C.P. Kruskal, "Searching, merging, and sorting in parallel computation", IEEE Trans. on Computers, C-32 (1983), pp. 942-946.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....merging of sorted arrays. In both cases, Valiant [Va 75] first described an O (loglogn ) algorithm in the parallel comparison model. His algorithms were later implemented as O (loglogn ) time optimal algorithms by Shiloach and Vishkin [SV81 ] for maximum finding (on a CRCW PRAM) and by Kruskal [Kr 83] for merging (on a CREW PRAM) Note that Beame and Hastad [BHa 87] showed that the problem of computing the parity of n bits requires W(logn loglogn ) time on the CRCW PRAM model with any polynomial number of processors. Thus, this simple problem is not highly parallelizable, and it is quite ....

C.P. Kruskal, "Searching, merging, and sorting in parallel computation", IEEE Trans. on Computers, C-32 (1983), pp. 942-946.

....combining the results. Valiant in [V] first used the partitioning strategy to handle the problem of merging two sorted sequences; he obtained an O(log log n) time algorithm based on the parallel comparison tree model of computation. Kruskal achieved the same O(log log n) time bounds on a PRAM in [Kr]. Finally, Borodin and Hopcroft in [BH] proved an Omega Gamma 12 log n) lower bound for the problem, and thus the O(log log n) time optimality. The procedure p merge presented below takes as inputs two sorted lists A and B and outputs the sorted sequence C, the merged list of A and B. The p ....

Kruskal, C., "Searching, Merging and Sorting in Parallel Computation", IEEE Transactions on Computers, C-32 (10):942-946, (1983).

No context found.

C. Kruskal, "Searching, merging, and sorting in parallel computation" IEEE Transactions on Computers, 32 (1983) 942--946.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC