Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm

. DDH extends the idea of dynamic hashing algorithms to distributed systems. DDH spreads data across multiple servers in a network using a novel autonomous location discovery algorithm that learns the bucket locations instead of using a centralized directory. We describe the design and implementation of the basic DDH algorithm using networked computers. Performance results show that the prototype of DDH hashing is roughly equivalent to conventional single-node hashing implementations when compared with CPU time or elapsed time. Finally, possible improvements are suggested to the basic DDH algorithm for increased reliability and robustness. 1 Introduction Rapidly plunging hardware costs and increasing performance of CPUs and networks mean that future file and database systems are likely to be constructed as networked clusters of nodes. Algorithms should be devised to work in these environments. This paper describes the design and implementation of a distributed hashing algorithm. Quick..