article · 2001

An In-Place Merge Algorithm for Parallel Systems

Denham Coates-evelyn

Cited by 0Abstract and details only

Abstract

An algorithm that does O(n 2) comparisons and data moves to sort a list of n random data values on a uni-processor system is presented. We show a multiprocessor implementation that has complexity of O ( √ n) using the MIMD model on a mesh connected system. The AT 2 complexity on this model is O(n 5/2 lg(n)), which is sub-optimum by a factor of O ( √ n / lg(n)).

Cite this paper

APA 7

Coates-evelyn, D. (2001). An In-Place Merge Algorithm for Parallel Systems.

MLA 9

Coates-evelyn, Denham. “An In-Place Merge Algorithm for Parallel Systems.” 2001.

Chicago

Coates-evelyn, Denham. 2001. “An In-Place Merge Algorithm for Parallel Systems.”

Harvard

Coates-evelyn, D. (2001) ‘An In-Place Merge Algorithm for Parallel Systems’.

BibTeX

@article{coatesevelyn2001place,
  title = {{An In-Place Merge Algorithm for Parallel Systems}},
  author = {Coates-evelyn, Denham},
  year = {2001}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.