Development and use of concurrency abstractions for discrete-event simulation

The concern here focuses on developing concurrency abstractions that can readily serve, without modeling compromises or structural awkwardness, in a variety of simulation programs. In this scheme, each concurrency abstraction is implemented as an Ada generic package that exports a task type, thereby enabling the instantiation of multiple task objects. A systematic method of expressing and developing concurrency abstractions is described. This process begins with the representation of a concurrency concept using a new type of graphical construct, a token transition graph, given by D.B. Mulcare and R.J. LeBlanc (1991). The authors consider how a useful, self-contained abstraction can evolve from one of these concept representations. Specifically, the development and application of a rudimentary rate monotonic scheduling job queue is illustrated.<
>