Premium
Using SR for discrete event simulation: A study in concurrent programming
Author(s) -
Olsson Ronald A.
Publication year - 1990
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380201202
Subject(s) - computer science , asynchronous communication , synchronization (alternating current) , programming language , event (particle physics) , context (archaeology) , exploit , discrete event simulation , concurrent object oriented programming , simulation language , concurrent computing , distributed computing , theoretical computer science , programming paradigm , reactive programming , inductive programming , simulation , computer network , paleontology , channel (broadcasting) , physics , computer security , quantum mechanics , biology
This paper demonstrates the use of the SR concurrent programming language for discrete event simulation. SR provides a rich collection of synchronization mechanisms, whose use can lead to programs that are simpler and more efficient than those constrained to employ only one synchronization mechanism. Several SR solutions to a simulation problem are presented and contrasted with an Ada solution to the same problem. The paper also introduces a technique that exploits asynchronous message passing to program concise solutions to several problems involving lists. In the context of the simulation problem, this technique is used to manage the event list and the list of blocked processes. The technique can also be applied to several other concurrent programming problems. The results of this paper should be of interest both to programmers using concurrent programming languages and to language designers.