ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules

Jain, Kamal Kumar and Rajaraman, V (1994) Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules. In: IEEE Transactions on Parallel and Distributed Systems, 5 (8). pp. 879-886.

[img]
Preview
PDF
lower.pdf

Download (816Kb)

Abstract

The lower and upper bounds on the minimum time needed to process a given directed acyclic task graph for a given number of processors are derived. It is proved that the proposed lower bound on time is not only sharper than the previously known values but also easier to calculate. The upper bound on time, which is useful in determining the worst case behavior of a given task graph, is presented. The lower and upper bounds on the minimum number of processors required to process a given task graph in the minimum possible time are also derived. It is seen with a number of randomly generated dense task graphs that the lower and upper bounds we derive are equal, thus giving the optimal time for scheduling directed acyclic task graphs on a given set of processors.

Item Type: Journal Article
Additional Information: Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords: Bounds on number of processors;Bounds on time;Multi processing;Optimal scheduling; Parallel processing;Performance evaluation;Scheduling directed acyclic task graphs
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 25 Aug 2008
Last Modified: 19 Sep 2010 04:27
URI: http://eprints.iisc.ernet.in/id/eprint/6853

Actions (login required)

View Item View Item