## Abstract The inherent complex nature of current distributed computing architectures hinders the widespread adoption of these systems for mainstream use. In general, users have access to a highly heterogeneous set of compute resources, which may include clusters, grids, desktop grids, clouds, and
P2PPerf: a framework for simulating and optimizing peer-to-peer-distributed computing applications
✍ Scribed by J.-B. Ernst-Desmulier; Julien Bourgeois; François Spies
- Publisher
- John Wiley and Sons
- Year
- 2008
- Tongue
- English
- Weight
- 348 KB
- Volume
- 20
- Category
- Article
- ISSN
- 1532-0626
- DOI
- 10.1002/cpe.1244
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
Peer‐to‐peer paradigm is more and more studied by the distributed computing community. Indeed, this type of architecture has interesting properties like the absence of centralized topology, fault tolerance or dynamic reorganization of the network. However, managing these networks is complex and the acceleration of the distributed applications is not ensured. That is why it is necessary to predict the performance as soon as possible in design and development phases, to bypass bottlenecks and to correct part of the applications that slow down the execution time. In this context, we propose P2PPerf: a simulation tool that aims at predicting performance and the execution time of a distributed application before its finalization. P2PPerf has been tested on JNGI: a P2P distributed computing application using the JXTA platform. Copyright © 2007 John Wiley & Sons, Ltd.
📜 SIMILAR VOLUMES