Name
Abstract | ||
|---|---|---|
In multiprocessor and distributed real-time systems, scheduling jobs dynamically on processors is likely to achieve better performance. However, analytical and efficient validation methods to determine whether all the timing constraints are met do not exist for systems using modern dynamic scheduling strategies, and exhaustive simulation and testing are unreliable and expensive. This paper describes several worst-case bounds and efficient algorithms for validating systems in which jobs have arbitrary timing constraints and variable execution times and are scheduled on processors dynamically in a priority-driven manner. The special cases of the validation problem considered here are concerned with independent jobs that are (1) preemptable and migratable, or (2) preemptable and nonmigratable, or (3) nonpreemptable |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1109/ICDCS.1994.302407 | ICDCS |
Keywords | Field | DocType |
execution time,efficient validation method,release time,validation methods,scheduling,network operating systems,arbitrary release time,validating timing constraint,distributed real-time systems,dynamic multiprocessor,resource allocation,completion time,real-time system,independent jobs,efficient algorithm,timing constraints,exhaustive method,multiprocessor,worst-case bounds,modern dynamic scheduling strategy,independent job,distributed processing,real-time systems,computer science,scheduling algorithm,databases,dynamic scheduling,real time systems,testing | Load management,Multiprocessor scheduling,Validation methods,Scheduling (computing),Computer science,Parallel computing,Multiprocessing,Real-time computing,Resource allocation,Processor scheduling,Dynamic priority scheduling,Distributed computing | Conference |
ISSN | Citations | PageRank |
1063-6927 | 46 | 4.76 |
References | Authors | |
4 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rhan Ha | 1 | 587 | 54.88 |
| Jane W.-S. Liu | 2 | 1399 | 337.97 |