Thumbnail
Access Restriction
Subscribed

Author Radke, Charles E.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Search method ♦ Address clustering ♦ Storage layout ♦ Searching ♦ Quadratic residue ♦ Quadratic search ♦ File addressing ♦ Hash addressing ♦ File searching ♦ Hash coding ♦ Random search ♦ Scatter storage
Abstract 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.
Description Affiliation: IBM Systems Development Division, Endicott, NY (Radke, Charles E.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 13
Issue Number 2
Page Count 3
Starting Page 103
Ending Page 105


Open content in new tab

   Open content in new tab
Source: ACM Digital Library