Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems
Software—Practice & Experience
Exploiting Fine-Grained Idle Periods in Networks of Workstations
IEEE Transactions on Parallel and Distributed Systems
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
A Framework for Distributed Evolutionary Algorithms
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Brocade: Landmark Routing on Overlay Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
G2: A Grid Middleware for Cycle Donation Using .NET
PDPTA '02 Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Volume 2
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
SCRIBE: The Design of a Large-Scale Event Notification Infrastructure
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
A scalable content-addressable network
A scalable content-addressable network
Awarded Best Student Paper! - Pond: The OceanStore Prototype
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
Approximate object location and spam filtering on peer-to-peer systems
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
G2DGA: an adaptive framework for internet-based distributed genetic algorithms
GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
Unstructured peer-to-peer networks for sharing processor cycles
Parallel Computing - Parallel matrix algorithms and applications (PMAA'04)
Enhancing data locality in a fully decentralised P2P cycle stealing framework
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
YA: Fast and Scalable Discovery of Idle CPUs in a P2P network.
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
International Journal of Communication Networks and Distributed Systems
Scalable architecture for allocation of idle CPUs in a p2p network
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Toward a Quality-of-Service Framework for Peer-to-Peer Applications
International Journal of Distributed Systems and Technologies
| Hi-index | 0.00 |
Existing cycle-stealing frameworks are generally based on simple client-server or hierarchical style architectures. G2:P2P moves cycle-stealing into the "pure" peer-to-peer (P2P), or fully decentralised arena, removing the bottleneck and single point of failure that centralised systems suffer from. Additionally, by utilising direct P2P communication, G2:P2P supports a far broader range of applications than the master-worker style that most cycle-stealing frame-works offer.G2:P2P moves away from the task based programming model typical of cycle-stealing systems to a distributed object abstraction which simplifies communication. It uses a distributed hash table based overlay network to provide an efficient method of referencing application objects while still allowing volunteer machines to come and go from the network. Most importantly, G2:P2P provides a sophisticated fault tolerance mechanism to ensure applications execute correctly. This mechanism is entirely automated, requiring no special effort on the application developer's part. The framework is implemented as an extension to .NET's Remoting framework, providing a familiar model for application programmers and an easy upgrade path for existing .NET sequential applications.