A peer-to-peer replica magement service for high-throughput Grids

Chazapis, A; Zissimos, A; Koziris, N

dc.contributor.author	Chazapis, A	en
dc.contributor.author	Zissimos, A	en
dc.contributor.author	Koziris, N	en
dc.date.accessioned	2014-03-01T02:43:04Z
dc.date.available	2014-03-01T02:43:04Z
dc.date.issued	2005	en
dc.identifier.issn	01903918	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31213
dc.subject	Data Grid	en
dc.subject	Data Storage	en
dc.subject	Distributed Hash Table	en
dc.subject	Fault Tolerant	en
dc.subject	High Performance	en
dc.subject	Location Service	en
dc.subject	Peer To Peer	en
dc.subject	Peer To Peer System	en
dc.subject	Peer-to-peer Network	en
dc.subject	High Throughput	en
dc.subject.other	Data Grid architecture	en
dc.subject.other	High-throughput Grids	en
dc.subject.other	Peer-to-peer systems	en
dc.subject.other	Replica Location Service	en
dc.subject.other	Algorithms	en
dc.subject.other	Computer architecture	en
dc.subject.other	Data processing	en
dc.subject.other	Data storage equipment	en
dc.subject.other	Fault tolerant computer systems	en
dc.subject.other	Distributed computer systems	en
dc.title	A peer-to-peer replica magement service for high-throughput Grids	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ICPP.2005.12	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ICPP.2005.12	en
heal.identifier.secondary	1488642	en
heal.publicationDate	2005	en
heal.abstract	Future high-throughput Grids may integrate millions or even billions of processing and data storage nodes. Services provided by the underlying Grid infrastructure may have to be able to scale to capacities not even imaginable today. In this paper we concentrate on one of the core components of the Data Grid architecture - the Replica Location Service - and evaluate a redesign of the system based on a structured peer-to-peer network overlay. We argue that the architecture of the currently most widespread solution for file replica location on the Grid, is biased towards high-performance deployments and can not scale to the future needs of a global Grid. Structured peer-to-peer systems can provide the same functionality, while being much more manageable, scalable and fault-tolerant. However, they are only capable of storing read-only data. To this end, we propose a revised protocol for Distributed Hash Tables that allows data to be changed in a distributed and scalable fashion. Results from a prototype implementation of the system suggest that Grids can truly benefit from the scalability and fault-tolerance properties of such peer-to-peer algorithms. © 2005 IEEE.	en
heal.journalName	Proceedings of the International Conference on Parallel Processing	en
dc.identifier.doi	10.1109/ICPP.2005.12	en
dc.identifier.volume	2005	en
dc.identifier.spage	443	en
dc.identifier.epage	451	en