✦ LIBER ✦

Performance of the LPT algorithm in multiprocessor scheduling

✍ Scribed by Tien Y. Kao; E.A. Elsayed

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 666 KB
Volume: 17
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(90)90015-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fault-tolerant LPT task scheduling in mu

Fault-tolerant LPT task scheduling in multiprocessor systems

✍ Alan A Bertossi; Luigi Mancini 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 838 KB

Performance evaluation of Two-level Sche

Performance evaluation of Two-level Scheduling algorithms for NUMA multiprocessors

✍ Yukio Ohishi; Keizo Saisho; Akira Fukuda 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

In this article, we simulate and evaluate various Twolevel Scheduling algorithms for cluster-based NUMA (Non-Uniform Memory Access) multiprocessors. Twolevel Scheduling is a kind of space partitioning scheduling. We evaluate the following variations: (1) Cluster-free Algorithm and (2) Cluster-limite

Multiprocessor scheduling: An extension

Multiprocessor scheduling: An extension of the MULTIFIT algorithm

✍ Chung-Yee Lee; J.David Massey 📂 Article 📅 1988 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 612 KB

Scheduling of parallel processors: A pos

Scheduling of parallel processors: A posterior bound on LPT sequencing and a two-step algorithm

✍ James D. Blocher; Suresh Chand 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 565 KB

Multiprocessor task scheduling in multis

Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach

✍ Cengiz Kahraman; Orhan Engin; İhsan Kaya; R. Elif Öztürk 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 235 KB

A standard task graph set for fair evalu

A standard task graph set for fair evaluation of multiprocessor scheduling algorithms

✍ Takao Tobita; Hironori Kasahara 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 587 KB

A 'standard task graph set' is proposed for fair evaluation of multiprocessor scheduling algorithms. Developers of multiprocessor scheduling algorithms usually evaluate them using randomly generated task graphs. This makes it di cult to compare the performance of algorithms developed in di erent res