Sciweavers

534 search results - page 80 / 107
» On Scheduling Parallel Tasks at Twilight
Sort
View
116
Voted
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
14 years 7 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
ESCIENCE
2007
IEEE
15 years 4 months ago
Intelligent Selection of Fault Tolerance Techniques on the Grid
The emergence of computational grids has lead to an increased reliance on task schedulers that can guarantee the completion of tasks that are executed on unreliable systems. There...
Daniel C. Vanderster, Nikitas J. Dimopoulos, Randa...
73
Voted
IPPS
2007
IEEE
15 years 4 months ago
A Near-optimal Solution for the Heterogeneous Multi-processor Single-level Voltage Setup Problem
A heterogeneous multi-processor (HeMP) system consists of several heterogeneous processors, each of which is specially designed to deliver the best energy-saving performance for a...
Tai-Yi Huang, Yu-Che Tsai, Edward T.-H. Chu
ICDCS
1997
IEEE
15 years 1 months ago
Load Profiling In Distributed Real-Time Systems
Load balancing is often used to ensure that nodes in a distributed systems are equally loaded. In this paper, we show that for real-time systems, load balancing is not desirable. ...
Azer Bestavros
95
Voted
EUROPAR
1997
Springer
15 years 1 months ago
Modulo Scheduling with Cache Reuse Information
Instruction scheduling in general, and software pipelining in particular face the di cult task of scheduling operations in the presence of uncertain latencies. The largest contrib...
Chen Ding, Steve Carr, Philip H. Sweany