Paper Info
Title
Layered Hashing Algorithm for Real-time Systems
Abstract
We present a hashing mechanism designated for real-time systems. As such, it is faster than standard hashing techniques, yet remains low-cost and uses a relatively small amount of resources. We study a mathematical model of the proposed mechanism, and compare the theoretical results to statistics obtained from simulations. The main contribution of this work is a procedure to determine the appropriate dimensions of the Hash-Table as a function of the required load, and a long-run analysis of the distribution of elements in the table.
Year
DOI
Venue
2012
10.1007/s00224-010-9297-0
Theory Comput. Syst.
Keywords
Field
DocType
Real-time algorithms,Resource allocation,Hashing
Locality-sensitive hashing,Hopscotch hashing,Discrete mathematics,Extendible hashing,Computer science,Universal hashing,Algorithm,Theoretical computer science,Dynamic perfect hashing,Open addressing,Hash table,Linear hashing
Journal
Volume
Issue
ISSN
50
2
1432-4350
Citations 
PageRank 
References 
0
0.34
13
Authors
1
Name
Order
Citations
PageRank
Matan Mandelbrod121114.41