58 search results - page 3 / 12 » Fast Optimal Task Graph Scheduling by Means of an Optimized ... |
TPDS
1998
13 years 5 months ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
CLUSTER
2006
IEEE
13 years 5 months ago
2006
IEEE
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
EUROPAR
2004
Springer
13 years 9 months ago
2004
Springer
Abstract This paper proposes an approach to continuously optimizing parallel scientific applications with dynamically changing architectures. We achieve this by combining a dynamic...
EUROPAR
2009
Springer
14 years 6 days ago
2009
Springer
Abstract In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on stead...
IPPS
2003
IEEE
13 years 11 months ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...