✦ LIBER ✦

Utilization Bounds for Multiprocessor Rate-Monotonic Scheduling

✍ Scribed by J. M. López; M. García; J. L. Díaz; D. F. García

Book ID: 110410907
Publisher: Springer US
Year: 2003
Tongue: English
Weight: 503 KB
Volume: 24
Category: Article
ISSN: 0922-6443
DOI: 10.1023/a:1021749005009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rate-monotonic scheduling on uniform mul

Rate-monotonic scheduling on uniform multiprocessors

✍ Baruah, S.K.; Goossens, J. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 260 KB

Utilization Bounds for EDF Scheduling on

Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems

✍ J. M. López; J. L. Díaz; D. F. García 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 361 KB

Utilization Bounds for N-Processor Rate

Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment

✍ Dong-Ik Oh; T.P. Bakker 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 512 KB

Generalized rate monotonic schedulabilit

Generalized rate monotonic schedulability bounds using relative period ratios

✍ Hsin-Wen Wei; Kwei-Jay Lin; Wan-Chen Lu; Wei-Kuan Shih 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 392 KB

A Feasibility Decision Algorithm for Rat

A Feasibility Decision Algorithm for Rate Monotonic and Deadline Monotonic Scheduling

✍ Yoshifumi Manabe; Shigemi Aoyagi 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 216 KB

Performance Bounds on Multiprocessor Sch

Performance Bounds on Multiprocessor Scheduling Strategies for Chain Structured Programs

✍ L. Lundberg 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 633 KB

In multiprocessors with static allocation of processes to processors, scheduling can be done locally for each processor. The scheduling strategy may have dramatic effect on the execution time of a parallel program. It is NP-hard to find an optimal schedule, and very little is known on how close the