1156 search results - page 45 / 232 » Optimal scheduling of task graphs on parallel systems |
100
click to vote
DATE
2009
IEEE
15 years 3 months ago
2009
IEEE
As application complexity increases, modern embedded systems have adopted heterogeneous processing elements to enhance the computing capability or to reduce the power consumption. ...
125
click to vote
CLUSTER
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
100
click to vote
ECRTS
2010
IEEE
15 years 27 days ago
2010
IEEE
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
103
click to vote
ALGORITHMICA
2005
14 years 11 months ago
2005
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...
230
click to vote
ICDE
1999
IEEE
16 years 1 months ago
1999
IEEE
We present parallel algorithms for building decision-tree classifiers on shared-memory multiprocessor (SMP) systems. The proposed algorithms span the gamut of data and task parall...