✦ LIBER ✦

Probabilistic single processor scheduling

✍ Scribed by Janelie J. Harms; Charles J. Colbourn

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 821 KB
Volume: 27
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90132-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling on a single processor with va

Scheduling on a single processor with variable speed

✍ Bahram Alidaee; Ahmad Ahmadian 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 384 KB

Video signal processor scheduling

✍ E. A. de Kock; E. H. L. Aarts; A. J. E. Verstraten 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 108 KB

A note on single-processor scheduling wi

A note on single-processor scheduling with time-dependent execution times

✍ Zhi-Long Chen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Multi-processor scheduling and expanders

✍ Nikolai N. Kuzjurin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 404 KB

A nonidentical parallel processor schedu

A nonidentical parallel processor scheduling problem

✍ Nicholas G. Hall; K. Anthony Rhee; Wansoo T. Rhee 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 363 KB

Eliminating Migration in Multi-processor

Eliminating Migration in Multi-processor Scheduling

✍ Bala Kalyanasundaram; Kirk R Pruhs 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 186 KB

We investigate the power of migration in real-time multi-processor scheduling with preemption. We show that every collection of jobs that can be completed by some schedule S on m processors can also be completed by a nonmigratory schedule S on 6m -5 processors. We can conclude from this result that,