Main content

F2DR: A Distributed Hash Table Algorithm

Show simple item record

dc.contributor.advisor Calvert, David A. Rea, Dana 2013-01-17T15:33:57Z 2013-01-17T15:33:57Z 2013-01 2012-12-11 2013-01-17
dc.description.abstract Considerable research has been directed toward the study of consistent hashing and distributed hash tables. While many useful research results have emerged from this work, existing solutions can be improved in the areas of time efficiency, system growth and change to input distributions. For resolution, systems such as Chord [69][70], Memcached [23] and others use a binary search over the set of intervals to determine the node. Also, relying on a pseudo-random designation of partitions on the continuum can result in poor worst-case time performance due to load imbalance. The work proposes F^2DR, a system that maps an arithmetic distribution of intervals on a continuum to a fluid set of nodes. Any point on the continuum can be resolved to a node in O(1) time, and O(n) space. The system also contains flexible mechanisms for adapting to load patterns through dynamic restructuring. In all, F2DR provides a fresh formulation of consistent hashing that offers several advantages over previous work. en_US
dc.description.sponsorship School of Computer Science, University of Guelph en_US
dc.language.iso en en_US
dc.rights.uri *
dc.subject Shared Nothing en_US
dc.title F2DR: A Distributed Hash Table Algorithm en_US
dc.type Thesis en_US Computer Science en_US Master of Science en_US School of Computer Science en_US
dc.rights.license All items in the Atrium are protected by copyright with all rights reserved unless otherwise indicated.

Files in this item

Files Size Format View Description
Rea_Dana_201301_Msc.pdf 553.4Kb PDF View/Open Thesis document

This item appears in the following Collection(s)

Show simple item record Except where otherwise noted, this item's license is described as