Time-Space Optimal Parallel Computation
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.
KeywordsParallel Algorithm Extra Space Local Select Displacement Computing EREW Pram
Unable to display preview. Download preview PDF.
- K. E. Batcher, ‘Sorting Networks and their Application’, Proceedings, AFIPS 1968 Spring Joint Computer Conference (1968), pp. 307–314.Google Scholar
- 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
- 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
- D. E. Knuth, ‘The Art of Computer Programming, Vol. 3: Sorting and Searching’, Addison-Wesley, Reading, MA, 1973.Google Scholar