Optimal dynamic scheduling of task tree on constant-dimensional architectures
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Cilk: an efficient multithreaded runtime system
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
ICS '96 Proceedings of the 10th international conference on Supercomputing
Network-Based Multicomputers: A Practical Supercomputer Architecture
IEEE Transactions on Parallel and Distributed Systems
Competitive implementation of parallel programs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Scheduling multithreaded computations by work stealing
Journal of the ACM (JACM)
Efficient load balancing for wide-area divide-and-conquer applications
PPoPP '01 Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming
Deterministic parallel backtrack search
Theoretical Computer Science
A New Scheduling Algorithm for General Strict Multithreaded Computations
Proceedings of the 13th International Symposium on Distributed Computing
Asynchronous Random Polling Dynamic Load Balancing
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Programming environments for high-performance grid computing: the Albatross project
Future Generation Computer Systems - Grid computing: Towards a new computing infrastructure
Dynamic load balancing efficiently in a large-scale cluster
International Journal of High Performance Computing and Networking
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Extending globus toolkit Java WS core to support reliable grid messagisng service
DNCOCO'06 Proceedings of the 5th WSEAS international conference on Data networks, communications and computers
Dynamic workload balancing deques for branch and bound algorithms in the message passing interface
International Journal of High Performance Systems Architecture
Scheduling efficiently for irregular load distributions in a large-scale cluster
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
An efficient dynamic load-balancing algorithm in a large-scale cluster
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
| Hi-index | 0.00 |
The relationship between parallel computation cost and communication cost for performing divide-and-conquer (D&C) computations on a parallel system of p processors is studied. The parallel computation cost is the maximal number of the D&C nodes that any processor in the parallel system may expand, whereas the communication cost is the total number of cross nodes (nodes generated by one processor but expanded by another processor). A scheduling algorithm is proposed, and lower bounds on the communication cost are derived. The proposed scheduling algorithm is optimal with respect to the communication cost, since the parallel computation cost of the algorithm is near optimal.