Parallel algorithms for regular architectures - meshes and pyramids

Part 1 Overview: models of computation forms of input problems data movement operations sample algorithms further remarks. Part 2 Fundamental mesh algorithms: definitions lower bounds primitive mesh algorithms matrix algorithms algorithms involving ordered data further remarks. Part 3 Mesh algorithms for images and graphs: fundamental graph algorithms connected components internal distances convexity external distances further remarks. Part 4 Mesh algorithms for computational geometry: preliminaries the convex hull smallest enclosing figures nearest point problem line segments and simple polygons intersection of convex sets diameter iso-oriented rectangles and polygons voronoi diagram further remarks. Part 5 Tree-like pyramid algorithms: definitions lower bounds fundamental algorithms image algorithms further remarks. Part 6 Hybrid pyramid algorithms: graphs as unordered edges graphs as adjacency matrices digitized pictures convexity data movement operations optimality further remarks.

[1]  Azriel Rosenfeld,et al.  Digital Straight Lines and Convexity of Digital Regions , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  A. Habermann,et al.  Parallel Neighbor-Sort (or the Glory of the Induction Principle), , 1972 .

[3]  Marcel J. E. Golay,et al.  Hexagonal Parallel Pattern Transformations , 1969, IEEE Transactions on Computers.

[4]  Kenneth E. Batcher,et al.  Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.

[5]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6]  Mikhail J. Atallah,et al.  Solving tree problems on a mesh-connected processor array , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[7]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[8]  G. C. Fox,et al.  Optimal communication algorithms for regular decompositions on the hypercube , 1988, C3P.

[9]  Jorge L. C. Sanz,et al.  An EREW PRAM Algorithm for Image Component Labeling , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Ivan Havel,et al.  Embedding the polytomic tree into the $n$-cube , 1973 .

[11]  Jorge L. C. Sanz,et al.  Hypercube and Shuffle-Exchange Algorithms for Image Component Labeling , 1987, J. Algorithms.

[12]  Mikhail J. Atallah,et al.  Multisearch techniques for implementing data structures on a mesh-connected computer (preliminary version) , 1991, SPAA '91.

[13]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[14]  Mikhail J. Atallah,et al.  Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers , 1994, J. Parallel Distributed Comput..

[15]  Kai Hwang,et al.  Integrated Computer Architectures for Image Processing and Database Management , 1983, Computer.

[16]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

[17]  Jesse M. Gordon.  Analysis of Minimal Path Routing Schemes in the Presence of Faults , 1992, Discret. Appl. Math..

[18]  Frank Dehne.  Parallel computational geometry and clustering methods , 1986 .

[19]  Arnold W. M. Smeulders,et al.  Discrete Representation of Straight Lines , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Francis Y. L. Chin,et al.  Efficient parallel algorithms for some graph problems , 1982, CACM.

[21]  Reinhard Klette,et al.  Shortest Path Algorithms for Graphs of Restricted In-Degree and Out-Degree , 1982, J. Inf. Process. Cybern..

[22]  W. Morven Gentleman,et al.  Some Complexity Results for Matrix Computations on Parallel Processors , 1978, JACM.

[23]  Stefano Levialdi,et al.  Computer Architectures for Pictorial Information Systems , 1981, Computer.

[24]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[25]  Ming-Syan Chen,et al.  Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors , 1990, IEEE Trans. Computers.

[26]  Renato Stefanelli,et al.  PAPIA: Pyramidal architecture for parallel image analysis , 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).

[27]  V. Benes.  Optimal rearrangeable multistage connecting networks , 1964 .

[28]  Evan Reid Cohn.  Implementing the Multiprefix Operation Efficiently , 1990, J. Parallel Distributed Comput..

[29]  Chul E. Kim.  On the Cellular Convexity of Complexes , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[30]  Susanne E. Hambrusch,et al.  Solving Undirected Graph Problems on VLSI , 1985, SIAM J. Comput..

[31]  Stephen B. Gray,et al.  Local Properties of Binary Images in Two Dimensions , 1971, IEEE Transactions on Computers.

[32]  I. Havel,et al.  $B$-valuations of graphs , 1972 .

[33]  Charles R. Dyer.  Memory-Augmented Cellular Automata for Image Analysis. , 1978 .

[34]  D. M. Watson,et al.  The Cellular Logic Array Image Processor , 1977, Comput. J..

