Time-Space Optimal Parallel Computation

  • Michael A. Langston
Part of the The Springer International Series In Engineering and Computer Science book series (SECS, volume 231)


The development of parallel file rearrangement algorithms that simultaneously optimize both time and space is surveyed. The classic problem of merging two sorted lists is used to illustrate fundamental techniques. Recent implementations on real parallel machines are also discussed. A primary aim of this research is to help narrow the gap between the theory and practice of parallel computing.


Parallel Algorithm Extra Space Local Select Displacement Computing EREW Pram 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. G. Akl, ‘Parallel Sorting Algorithms’, Academic Press, Orlando, FL, 1985.MATHGoogle Scholar
  2. [2]
    S. G. Akl and N. Santoro, ‘Optimal Parallel Merging and Sorting Without Memory Conflicts’, IEEE Transactions on Computers 36 (1987), pp. 1367–1369.CrossRefMathSciNetGoogle Scholar
  3. [3]
    K. E. Batcher, ‘Sorting Networks and their Application’, Proceedings, AFIPS 1968 Spring Joint Computer Conference (1968), pp. 307–314.Google Scholar
  4. [4]
    P. Banerjee and K. P. Belkhale, ‘Parallel Algorithms for Geometric Connected Component Labeling Problems on a Hypercube’, Technical Report, Coordinated Science Laboratory, University of Illinois, Urbana, IL, 1988.Google Scholar
  5. [5]
    G. Baudet and D. Stevenson, ‘Optimal Sorting Algorithms for Parallel Computers’, IEEE Transactions on Computers 27 (1978), pp. 84–87.MATHMathSciNetGoogle Scholar
  6. [6]
    D. Bitton, D. J. Dewitt, D. K. Hsiao and J. Menon, ‘A Taxonomy of Parallel Sorting’, Computing Surveys 16 (1984), pp. 287–318.MATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    A. Borodin and J. E. Hopcroft, ‘Routing, Merging and Sorting on Parallel Models of Computation’, Journal of Computer and System Sciences 30 (1985), pp. 130–145.MATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    C. P. Breshears and M. A. Langston, ‘MIMD versus SIMD Computation: Experience with Non-Numeric Parallel Algorithms’, in Proc. Twenty-Sixth Annual Hawaii International Conference on System Sciences, Vol. II: Software Technology, H. El-Rewini, T. Lewis, and B. D. Shriver (editors), 1993, pp. 298–307.Google Scholar
  9. [9]
    R. Cole, ‘Parallel Merge Sort’, SIAM Journal on Computing 17 (1988), pp. 770–785.MATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    X. Guan and M. A. Langston, ‘Time-Space Optimal Parallel Merging and Sorting’, IEEE Transactions on Computers 40 (1991), pp. 596–602.CrossRefMathSciNetGoogle Scholar
  11. [11]
    X. Guan and M. A. Langston, ‘Parallel Methods for Solving Fundamental File Rearrangement Problems’, Journal of Parallel and Distributed Computing 14, (1992), pp. 436–439.MATHCrossRefGoogle Scholar
  12. [12]
    B-C Huang and M. A. Langston, ‘Practical In-Place Merging’, Communications of the ACM 31 (1988), pp. 348–352.CrossRefGoogle Scholar
  13. [13]
    B-C Huang and M. A. Langston, ‘Stable Duplicate-Key Extraction with Optimal Time and Space Bounds’, Acta Informatica 26 (1989), pp. 473–484.MATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    B-C Huang and M. A. Langston, ‘Stable Set and Multiset Operations in Optimal Time and Space’, Information Processing Letters 39 (1991), pp. 131–136.MATHCrossRefGoogle Scholar
  15. [15]
    D. E. Knuth, ‘The Art of Computer Programming, Vol. 3: Sorting and Searching’, Addison-Wesley, Reading, MA, 1973.Google Scholar
  16. [16]
    M. A. Kronrod, ‘An Optimal Ordering Algorithm without a Field of Operation’, Doklady Akademii Nauk SSSR 186 (1969), pp. 1256–1258.MathSciNetGoogle Scholar
  17. [17]
    C. P. Kruskal, ‘Searching, Merging and Sorting in Parallel Computation’, IEEE Transactions on Computers 32 (1983), pp. 942–946.MATHMathSciNetGoogle Scholar
  18. [18]
    S. Lakshmivarahan, S. K. Dhall, and L. L. Miller, ‘Parallel Sorting Algorithms’, Advances in Computers 23 (1984), pp. 295–354.MathSciNetGoogle Scholar
  19. [19]
    Y. Shiloach and U. Vishkin, ‘Finding the Maximum, Merging and Sorting in a Parallel Computation Model’, Journal of Algorithms 2 (1981), pp. 88–102.MATHCrossRefMathSciNetGoogle Scholar
  20. [20]
    J. D. Ullman, ‘Computational Aspects of VLSI’, Computer Science Press, Rockville, MD, 1984.MATHGoogle Scholar
  21. [21]
    L. G. Valiant, ‘Parallelism in Comparison Problems’, SIAM Journal on Computing 4 (1975), pp. 349–355.CrossRefMathSciNetGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1993

Authors and Affiliations

  • Michael A. Langston
    • 1
  1. 1.Department of Computer ScienceUniversity of TennesseeKnoxvilleUSA

Personalised recommendations