Grid Resource Scheduling with Gossiping Protocols

Grid resource providers can use gossiping to disseminate their available resource state to remote regions of the grid to attract application load. Pairwise gossiping protocols exchange information about limited subsets of other resources between pairs of potentially remote participants. In epidemic gossiping protocols, the provider disseminates information to multiple neighbors, who in turn forward it to their neighbors, and so on. One important metric for these protocols is their coverage, which characterizes how many and which resources receive the information. Coverage characteristics of epidemic protocols are non-uniform, concentrated within the vicinity of a disseminating node; they can exhibit bi-modal behavior where information either reaches distant nodes or dies out quickly. Pairwise gossiping protocols, on the other hand, provide a more uniform coverage, but it can take longer for the dissemination to reach desired uniformity. In this paper, we study performance characteristics of three gossiping protocols: (1) epidemic gossiping, (2) pairwise gossiping, and (3) adaptive information dissemination (which is based on a form of epidemic gossiping). We report experimental results based on our simulation framework that compare the three protocols in terms of packet overhead and query satisfaction rates. We show that pairwise gossiping protocols work best when resource distribution on the grid is uniform, but that they can be configured to perform well in support of grid scheduling.

[1]  Anne-Marie Kermarrec,et al.  From Epidemics to Distributed Computing , 2004 .

[2]  Nael B. Abu-Ghazaleh,et al.  Analysis of query matching criteria and resource monitoring models for grid application scheduling , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[3]  Dennis Shasha,et al.  Filtering algorithms and implementation for very fast publish/subscribe systems , 2001, SIGMOD '01.

[4]  David M. Nicol,et al.  Towards Realistic Million-Node Internet Simulation , 1999, PDPTA.

[5]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[6]  Peter Triantafillou,et al.  PastryStrings: A Comprehensive Content-Based Publish/Subscribe DHT Network , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[7]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[8]  Nael B. Abu-Ghazaleh,et al.  Short Paper: Toward Self Organizing Grids , 2006, 2006 15th IEEE International Conference on High Performance Distributed Computing.

[9]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[10]  Maarten van Steen,et al.  CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays , 2005, Journal of Network and Systems Management.

[11]  Nael B. Abu-Ghazaleh,et al.  Controlling the Coverage of Grid Information Dissemination Protocols , 2005, Fourth IEEE International Symposium on Network Computing and Applications.

[12]  Nael B. Abu-Ghazaleh,et al.  Non-uniform information dissemination for dynamic grid resource discovery , 2004, Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings..

[13]  Nael B. Abu-Ghazaleh,et al.  Adaptive Approach to Information Dissemination in Self-Organizing Grids , 2006, International Conference on Autonomic and Autonomous Systems (ICAS'06).

[14]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[15]  Jon M. Kleinberg,et al.  Spatial gossip and resource location protocols , 2004, J. ACM.

[16]  Alejandro P. Buchmann,et al.  A peer-to-peer approach to content-based publish/subscribe , 2003, DEBS '03.

[17]  Kenneth P. Birman,et al.  The process group approach to reliable distributed computing , 1992, CACM.

[18]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[19]  Anne-Marie Kermarrec,et al.  Probabilistic Reliable Dissemination in Large-Scale Systems , 2003, IEEE Trans. Parallel Distributed Syst..

[20]  Nael B. Abu-Ghazaleh,et al.  An Adaptive Algorithm for Information Dissemination in Self-Organizing Grids , 2006, 2006 Second IEEE International Conference on e-Science and Grid Computing (e-Science'06).

[21]  Henri E. Bal,et al.  ARRG: real-world gossiping , 2007, HPDC '07.

[22]  Dale Skeen,et al.  The Information Bus: an architecture for extensible distributed systems , 1994, SOSP '93.

[23]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[24]  Divyakant Agrawal,et al.  Meghdoot: Content-Based Publish/Subscribe over P2P Networks , 2004, Middleware.

[25]  Ben Y. Zhao,et al.  Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination , 2001, NOSSDAV '01.

[26]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[27]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[28]  Robert Tappan Morris,et al.  Designing a DHT for Low Latency and High Throughput , 2004, NSDI.

[29]  Andrew A. Chien,et al.  Henri Casanova , 2022 .