
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Tatsuya Hayashi, Koji Nakano, Stephan Olariu, "WorkTime Optimal kMerge Algorithms on the PRAM," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 3, pp. 275282, March, 1998.  
BibTex  x  
@article{ 10.1109/71.674319, author = {Tatsuya Hayashi and Koji Nakano and Stephan Olariu}, title = {WorkTime Optimal kMerge Algorithms on the PRAM}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {3}, issn = {10459219}, year = {1998}, pages = {275282}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.674319}, 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  WorkTime Optimal kMerge Algorithms on the PRAM IS  3 SN  10459219 SP275 EP282 EPD  275282 A1  Tatsuya Hayashi, A1  Koji Nakano, A1  Stephan Olariu, PY  1998 KW  Merging KW  sorting KW  parallel algorithms KW  worktime optimal algorithms KW  information retrieval KW  databases KW  query processing. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—For 2 ≤
[1] A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms.Reading, Mass: AddisonWesley, 1983.
[2] S.G. Akl, Parallel Computation: Models and Methods. Upper Saddle River, N.J.: Prentice Hall, 1997.
[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] Y. Azar and U. Vishkin, "Tight Comparison Bounds on the Complexity of Parallel Sorting," SIAM J. Computing, vol. 16, pp. 458464, 1987.
[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.P. Brent, "The Parallel Evaluation of General Arithmetic Expressions," J. ACM, vol. 21, pp. 201206, 1974.
[8] D.Z. Chen, W. Chen, K. Wada, and K. Kawaguchi, "Parallel Algorithms for Partitioning Sorted Sets and Related Problems," Proc. Fourth European Symp. Algorithms, ESA '96 (LNCS 1136), pp. 234235, 1996.
[9] R.J. Cole, “An Optimally Efficient Selection Algorithm,” Information Processing Letters 26, pp. 295299, 1987/1988.
[10] R. Cole, "Parallel Merge Sort," SIAM J. Computing, vol. 17, pp. 770785, 1988.
[11] 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.
[12] E. Dekel and I. Ozsvath,"Parallel external sorting," J. Parallel and Distributed Computing, vol. 6, pp. 623635, 1989.
[13] J.Y. Fu and F.C. Lin, "Optimal Parallel External Merging Under Hardware Contstraints," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 7074,St. Charles, Ill., Aug. 1991.
[14] T. Hagerup and R. Raman, "Fast Deterministic Approximate and Exact Parallel Sorting," Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 346355, 1993.
[15] T. Hagerup and C. Rub,"Optimal merging and sorting on the EREW PRAM," Information Processing Letters, vol. 33, pp. 181185, 1989.
[16] J. JáJá, An Introduction to Parallel Algorithms.Reading, Mass.: AddisonWesley, 1991.
[17] R.M. Karp and V. Ramachandran, "Parallel Algorithms for SharedMemory Machines," Handbook of Theoretical Computer Science, J. van Leeuwen, ed., vol. A, pp. 869941.Amsterdam: NorthHolland, 1990.
[18] D.E. Knuth, The Art of Computer Programming, vol. 1,Addison Wesley, second ed. 1973.
[19] C. Kruskal, "Searching, Merging, and Sorting in Parallel Computation," IEEE Trans. Computers, vol. 32, pp. 942946, 1983.
[20] R.E. Ladner and M.J. Fischer, "Parallel Prefix Computation," J. ACM, vol. 27, no. 4, pp. 831838, Oct. 1980.
[21] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[22] T.H. Merrett, Relational Information Systems.Reston, Va: Reston Publishing Co., 1983.
[23] S. Olariu, C.M. Overstreet, and Z. Wen, "Reconstructing Binary Trees in Doubly Logarithmic CREW Time," J. Parallel and Distributed Computing, vol. 27, pp. 100105, 1995.
[24] S. Olariu and J. Schwing, "A New Deterministic Sampling Scheme with Applications to BroadcastEfficient Sorting on the Reconfigurable Mesh," J. Parallel and Distributed Computing, vol. 32, pp. 215222, 1996.
[25] S. Olariu and Z. Wen, "An Efficient Parallel Algorithm for Multiselection," Parallel Computing, vol. 17, pp. 689693, 1991.
[26] M.J. Quinn, Parallel Computing: Theory and Practice.New York: McGrawHill, 1994.
[27] M. Snir, "On Parallel Searching," SIAM J. Computing, vol. 14, pp. 688708, 1985.
[28] Y. Shiloach and U. Vishkin, "Finding the Maximum, Merging and Sorting in Parallel Computation," J. Algorithms, vol. 2, pp. 88102, 1981.
[29] 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.
[30] L. G. Valiant, "Parallelism in Comparison Problems," SIAM J. Computing, vol. 4, pp. 348355, 1975.
[31] 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.
[32] Z. Wen, "MultiWay Merging in Parallel," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 1, pp. 1117, Jan. 1996.