✦ LIBER ✦

Fairness in parallel job scheduling

✍ Scribed by Uwe Schwiegelshohn; Ramin Yahyapour

Publisher: Springer US
Year: 2000
Tongue: English
Weight: 180 KB
Volume: 3
Category: Article
ISSN: 1094-6136
DOI: 10.1002/1099-1425(200009/10)3:5<297::aid-jos50>3.0.co;2-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A metric of fairness for parallel job sc

A metric of fairness for parallel job schedulers

✍ John Ngubiri; Mario van Vliet 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB 👁 1 views

## Abstract Fairness is an important aspect in queuing systems. Several fairness measures have been proposed in queuing systems in general and parallel job scheduling in particular. Generally, a scheduler is considered unfair if some jobs are discriminated whereas others are favored. Some of the me

Fairness in Scheduling

✍ Miklos Ajtai; James Aspnes; Moni Naor; Yuval Rabani; Leonard J Schulman; Orli Wa 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 376 KB

Parallel machine scheduling with job ass

Parallel machine scheduling with job assignment restrictions

✍ Celia A. Glass; Hans Kellerer 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

## Abstract In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means

Randomized On-line Scheduling of Paralle

Randomized On-line Scheduling of Parallel Jobs

✍ Jiřı&#x0301; Sgall 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 230 KB

We study randomized on-line scheduling on mesh machines. We show that for scheduling independent jobs randomized algorithms can achieve a significantly better performance than deterministic ones; on the other hand with dependencies randomization does not help.

Scheduling jobs and maintenance activiti

Scheduling jobs and maintenance activities on parallel machines

✍ Chung-Yee Lee; Zhi-Long Chen 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machin

Concurrent operations can be parallelize

Concurrent operations can be parallelized in scheduling multiprocessor job shop

✍ Nodari Vakhania; Evgeny Shchepin 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 162 KB

We consider the multiprocessor job shop scheduling problem (JSP) with unrelated processors, an extension of the classical JSP. The precedence relations between the operations are given by an acyclic directed weighted graph, in which nodes represent operations and arcs represent precedence relations.