Multiway merging in parallel

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 1, 1996, Pages 11-17

  Wen, Zhaofang ^a,b  

^a IEEE

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

Analysis of algorithms; Databases; Information retrieval; Merging; Parallel computation; Processors assignment; Sorting

Indexed keywords

DATABASE SYSTEMS; INFORMATION RETRIEVAL; MERGING; OPTIMIZATION; PARALLEL ALGORITHMS; RANDOM ACCESS STORAGE; SORTING;

MULTIWAY MERGING; PARALLEL RANDOM ACCESS MACHINE; PROCESSORS ASSIGNMENT;

PARALLEL PROCESSING SYSTEMS;

EID: 0029732236     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.481593     Document Type: Article

References (16)

1. M. Ajtai, J. Komlos, W.L. Steiger, and E. Szemeredi, "An O(n log n) sorting network," Proc. Ann. ACM Symp. Theory of Computing, pp. 1-9, 1983.
2. S.G. Akl, The Design and Analysis of Parallel Algorithms. Englewood Cliffs, N.J.: Prentice Hall, 1989.
3. S.G. Akl and N. Santoro, "Optimal parallel merging and sorting without memory conflict," IEEE Trans. Computers, vol. 36, no. 11, pp. 1,367-1,369, 1987.
4. K.E. Batcher, "Sorting networks and their applications," Proc. AFIPS Spring Joint Computer Conf. 32, pp. 307-314, 1968.
5. D. Bitton, D.J. Dewitt, D.K. Hsiao, and J. Menon, "A taxonomy of parallel sorting," ACM Computing Surveys, vol. 16, pp. 287-318, 1984.
6. A. Borodin and J.E. Hopcroft, "Routing, merging and sorting on parallel models of comparison," J. Computer and System Science, vol. 30, pp. 130-145, 1985.
7. R. Cole, "Parallel merge sort," SIAM J. Computing, vol. 17, no. 4, pp. 770-785, Aug. 1988.
8. R. Cole and U. Vishkin, "Approximate parallel scheduling, part 1: The basic technique with applications to optimal parallel list ranking in logarithmic time," SIAM J. Computing, vol. 17, no. 1, pp. 128-142, 1988.
9. E. Dekel and I. Ozsvath, "Parallel external sorting," J. Parallel and Distributed Computing, vol. 6, pp. 623-635, 1989.
10. J.Y. Fu and F.C. Lin, "Optimal parallel external merging under hardware constraints," Proc. 1991 Int'l Conf. Parallel Processing, pp. III70-III74, 1991.
11. T. Hagerup and C. Rub, "Optimal merging and sorting on the EREW PRAM," Information Processing Letters, vol. 33, pp. 181-185, 1989.
12. D.E. Knuth, The Art of Computer Programming, Vol. 1, Fundamental Algorithms, second edition. Reading, Mass.: Addison-Wesley, 1973.
13. G. Salton, Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Reading, Mass.: Addison-Wesley, 1988.
14. Y. Shiloach and U. Vishkin, "Finding the maximum, merging and sorting in a parallel computation," J. Algorithms, vol. 2, pp. 88-102, 1981.
15. P. Valduriez and G. Gardarin, "Join and semijoin algorithms for multiprocessors database machines," ACM Trans. Database Systems, vol. 9, no. 1, pp. 133-161, 1984.
16. P.J. Varman, S.D. Scheufler, B.R. Iyer, and G.R. Ricard, "Merging multiple lists on hierarchical-memory multiprocessors," J. Parallel and Distributed Computing, vol. 12, pp. 171-177, 1991.