Cilk: an efficient multithreaded runtime system
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Space-Efficient Scheduling of Multithreaded Computations
SIAM Journal on Computing
Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments
IEEE Transactions on Parallel and Distributed Systems
Scheduling multithreaded computations by work stealing
Journal of the ACM (JACM)
Benchmarking and comparison of the task graph scheduling algorithms
Journal of Parallel and Distributed Computing
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Scalable Parallel Computing: Technology,Architecture,Programming
Scalable Parallel Computing: Technology,Architecture,Programming
Introduction to Algorithms
Models and Scheduling Mechanisms for Global Computing Applications
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors
Proceedings of the 8th International Symposium on Parallel Processing
On Scheduling Mesh-Structured Computations for Internet-Based Computing
IEEE Transactions on Computers
Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing
IEEE Transactions on Computers
Creating minimal vertex series parallel graphs from directed acyclic graphs
APVis '04 Proceedings of the 2004 Australasian symposium on Information Visualisation - Volume 35
Toward a Theory for Scheduling Dags in Internet-Based Computing
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
On scheduling dags to maximize area
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Extending IC-scheduling via the Sweep Algorithm
Journal of Parallel and Distributed Computing
Assessing the computational benefits of AREA-oriented DAG-scheduling
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
On scheduling dag s for volatile computing platforms: Area-maximizing schedules
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Earlier work introduced a new optimization goal for DAG schedules: the "AREA" of the schedule. AREA-maximizing schedules are intended for computational environments--such as Internet-based computing and massively multicore computers--that benefit from DAG-schedules that produce executioneligible tasks as fast as possible. The earlier study of AREA-maximizing schedules showed how to craft such schedules efficiently for DAGs that have the structure of trees and other, less well-known, families of DAGs. The current paper extends the earlier work by showing how to efficiently craft AREA-maximizing schedules for series-parallel DAGs, a family that arises, e.g., in multi-threaded computations. The tools that produce the schedules for series-parallel DAGs promise to apply also to other large families of computationally significant DAGs.