Name
Abstract | ||
|---|---|---|
We present a mathematical model of parallel computing in a hypercubical parallel computer. This is based on embedding binary trees or forests into the n -dimensional hypercube. We consider three different models corresponding to three different computing situations. First we assume that the processing time at each level of the binary tree is arbitrary, and develop the corresponding mathematical model of an embedding of a binary tree into the hypercube. Then we assume that the processing time at each level of the binary tree is the same for all processors involved at that level, and for this we develop the mathematical model of a loop embedding of a binary tree into the hypercube. The most general case is that in which only certain neighboring levels are active. Here we assume for simplicity that only the processors corresponding to two neighboring levels are active at the same time, and correspondingly we develop the mathematical model of a level embedding of a binary tree into the hypercube to cover this case. Both loop embeddings and level embeddings allow us to use the same processor several times during the execution of a program. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1016/0743-7315(89)90013-0 | J. Parallel Distrib. Comput. |
Keywords | Field | DocType |
binary tree,parallel computer,mathematical model,parallel processing | Computer science,K-ary tree,Threaded binary tree,Self-balancing binary search tree,Parallel computing,Optimal binary search tree,Binary tree,Theoretical computer science,Random binary tree,Binary expression tree,Distributed computing,Interval tree | Journal |
Volume | Issue | ISSN |
6 | 3 | Journal of Parallel and Distributed Computing |
Citations | PageRank | References |
3 | 0.45 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Bier | 1 | 11 | 4.92 |
| Kia-Fock Loe | 2 | 180 | 20.88 |