1156 search results - page 73 / 232 » Optimal scheduling of task graphs on parallel systems |
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...
133
click to vote
PRDC
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
SC
2003
ACM
15 years 5 months ago
2003
ACM
Buffered CoScheduled MPI (BCS-MPI) introduces a new approach to design the communication layer for largescale parallel machines. The emphasis of BCS-MPI is on the global coordinat...
ESCIENCE
2007
IEEE
15 years 6 months ago
2007
IEEE
The emergence of computational grids has lead to an increased reliance on task schedulers that can guarantee the completion of tasks that are executed on unreliable systems. There...
108
click to vote
TCAD
1998
14 years 11 months ago
1998
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...