• home
• current students
• graduate
• events

Presenter: Watheq
Supervisor:

Date: Wed, August 7, 2002
Time: 14:00:00 - 15:00:00
Place: EOW 430

ABSTRACT

Abstract:

Data dependency in stack operations limits the performance of Java processors. To enhance Java's performance, existing literature has suggested using stack operations folding algorithms.

In this presentation, I will first review existing folding algorithms emphasizing their shortcomings. Then, I will describe the operand extraction (OPEX) bytecode folding algorithm.

OPEX identifies principal operations in folding groups and extracts necessary operands from the bytecode stream, thus permitting multiple issuing of folding groups and nested pattern folding, which reduce the required size of the on-chip stack. Benchmarking using SPECjvm98 shows that the proposed algorithm results in an excellent speedup compared to existing algorithms.

For more information please contact me at watheq@engr.uvic.ca.