An instruction folding solution to a java processor

  • Authors:
  • Tan Yiyu;Anthony S. Fong;Yang Xiaojian

  • Affiliations:
  • College of Information Science and Engineering, Nanjing University of Technology, Nanjing, China;Department of Electronic Engineering, City University of Hong Kong, Kowloon Tong, Hong Kong;College of Information Science and Engineering, Nanjing University of Technology, Nanjing, China

  • Venue:
  • NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Java is widely applied into embedded devices. Java programs are compiled into Java bytecodes, which are executed into the Java virtual machine. The Java virtual machine is a stack machine and instruction folding is a technique to reduce the redundant stack operations. In this paper, a simple instruction folding algorithm is proposed for a Java processor named jHISC, where bytecodes are classified into five categories and the operation results of incomplete folding groups are hold for further folding. In the benchmark JVM98, with respect to all stack operations, the percentage of the eliminated P and C type instructions varies from 87% to 98% and the average is about 93%. The reduced instructions are between 37% and 50% of all operations and the average is 44%.