# Interprocessor communication with memory constraints

## Abstract

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. The authors propose a model for optimizing the exchange of messages under such circumstances which they call the minimum phase remapping problem. They first show that the problem is NP-Complete, and then analyze several methodologies for addressing it. First, they show how the problem can be phrased as an instance of multi-commodity flow. Next, they study a continuous approximation to the problem. They 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. Finally, they devise a simple and practical approximation algorithm for the problem with a bound of 1.5 times the optimal number of phases.

- Authors:

- Publication Date:

- Research Org.:
- Sandia National Labs., Albuquerque, NM (US); Sandia National Labs., Livermore, CA (US)

- Sponsoring Org.:
- US Department of Energy (US)

- OSTI Identifier:
- 756410

- Report Number(s):
- SAND2000-1361C

TRN: AH200022%%164

- DOE Contract Number:
- AC04-94AL85000

- Resource Type:
- Conference

- Resource Relation:
- Conference: Symposium on Parallel Algorithms and Architectures, Bar Harbor, ME (US), 07/10/2000; Other Information: PBD: 30 May 2000

- Country of Publication:
- United States

- Language:
- English

- Subject:
- 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; ALGORITHMS; PARALLEL PROCESSING; MEMORY MANAGEMENT; DISTRIBUTED DATA PROCESSING; COMMUNICATIONS

### Citation Formats

```
PINAR,ALI, and HENDRICKSON,BRUCE A.
```*Interprocessor communication with memory constraints*. United States: N. p., 2000.
Web.

```
PINAR,ALI, & HENDRICKSON,BRUCE A.
```*Interprocessor communication with memory constraints*. United States.

```
PINAR,ALI, and HENDRICKSON,BRUCE A. Tue .
"Interprocessor communication with memory constraints". United States. https://www.osti.gov/servlets/purl/756410.
```

```
@article{osti_756410,
```

title = {Interprocessor communication with memory constraints},

author = {PINAR,ALI and HENDRICKSON,BRUCE A.},

abstractNote = {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. The authors propose a model for optimizing the exchange of messages under such circumstances which they call the minimum phase remapping problem. They first show that the problem is NP-Complete, and then analyze several methodologies for addressing it. First, they show how the problem can be phrased as an instance of multi-commodity flow. Next, they study a continuous approximation to the problem. They 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. Finally, they devise a simple and practical approximation algorithm for the problem with a bound of 1.5 times the optimal number of phases.},

doi = {},

journal = {},

number = ,

volume = ,

place = {United States},

year = {2000},

month = {5}

}