Sciweavers

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

11

IPPS
1998
IEEE

favoriteEmaildiscussreport

154views Distributed And Parallel Com...» more IPPS 1998»

A Survey of Randomness and Parallelism in Comparison Problems

13 years 9 months ago

A Survey of Randomness and Parallelism in Comparison Problems

Download ipdps.cc.gatech.edu

A survey of results for the problems of selection, mergingand sorting in the Randomized Parallel Comparison Tree RPCT model is given. The results indicate that while randomization helps" in the case of selection, it does not provide any advantage for the cases of merging and sorting, in this model.

Danny Krizanc

Real-time Traffic

Distributed And Parallel Computing | IPPS 1998 | Randomized Parallel Comparison | Sorting | Tree RPCT Model |

claim paper

Related Content

» Parallel Randomized Techniques for Some Fundamental Geometric Problems A Survey

» Randomized Algorithms on the Mesh

» Complexity of Boolean Functions on PRAMs Lower Bound Techniques

» Randomization in Parallel Stringology

» On Randomized and Deterministic Schemes for Routing and Sorting on FixedConnection Network...

» Survey of Biological High Performance Computing Algorithms Implementations and Outlook Res...

» Comparisons of sequence labeling algorithms and extensions

» Alternative Computational Models A Comparison of Biomolecular and Quantum Computation

» A Comparative Study of Parallel Metaheuristics for Protein Structure Prediction on the Com...

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	IPPS
Authors	Danny Krizanc

Comments (0)