Name
Title | ||
|---|---|---|
Bounding completion times of jobs with arbitrary release times, variable execution times and resource sharing |
Abstract | ||
|---|---|---|
The workload of many real-time systems can be characterized as a set of preemptable jobs with linear precedence constraints. Typically their execution times are only known to lie within a range of values. In addition, jobs share resources and access to the resources must be synchronized to ensure the integrity of the system. This paper is concerned with the schedulability of such jobs when scheduled on a priority-driven basis. It describes three algorithms for computing upper bounds on the completion times of jobs that have arbitrary release times and priorities. The first two are simple but do not yield sufficiently tight bounds, while the last one yields the tightest bounds but has the greatest complexity. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/32.637144 | Software Engineering, IEEE Transactions |
Keywords | Field | DocType |
computational complexity,data integrity,real-time systems,resource allocation,scheduling,arbitrary release times,bounding completion times,complexity,linear precedence constraints,preemptable jobs,priority driven basis,real time systems,resource sharing,schedulability,system integrity,variable execution times | Workload,Computer science,Scheduling (computing),Parallel computing,Real-time computing,Data integrity,Resource allocation,Data cache,Shared resource,Bounding overwatch,Computational complexity theory | Journal |
Volume | Issue | ISSN |
23 | 10 | 0098-5589 |
Citations | PageRank | References |
12 | 0.77 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sun, J. | 1 | 12 | 0.77 |
| Mark K. Gardner | 2 | 145 | 15.48 |
| Jane W.-S. Liu | 3 | 1399 | 337.97 |