Sciweavers

1502 search results - page 42 / 301
» Node weighted scheduling
Sort
View
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 10 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin
ESA
2010
Springer
149views Algorithms» more  ESA 2010»
13 years 10 months ago
Non-clairvoyant Speed Scaling for Weighted Flow Time
We study online job scheduling on a processor that can vary its speed dynamically to manage its power. We attempt to extend the recent success in analyzing total unweighted flow ti...
Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee
COCOA
2008
Springer
13 years 11 months ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz
IFIP
2010
Springer
13 years 4 months ago
Task Migration for Fault-Tolerant FlexRay Networks
In this paper we present new concepts to resolve ECU (Electronic Control Unit) failures in FlexRay networks. Our approach extends the FlexRay bus schedule by redundant slots with m...
Kay Klobedanz, Gilles B. Defo, Henning Zabel, Wolf...
INFOCOM
2007
IEEE
14 years 4 months ago
Cooperative Strategies and Optimal Scheduling for Tree Networks
Abstract— In this paper, we develop and analyze a lowcomplexity cooperative protocol that significantly increases the average throughput of multi-hop upstream transmissions for ...
Alexandre de Baynast, Omer Gurewitz, Edward W. Kni...