Optimal Parallel Merging by Counting

I
ITNG
2007
International Conference on Information Technology (ITNG'07)
Abstract - Optimal Parallel Merging by Counting

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Hazem M. Bahig Articles by Hatem M. Bahig

International Conference on Information Technology (ITNG'07)

Las Vegas, Nevada, USA

April 02-April 04

ISBN: 0-7695-2776-0

	ASCII Text	x
	Hazem M. Bahig, Hatem M. Bahig, "Optimal Parallel Merging by Counting," Information Technology: New Generations, Third International Conference on, pp. 664-669, International Conference on Information Technology (ITNG'07), 2007.

	BibTex	x
	@article{ 10.1109/ITNG.2007.144, author = {Hazem M. Bahig and Hatem M. Bahig}, title = {Optimal Parallel Merging by Counting}, journal ={Information Technology: New Generations, Third International Conference on}, volume = {0}, year = {2007}, isbn = {0-7695-2776-0}, pages = {664-669}, doi = {http://doi.ieeecomputersociety.org/10.1109/ITNG.2007.144}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Information Technology: New Generations, Third International Conference on TI - Optimal Parallel Merging by Counting SN - 0-7695-2776-0 SP664 EP669 A1 - Hazem M. Bahig, A1 - Hatem M. Bahig, PY - 2007 KW - null VL - 0 JA - Information Technology: New Generations, Third International Conference on ER -

Hazem M. Bahig, Ain Shams University, Cairo, Egypt

Hatem M. Bahig, Ain Shams University, Cairo, Egypt

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ITNG.2007.144

We present a new optimal deterministic parallel algorithm for merging two sorted arrays A = (a0, a1, ? ? ? , an1-1) and B = (b0, b1, ? ? ? , bn2-1) of integers. The elements of two sorted arrays are drawn from a domain of integers [0, n - 1], where n = Max(n1, n2). The algorithm takes O(log n) time and O(n) space using n/ log n processors on EREW PRAM. Also, the algorithm is stable.

Citation:

Hazem M. Bahig, Hatem M. Bahig, "Optimal Parallel Merging by Counting," itng, pp.664-669, International Conference on Information Technology (ITNG'07), 2007

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.