182 search results - page 8 / 37 » Benchmarking the Task Graph Scheduling Algorithms |
ISCAPDCS
2007
14 years 11 months ago
2007
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
ATMOS
2010
14 years 8 months ago
2010
In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The...
JSSPP
2009
Springer
15 years 4 months ago
2009
Springer
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...
106
click to vote
CCGRID
2008
IEEE
14 years 11 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
87
Voted
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...