• Corpus ID: 1485241

Parallelized QuickSort with Optimal Speedup

  title={Parallelized QuickSort with Optimal Speedup},
  author={David M. W. Powers},
Knuth (1973,pp2-3) notes that sorting is estimated to take up 25% of the world’s computer time. With the advent of the microcomputer this may well have changed, but it is nonetheless a both practically and theoretically interesting task. Sorting, in the sense of bringing together related things, has now been subsumed by.the more specific task of ordering, and has spawned an enormous number of serial sorting algorithms. 

Tables from this paper

SAPCo Sort: optimizing Degree-Ordering for Power-Law Graphs

We introduce the Structure-Aware Parattet Counting (SAPCo) Sort algorithm that optimizes performance of degree-ordering, a key operation in graph analytics. SAPCo leverages the skewed degree

Theoretical Engineering and Satellite Comlink of a PTVD-SHAM System

This paper focuses on super helical memory system's design, 'Engineering, Architectural and Satellite Communications' as a theoretical approach of an invention-model to 'store time- data' and the time-data versus data-time algorithm.

Quantum algorithms for jet clustering

This work considers the possibility of using quantum computers to speed up jet clustering algorithms and identifies a well-known event shape called thrust whose optimum corresponds to the most jetlike separating plane among a set of particles, thereby defining two hemisphere jets.

Analysis and Determination of Inner Lip texture Descriptors for Visual Speech Representation

The experimental results show that the local inner texture descriptors, such as the color moment with geometric feature, outperform the holistic inner textures descriptors in representing visual speech with the close discriminability but low dimensionality.



Parallel merge sort

  • R. Cole
  • Computer Science
    27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
  • 1986
We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and O(logn) time; the constant in the running time is small. We also give a more complex version of the algorithm

Sorting inc logn parallel steps

A sorting network withcn logn comparisons where in thei-th step of the algorithm the contents of registersRj, andRk, wherej, k are absolute constants then change their contents or not according to the result of the comparison.

Sorting networks and their applications

To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several

Sorting and Searching

The first revision of this third volume is a survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and

The Art of Computer Programming

The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.

Networks and their Applications

This chapter explores the features of a network, the special demands of multimedia on networks, electronic mail, internet tools, and more.

Scholarly Review. Computing Reviews

  • Scholarly Review. Computing Reviews
  • 1989

Parallelism in QuickSort

  • Proc. 12th Aust. Comp. Sci. Conf
  • 1989

QuickSort, Computer Journal

  • QuickSort, Computer Journal
  • 1962