Messages Scheduling for Parallel Data Redistribution between Clusters
IEEE Transactions on Parallel and Distributed Systems
Scheduling Messages For Data Redistribution: An Experimental Study
International Journal of High Performance Computing Applications
Experiments with SmartGridSolve: Achieving higher performance by improving the GridRPC model
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Towards a transparent data access model for the GridRPC paradigm
HiPC'07 Proceedings of the 14th international conference on High performance computing
Two implementations of the preconditioned conjugate gradient method on heterogeneous computing grids
International Journal of Applied Mathematics and Computer Science - Computational Intelligence in Modern Control Systems
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Hi-index | 0.00 |
The GridRPC model [1] is an emerging standard promoted by the Global Grid Forum (GGF)1 that defines how to perform remote client-server computation on a distributed architecture. In this model data are sent back to the client at the end of every computation. This implies unnecessary communications when computed data are needed by an other server in further computations. Since, communication time is sometimes the dominant cost of remote computation, this cost has to be lowered. Several tools instantiate the GridRPC model such as NetSolve which is a NES environment developed at the University of Tennessee, Knoxville. In this paper, we present the modifications we made to the NetSolve protocol in order to overcome this drawback. We have developed a set of new functions and data structures that allow clients to order servers to keep data in place and to redistribute them directly to an other server when needed.