AI Chat AI Image Generator AI Video Text to Speech

The Saukas-Song Selection Algorithm and Coarse Grained Parallel Sorting

12/04/2017

∙

by Laurence Boxer, et al.

∙

∙

We analyze the running time of the Saukas-Song algorithm for selection on a coarse grained multicomputer without expressing the running time in terms of communication rounds. We derive sorting algorithms that are asymptotically optimal for restricted ranges of processors on coarse grained multicomputers.

page 1

page 2

page 3

page 4

research

∙ 12/19/2022

Lower bound on the running time of Pop-Stack Sorting on a random permutation

Pop-Stack Sorting is an algorithm that takes a permutation as an input a...

0 Lyuben Lichev, et al. ∙

research

∙ 07/13/2022

Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem

This paper presents a parallel solution based on the coarse-grained mult...

0 Jerry Lacmou Zeutouo, et al. ∙

research

∙ 01/01/2023

Optimization Perspectives on Shellsort

Shellsort is a sorting method that is attractive due to its simplicity, ...

0 Oscar Skean, et al. ∙

research

∙ 09/14/2023

Methodologies for Selection of Optimal Sites for Renewable Energy Under a Diverse Set of Constraints and Objectives

In this paper, we present methodologies for optimal selection for renewa...

0 Arunabha Sen, et al. ∙

research

∙ 08/13/2019

Finding and counting permutations via CSPs

Permutation patterns and pattern avoidance have been intensively studied...

0 Benjamin Aram Berendsohn, et al. ∙

research

∙ 03/18/2020

A Generalization of Self-Improving Algorithms

Ailon et al. [SICOMP'11] proposed self-improving algorithms for sorting ...

0 Siu-Wing Cheng, et al. ∙

research

∙ 05/10/2018

Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs

We present two stable mergesort variants, "peeksort" and "powersort", th...

0 J. Ian Munro, et al. ∙