Sciweavers

3563 search results - page 192 / 713
» Scheduling Algorithms for Procrastinators
Sort
View
CLUSTER
2008
IEEE
15 years 10 months ago
Divisible load scheduling with improved asymptotic optimality
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
Reiji Suda
RTCSA
2003
IEEE
15 years 9 months ago
Scheduling Jobs with Multiple Feasible Intervals
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When...
Chi-Sheng Shih, Jane W.-S. Liu, Infan Kuok Cheong
IPPS
2010
IEEE
15 years 2 months ago
Oblivious algorithms for multicores and network of processors
We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hi...
Rezaul Alam Chowdhury, Francesco Silvestri, Brando...
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
14 years 11 months ago
Lower Bounds for Randomized Consensus under a Weak Adversary
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
Hagit Attiya, Keren Censor-Hillel
SSS
2009
Springer
162views Control Systems» more  SSS 2009»
15 years 11 months ago
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
André Schumacher, Harri Haanpää