Name: | Description: | Size: | Format: | |
---|---|---|---|---|
240.76 KB | Adobe PDF |
Advisor(s)
Abstract(s)
In this paper we present the design and implementation of DPH, a storage layer for cluster environments. DPH is a Distributed Data Structure (DDS) based on the distribution of a paged hash table. It combines main memory with file system resources across the cluster in order to implement a distributed dictionary that can be used for the storage of very large data sets with key based addressing techniques. The DPH storage layer is supported by a collection of cluster-aware utilities and services. Access to the DPH interface is provided by a user-level API. A preliminary performance evaluation shows promising results.
Description
Keywords
Cluster computing Distributed hash tables
Citation
Rufino, José; Pina, António; Alves, Albano; Exposto,José (2002). Distributed paged hash tables. In 5th International Meeting on High Performance Computing for Computational Science (VECPAR'02). Porto, Portugal. p.679-692