Sciweavers

200 search results - page 27 / 40
» Approximation Algorithms for Scheduling on Multiple Machines
Sort
View
SIES
2009
IEEE
14 years 2 months ago
Programmable temporal isolation through variable-bandwidth servers
—We introduce variable-bandwidth servers (VBS) for scheduling and executing processes under programmable temporal isolation. A VBS is an extension of a constant-bandwidth server ...
Silviu S. Craciunas, Christoph M. Kirsch, Hannes P...
ICALP
2004
Springer
14 years 1 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
DATE
2007
IEEE
141views Hardware» more  DATE 2007»
13 years 11 months ago
Energy-efficient real-time task scheduling with task rejection
In the past decade, energy-efficiency has been an important system design issue in both hardware and software managements. For mobile applications with critical missions, both ene...
Jian-Jia Chen, Tei-Wei Kuo, Chia-Lin Yang, Ku-Jei ...
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
14 years 1 months ago
Rounding of Sequences and Matrices, with Applications
Abstract. We show that any real matrix can be rounded to an integer matrix in such a way that the rounding errors of all row sums are less than one, and the rounding errors of all ...
Benjamin Doerr, Tobias Friedrich, Christian Klein,...
TC
2010
13 years 2 months ago
Scheduling Concurrent Bag-of-Tasks Applications on Heterogeneous Platforms
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...
Anne Benoit, Loris Marchal, Jean-Francois Pineau, ...