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

ABSTRACT

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.

REFERENCES

• 1: J. Eric Baldeschwieler , Robert D. Blumofe , Eric A. Brewer, ATLAS: an infrastructure for global computing, Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications, September 09-11, 1996, Connemara, Ireland [doi>10.1145/504450.504482]
• 2: Robert D. Blumofe , Christopher F. Joerg , Bradley C. Kuszmaul , Charles E. Leiserson , Keith H. Randall , Yuli Zhou, Cilk: an efficient multithreaded runtime system, Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming, p.207-216, July 19-21, 1995, Santa Barbara, California, United States
• 3: Robert D. Blumofe , Charles E. Leiserson, Scheduling multithreaded computations by work stealing, Journal of the ACM (JACM), v.46 n.5, p.720-748, Sept. 1999 [doi>10.1145/324133.324234]
• 4: Robert D. Blumofe , Philip A. Lisiecki, Adaptive and reliable parallel computing on networks of workstations, Proceedings of the annual conference on USENIX Annual Technical Conference, p.10-10, January 06-10, 1997, Anaheim, California
• 5: R. Buyya and M. Murshed. Gridsim: a toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing. Concurrency and Computation: Practice and Experience, 14(13--15):1175--1220, 2002.
• 6: Nicholas Carriero , Eric Freeman , David Gelernter , David Kaminsky, Adaptive Parallelism and Piranha, Computer, v.28 n.1, p.40-49, January 1995 [doi>10.1109/2.362631]
• 7: Andrea Ceccanti , Gian Paolo Jesi, Building Latency-aware Overlay Topologies with QuickPee, Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services, p.24, October 23-28, 2005
• 8: I. Foster and A. Iamnitchi. On death, taxes, and the convergence of peer-to-peer and grid computing. In Proc. of the 2nd International Workshop on Peer-to-Peer Systems, IPTPS, Lecture Notes in Computer Science, v. 2735, pages 118--128, Berkeley, 2003. Berlin, Springer.
• 9: Ayalvadi J. Ganesh , Anne-Marie Kermarrec , Laurent Massoulié, Peer-to-Peer Membership Management for Gossip-Based Protocols, IEEE Transactions on Computers, v.52 n.2, p.139-149, February 2003 [doi>10.1109/TC.2003.1176982]
• 10: Thilo Kielmann, Programming Models for Grid Applications and Systems: Requirements and Approaches, Proceedings of the IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing, p.27-32, October 03-06, 2006 [doi>10.1109/JVA.2006.41]
• 11: L. Massoulie, A.-M. Kermarrec, and A. Ganesh. Network awareness and failure resilience in self-organizing overlay networks. In Proc. of the 22nd International Symposium on Reliable Distributed Systems, pages 47--55, Florence, 2003. {S.l.}, IEEE Computer Society.
• 12: Michael O. Neary , Peter Cappello, Advanced eager scheduling for Java-based adaptively parallel computing, Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande, p.56-65, November 03-05, 2002, Seattle, Washington, USA [doi>10.1145/583810.583817]
• 13: M. Parashar and J. Browne. Conceptual and implementation models for the grid. Proceedings of the IEEE, 93(3):653--668, 2005.
• 14: PEERSIM SIMULATOR, 2006. Online: http://peersim.sourceforge.net/.
• 15: Sun Microsystems. JSR 175: A metadata facility for the Java#8482; programming language. Technical report, Sun Microsystems, Santa Clara, 2004.
• 16: Rob V. van Nieuwpoort , Thilo Kielmann , Henri E. Bal, Efficient load balancing for wide-area divide-and-conquer applications, Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming, p.34-43, June 2001, Snowbird, Utah, United States
• 17: R. V. van Nieuwpoort, J. Maassen, T. Kielmann, and H. E. Bal. Satin: Simple and efficient java-based grid programming. Scalable Computing: Practice and Experience, 6(3):19--32, 2005.
• 18: A. C. Yamin, J. L. V. Barbosa, I. Augustin, L. C. da Silva, R. A. Real, C. F. R. Geyer, and G. Cavalheiro. Towards merging context-aware, mobile and grid computing. International Journal of High Performance Computing Applications, 17(2):191--203, 2003.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.4 Distributed Systems
          Subjects: Distributed applications

Additional Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.6 Programming Environments
          Subjects: Programmer workbench

Keywords:
grid computing, grid-unaware application, peer-to-peer, programming environment, random stealing