DeepAI AI Chat
Log In Sign Up

Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model

by   Torben Hagerup, et al.
Universität Augsburg

A new algorithm, Guidesort, for sorting in the uniprocessor variant of the parallel disk model (PDM) of Vitter and Shriver is presented. The algorithm is deterministic and executes a number of (parallel) I/O operations that comes within a constant factor C of the optimum. The algorithm and its analysis are simpler than those proposed in previous work, and the achievable constant factor C of essentially 3 appears to be smaller than for all other known deterministic algorithms, at least for plausible parameter values.


page 1

page 2

page 3

page 4


Towards Parallel Learned Sorting

We introduce a new sorting algorithm that is the combination of ML-enhan...

Deterministic Massively Parallel Algorithms for Ruling Sets

In this paper we present a deterministic O(loglog n)-round algorithm for...

A Description and Proof of a Generalised and Optimised Variant of Wikström's Mixnet

In this paper, we describe an optimised variant of Wikström's mixnet whi...

Deterministic parallel analysis

Factor analysis is widely used in many application areas. The first step...

An Illuminating Algorithm for the Light Bulb Problem

The Light Bulb Problem is one of the most basic problems in data analysi...

A study of integer sorting on multicores

Integer sorting on multicores and GPUs can be realized by a variety of a...

Deterministic algorithms for the Lovasz Local Lemma: simpler, more general, and more parallel

The Lovasz Local Lemma (LLL) is a keystone principle in probability theo...