Parallel Computing in Electrical Engineering, 2004. International Conference on (2004)
Sept. 7, 2004 to Sept. 10, 2004
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCEE.2004.63
Eryk Laskowski , Institute of Computer Science PAS, Warsaw, Poland
Richard Olejnik , Universit? des Sciences et Technologies de Lille
Bernard Toursel , Universit? des Sciences et Technologies de Lille
Marek Tudruj , Institute of Computer Science PAS, Warsaw, Poland
This paper presents pre-optimization methods for distributed Java applications on Java Virtual Machines (JVMs), which reduce program execution time. On the basis of an analysis the byte code compiled for a program, an extended macro data flow graph is generated. To this graph clustering and scheduling algorithms are applied based on modified DSC heuristics. The algorithms define distribution of clusterized nodes and objects on JVMs, so as to reduce the total execution time of programs. The nodes of the macro data flow graph are distributed to different JVMs as dynamic threads of distributed objects by modification of the program byte code without modifications of Java virtual machines.
E. Laskowski, R. Olejnik, M. Tudruj and B. Toursel, "Scheduling Byte Code-Defined Data Dependence Graphs of Object Oriented Programs," Parallel Computing in Electrical Engineering, 2004. International Conference on(PARELEC), Dresden, Germany, 2004, pp. 398-401.