By Topic

Petri net model of a dynamically partitioned multiprocessor system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Madhukar, M. ; Dept. of Comput. Sci., Vanderbilt Univ., Nashville, TN, USA ; Leuze, M. ; Dowdy, L.

A multiprocessor system can be subdivided into partitions of processors, each of which can be dedicated to the execution of a parallel program. The partitioning of the system, can be done statically at system configuration time, adaptively prior to the execution time, or dynamically during execution time. Since, in a dynamically partitioned multiprocessor system, partitioning can occur anytime during the execution of a program, designing an analytical model for such a system is a difficult task. In this paper a Petri net model of a dynamically partitioned multiprocessor system is presented. The workload consists of parallel programs which are characterized by their execution signatures. Repartitioning overhead is an important parameter and is modeled explicitly. The model is used to perform a series of sensitivity analysis experiments which give insight into the behavior of such systems. Several dynamic processor allocation policies have been implemented. Equal Slope and Shortest Job First Preemptive Resume achieve the best performance of the policies considered

Published in:

Petri Nets and Performance Models, 1995., Proceedings of the Sixth International Workshop on

Date of Conference:

3-6 Oct 1995