Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

IPPS
2002
IEEE

favoriteEmaildiscussreport

114views Distributed And Parallel Com...» more IPPS 2002»

On Cost-Optimal Merge of Two Intransitive Sorted Sequences

13 years 9 months ago

On Cost-Optimal Merge of Two Intransitive Sorted Sequences

Download www.cis.temple.edu

The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal 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. The cost-optimal merge in the strong sense is still an open problem.

Jie Wu, Stephan Olariu

Real-time Traffic

Distributed And Parallel Computing | Intransitive Sorted Sequences | IPPS 2002 | Parallel Merging Algorithm | Sorted Total Order |

claim paper

Related Content

» Fast Integer Merging on the EREW PRAM

» Periodic Sorting Using Minimum Delay Recursively Constructed Merging Networks

» WorkTime Optimal KMerge Algorithms on the PRAM

» Periodic Merging Networks

» Visibility Sorting and Compositing Without Splitting for Image Layer Decompositions

» Improving the Usability of a Graph Transformation Language

» Analysis of circular genome rearrangement by fusions fissions and blockinterchanges

Post Info
More Details (n/a)

Added	15 Jul 2010
Updated	15 Jul 2010
Type	Conference
Year	2002
Where	IPPS
Authors	Jie Wu, Stephan Olariu

Comments (0)