𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multi-organization scheduling approximation algorithms

✍ Scribed by Johanne Cohen; Daniel Cordeiro; Denis Trystram; Frédéric Wagner

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
431 KB
Volume
23
Category
Article
ISSN
1532-0626

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cooperation in multi-organization schedu
Cooperation in multi-organization scheduling
✍ Fanny Pascual; Krzysztof Rzadca; Denis Trystram 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 552 KB

## Abstract The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We consider systems in which each organization owns a cluster of processors. Each organization wants its tasks t

Approximation algorithms for general par
Approximation algorithms for general parallel task scheduling
✍ Oh-Heum Kwon; Kyung-Yong Chwa 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 281 KB

A general parallel task scheduling problem is considered. A task can be processed in parallel on one of several alternative subsets of processors. The processing time of the task depends on the subset of processors assigned to the task. We first show the hardness of approximating the problem for bot

Sleep/wake scheduling for multi-hop sens
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
✍ Yan Wu; Sonia Fahmy; Ness B. Shroff 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 556 KB

We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronization error in the design of the sleep/wake scheduling algorithm. In our previous work, we studied sleep/wake scheduling for

Approximation algorithms for shop schedu
Approximation algorithms for shop scheduling problems with minsum objective
✍ Maurice Queyranne; Maxim Sviridenko 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 166 KB

We consider a general class of multiprocessor shop scheduling problems, preemptive or non-preemptive, with precedence constraints between operations, with job or operation release dates, and with a class of objective functions including weighted sums of job, operations and stage completion times. We

Approximation algorithms for scheduling
Approximation algorithms for scheduling trees with general communication delays
✍ Alix Munier 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 101 KB

We consider the problem of scheduling a tree with general communication delays. Jakoby and Reischuk proved that this problem is NP-hard for binary trees and unlimited number of processors. Firstly, we develop a clustering procedure based on the same lower bounds as Papadimitriou and Yannakakis for a