An optimal scheduling algorithm is described that feasibly schedules a set of m periodic tasks on n processors before their respective deadlines, if the task set satisfies certain conditions. The complexity of this scheduling algorithm in terms of the number of scheduled tasks and the number of proc
โฆ LIBER โฆ
Real time scheduling algorithms and their performances
โ Scribed by R. Cobelli; L. Mezzalira; G.F. Navoni; N. Scarabottolo
- Publisher
- Elsevier Science
- Year
- 1990
- Weight
- 449 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0165-6074
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An Optimal Multiprocessor Real-Time Sche
โ
Ashok Khemka; R.K. Shyamasundar
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 170 KB
Real-Time Systems || Real-Time Schedulin
โ
Cheng, Albert M. K.
๐
Article
๐
2002
๐
John Wiley & Sons, Inc.
โ 301 KB
๐ 2 views
Scheduling expert systems and their perf
โ
Jae K. Lee; Mark S. Fox; Paul R. Watkins
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 109 KB
A new study for fault-tolerant real-time
โ
G. Manimaran; C. Siva Ram Murthy
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 823 KB
Scheduling Algorithms with Fault Detecti
โ
K. Mahesh; G. Manimaran; C.Siva Ram Murthy; Arun K. Somani
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 444 KB
Several schemes for detecting and locating faulty processors through self-diagnosis in multiprocessor systems have been discussed in the past. These schemes attempt to start multiple copies (versions) of the tasks on available idle processors simultaneously and compare the results generated by the c
A schedulability algorithm for data flow
โ
R Davoli; L.A Giachini
๐
Article
๐
1994
๐
Elsevier Science
โ 488 KB