Distributed java programs initial mapping based on extremal optimization

Authors:
Eryk Laskowski;Marek Tudruj;Ivanoe De Falco;Umberto Scafuri;Ernesto Tarantino;Richard Olejnik
Affiliations:
Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland;Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland;ICAR-CNR, Institute of High Performance Computing and Networking, Naples, Italy;ICAR-CNR, Institute of High Performance Computing and Networking, Naples, Italy;ICAR-CNR, Institute of High Performance Computing and Networking, Naples, Italy;Computer Science Laboratory, University of Science and Technology of Lille, France
Venue:
PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume Part I
Year:
2010

Citing 8
Cited 0

Scheduling precedence graphs in systems with interprocessor communication times

SIAM Journal on Computing
Benchmarking and comparison of the task graph scheduling algorithms

Journal of Parallel and Distributed Computing
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
Autonomous Load Balance System for Distributed Servers using Active Objects

DEXA '01 Proceedings of the 12th International Workshop on Database and Expert Systems Applications
An Object Observation for a Java Adaptative Distributed Application Platform

PARELEC '02 Proceedings of the International Conference on Parallel Computing in Electrical Engineering
Optimizing Distributed Data Mining Applications Based on Object Clustering Methods

PARELEC '06 Proceedings of the international symposium on Parallel Computing in Electrical Engineering
Byte-code scheduling of Java programs with branches for desktop grid

Future Generation Computer Systems
Java programs optimization based on the most–often–used–paths approach

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

An application of extremal optimization algorithm for mapping Java program components on clusters of Java Virtual Machines (JVMs) is presented. Java programs are represented as Directed Acyclic Graphs in which tasks correspond to methods of distributed active Java objects that communicate using the RMI mechanism. The presented probabilistic extremal optimization approach is based on the local fitness function composed of two sub-functions in which elimination of delays of task execution after reception of required data and the imbalance of tasks execution in processors are used as heuristics for improvements of extremal optimization solutions. The evolution of an extremal optimization solution is governed by task clustering supported by identification of the dominant path in the graph. The applied task mapping is based on dynamic measurements of current loads of JVMs and inter-JVM communication link bandwidth. The JVM loads are approximated by observation of the average idle time that threads report to the OS. The current link bandwidth is determined by observation of the performed average number of RMI calls per second.