The Design of Efficient Parallel Algorithms

This chapter serves as an introduction to the study of parallel algorithms, in particular how they differ from conventional algorithms, how they are designed, and how they are analyzed to evaluate their speed and cost.

[1]  Charles L. Seitz,et al.  Concurrent VLSI Architectures , 1984, IEEE Transactions on Computers.

[2]  Sartaj Sahni,et al.  Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..

[3]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[4]  Selim G. Akl,et al.  On Some Properties and Algorithms for the Star and Pancake Interconnection Networks , 1994, J. Parallel Distributed Comput..

[5]  Richard Cole,et al.  Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time , 1988, SIAM J. Comput..

[6]  Arun K. Somani,et al.  An Efficient Sorting Algorithm for the Star Graph Interconnection Network , 1990, ICPP.

[7]  Laxmi N. Bhuyan.  Guest Editor's Introduction Interconnection Networks for Parallel and Distributed Processing , 1987, Computer.

[8]  P. Fragopoulou,et al.  A framework for optimal communication on a subclass of the Cayley graph based networks , 1995, Proceedings International Phoenix Conference on Computers and Communications.

[9]  Ivan Stojmenovic,et al.  Solving city block metric and digital geometry problems on the BSR model of parallel computation , 1993, Other Conferences.

[10]  Ketan Mulmuley,et al.  Computational geometry : an introduction through randomized algorithms , 1993 .

[11]  Selim G. Akl,et al.  Broadcasting with Selective Reduction , 1989, IFIP Congress.

[12]  Selim G. Akl,et al.  Decomposing a Star Graph Into Disjoint Cycles , 1991, Inf. Process. Lett..

[13]  Selim G. Akl,et al.  A Novel Routing Scheme on the Star and Pancake Networks and its Applications , 1993, Parallel Comput..

[14]  Selim G. Akl,et al.  Communication and fault tolerance algorithms on a class of interconnection networks , 1995 .

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

[16]  Selim G. Akl,et al.  Load Balancing, Selection and Sorting on the Star and Pancake Interconnection Networks , 1994, Parallel Algorithms Appl..

[17]  Selim G. Akl,et al.  Efficient algorithms for global data communication on the multidimensional torus network , 1995, Proceedings of 9th International Parallel Processing Symposium.

[18]  Stephan Olariu,et al.  A Simple Optimal Parallel Algorithm to Solve the Lowest Common Ancestor Problem , 1991, ICCI.

[19]  Sartaj Sahni,et al.  Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs , 1990, ICPP.

[20]  Sanguthevar Rajasekaran,et al.  Selection, Routing, and Sorting on the Star Graph , 1997, J. Parallel Distributed Comput..

[21]  Selim G. Akl,et al.  Paradigms Admitting Superunitary Behaviour in Parallel Computation , 1994, Parallel Algorithms Appl..

[22]  Selim G. Akl,et al.  Broadcasting with selective reduction on an optimal PRAM circuit , 1991 .

[23]  Ivan Stojmenovic,et al.  Multiple criteria BSR: an implementation and applications to computational geometry problems , 1994, 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences.

[24]  S. Lakshmivarahan,et al.  Parallel computing using the prefix problem , 1994 .

[25]  David Eppstein,et al.  Parallel Algorithmic Techniques for Combinatorial Computation , 1988, ICALP.

[26]  Quentin F. Stout,et al.  Mesh-Connected Computers with Broadcasting , 1983, IEEE Transactions on Computers.

[27]  Fabrizio Luccio,et al.  Three non Conventional Paradigms of Parallel Computation , 1992, Heinz Nixdorf Symposium.

[28]  Selim G. Akl,et al.  On Some Properties of the Star Graph , 1995, VLSI Design.

[29]  Pradip K. Srimani,et al.  A Fault-Tolerant Routing Algorithm for Star Graph Interconnection Network , 1991, ICPP.

[30]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[31]  Norishige Chiba,et al.  The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs , 1989, J. Algorithms.

[32]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[33]  Lorrie Fava Lindon.  Discriminating Analysis and Ist Application to Matrix by Vector Multiplication on the Pram , 1992, Parallel Process. Lett..

