Name
Abstract | ||
|---|---|---|
Exclusive methods for determining whether all jobs complete by their deadlines in systems that use modern priority-driven scheduling strategies are often infeasible or unreliable because the execution and release times of each job may vary. This article presents several worst-case bounds and efficient algorithms for determining how late the completion times of jobs can be in static and dynamic multiprocessor or distributed systems. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1016/0164-1212(94)00118-7 | Journal of Systems and Software |
Keywords | Field | DocType |
real-time constraint,distributed system,real time | Upper and lower bounds,Scheduling (computing),Computer science,Parallel computing,Multiprocessing,Real-time computing,Execution time,Distributed computing | Journal |
Volume | Issue | ISSN |
30 | 1-2 | The Journal of Systems & Software |
Citations | PageRank | References |
7 | 0.80 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jane W.-S. Liu | 1 | 1399 | 337.97 |
| Rhan Ha | 2 | 587 | 54.88 |