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

On-Line Scheduling to Maximize Task Completions

Baruah, Sanjoy K and Haritsa, Jayant and Sharma, Nitin (1994) On-Line Scheduling to Maximize Task Completions. In: Real- Time Systems Symposium, 7-9 December, 1994, San Juan, Puerto Rico, pp. 228-236.

[img]
Preview
PDF
on-line.pdf

Download (275Kb)

Abstract

The problem of uniprocessor scheduling under conditions of overload is investigated. The system objective is to maximize the number of tasks that complete by their deadlines. For this performance metric it is shown that, in general, any on-line algorithm may perform arbitrarily poorly as compared t o a clairvoyant scheduler. Restricted instances of the general problem for which on-line schedulers can provide a guaranteed level of performance are identified, and on-line algorithms presented for these special cases.

Item Type: Conference Paper
Additional Information: ©1994 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.
Department/Centre: Division of Information Sciences > Supercomputer Education & Research Centre
Date Deposited: 21 Jul 2004
Last Modified: 19 Sep 2010 04:14
URI: http://eprints.iisc.ernet.in/id/eprint/1096

Actions (login required)

View Item View Item