Algorithms for Scalable Storage Servers

Sanders, Peter; Van Emde Boas, Peter; Pokorný, Jaroslav; Bieliková, Mária; Stuller, Július

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Algorithms for Scalable Storage Servers

MPS-Authors

/persons/resource/persons45344

Sanders, Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Van Emde Boas, Peter
Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Sanders, P. (2004). Algorithms for Scalable Storage Servers. In SOFSEM 2004: theory and practice of computer science; 30th Conference on Current Trends in Theory and Practice of Computer Science (pp. 82-101). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-295B-7

Abstract

We survey a set of algorithmic techniques that make it possible to build a high performance storage server from a network of cheap components. Such a storage server offers a very simple programming model. To the clients it looks like a single very large disk that can handle many requests in parallel with minimal interference between the requests. The algorithms use randomization, redundant storage, and sophisticated scheduling strategies to achieve this goal. The focus is on algorithmic techniques and open questions. The paper summarizes several previous papers and presents a new strategy for handling heterogeneous disks.