✦ LIBER ✦

Probabilistic Bounds on the Performance of List Scheduling

✍ Scribed by Bruno, John L.; Downey, Peter J.

Book ID: 118174126
Publisher: Society for Industrial and Applied Mathematics
Year: 1986
Tongue: English
Weight: 807 KB
Volume: 15
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0215028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Probabilistic performance analysis in mu

Probabilistic performance analysis in multiprocessor scheduling

✍ Nissanke, N.; Leulseged, A.; Chillara, S. 📂 Article 📅 2002 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 645 KB

Tight Performance Bounds of CP-Schedulin

Tight Performance Bounds of CP-Scheduling on Out-Trees

✍ Nodari Vakhania 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 381 KB

Bounds on list scheduling of uet tasks w

Bounds on list scheduling of uet tasks with restricted resource constraints

✍ Joseph Y-T. Leung 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 381 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

Performance Bounds of Algorithms for Sch

Performance Bounds of Algorithms for Scheduling Advertisements on a Web Page

✍ Milind Dawande; Subodha Kumar; Chelliah Sriskandarajah 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 201 KB

On the optimality of list scheduling for

On the optimality of list scheduling for online uniform machines scheduling

✍ Fangqiu Han, Zhiyi Tan, Yang Yang 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 285 KB