Near optimal algorithms for scheduling independent chains in BSP
暂无分享,去创建一个
[1] Torsten Suel,et al. BSPlib: The BSP programming library , 1998, Parallel Comput..
[2] Victor J. Rayward-Smith,et al. UET scheduling with unit interprocessor communication delays , 1987, Discret. Appl. Math..
[3] Jacques Verriet,et al. Scheduling tree-structured programs in the LogP model , 1997 .
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Leslie G. Valiant,et al. A bridging model for parallel computation , 1990, CACM.
[6] Denis Trystram,et al. Some Results On Scheduling Flat Trees In LogP Model , 1999 .
[7] David B. Skillicorn,et al. Questions and Answers about BSP , 1997, Sci. Program..
[8] Denis Trystram,et al. Exchange of Messages of Different Sizes , 1998, IRREGULAR.