[34]  John H. Reif,et al.  Synthesis of Parallel Algorithms , 1993 .

[35]  Guy E. Blelloch,et al.  Vector Models for Data-Parallel Computing , 1990 .

[36]  Manfred Kunde.  Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers , 1987, STACS.

[37]  Wei-Kuo Chiang,et al.  The (n, k)-Star Graph: A Generalized Star Graph , 1995, Inf. Process. Lett..

[38]  Alok Aggarwal.  Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses , 1986, IEEE Transactions on Computers.

[39]  Richard Cole,et al.  Approximate and exact parallel scheduling with applications to list, tree and graph problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[40]  Selim G. Akl,et al.  Efficient Parallel Algorithms on Proper Circular Arc Graphs , 1995, PDPTA.

[41]  Albert Y. Zomaya.  Parallel and Distributed Computing Handbook , 1995 .

[42]  Selim G. Akl,et al.  Computation and communication aspects of arrays with optical pipelined buses , 1997 .

[43]  Stephan Olariu,et al.  A Unifying Look at Semigroup Computations on Meshes with Multiple Broadcasting , 1993, Parallel Process. Lett..

[44]  Richard Cole,et al.  Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..

[45]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[46]  Selim G. Akl,et al.  Matrix Operations Using Arrays with Reconfigurable Optical Buses* , 1996, Parallel Algorithms Appl..

[47]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[48]  Richard Cole,et al.  Faster Optimal Parallel Prefix Sums and List Ranking , 2011, Inf. Comput..

[49]  Richard M. Karp,et al.  A Survey of Parallel Algorithms for Shared-Memory Machines , 1988 .

[50]  Hussein M. Alnuweiri.  Constant-Time Parallel Algorithms for Image Labeling on a Reconfigurable Network of Processors , 1994, IEEE Trans. Parallel Distributed Syst..

[51]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[52]  Selim G. Akl,et al.  A Case Study in Real-Time Parallel Computation: Correcting Algorithms , 2001, J. Parallel Distributed Comput..

[53]  Selim G. Akl,et al.  A Parallel Algorithm for Computing Fourier Transforms on the Star Graph , 1994, IEEE Trans. Parallel Distributed Syst..

[54]  Kang G. Shin,et al.  Implementation of Decentralized Load Sharing in Networked Workstations Using the Condor Package , 1997, J. Parallel Distributed Comput..

[55]  Selim G. Akl,et al.  Efficient sorting on the star graph interconnection network , 1998, Telecommun. Syst..

[56]  Uzi Vishkin,et al.  A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer , 2011, Theor. Comput. Sci..

[57]  Selim G. Akl,et al.  The Characterization of Data-Accumulating Algorithms , 2000, Theory of Computing Systems.

[58]  L. Kronsjö,et al.  Advances in parallel algorithms , 1992 .

[59]  Yijie Han,et al.  : Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem , 1986, ICPP.

[60]  Selim G. Akl,et al.  Efficient algorithms for the Hough transform on arrays with reconfigurable optical buses , 1996, Proceedings of International Conference on Parallel Processing.

[61]  Jang-Ping Sheu,et al.  Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting , 1990, IEEE Trans. Parallel Distributed Syst..

[62]  Selim G. Akl,et al.  Parallel Routing and Sorting of the Pancake Network , 1991, ICCI.

[63]  Selim G. Akl,et al.  Optimal Communication Primitives on the Generalized Hypercube Network , 1996, J. Parallel Distributed Comput..

[64]  David G. Kirkpatrick,et al.  A Simple Parallel Tree Contraction Algorithm , 1989, J. Algorithms.

[65]  Sajal K. Das,et al.  Parallel graph algorithms for hypercube computers , 1990, Parallel Comput..

[66]  S. Lakshmivarahan,et al.  Embedding of cycles and grids in star graphs , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[67]  Selim G. Akl,et al.  Optimal Communication algorithms on Star Graphs Using Spanning Tree Constructions , 1995, J. Parallel Distributed Comput..

[68]  Ivan Stojmenovic,et al.  Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals , 1996, IEEE Trans. Parallel Distributed Syst..

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

