
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Zhaofang Wen, "Multiway Merging in Parallel," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 1, pp. 1117, January, 1996.  
BibTex  x  
@article{ 10.1109/71.481593, author = {Zhaofang Wen}, title = {Multiway Merging in Parallel}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {1}, issn = {10459219}, year = {1996}, pages = {1117}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.481593}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Multiway Merging in Parallel IS  1 SN  10459219 SP11 EP17 EPD  1117 A1  Zhaofang Wen, PY  1996 KW  Analysis of algorithms KW  databases KW  information retrieval KW  merging KW  parallel computation KW  processors assignment KW  sorting. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—The problem of merging
[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. 19, 1983.
[2] S.G. Akl, The Design and Analysis of Parallel Algorithms. Orlando, Fl.: Academic Press, 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,3671,369, 1987.
[4] K.E. Batcher,"Sorting networks and their applications," Proc. AFIPS Spring Joint Computer Conf. 32, pp. 307314, 1968.
[5] D. Bitton,D.J. Dewitt,D.K. Hsiao, and J. Menon,"A taxonomy of parallel sorting," ACM Computing Surveys, vol. 16, pp. 287318, 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. 130145, 1985.
[7] R. Cole, "Parallel Merge Sort," SIAM J. Computing, vol. 17, pp. 770785, 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. 18, pp. 128142, 1988.
[9] E. Dekel and I. Ozsvath,"Parallel external sorting," J. Parallel and Distributed Computing, vol. 6, pp. 623635, 1989.
[10] J.Y. Fu and F.C. Lin,"Optimal parallel external merging under hardware constraints," Proc. 1991 Int'l Conf. Parallel Processing, pp. III70III74, 1991.
[11] T. Hagerup and C. Rub,"Optimal merging and sorting on the EREW PRAM," Information Processing Letters, vol. 33, pp. 181185, 1989.
[12] D.E. Knuth, The Art of Computer Programming, vol. 1,Addison Wesley, second ed. 1973.
[13] G. Salton, Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer, Addison Wesley, New York, 1989.
[14] Y. Shiloach and U. Vishkin,"Finding the maximum, merging and sorting in a parallel computation," J. Algorithms, vol. 2, pp. 88102, 1981.
[15] P. Valduriez and G. Gardarin,“Join and semijoin algorithms for a multiprocessor database machine,” ACM Trans. on Database Systems, vol. 9, no. 1, pp. 133161, Mar. 1984.
[16] P.J. Varman,S.D. Scheufler,B.R. Iyer, and G.R. Ricard,"Merging multiple lists on hierarchicalmemory multiprocessors," J. Parallel and Distributed Computing, vol. 12, pp. 171177, 1991.