Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer

We address the problem of developing a suite of microbenchmarking experiments aimed at providing the basic functionalities of a measurement tool for a P2P-based globally distributed computing platform, usually referred to as overlay computer. We argue that such a measuring system should take into account the communication patterns generated by the applications in order to provide useful performance insights

[1]  Henri E. Bal,et al.  Simple locality-aware co-allocation in peer-to-peer supercomputing , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[2]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

[3]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  William Gropp,et al.  Reproducible Measurements of MPI Performance Characteristics , 1999, PVM/MPI.

[5]  J. S. Gage.  The great Internet Mersenne prime search. , 1998, M.D. computing : computers in medical practice.

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

[7]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[8]  Joseph D. Gradecki.  Mastering JXTA: Building Java Peer-to-Peer Applications , 2002 .

[9]  Krishna P. Gummadi,et al.  Measurement, modeling, and analysis of a peer-to-peer file-sharing workload , 2003, SOSP '03.

[10]  Michael Kleis,et al.  A placement scheme for peer-to-peer networks based on principles from geometry , 2004, Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings..

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

[12]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[13]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[15]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[16]  Jaspal Subhlok,et al.  Automatic construction and evaluation of performance skeletons , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[17]  Marios D. Dikaiakos,et al.  GridBench: A Workbench for Grid Benchmarking , 2005, EGC.

[18]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[19]  Duncan A. Grove,et al.  Precise MPI Performance Measurement Using MPIBench , 2001 .

[20]  Daniel Zappala,et al.  Cluster Computing on the Fly : P 2 P Scheduling of Idle Cycles in the Internet , 2004 .

[21]  Peter Steenkiste,et al.  Exploiting internet route sharing for large scale available bandwidth estimation , 2005, IMC '05.

[22]  Mudhakar Srivatsa,et al.  Scaling unstructured peer-to-peer networks with multi-tier capacity-aware overlay topologies , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..