By Topic

Java Byte Code Scheduling Based on the Most-Often-Used-Paths in Programs with Branches

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Laskowski, E. ; Inst. of Comput. Sci., PAS, Ordona ; Tudruj, M. ; Olejnik, R. ; Toursel, B.

The paper presents an introductory optimization algorithm, which can be performed before a Java program is executed in a parallel system. Taking a sequential multithreaded version of a Java program as input information, the aim of the parallel program optimization is to determine an initial distribution of objects on virtual machines so as to decrease direct inter-object communication and balance loads of the virtual machines. The object placement optimization algorithm uses a graphical representation of control dependencies and data dependencies among methods in Java programs. These dependencies are discovered by an analysis of program byte code and stored in the form of relevant macro/dataflow graphs. The placement optimization algorithm tries to optimally assign the macro nodes to processors (JVMs) so as to reduce inter-processor communication overheads. The optimization method first does clustering of macro nodes on unlimited number of processors (logical JVMs) to reduce the execution time of the clustered nodes. Next, merging of the assigned clusters is performed to reduce the number of logical JVMs to the number of real processors. The presented approach is supported by a dynamic, online load balancing mechanism, which applies object migration as proposed in the ADAJ (adaptive distributed applications in Java) project

Published in:

Parallel and Distributed Computing, 2005. ISPDC 2005. The 4th International Symposium on

Date of Conference:

4-6 July 2005