In: CPN, Aarhus, Denmark, 10-12 June 1998 / Jensen, K.: Daimi PB-532: Workshop on Practical Use of Coloured Petri Nets and Design, pages 253-270. Aarhus University, June 1998. Available at ftp://ftp.cs.mun.ca/pub/publications/98-CPN.ps.Z.
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: multiprocessor architectures; multithreaded architectures; timed Petri nets; timed colored nets.
Back to the Petri Nets Bibliography