Improving communication scheduling for array redistribution
Authors:
- Minyi GuoMGMinyi Guo
- Yi PanYPYi Pan
- 1 May 2005
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 65 (5) , 553-563
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- A scalable HPF implementation of a finite-volume computational electromagnetics application on a CRAY T3E parallel systemConcurrency and Computation: Practice and Experience, 2003
- A generalized processor mapping technique for array redistributionIEEE Transactions on Parallel and Distributed Systems, 2001
- A generalized basic-cycle calculation method for efficient array redistributionIEEE Transactions on Parallel and Distributed Systems, 2000
- Efficient algorithms for block-cyclic array redistribution between processor setsIEEE Transactions on Parallel and Distributed Systems, 1999
- A basic-cycle calculation technique for efficient dynamic data redistributionIEEE Transactions on Parallel and Distributed Systems, 1998
- Scheduling block-cyclic array redistributionIEEE Transactions on Parallel and Distributed Systems, 1998
- Automatic selection of dynamic data partitioning schemes for distributed-memory multicomputers1996
- Processor mapping techniques toward efficient data redistributionIEEE Transactions on Parallel and Distributed Systems, 1995
- Unicast-based multicast communication in wormhole-routed networksIEEE Transactions on Parallel and Distributed Systems, 1994
- Static and run-time algorithms for all-to-many personalized communication on permutation networksIEEE Transactions on Parallel and Distributed Systems, 1994