Facebook pixel tracking

The Science and Information (SAI) Organization publishes open-access peer-reviewed journals in computer science and artificial intelligence.

Contact Info
Website thesai.org
Follow Us
Contact Info
Follow Us
Research Article | Open Access |

k-Integer-Merging on Shared Memory

Author 1: Ahmed Y Khedr Author 2: Ibrahim M Alseadoon
International Journal of Advanced Computer Science and Applications (IJACSA) · Vol. 12, No. 1 · Published 2021

DOI: https://doi.org/10.14569/IJACSA.2021.0120179

Abstract

The k integer-merging problem is to merge the k sorted arrays into a new sorted array that contains all elements of Ai,∀ i. We propose a new parallel algorithm based on exclusive read exclusive write shared memory. The algorithm runs in O(log n) time using n/log n processors. The algorithm performs linear work, O(n), and has optimal cost. Furthermore, the total work done by the algorithm is less than the best-known previous parallel algorithms for k merging problem.

Keywords

How to Cite this Article

Khedr, A. Y., & Alseadoon, I. M. (2021). k-Integer-Merging on Shared Memory. International Journal of Advanced Computer Science and Applications, 12(1). https://doi.org/10.14569/IJACSA.2021.0120179

Khedr, Ahmed Y, and Ibrahim M Alseadoon. "k-Integer-Merging on Shared Memory." International Journal of Advanced Computer Science and Applications, vol. 12, no. 1, 2021, https://doi.org/10.14569/IJACSA.2021.0120179.

@article{Khedr2021,
  title     = {k-Integer-Merging on Shared Memory},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {12},
  number    = {1},
  year      = {2021},
  publisher = {The Science and Information Organization},
  author    = {Ahmed Y Khedr and Ibrahim M Alseadoon},
  doi       = {10.14569/IJACSA.2021.0120179},
  url       = {https://doi.org/10.14569/IJACSA.2021.0120179}
}

Open Access — licensed under a Creative Commons Attribution 4.0 International License. Unrestricted use, distribution, and reproduction in any medium, even commercially, as long as the original work is properly cited.