Browse Prior Art Database

Multiprocessor Scheduling

IP.com Disclosure Number: IPCOM000069237D
Original Publication Date: 1978-Apr-01
Included in the Prior Art Database: 2005-Feb-20

Publishing Venue

IBM

Related People

Authors:
Fernandez, EB Lang, T [+details]

Abstract

This article describes an efficient algorithm for determination of lower bounds on the number of processors and on time for multiprocessor optimal scheduling, given a set of partially ordered computational tasks to be assigned to a set of homogeneous processors. The algorithm takes advantage of the characteristics of the graph of tasks to reduce the number of time intervals that have to be considered in the calculation.