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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
