Scheduling model for computer systems with two classes of processors
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Simulation results show the algorithms to be useful in scheduling less restricted job sets and an upper bound is seen to compare favorably with the upper bound intrinsic to the model.
Abstract
From Sagamore computer conference on parallel processing; Syracuse, New York, USA (22 Aug 1973). A simple algorithm to schedule a restricted set of jobs on a multiprocessor system with two classes of processors is described. Through deterministic analysis an upper bound is established for the behavior of the algorithm. This bound is seen to compare favorably with the upper bound intrinsic to the model. Simulation results show the algorithms to be useful in scheduling less restricted job sets. (auth)