93 search results - page 6 / 19 » Non-clairvoyant scheduling with precedence constraints |
SPAA
2005
ACM
14 years 4 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
RTAS
2010
IEEE
13 years 9 months ago
2010
IEEE
—This article studies the scheduling of critical embedded systems, which consist of a set of communicating periodic tasks with constrained deadlines. Currently, tasks are usually...
ECRTS
1999
IEEE
14 years 3 months ago
1999
IEEE
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
APPROX
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
RTAS
2010
IEEE
13 years 9 months ago
2010
IEEE
While most prior work on multiprocessor real-time scheduling focuses on independent tasks, dependencies due to non-preemptive sections, suspensions, and pipelinebased precedence c...