Timed colored Petri net models of distributed memory multithreaded multiprocessors

Zuberek, W.M., Govindarajan, R., and Suciu, F.

Proc. Workshop on Practical Use of Colored Petri Nets and Design/CPN; Aarhus, Denmark, 8-12 June 1998, pp.253-270.

Abstract:

Distributed-memory multithreaded multiprocessors are composed of a number of (multithreaded) processors, each with its memory, and an interconnecting network. The long memory latencies and synchronization delays are tolerated by context switching, i.e., by suspending the current thread and switching the processor to another `ready' thread provided such a thread is available. Because of very simple representation of concurrency and synchronization, timed Petri net models seem to be well suited for modeling and evaluation of such systems. Colors are used to represent the progress of remote memory access requests in the interconnecting network as well as to fold the models of individual processors. This paper describes timed colored Petri net models of several multithreaded multiprocessor architectures, and presents some performance characteristics obtained by evaluation of these models.

Keywords:

Instruction-level multithreading, distributed-memory architectures, colored Petri nets, timed Petri nets, discrete-event simulation.

References:

Available in pdf and postscript.