|
EPrints@IIT Delhi >
Faculty Research Publicatons >
Computer Science and Engineering >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2074/646
|
| Title: | Conditions for on-line scheduling of hard real-time tasks on multiprocessors1 |
| Authors: | Dominic, M
Jain, Bijendra N |
| Keywords: | linescheduling ofhard real-timetasks
tasks
for on-line scheduling
condition |
| Issue Date: | 1998 |
| Citation: | Journal of Parallel and Distributed Computing, 55(1), 121--137 |
| Abstract: | In 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. |
| URI: | http://eprint.iitd.ac.in/dspace/handle/2074/646 |
| Appears in Collections: | Computer Science and Engineering
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| dominiccon1998.pdf | | 406Kb | Adobe PDF | View/Open |
|
Show full item record
All items in DSpace are protected by copyright, with all rights reserved.
|
