A robust stack folding approach for Java processors: an operand extraction-based algorithm

M. Watheq El‐Kharashi

doi:10.1016/S1383-7621(01)00026-1

Return

A robust stack folding approach for Java processors: an operand extraction-based algorithm

2001-12-01

PRE

M. Watheq El‐Kharashi

F. El-Guibaly

K.F. Li

DOI：10.1016/S1383-7621(01)00026-1

Original

Original request for help

Save

Abstract

En 中文

Data dependency in stack operations limits the performance of Java processors. To enhance Java's performance, existing literature suggests using stack operations folding. We extend this concept in a new folding algorithm that identifies principle operations in folding groups and extracts necessary operands from the bytecode queue. The proposed algorithm permits nested pattern folding and multiple issue of folding groups. Hence, the need for and therefore the limitations of a stack are eliminated. This paper discusses various aspects of the proposed algorithm and illustrates different folding scenarios as well as possible hazards. Benchmarking using SPECjvm98 shows excellent performance gains as compared to existing algorithms. (C) 2001 Elsevier Science B.V. All rights reserved.

Keywords:

Java

Java virtual machine

Java processors

Java performance

Java bytecode folding

stack processors

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.