This paper addresses the problem of distributed class code and data propagation with Java. Traditional approach based on problem-oriented structures and on predefined task language is not suitable for universal grid programming. The main contribution is the development of an automatic framework for efficient propagation of class package and data. We examine two problems suitable for code and data distribution: large n-merge sorting and document indexing. Thanks to the use reflection mechanism, we show that Java is adequate for defining new tasks on grid elements without any language extension. Relation between number of component nodes of the structure and total processing time has been checked. Furthermore the framework is fault-tolerant when some nodes fail.
['Dariusz Król', 'Grzegorz Stanislaw Kukla']
Distributed Class Code and Data Propagation with Java