No Access

ON MODELING PARTITIONED MULTIPROCESSOR SYSTEMS

Department of Computer Science Vanderbilt University Nashville, Tennessee 37235, USA

Supported in part by the Alexander von Humboldt Foundation while on leave to the University of Erlangen-Nürnberg, Erlangen, FRG.

Search for more papers by this author

and

MICHAEL R. LEUZE

Mathematical Sciences Section Oak Ridge National Laboratory Oak Ridge, Tennessee 37831, USA

Supported by the Applied Mathematical Sciences Research Program of the Office of Energy Research, U.S. Department of Energy.

Search for more papers by this author

https://doi.org/10.1142/S0129053394000032Cited by:5 (Source: Crossref)

Abstract

In recent years, multiprocessor systems have been developed to exploit parallelism within individual programs. However, a multiprocessor system may be used more efficiently if its processors are partitioned among independent parallel programs. The partitioning of a multiprocessor system is addressed in this paper.

A simple yet powerful model is proposed for the analysis of various partitioning schemes. The model parameterizes both a multiprocessor system and its parallel workload. Attention is restricted to a multiprocessor system partitioned between two parallel programs. The model is studied to determine (1) when partitioning is worthwhile, (2) the extent of performance improvement under optimal partitioning, and (3) which of three partition scheduling schemes is best.

Keywords: