✦ LIBER ✦

A lower bound for randomized on-line multiprocessor scheduling

✍ Scribed by Jiří Sgall

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 464 KB
Volume: 63
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00093-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for on-line single-machine

Lower bounds for on-line single-machine scheduling

✍ Leah Epstein; Rob van Stee 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 158 KB

New lower and upper bounds for on-line s

New lower and upper bounds for on-line scheduling

✍ Bo Chen; André van Vliet; Gerhard J. Woeginger 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 507 KB

An LPT-Bound for a Parallel Multiprocess

An LPT-Bound for a Parallel Multiprocessor Scheduling Problem

✍ F. Harche; S. Seshadri 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 476 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

A lower bound for randomized list update

A lower bound for randomized list update algorithms

✍ Boris Teia 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 405 KB

Lower bounds for on-line graph coloring

✍ Magnus M. Halldórsson; Mario Szegedy 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 771 KB