279 search results - page 20 / 56 » Low Overhead Parallel Schedules for Task Graphs |
CLUSTER
2009
IEEE
14 years 13 days ago
2009
IEEE
Abstract—Since the advent of multi-core processors, the physionomy of typical clusters has dramatically evolved. This new massively multi-core era is a major change in architectu...
HPDC
2006
IEEE
14 years 1 months ago
2006
IEEE
ALPS is a per-application user-level proportional-share scheduler that operates with low overhead and without any special kernel support. ALPS is useful to a range of applications...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
EOR
2002
13 years 7 months ago
2002
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
PDCAT
2004
Springer
14 years 1 months ago
2004
Springer
DFS has previously been shown to be a simple and efficient strategy for removing cycles in graphs allowing the resulting DAGs to be scheduled using one of the many well-established...