Scheduling Byte Code-Defined Data Dependence Graphs of Object Oriented Programs

Authors:
Eryk Laskowski;Richard Olejnik;Bernard Toursel;Marek Tudruj
Affiliations:
Institute of Computer Science PAS, Warsaw, Poland;Université des Sciences et Technologies de Lille;Université des Sciences et Technologies de Lille;Institute of Computer Science PAS, Warsaw, Poland
Venue:
PARELEC '04 Proceedings of the international conference on Parallel Computing in Electrical Engineering
Year:
2004

Citing 0
Cited 1

An Efficient Way of Passing of Data in a Multithreaded Scheduled Dataflow Architecture

HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.