On Cost-Optimal Merge of Two Intransitive Sorted Sequences

Authors:
Jie Wu;Stephan Olariu
Affiliations:
-;-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 5
Cited 0

Fast parallel algorithms for finding Hamiltonian paths and cycles in a tournament

Journal of Algorithms
Parallel merge sort

SIAM Journal on Computing
Sorting, minimal feedback sets, and Hamilton paths in tournaments

SIAM Journal on Discrete Mathematics
On Sorting an Intransitive Total Ordered Set Using Semi-Heap

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Sorting networks and their applications

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of merging two intransitive sorted sequences, that is, to generate a sorted total order without the transitive property. A parallel merging algorithm is proposed under the EREW PRAM model. This algorithm has a run time of O(log2 n) using O(n/ log2 n) processors (i.e., this algorithm is costoptimal). Design an algorithm that is cost-optimal in the strong sense is still an open problem.