MERGING ON PRAM

Hazem M. Bahig and Hatem M. Bahig

References

  1. [1] T. Cormen, C. Leiserson, & R. Rivest, Introduction to algo-rithms (Cambridge, MA: MIT Press, 1990).
  2. [2] D. Knuth, The art of computer programming: Sorting andsearching Second Edition (Reading, MA: Addison-Wesley,1997).54
  3. [3] S. Akl, Parallel computation: Models and methods (UpperSaddle River, NJ: Prentice Hall, 1997).
  4. [4] S. Akl & N. Santoro, Optimal parallel merging and sortingwithout memory conflicts, IEEE Transactions on Computers,36, 1987, 1367–1369.
  5. [5] A. Borodin & J. Hopcroft, Routing, merging, and sortingon parallel models of computation, Journal of Computer andSystem Science, 30, 1985, 130–145.
  6. [6] T. Hagerup & C. Rub, Optimal merging and sorting on theEREW PRAM, Information Processing Letter, 33, 1989, 181–185. doi:10.1016/0020-0190(89)90138-5
  7. [7] C. Kruskal, Searching, merging, and sorting in parallel com-putation, IEEE Transaction on Computers, 32 (10), 1983,942–946. doi:10.1109/TC.1983.1676138
  8. [8] Y. Shiloach & U. Vishkin. Finding the maximum, merging,and sorting in a parallel computational models, Journal ofAlgorithms, 2, 1981, 88–102.
  9. [9] N. Deo & D. Sarkar, Parallel algorithms for merging andsorting, Information Sciences, 51, 1990, 121–131. doi:10.1016/0020-0255(90)90021-2
  10. [10] O. Berkman & U. Vishkin, On parallel integer merging, Infor-mation and Computation, 106, 1993, 266–285. doi:10.1006/inco.1993.1056
  11. [11] T. Hagerup & M. Kutylowski, Fast integer merging on theEREW PRAM, Algorithmca, 17, 1997, 55–66. doi:10.1007/BF02523238
  12. [12] H. Bahig & H. Bahig, Optimal parallel merging by counting.Proc. 4th Inter. IEEE Conf. on Information Technology: NewGeneration, Las Vegas, April 2–4, 2007, 664–669.

Important Links:

Go Back