Performance Analysis of Some Process-to-Processor Assignment Algorithms for a UNIX (R) Multiprocessor System
01 January 1988
A fundamental task in the design of operating system for a distributed computing environment is the development of an effective job scheduling procedure which suitably takes advantage of an architecture offering multiple resources of the same class. In this paper we present some results of a performance study of process- to- processor assignment algorithms for a UNIX multiprocessor system with centralized resource manager.