Programming Technique: An improved hash code for scatter storage
Communications of the ACM
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
Identifier Search Mechanisms: A Survey and Generalized Model
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Comment on weighted increment linear search for scatter tables
Communications of the ACM
Communications of the ACM
The quadratic hash method when the table size is not a prime number
Communications of the ACM
Weighted increment linear search for scatter tables
Communications of the ACM
Reducing the retrieval time of scatter storage techniques
Communications of the ACM
Communications of the ACM
Full table quadratic searching for scatter storage
Communications of the ACM
Communications of the ACM
A graduate course in database management
ACM SIGMOD Record
Fast Duplicate Address Detection for Seamless Inter-Domain Handoff in All-IPv6 Mobile Networks
Wireless Personal Communications: An International Journal
Expandable open addressing hash table storage and retrieval
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 48.34 |
Some of the problems of simulating discrete event systems, particularly computer systems, on a conventional digital computer are dealt with. The systems are assumed to be described as a network of interconnected sequential processes. Briefly reviewed are the common techniques used to handle such simulations when simultaneous events do not occur, can be ignored, or can be handled by simple priority rules. Following this, the problem of dealing with simultaneous events in separate processes is introduced. An abstraction of this problem is developed which admits solution for a majority of commonly encountered problems. The technique will either find a method of simulating the parallel events or report that none can be found. In some of the latter cases it is shown to be possible to find a solution by extending the information available to the solution technique, but in many cases the technique becomes computationally unfeasible when the additional information is provided.