On the use of hash tables in real-time applications

Authors:
Rômulo Silva De Oliveira;Carlos Carlos;Rodrigo Lange
Affiliations:
Departamento de Automação e Sistemas, Universidade Federal de Santa Catarina, Florianópolis, SC, Brasil;Departamento de Automação e Sistemas, Universidade Federal de Santa Catarina, Florianópolis, SC, Brasil;Departamento de Automação e Sistemas, Universidade Federal de Santa Catarina, Florianópolis, SC, Brasil
Venue:
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Year:
2009

Citing 3
Cited 0

Introduction to algorithms

Introduction to algorithms
Balanced allocations (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Expected Length of the Longest Probe Sequence in Hash Code Searching

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Software applications use hash tables for many different purposes. Hash tables have an excellent average-case behavior but, in the worst-case, it degrades to something like a chained list. Because of that, the use of hash tables in real-time systems is not usual, since those systems may be required to guarantee deadlines. This paper discusses the use of hash table in real-time systems, considering that when the probability of an undesirable behavior is low enough, it can be ignored. It also compares approaches simple and 2-choice for the table design.