Change search
ReferencesLink to record
Permanent link

Direct link
A High Throughput Atomic Storage Algorithm
EPFL.ORCID iD: 0000-0002-1256-1070
2007 (English)In: Proceedings of the 27th IEEE International Conference on Distributed Computing Systems (ICDCS’07), IEEE conference proceedings, 2007Conference paper (Refereed)
Abstract [en]

This paper presents an algorithm to ensure the atomicity of a distributed storage that can be read and written by any number of clients. In failure-free and synchronous situations, and even if there is contention, our algorithm has a high write throughput and a read throughput that grows linearly with the number of available servers. The algorithm is devised with a homogeneous cluster of servers in mind. It organizes servers around a ring and assumes oint-to-point communication. It is resilient to the crash failure of any number of readers and writers as well as to the crash failure of all but one server. We evaluated our algorithm on a cluster of 24 nodes with dual fast ethernet network interfaces (100 Mbps). We achieve 81 Mbps of write throughput and 8*90 Mbps of read throughput (with up to 8 servers) which conveys the linear scalability with the number of servers.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2007.
Keyword [en]
Fault-tolerance; Atomicity; Distributed Storage; Performance; Throughput
National Category
Computer Science
URN: urn:nbn:se:kth:diva-146727DOI: 10.1109/ICDCS.2007.80OAI: diva2:724965
The 27th IEEE International Conference on Distributed Computing Systems (ICDCS’07),25-27 June 2007, Toronto, CA

QC 20140619

Available from: 2014-06-13 Created: 2014-06-13 Last updated: 2014-06-19Bibliographically approved

Open Access in DiVA

fulltext(253 kB)13 downloads
File information
File name FULLTEXT01.pdfFile size 253 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full textIEEEXplore

Search in DiVA

By author/editor
Kostic, Dejan
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 13 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 32 hits
ReferencesLink to record
Permanent link

Direct link