EPrints@IIT Delhi >
Faculty Research Publicatons  >
Computer Science and Engineering >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/646

Full metadata record

DC FieldValueLanguage
dc.contributor.authorDominic, M-
dc.contributor.authorJain, Bijendra N-
dc.identifier.citationJournal of Parallel and Distributed Computing, 55(1), 121--137en
dc.description.abstractIn this paper we consider the problem of on-line scheduling of hard real-time tasks on multiple processors. For a given set of ready tasks, one can propose many schedules. These schedules, however, may not necessarily be suitable for on-line scheduling. A suitable on-line schedule is one which can accommodate any future task set when it arrives. The traditional approach to solve the on-line scheduling problem is to propose a heuristic, and then to prove its effectiveness by comparing it with existing heuristics using simula- tion. No attempt has, however, been made to obtain a condition on the current schedule which when satisfied will permit one to schedule an arbitrary future task. In this paper, we aim at developing such a condition on the current schedule for the set of ready tasks which when satisfied can guarantee an on-line schedule for any future feasible task set.en
dc.format.extent416386 bytes-
dc.subjectlinescheduling ofhard real-timetasksen
dc.subjectfor on-line schedulingen
dc.titleConditions for on-line scheduling of hard real-time tasks on multiprocessors1en
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
dominiccon1998.pdf406.63 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback