Interprocessor communication with limited memory

Journal Article · Wed May 07 04:00:00 EDT 2003 · IEEE Transactions on Parallel and Distributed Systems

OSTI ID:834925

Pinar, Ali ^[1]; Hendrickson, Bruce

---

1. LBNL Library

Many parallel applications require periodic redistribution of workloads and associated data. In a distributed memory computer, this redistribution can be difficult if limited memory is available for receiving messages. We propose a model for optimizing the exchange of messages under such circumstances which we call the minimum phase remapping problem. We first show that the problem is NP-Complete, and then analyze several methodologies for addressing it. First, we show how the problem can be phrased as an instance of multi-commodity flow. Next, we study a continuous approximation to the problem. We show that this continuous approximation has a solution which requires at most two more phases than the optimal discrete solution, but the question of how to consistently obtain a good discrete solution from the continuous problem remains open. We also devise simple and practical approximation algorithm for the problem with a bound of 1.5 times the optimal number of phases. We also present an empirical study of variations of our algorithms which indicate that our approaches are quite practical.

• Research Organization: Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (US)
• Sponsoring Organization: USDOE Director. Office of Science. Office of Advanced Scientific Computing Research. Mathematical Information and Computational Sciences Division. Contract DE-AC03-76SF00098, Lockheed-Martin Company. Sandia Corporation. Contract DE-AC94AL85000, Applied Mathematical Sciences Program (US)
• DOE Contract Number: AC03-76SF00098
• OSTI ID: 834925
• Report Number(s): LBNL--51863
• Journal Information: IEEE Transactions on Parallel and Distributed Systems, Journal Name: IEEE Transactions on Parallel and Distributed Systems Journal Issue: 7 Vol. 15
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
COMMUNICATIONS
INTERPROCESSOR COMMUNICATION DYNAMIC LOAD BALANCING DATA MIGRATION SCHEDULING NP-COMPLETENESS APPROXIMATION ALGORITHMS
LAWRENCE BERKELEY LABORATORY