[70]  Larry Rudolph,et al.  The power of parallel prefix , 1985, IEEE Transactions on Computers.

[71]  Yosi Ben-Asher,et al.  Ranking on Reconfigurable Networks , 1991, Parallel Process. Lett..

[72]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

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

[74]  Selim G. Akl,et al.  Fault tolerant communication algorithms on the star network using disjoint paths , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.

[75]  Selim G. Akl,et al.  Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance , 1996, IEEE Trans. Computers.

[76]  Selim G. Akl,et al.  Paradigms Admitting Superunitary Behaviour in Parallel Computation , 1997, Parallel Algorithms Appl..

[77]  Ivan Stojmenovic,et al.  Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry , 1993, Networks.

[78]  Leonidas J. Guibas,et al.  Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[79]  Selim G. Akl,et al.  An Optimal Implementation of Broadcasting with Selective Reduction , 1993, IEEE Trans. Parallel Distributed Syst..

[80]  Ivan Stojmenovic,et al.  Computing External Watchman Routes on Pram, BSR, and Interconnection Network Models of Parallel Computation , 1994, Parallel Process. Lett..

[81]  Lorrie Fava Lindon.  Synergy in parallel computation , 1996 .

[82]  Rami G. Melhem,et al.  Using Coincident Optical Pulses for Parallel Memory Addressing , 1987, Computer.

[83]  Selim G. Akl,et al.  A Unified Approach to Parallel Depth-First Traversals of General Trees , 1991, Inf. Process. Lett..

[84]  Adi Shamir,et al.  Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks , 1986, ICPP.

[85]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[86]  Selim G. Akl,et al.  on the Power of Arrays with Optical Pipeline Buses , 1996, PDPTA.

[87]  Uzi Vishkin,et al.  On Efficient Parallel Strong Orientation , 1985, Inf. Process. Lett..

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

[89]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[90]  Sartaj Sahni,et al.  Sorting n Numbers on n x n Reconfigurable Meshes with Buses , 1994, J. Parallel Distributed Comput..

[91]  Selim G. Akl,et al.  Parallel Sorting Algorithms , 1985 .

[92]  Lin Chen.  Optimal Bucket Sorting and Overlap Representations , 1997, Parallel Algorithms Appl..

[93]  Kazuo Ushijima,et al.  ANSV Problem on BSRs , 1998, Inf. Process. Lett..

[94]  Fabrizio Luccio,et al.  The p-shovelers problem: (computing with time-varying data) , 1992, SIGA.

[95]  Richard Cole,et al.  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.

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

[97]  G. C. Fox,et al.  Solving Problems on Concurrent Processors , 1988 .

[98]  S Pavel,et al.  Area-time trade-offs in arrays with optical pipelined buses. , 1996, Applied optics.

[99]  Selim G. Akl,et al.  Parallel Real-Time Optimization: Beyond Speedup , 1999, Parallel Process. Lett..

[100]  Marc Snir,et al.  Depth-Size Trade-Offs for Parallel Prefix Computation , 1986, J. Algorithms.

[101]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[102]  Greg Wilson,et al.  Past, Present, Parallel , 1991, Springer London.

[103]  James Christopher Wyllie,et al.  The Complexity of Parallel Computations , 1979 .

[104]  Shahid H. Bokhari,et al.  Finding Maximum on an Array Processor with a Global Bus , 1984, IEEE Transactions on Computers.

[105]  Ivan Hal Sudborough,et al.  Three disjoint path paradigms in star networks , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[106]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

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

[108]  Ke Qiu.  The star and pancake interconnection networks: properties and algorithms , 1992 .

[109]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[110]  Limin Xiang.  Kazuo Ushijima: Decoding and Drawing on BSR for a Binary Tree from Its i-p Sequence , 1999, Parallel Process. Lett..

[111]  Michael E. Saks,et al.  The balanced sorting network , 1983, PODC '83.

[112]  Selim G. Akl,et al.  Application of Broadcasting with Selective Reduction to the Maximal Sum Subsegment Problem , 1991, Int. J. High Speed Comput..