Abstract
We are interested in the issues on the bytecode transformation for performance improvements on programs. In this work, we focus on the aspect of our bytecode to bytecode optimizing system on the ability to optimize the performances of hardware stack machines. Two categories of the problem are considered. First, we consider the stack allocations for intra-procedural cases with a family of Java processors. We propose a mechanism to report an allocation scheme for a given size of stack allocation according to our cost model. Second, we also extend our framework for stack allocations to deal with inter-procedural cases. Our initial experimental test-bed is based on an ITRI-made Java processor and Kaffe VM simulator[2]. Early experiments indicate our proposed methods are promising in speedup Java programs on Java processors with a fixed size of stack caches.