2011 18th International Conference on High Performance Computing

The ever-growing amount of data requires highly scalable storage solutions. The most flexible approach is to use storage pools that can be expanded and scaled down by adding or removing storage devices. To make this approach usable, it is necessary to provide a solution to locate data items in such...

Ausführliche Beschreibung

Gespeichert in:
1. Verfasser:
IEEE Staff (MitwirkendeR)
Körperschaft:
Institute of Electrical and Electronics Engineers (IEEE)
Format:
Elektronisch E-Book
Sprache:
Englisch
Veröffentlicht:
[Place of publication not identified] IEEE 2011
Zusammenfassung:
The ever-growing amount of data requires highly scalable storage solutions. The most flexible approach is to use storage pools that can be expanded and scaled down by adding or removing storage devices. To make this approach usable, it is necessary to provide a solution to locate data items in such a dynamic environment. This paper presents and evaluates the Random Slicing strategy, which incorporates lessons learned from table-based, rule-based, and pseudo-randomized hashing strategies and is able to provide a simple and efficient strategy that scales up to handle exascale data. Random Slicing keeps a small table with information about previous storage system insert and remove operations, drastically reducing the required amount of randomness while delivering a perfect load distribution.
Umfang:
1 online resource : illustrations
Anmerkungen:
Bibliographic Level Mode of Issuance: Monograph
Anmerkungen:
English
ISBN:
9781457719509
1457719509
9781457719493
1457719495
Schlagworte:
High performance computing > Congresses.
Bezugswerke:
Links: