# Locality in parallel computation. Master's thesis

## Abstract

This thesis explores strategies for exploiting locality in three major areas of parallel computation: packet routing, graph algorithms, and network emulations. Chapter 1 describes a network-independent approach to the packet-routing problem. Our strategy is to partition the problem into two stages: a path-selection stage and a scheduling stage. Chapter 2 introduces a model for parallel computation, called the distribution random-access machine (DRAM), in which the communication requirements of parallel computer in which memory accesses are evaluated. A DRAM is an abstraction of a parallel computer in which memory accesses are implemented by routing messages through a communication network. Chapter 3 examines the problem of how efficiently a host network can emulate a guest network. The goal is to emulate TG steps of an NG-node guest network on an NH node host network. Chapter 4 presents an algorithm for finding a minimum-cost spanning tree of an N-node graph on an N x N mesh-connected computer. The algorithm has the same O(N) running time as the previous algorithms, but it is much simpler.

- Authors:

- Publication Date:

- Research Org.:
- Massachusetts Inst. of Tech., Cambridge, MA (USA). Lab. for Computer Science

- OSTI Identifier:
- 6999295

- Report Number(s):
- AD-A-218733/4/XAB; MIT/LCS/TR-469

- Resource Type:
- Technical Report

- Resource Relation:
- Other Information: Thesis

- Country of Publication:
- United States

- Language:
- English

- Subject:
- 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; PARALLEL PROCESSING; LOCALITY; ALGORITHMS; COMMUNICATIONS; COMPUTERS; DISTRIBUTED DATA PROCESSING; DISTRIBUTION; GRAPHS; MEMORY DEVICES; ROUTING; SPECIFICATIONS; DATA PROCESSING; MATHEMATICAL LOGIC; PROCESSING; PROGRAMMING; 990200* - Mathematics & Computers

### Citation Formats

```
Maggs, B M.
```*Locality in parallel computation. Master's thesis*. United States: N. p., 1989.
Web.

```
Maggs, B M.
```*Locality in parallel computation. Master's thesis*. United States.

```
Maggs, B M. Fri .
"Locality in parallel computation. Master's thesis". United States.
```

```
@article{osti_6999295,
```

title = {Locality in parallel computation. Master's thesis},

author = {Maggs, B M},

abstractNote = {This thesis explores strategies for exploiting locality in three major areas of parallel computation: packet routing, graph algorithms, and network emulations. Chapter 1 describes a network-independent approach to the packet-routing problem. Our strategy is to partition the problem into two stages: a path-selection stage and a scheduling stage. Chapter 2 introduces a model for parallel computation, called the distribution random-access machine (DRAM), in which the communication requirements of parallel computer in which memory accesses are evaluated. A DRAM is an abstraction of a parallel computer in which memory accesses are implemented by routing messages through a communication network. Chapter 3 examines the problem of how efficiently a host network can emulate a guest network. The goal is to emulate TG steps of an NG-node guest network on an NH node host network. Chapter 4 presents an algorithm for finding a minimum-cost spanning tree of an N-node graph on an N x N mesh-connected computer. The algorithm has the same O(N) running time as the previous algorithms, but it is much simpler.},

doi = {},

url = {https://www.osti.gov/biblio/6999295},
journal = {},

number = ,

volume = ,

place = {United States},

year = {1989},

month = {9}

}