1156 search results - page 12 / 232 » Optimal scheduling of task graphs on parallel systems |
121
click to vote
CEC
2005
IEEE
15 years 1 months ago
2005
IEEE
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
IEEEPACT
1998
IEEE
15 years 3 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
108
click to vote
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
127
click to vote
EUROPAR
2010
Springer
14 years 9 months ago
2010
Springer
Star Superscalar is a task-based programming model. The programmer starts with an ordinary C program, and adds pragmas to mark functions as tasks, identifying their inputs and outp...
PPAM
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. The paper contains an extension of a formal model of multiagent computing system developed in previous publications towards considering a more general system state. We pr...