Minimizing mean flow-time with parallel processors and resource constraints
- 80 Downloads
The problem to be considered is one of scheduling nonpreemptable tasks in multiprocessor systems when tasks need for their processing processors and other limited resources, and when mean flow time is the system performance measure. For each task the time required for its processing and the amount of each resource which it requires, are given. Special attention is paid to the computational complexity of algorithms for determining the optimal schedules for different assumptions concerning the environment. For the case of scheduling independent, arbitrary length tasks when each task may require a unit of an additional resource of one type, an O(n3) algorithm is given. For more complicated resource requirements, however, it is proved that the problem under consideration is NP-hard in the strong sense, even for the case of two processors.
KeywordsComputational Complexity Information Theory Computational Mathematic Computer System System Organization
Unable to display preview. Download preview PDF.
- 7.Bruno, J.L.: Scheduling algorithms for minimizing the mean weighted flow-time criterion. In: Computer and Job/Shop Scheduling Theory, Coffman, E.G., Jr. (ed.). New York: Wiley 1976Google Scholar
- 20.Ullman, J.D.: Complexity of Sequencing Problems. In: Computer and Job/Shop Scheduling Theory. Coffman, E.G., Jr. (ed.). New York: Wiley 1976Google Scholar