WSPE: a peer-to-peer programming environment for grid-unaware applications

Grid programming environments are tools designed to isolate users from issues like heterogeneity, scalability, and adaptability, thus simplifying the use of Grid infrastructure. This paper presents WSPE, a Grid programming environment for Grid-unaware applications. WSPE consists of a simple programming interface and a fully decentralized runtime system following a peer-to-peer organization. WSPE's runtime system employs a new scheduling mechanism, called Round Stealing, inspired on the idea of work stealing. The main focus of this work is to research methods to achieve efficient execution of parallel applications in a Grid computing infrastructure. By simulation, we show that our scheduling mechanism outperforms a more traditional mechanism, in a Grid environment. We also demonstrate how an appropriate choice for a network overlay mechanism can further improve execution efficiency.

[1]  Eric A. Brewer,et al.  ATLAS: an infrastructure for global computing , 1996, EW 7.

[2]  Jason Maassen,et al.  Satin: Simple and Efficient Java-based Grid Programming , 2005, Scalable Comput. Pract. Exp..

[3]  MANISH PARASHAR,et al.  Conceptual and Implementation Models for the Grid , 2005, Proceedings of the IEEE.

[4]  Henri E. Bal,et al.  Efficient load balancing for wide-area divide-and-conquer applications , 2001, PPoPP '01.

[5]  Robert D. Blumofe,et al.  Adaptive and Reliable ParallelComputing9 Networks of Workstations , 1997 .

[6]  G. P. Jesi,et al.  Building Latency-aware Overlay Topologies with QuickPeer , 2005 .

[7]  Rajkumar Buyya,et al.  GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing , 2002, Concurr. Comput. Pract. Exp..

[8]  Peter R. Cappello,et al.  Advanced eager scheduling for Java‐based adaptive parallel computing , 2002, JGI '02.

[9]  Anne-Marie Kermarrec,et al.  Network awareness and failure resilience in self-organizing overlay networks , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[10]  Ian T. Foster,et al.  On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing , 2003, IPTPS.

[11]  Thilo Kielmann,et al.  Programming Models for Grid Applications and Systems: Requirements and Approaches , 2006, IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing (JVA'06).

[12]  Anne-Marie Kermarrec,et al.  Peer-to-Peer Membership Management for Gossip-Based Protocols , 2003, IEEE Trans. Computers.

[13]  Jorge L. V. Barbosa,et al.  Towards Merging Context-Aware, Mobile and Grid Computing , 2003, Int. J. High Perform. Comput. Appl..

[14]  Gian Paolo Jesi,et al.  Building Latency-aware Overlay Topologies with QuickPee , 2005, Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (icas-isns'05).

[15]  Bradley C. Kuszmaul,et al.  Cilk: an efficient multithreaded runtime system , 1995, PPOPP '95.

[16]  Nicholas Carriero,et al.  Adaptive Parallelism and Piranha , 1995, Computer.