Timed Petri net models of multithreaded multiprocessor architectures

  • Authors:
  • R. Govindarajan;F. Suciu;W. M. Zuberek

  • Affiliations:
  • -;-;-

  • Venue:
  • PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multithreaded distributed-memory multiprocessor architectures are composed of a number of (multithreaded) processors, each with its memory, and an interconnection network. The long memory latencies and unpredictable 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 architectures. However, accurate net models of multithreaded multiprocessors become quite complicated, so their analysis can be a nontrivial task. This paper describes a timed colored Petri net model of a multithreaded multiprocessor architecture, and presents some results obtained by simulation of this model. A simplified approach to modeling such architectures is also proposed.