Parallel divide and conquer on meshes

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 10, 1996, Pages 1049-1058

  Lo, Virginia ^a,e   Rajopadhye, Sanjay ^b,e   Telle, Jan Arne ^c   Zhong, Xiaoxiong ^d  

^a UNIVERSITY OF OREGON   (United States)

^b CAMPUS DE BEAULIEU   (France)

^c UNIVERSITY OF BERGEN   (Norway)

^d HEWLETT PACKARD ENTERPRISE   (United States)

^e IEEE

Author keywords

Binomial tree; Contention; Dilation; Divide and conquer algorithms; Embedding; Mapping; Mesh connected machines; Routing; Store and forward routing; Wormhole routing

Indexed keywords

ALGEBRA; CALCULATIONS; GRAPH THEORY; LARGE SCALE SYSTEMS; MATHEMATICAL TECHNIQUES; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; PROGRAMMING THEORY; TOPOLOGY; TREES (MATHEMATICS);

BINOMIAL TREE; CONTENTION; DILATION; DIVIDE AND CONQUER ALGORITHM; EMBEDDING; MESH CONNECTED MACHINE; STORE AND FORWARD ROUTING; WORMHOLE ROUTING;

PARALLEL ALGORITHMS;

EID: 0030262784     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.539736     Document Type: Article

References (18)

1. A. Agarwal, "Limits on Network Performance," MIT VLSI memo, 1990.
2. W.C. Athas and C.L. Seitz, "Multicomputers: Message-Passing Concurrent Computers," Computer, pp. 9-23, Aug. 1988.
3. G.E. Blelloch, Vector Models for Data-Parallel Computing. MIT Press, 1990.
4. S.H. Bokhari, Assignment Problems in Parallel and Distributed Computting. Kluwer Academic Publishers, 1987.
5. S.H. Bokhari, "Communication Overhead on the Intel iPSC-860 Hypercube," technical report, ICASE, NASA Langley Research Center, May 1990.
6. S.S. Chittor, "Communication Performance of Multicomputers," PhD thesis, Dept. of Computer Science, Michigan State Univ., 1991.
7. M.I. Cole, "Algorithmic Skeletons: Structure Management of Parallel Computation," Research Monographs in Parallel and Distributed Computing. MIT Press, 1989.
8. W.J. Dally, "Performance Analysis of k-ary n-cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1990.
9. T.H. Dunigan, "Performance of the Intel iPSC/860 and Ncube 6400 Hypercubes," Parallel Computing, vol. 17, pp. 1,285-1,302, 1991.
10. C.L. Seitz et al., "The Performance and Programming of the Ametek Series 2010 Multicomputer," Proc. Hypercube Computer Conf., pp. 33-36, 1988.
11. S.L. Johnson, "Communication in Network Architectures," VLSI and Parallel Computation, p. 290, Morgan Kaufmann, 1990.
12. P. Kermani and L. Kleinrock, "Virtual Cut-Through: A New Computer Communication Switching Technique," Computer Networks, vol. 3, pp. 267-286, 1979.
13. Z.G. Mou and P. Hudak, "An Algebraic Model for Divide-and-Conquer Algorithms and its Parallelism," J. Supercomputing, vol. 2, no. 3, pp. 257-278, Nov. 1988.
14. P.A. Nelson and L. Snyder, "Programming Paradigms for Non-shared Memory Parallel Computers," The Characteristics of Parallel Algorithms, pp. 3-20, MIT Press, 1987.
15. A.L. Rosenberg, "Graph Embeddings 1988: Recent Breakthroughs New Directions," Technical Report No. 88-28, Univ. of Massachusetts at Amherst, Mar. 1988.
16. H.S. Stone, "Multiprocessor Scheduling with the Aid of Network Flow Algorithms," IEEE Trans. Software Engineering, vol. 3, no. 1, pp. 85-93, Jan. 1977.
17. J.D. Ullman, Computation Aspects of VLSI. Rockville, Md.: Computer Science Press, 1984.
18. J. Vuillemin, "A Data Structure for Manipulating Priority Queues," Comm. ACM, vol. 21, no. 4, pp. 309-315, Apr. 1987.