182 search results - page 11 / 37 » Benchmarking the Task Graph Scheduling Algorithms |
110
Voted
ESCIENCE
2007
IEEE
15 years 8 months ago
2007
IEEE
Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling ...
108
Voted
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...
122
Voted
IPPS
2010
IEEE
15 years 10 days ago
2010
IEEE
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
127
click to vote
DATE
2006
IEEE
15 years 6 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
114
Voted
ICPPW
2006
IEEE
15 years 8 months ago
2006
IEEE
Evolution of grid has drawn attention from various resource intensive applications addressing domains of bio-informatics, astrology and multimedia, to name a few. Image analysis a...