[35]  Mikhail J. Atallah,et al.  Efficient Parallel Solutions to Some Geometric Problems , 1986, J. Parallel Distributed Comput..

[36]  John P. Hayes,et al.  A Microprocessor-based Hypercube Supercomputer , 1986, IEEE Micro.

[37]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[38]  S. Lakshmivarahan,et al.  Parallel Sorting Algorithms , 1984, Adv. Comput..

[39]  L. Johnsson,et al.  Optimal algorithms for stable dimension permutations on Boolean cubes , 1988, C3P.

[40]  Mikhail J. Atallah,et al.  Graph Problems on a Mesh-Connected Processor Array , 1984, JACM.

[41]  Arnold L. Rosenberg,et al.  Efficient Embeddings of Trees in Hypercubes* , 2022 .

[42]  S. Lennart Johnsson,et al.  Distributed Routing Algorithms for Broadcasting and Personalized Communication in Hypercubes , 1986, ICPP.

[43]  Martin A. Fischler.  Fast algorithms for two maximal distance problems with applications to image analysis , 1980, Pattern Recognit..

[44]  Chul E. Kim,et al.  Three-Dimensional Digital Line Segments , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[45]  Bruce W. Weide,et al.  Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.

[46]  Ilse C. F. Ipsen,et al.  How to Embed Trees in Hypercubes. , 1985 .

[47]  Richard M. Brown,et al.  The ILLIAC IV Computer , 1968, IEEE Transactions on Computers.

[48]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[49]  Mee Yee Chan.  Embedding of Grids into Optimal Hypercubes , 1991, SIAM J. Comput..

[50]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[51]  H. T. Kung,et al.  Matrix Triangularization By Systolic Arrays , 1982, Optics & Photonics.

[52]  Azriel Rosenfeld,et al.  Parallel Image Processing by Memory-Augmented Cellular Automata , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[53]  Herbert Freeman,et al.  Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.

[54]  Bernard Chazelle.  Computational Geometry on a Systolic Chip , 1984, IEEE Transactions on Computers.

[55]  George Papageorgiou,et al.  The Complexity of Cubical Graphs , 1985, Inf. Control..

[56]  Magdy Gaafar.  Convexity Verification, Block-Chords, and Digital Straight Lines , 1977 .

[57]  Chul E. Kim,et al.  Digital Convexity, Straightness, and Convex Polygons , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[58]  C. Dyer.  Computing the Euler number of an image from its quadtree , 1980 .

[59]  C. Greg Plaxton,et al.  Deterministic sorting in nearly logarithmic time on the hypercube and related computers , 1990, Symposium on the Theory of Computing.

[60]  Davis Avis,et al.  On the complexity of finding the convex hull of a set of points , 1982, Discret. Appl. Math..

[61]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[62]  Narendra Ahuja,et al.  Multiprocessor Pyramid Architectures for Bottom-Up Image Analysis , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[63]  Ming-Deh A. Huang.  Solving some graph problems with optimal or near-optimal speedup on mesh-of-trees networks , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[64]  W. Beyer.  RECOGNITION OF TOPOLOGICAL INVARIANTS BY ITERATIVE ARRAYS , 1969 .

[65]  John L. Gustafson,et al.  The Architecture of a Homogeneous Vector Supercomputer , 1986, J. Parallel Distributed Comput..

[66]  Selim G. Akl,et al.  Parallel computational geometry , 1992 .

[67]  Cauligi S. Raghavendra,et al.  Optimal Self-Routing of Linear-Complement Permutations in Hypercubes , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..

[68]  Frank Dehne,et al.  O(n^(1/2)) Algorithms for the Maximal Elements and ECDF Searching Problem on a Mesh-Connected Parallel Computer , 1986, Inf. Process. Lett..

[69]  Susanne E. Hambrusch.  VLSI Algorithms for the Connected Component Problem , 1983, SIAM J. Comput..

[70]  Lennart Johnsson,et al.  Combining Parallel and Sequential Sorting on a Boolean n–cube , 1984 .

[71]  Dilip V. Sarwate,et al.  Computing connected components on parallel computers , 1979, CACM.

[72]  Andrew Rau-Chaplin,et al.  Scalable parallel computational geometry for coarse grained multicomputers , 1996, Int. J. Comput. Geom. Appl..

[73]  Frans C. A. Groen,et al.  The smallest box around a package , 1981, Pattern Recognit..

[74]  Azriel Rosenfeld,et al.  Parallel Region Property Computation by Active Quadtree Networks , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.