Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 41 for “"hash table"”.

  1. A distributed Hash table

    DHash is a new system that harnesses the storage and network resources of computers distributed across the Internet by providing a wide-area storage service, DHash. DHash frees applications from re-implementing mechanisms common to any system that stores data on a collection of machines: it …

    mit Repository record for A distributed Hash table (opens in a new tab)

  2. Storing and managing data in a distributed hash table

    Distributed hash tables (DHTs) have been proposed as a generic, robust storage infrastructure for simplifying the construction of large-scale, wide-area applications. For example, UsenetDHT is a new design for Usenet News developed in this thesis that uses a DHT to cooperatively deliver Usenet …

    mit Repository record for Storing and managing data in a distributed hash table (opens in a new tab)

  3. CPHASH : a cache-partitioned hash table with LRU eviction

    In this thesis we introduce CPHASH - a scalable fixed size hash table that supports eviction using an LRU list, and CPSERVER - a scalable in memory key/value cache server that uses CPHASH to implement its hash table. CPHASH uses computation migration to avoid transferring data between cores. …

    mit Repository record for CPHASH : a cache-partitioned hash table with LRU eviction (opens in a new tab)

  4. A fast concurrent and resizable Robin Hood hash table

    Concurrent hash tables are among the most important primitives in concurrent programming and have been extensively studied in the literature. Robin Hood hashing is a variant of linear probing that moves around keys to reduce probe distances. It has been used to develop state of the art serial hash

    mit Repository record for A fast concurrent and resizable Robin Hood hash table (opens in a new tab)

  5. Robust and efficient data management for a distributed hash table

    Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.

    mit Repository record for Robust and efficient data management for a distributed hash table (opens in a new tab)

  6. Scaled: Scalable Federated Learning via Distributed Hash Table Based Overlays

    … Scalable Federated Learning via Distributed Hash Table Based Overlays for network (Scaled) to conduct multiple concurrently running FL-based applications over edge networks. Specifically, Scaled adopts a fully decentral- ized multiple-master and multiple-slave architecture by exploiting …

    vt Repository record for Scaled: Scalable Federated Learning via Distributed Hash Table Based Overlays (opens in a new tab)

  7. Design and applications of a secure and decentralized Distributed Hash Table

    Distributed Hash Tables (DHTs) are a powerful building block for highly scalable decentralized systems. They route requests over a structured overlay network to the node responsible for a given key. DHTs are subject to the well-known Sybil attack, in which an adversary creates many false identities …

    mit Repository record for Design and applications of a secure and decentralized Distributed Hash Table (opens in a new tab)

  8. GraphDHT: Scaling Graph Neural Networks' Distributed Training on Edge Devices on a Peer-to-Peer Distributed Hash Table Network

    … devices interconnected through a Distributed Hash Table (DHT). As GNNs become increasingly vital in analyzing graph-structured data across various domains, they pose unique challenges in computational demands and privacy preservation, particularly when deployed for training on edge devices …

    vt Repository record for GraphDHT: Scaling Graph Neural Networks' Distributed Training on Edge Devices on a Peer-to-Peer Distributed Hash Table Network (opens in a new tab)

  9. Perfect hashing and related problems

    … structure that supports these operations is a hash table. On a hash table, a basic operation takes 𝑂(1) time in the average case and 𝑂(𝑛) time in the worst case, where n is the number of words in the dictionary. While an ordinary hash function maps the words in a dictionary to a hash table with …

    vt Repository record for Perfect hashing and related problems (opens in a new tab)

  10. WhanauSIP : a secure peer-to-peer communications platform

    … WhanauSIP merges a Sybil-proof distributed hash table with the session initiation protocol (SIP) to enable instant messaging, audio chat, and video conferencing that is resilient to censoring, eavesdropping, and forgery. Performance and security evaluations performed on the PlanetLab network …

    mit Repository record for WhanauSIP : a secure peer-to-peer communications platform (opens in a new tab)

  11. G-hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases

    … graph data management. In our method we use a hash table to support efficient storage and fast search of the extracted local features from graph data. Using the hash table, we have developed a graph kernel function to capture the intrinsic similarity of graphs and for fast similarity query …

    ku Repository record for G-hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases (opens in a new tab)

  12. An empirical study of a novel technique : rationed-memory compiling

    … block, the compiler redirects the access to a hash table which stores and indexes out-of-bounds writes and returns the stored values on out-of-bounds reads from corresponding locations. For programs that over-allocate memory, the compiler yields savings because it allocates smaller memory …

    mit Repository record for An empirical study of a novel technique : rationed-memory compiling (opens in a new tab)

  13. Melody : a distributed music-sharing system

    … on Chord, a distributed lookup algorithm, and DHash, a distributed hash table. We evaluate the performance consequences and usability of Melody. In addition, this thesis presents two support applications: Autocat, to support automatic categorization, and Paynet, to encourage users to pay for the …

    mit Repository record for Melody : a distributed music-sharing system (opens in a new tab)

  14. Dynamic Load Balancing for a hp-adaptive Discontinuous Galerkin Wave Equation Solver via Spacing-Filling Curve and Advanced Data Structure

    … the mortar element method is adopted. A hash table AMR technique is developed for the AMR data encoding and storing. It can be built independently on distributed memory systems. It provides high control of the mesh resolution and efficient data management operations. Results using this …

    ottawa-retro Repository record for Dynamic Load Balancing for a hp-adaptive Discontinuous Galerkin Wave Equation Solver via Spacing-Filling Curve and Advanced Data Structure (opens in a new tab)

  15. On the use of locality aware distributed hash tables for homology searches over voluminous biological sequence data

    … of machines using a locality aware distributed hash table. A novel distributed nearest neighbor search algorithm identifies sequence segments with high similarity and splices them together to form an alignment. This paper includes an empirical evaluation of the performance, sensitivity, and …

    colostate Repository record for On the use of locality aware distributed hash tables for homology searches over voluminous biological sequence data (opens in a new tab)

  16. Exact genome alignment

    … of two sequence alignment programs LASTZ, a hash table based faster method and SSEARCH, a slower but more rigorous Smith-Waterman based approach, on whole genome sequences from primates and mammals. An exact genome alignment technique is used by breaking the entire genome into fragments and …

    njit Repository record for Exact genome alignment (opens in a new tab)

  17. Disk Based Model Checking

    … the RAM only algorithm, the new algoritm reduces hash table insertion time by reducing the cost and growth of the hash load. Compared with Stern's disk based algorithm, the new disk based algorithm significantly reduces disk vs memory comparsion but increases disk read/write time. The size of the …

    byu Repository record for Disk Based Model Checking (opens in a new tab)

  18. OverCite : a cooperative digital research library

    … research library based on a distributed hash table (DHT). The new architecture harnesses donated resources at many sites to provide document search and retrieval service to researchers worldwide. A preliminary evaluation of an initial OverCite prototype shows that it can service more …

    mit Repository record for OverCite : a cooperative digital research library (opens in a new tab)

  19. Making medical records more resilient

    … storage solutions based on Distributed Hash Table (DHT) technology for medical record storage. Distributed storage would alleviate public concerns over privacy with centralized storage of medical records. Empirical evidence is presented demonstrating the performance of DHT technology …

    mit Repository record for Making medical records more resilient (opens in a new tab)

  20. Inference neural network hardware acceleration techniques

    … Replace the multiply-add operation with a CRC hash table lookup. The results show that the first proposed method is not as competitive because of the long delay and high energy consumption of the unit. The second method is more promising in that it improves the energy by 1.96× with accuracy …

    uiuc Repository record for Inference neural network hardware acceleration techniques (opens in a new tab)

Page 1 of 3