1156 search results - page 92 / 232 » Optimal scheduling of task graphs on parallel systems |
ICCAD
1997
IEEE
15 years 4 months ago
1997
IEEE
- Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register les must be preserved in order for the task to be resumed. This e...
HICSS
1995
IEEE
15 years 3 months ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
GRID
2006
Springer
14 years 12 months ago
2006
Springer
Existing data grid scheduling systems handle huge data I/O via replica location services coupled with simple staging, decoupled from scheduling of computing tasks. However, when th...
117
click to vote
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
103
click to vote
ECRTS
2010
IEEE
15 years 2 days ago
2010
IEEE
The Earliest Deadline First scheduling algorithm (EDF) is known to not be optimal under global scheduling on multiprocessor platforms. Results have been obtained that bound the ma...