1987 | OriginalPaper | Chapter
Simulated Time and the Ada Rendezvous
Author : Werner Pohlmann
Published in: Messung, Modellierung und Bewertung von Rechensystemen
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Choosing Ada as a base language for the process view of simulation, one would like to adopt the Ada rendezvous for process interaction. This paper investigates the implications of the rendezvous in the context of simulated time. To avoid the danger of deadlock (as exhibited by some proposed systems), a very thorough control of the rendezvous is shown to be necessary. A suitable simulation mechanism is presented and proven. But judged by the ensuing costs the rendezvous is considered to be no attractive choice for general simulation purposes.Considering methods, this paper uses and contributes to the “space-time view” (L.Lamport) of processes: processes are sequences of actions, and simulated time is a mapping of actions to numerical values.