A new estimation method for distributed Java object activity

We introduce a new method to estimate the Java object activity in a distributed context of irregular applications. This method uses an observation mechanism which is itself a part of a more global load balancing system. It predicts the tendencies of the communication between the objects of the distributed application. To illustrate the behaviour of this mechanism we applied it to the "Travelling Salesman Problem" TSP which is solved by means of a genetic algorithm. Finally we present the overhead measurements we have done.

[1]  Jean-Louis Pazat,et al.  Generation of Distributed Parallel Java Programs , 1998, Euro-Par.

[2]  Richard Olejnik,et al.  An observation mechanism of distributed objects in Java , 2002, Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing.

[3]  Dana S. Richards,et al.  Punctuated Equilibria: A Parallel Genetic Algorithm , 1987, ICGA.

[4]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[5]  Suchendra M. Bhandarkar,et al.  A parallel genetic algorithm for physical mapping of chromosomes , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

[6]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[7]  John J. Grefenstette,et al.  A Parallel Genetic Algorithm , 1987, ICGA.

[8]  Richard Olejnik,et al.  Java Tools for Measurement of the Machine Loads , 2001, IWCC.

[9]  Ian T. Foster,et al.  The Globus project: a status report , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[10]  Michael Philippsen,et al.  JavaParty - Transparent Remote Objects in Java , 1997, Concurr. Pract. Exp..

[11]  Darrell Whitley,et al.  A genetic algorithm tutorial , 1994, Statistics and Computing.