Communications of the ACM
Anonymous Remote Computing: A Paradigm for Parallel Programming on Interconnected Workstations
IEEE Transactions on Software Engineering
Communications of the ACM
File and Object Replication in Data Grids
Cluster Computing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
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
ACM Transactions on Computer Systems (TOCS)
Giggle: a framework for constructing scalable replica location services
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Pipeline and Batch Sharing in Grid Workloads
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Should we build Gnutella on a structured overlay?
ACM SIGCOMM Computer Communication Review
Stork: Making Data Placement a First Class Citizen in the Grid
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Discouraging Free Riding in a Peer-to-Peer CPU-Sharing Grid
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
A Peer-to-Peer Replica Management Service for High-Throughput Grids
ICPP '05 Proceedings of the 2005 International Conference on Parallel Processing
OpenDHT: a public DHT service and its uses
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Vishwa: A reconfigurable P2P middleware for Grid Computations
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
IEEE Transactions on Parallel and Distributed Systems
Concurrency and Computation: Practice & Experience - Adaptive Grid Middleware
Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing
IEEE Transactions on Parallel and Distributed Systems
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Fixing the embarrassing slowness of OpenDHT on PlanetLab
WORLDS'05 Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2
PeerCast: Churn-resilient end system multicast on heterogeneous overlay networks
Journal of Network and Computer Applications
Numerical Mathematics and Computing
Numerical Mathematics and Computing
Avalanche Dynamics in Grids: Indications of SOC or HOT?
Proceedings of the 2005 conference on Self-Organization and Autonomic Informatics (I)
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
An efficient P2P content distribution system based on altruistic demand and recoding dissemination
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special issue on model-based diagnostics
A content aware and name based routing network speed up system
ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
Hi-index | 0.00 |
Data objects have to be replicated in large-scale distributed systems for reasons of fault tolerance, availability, and performance. Furthermore, computations may have to be scheduled on these objects, when these objects are part of a grid computation. Although replication mechanism for unstructured peer-to-peer (P2P) systems can place replicas on capable nodes, they may not be able to provide deterministic guarantees on searching. Replication mechanisms in structured P2P systems provide deterministic guarantees on searching but do not address node capability in replica placement. We propose Virat, a node-capability-aware P2P middleware for managing replicas in large-scale distributed systems. Virat uses a unique two-layered architecture that builds a structured overlay over an unstructured P2P layer, combining the advantages of both structured and unstructured P2P systems. Detailed performance comparison is made with a replication mechanism realized over OpenDHT, a state-of-the-art structured P2P system. We show that the 99th percentile response time for Virat does not exceed 600 ms, whereas for OpenDHT, it goes beyond 2000 ms in our test bed, created specifically for the aforementioned comparison.