✦ LIBER ✦

Greedy multiprocessor server scheduling

✍ Scribed by Carl Bussema; Eric Torng

Book ID: 103877738
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 191 KB
Volume: 34
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2005.07.005

No coin nor oath required. For personal study only.

✦ Synopsis

We show that the greedy highest density first (HDF) algorithm is (1 + )-speed O(1)-competitive for the problem of minimizing the p norms of weighted flow time on m identical machines. Similar results for minimizing unweighted flow provide insight into the power of migration.

📜 SIMILAR VOLUMES

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

On Multiprocessor System Scheduling

✍ Xiaotie Deng; Patrick Dymond 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 128 KB

Leakage-Aware Multiprocessor Scheduling

✍ Pepijn de Langen; Ben Juurlink 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 686 KB

General multiprocessor task scheduling

✍ Jianer Chen; Chung-Yee Lee 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB

Most papers in the scheduling field assume that a job can be processed by only one machine at a time. Namely, they use a one-job-on-one-machine model. In many industry settings, this may not be an adequate model. Motivated by human resource planning, diagnosable microprocessor systems, berth allocat

Multiprocessor Scheduling with Rejection

✍ Bartal, Yair; Leonardi, Stefano; Marchetti-Spaccamela, Alberto; Sgall, Jirí; Sto 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 326 KB

Guest editorial: multiprocessor scheduli

Guest editorial: multiprocessor scheduling

✍ Alan Burns, Laurent George 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 153 KB