𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An optimal boundary fair scheduling algorithm for multiprocessor real-time systems

✍ Scribed by Dakai Zhu; Xuan Qi; Daniel Mossé; Rami Melhem

Book ID
113743661
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
658 KB
Volume
71
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Optimal Multiprocessor Real-Time Sche
An Optimal Multiprocessor Real-Time Scheduling Algorithm
✍ Ashok Khemka; R.K. Shyamasundar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 170 KB

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

Scheduling Algorithms with Fault Detecti
Scheduling Algorithms with Fault Detection and Location Capabilities for Real-Time Multiprocessor Systems
✍ 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