Simple locality-aware co-allocation in peer-to-peer supercomputing
Authors:
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 8 pp.-14
Abstract
With current grid middleware, it is difficult to deploy distributed supercomputing applications that run concurrently on multiple resources. As current grid middleware systems have problems with co-allocation (scheduling across multiple grid sites), fault-tolerance and are difficult to set-up and maintain, we consider an alternative: peer-to-peer (P2P) supercomputing. P2P supercomputing middleware systems overcome many limitations of current grid systems. However, the lack of central components makes scheduling on P2P systems inherently difficult. As a possible scheduling solution for P2P supercomputing middleware we introduce flood scheduling. It is locality aware, decentralized, flexible and supports co-allocation. We introduce Zorilla, a prototype P2P supercomputing middleware system. Evaluation of Zorilla on over 600 processors at six sites of the Grid5000 system shows that flood scheduling, when used in a P2P network with suitable properties, is a good alternative to centralized algorithmsKeywords
This publication has 7 references indexed in Scilit:
- Balancing Active Objects on a Peer to Peer Infrastructure2006
- A High Performance Java Middleware with a Real Application2005
- Computing on large-scale distributed systems: XtremWeb architecture, programming models, security, tests and convergence with gridFuture Generation Computer Systems, 2005
- Fault-tolerance, malleability and migration for divide-and-conquer applications on the grid2005
- Experiences with the KOALA co-allocating scheduler in multiclusters2005
- GridSAT2003
- Ibis2002