IEEE - Institute of Electrical and Electronics Engineers, Inc. - Java Byte Code Scheduling Based on the Most-Often-Used-Paths in Programs with Branches

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

Author(s): E. Laskowski ; M. Tudruj ; R. Olejnik ; B. Toursel
Sponsor(s): Region Nord Pas de Calais
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 2005
Conference Location: Lille, France
Conference Date: 4 July 2005
Page(s): 21 - 27
ISBN (Paper): 0-7695-2434-6
ISSN (Paper): 2379-5352
DOI: 10.1109/ISPDC.2005.31
Regular:

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... View More

Advertisement