Results 321 to 330 of about 1,648,250 (343)
Some of the next articles are maybe not open access.
Concurrent Hash Tables for Haskell
2016This paper presents seven hash table Haskell implementations, ranging from low-level synchronization mechanisms to high-level ones such as transactional memories. The result of the comparison between the algorithms showed that the implementation using the STM Haskell transactional memory library and fine-grain synchronization presented the best ...
Rodrigo Medeiros Duarte +4 more
openaire +2 more sources
Interactive creation of hash tables
2016 International Conference on Emerging eLearning Technologies and Applications (ICETA), 2016The aim of this work is to design and implement program, which is able to do basic operations and to interactively create hash tables. It describes principles of hashing, behavior of hash tables with the use of various methods, which deal with conflicts when inserting values into tables and analyzes selected hash functions.
Eva Chovancová +2 more
openaire +2 more sources
7. Distributed Hash Tables [PDF]
, 2005 In the last few years, an increasing number of massively distributed systems with millions of participants has emerged within very short time frames. Applications, such as instant messaging, file-sharing, and content distribution have attracted countless numbers of users.
Simon Rieche, Klaus Wehrle, Stefan Götz
openaire +1 more source
Lock-free Hash Table on Graphics Processors
2012 Symposium on Application Accelerators in High Performance Computing, 2012Lock-free data structures guarantee higher throughput than lock-based implementations in parallel architectures. This paper presents the first CAS-based lock-free hash table that is based on chaining on GPUs.
Maryam Moazeni, Majid Sarrafzadeh
semanticscholar +1 more source
On the design of special hash functions for multiple hash tables
2012 9th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE), 2012One disadvantage of bitstate hashing, the traditional probabilistic state space analysis method, is the possible large amount of wasted memory for achieving a high probability of no address collision in hashing. We look at tradeoff between hashing speed and memory assigned for hashing. This paper presents a method using multiple hash tables and special
openaire +2 more sources
1995
One of the crucial operations on the path from specification to implementation is the modification of data structures. In this paper we demonstrate how this task can be accomplished constructively.
Peter Pepper +3 more
openaire +2 more sources
One of the crucial operations on the path from specification to implementation is the modification of data structures. In this paper we demonstrate how this task can be accomplished constructively.
Peter Pepper +3 more
openaire +2 more sources
Proceedings of the workshop on Memory Systems Performance and Correctness, 2014
From a trace of data accesses, it is possible to calculate an affinity hierarchy that groups related data together. Combining this hierarchy with the extremely common hash table, there is an opportunity to both improve cache performance and enable novel applications.
Brian Gernhardt +2 more
openaire +2 more sources
From a trace of data accesses, it is possible to calculate an affinity hierarchy that groups related data together. Combining this hierarchy with the extremely common hash table, there is an opportunity to both improve cache performance and enable novel applications.
Brian Gernhardt +2 more
openaire +2 more sources
The reallocation of hash-coded tables
Communications of the ACM, 1973When the space allocation for a hash-coded table is altered, the table entries must be rescattered over the new space. A technique for accomplishing this rescattering is presented. The technique is independent of both the length of the table and the hashing function used, and can be utilized in conjunction with a linear reallocation of the table being ...
openaire +2 more sources
Hash Tables and Associative Arrays
2019If you want to get a book from the central library of the Karlsruhe Institute of Technology (KIT), you have to order the book in advance. The library personnel fetch the book from the stacks and deliver it to a room with 100 shelves. You find your book on a shelf numbered with the last two digits of your library card.
Roman Dementiev +3 more
openaire +2 more sources