Sciweavers

123 search results - page 11 / 25
» A Bi-criteria Algorithm for Scheduling Parallel Task Graphs ...
Sort
View
EUROPAR
2005
Springer
14 years 1 months ago
Hierarchical Scheduling for Moldable Tasks
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
Pierre-François Dutot
CLUSTER
2006
IEEE
14 years 1 months ago
Stochastic Scheduling with Availability Constraints in Heterogeneous Clusters
High availability plays an important role in heterogeneous clusters, where processors operate at different speeds and are not continuously available for processing. Existing sched...
Tao Xie 0004, Xiao Qin
CCGRID
2008
IEEE
14 years 2 months ago
Joint Communication and Computation Task Scheduling in Grids
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
Kostas Christodoulopoulos, Nikolaos D. Doulamis, E...
IPPS
2010
IEEE
13 years 5 months ago
Executing task graphs using work-stealing
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...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
ESCIENCE
2007
IEEE
14 years 1 months ago
A Dynamic Critical Path Algorithm for Scheduling Scientific Workflow Applications on Global Grids
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 ...
Mustafizur Rahman 0003, Srikumar Venugopal, Rajkum...