Future of Information and Communication Conference (FICC) 2021
29-30 April 2021
Publication Links
IJACSA
Special Issues
Computing Conference 2021
Intelligent Systems Conference (IntelliSys) 2021
Future Technologies Conference (FTC) 2021
Future of Information and Communication Conference (FICC) 2021
Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2021.0120179
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 12 Issue 1, 2021.
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.
Ahmed Y Khedr and Ibrahim M Alseadoon, “k-Integer-Merging on Shared Memory” International Journal of Advanced Computer Science and Applications(IJACSA), 12(1), 2021. http://dx.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},
doi = {10.14569/IJACSA.2021.0120179},
url = {http://dx.doi.org/10.14569/IJACSA.2021.0120179},
year = {2021},
publisher = {The Science and Information Organization},
volume = {12},
number = {1},
author = {Ahmed Y Khedr and Ibrahim M Alseadoon}
}