Sciweavers

93 search results - page 1 / 19
» Non-clairvoyant scheduling with precedence constraints
Sort
View
CJ
2008
110views more  CJ 2008»
13 years 4 months ago
Average-Case Performance Analysis Of Online Non-Clairvoyant Scheduling Of Parallel Tasks With Precedence Constraints
We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a ...
Keqin Li
TCAD
2002
73views more  TCAD 2002»
13 years 4 months ago
System-on-a-chip test scheduling with precedence relationships, preemption, and power constraints
Test scheduling is an important problem in system-on-a-chip (SOC) test automation. Efficient test schedules minimize the overall system test application time, avoid test resource c...
Vikram Iyengar, Krishnendu Chakrabarty
ICPP
2002
IEEE
13 years 9 months ago
An Efficient Fault-Tolerant Scheduling Algorithm for Real-Time Tasks with Precedence Constraints in Heterogeneous Systems
In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provi...
Xiao Qin, Hong Jiang, David R. Swanson
EOR
2002
105views more  EOR 2002»
13 years 4 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler
ICALP
2001
Springer
13 years 9 months ago
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
Gerhard J. Woeginger