✦ LIBER ✦

Two processor scheduling with limited preemption

✍ Scribed by E.L. Lloyd

Publisher: Elsevier Science
Year: 1986
Weight: 122 KB
Volume: 4
Category: Article
ISSN: 0167-7136
DOI: 10.1016/0167-7136(86)90040-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two processor scheduling with limited pr

Two processor scheduling with limited preemption

✍ Errol L. Lloyd 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Online deadline scheduling with preempti

Online deadline scheduling with preemption penalties

✍ Feifeng Zheng; Yinfeng Xu; Chung Keung Poon; E. Zhang; Xiaoping Wu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 264 KB

Tail-robust scheduling via limited proce

Tail-robust scheduling via limited processor sharing

✍ Jayakrishnan Nair; Adam Wierman; Bert Zwart 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 490 KB

From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed workload distributions, and vice versa, leading to fundamental problems in designing schedulers that are robust to distribution

Optimal scheduling for two-processor sys

Optimal scheduling for two-processor systems

✍ E. G. Coffman; R. L. Graham 📂 Article 📅 1972 🏛 Springer-Verlag 🌐 English ⚖ 639 KB

Real-time scheduling with both preemptio

Real-time scheduling with both preemption and nonpreemption requirements

✍ Xiaoping Yuan; Ashok K. Agrawala 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 490 KB

Computing the bump number with technique

Computing the bump number with techniques from two-processor scheduling

✍ Alejandro A. Schäffer; Barbara B. Simons 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 730 KB