论文信息 - Scatter Scheduling for Problems with Unpredictable Structures

Scatter Scheduling for Problems with Unpredictable Structures

An extended scatter scheduling was applied to problems with unpredictable, asynchronous struc- tures. It has been found that with this simple schedul- ing strategy, good load balance can be reached with- out incurring much runtime overhead. This scheduling algorithm has been implemented on hypercube ma- chines, and its performance is compared with other scheduling strategies.

Min-You Wu | Wei Shu

[1] Wei Wennie Shu. Chare kernel and its implementation on multicomputers , 1990 .

[2] J. Salmon,et al. A mathematical analysis of the scattered decomposition , 1988, C3P.

[3] Min-You Wu,et al. A Dynamic Partitioning Strategy on Distributed Memory Systems , 1990, ICPP.

[4] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[5] Geoffrey C. Fox,et al. Solving problems on concurrent processors: vol. 2 , 1990 .

[6] Charles L. Seitz,et al. Multicomputers: message-passing concurrent computers , 1988, Computer.

[7] Daniel A. Reed,et al. Circuit-switched multicomputers and heuristic load placement , 1989 .

[8] William C. Athas,et al. Fine Grain Concurrent Computations , 1987 .

[9] M. Nicol,et al. AN ANALYSIS OF SCATTER DECOMPOSITION , 2022 .

[10] G. C. Fox,et al. Solving Problems on Concurrent Processors , 1988 .

[11] Laxmikant V. Kalé,et al. Chare Kernel - a Runtime Support System for Parallel Computations , 1991, J. Parallel Distributed Comput..

[12] Laxmikant V. Kalé,et al. A dynamic scheduling strategy for the Chare-Kernel system , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).