Treffer: A simple optimal randomized algorithm for sorting on the PDM
Title:
A simple optimal randomized algorithm for sorting on the PDM
Authors:
Source:
Algorithms and computation (16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005)0ISAAC 2005. :543-552
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 23 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme optimal, Optimal algorithm, Algoritmo óptimo, Algorithme randomisé, Randomized algorithm, Algoritmo aleatorizado, Disque parallèle, Parallel disk, Disco paralelo, Goulot étranglement, Bottleneck, Gollete estrangulamiento, Modélisation, Modeling, Modelización, Organisation mémoire, Memory organization, Organización memoria, Plan randomisé, Randomized design, Plan aleatorizado, Temps minimal, Minimum time, Tiempo mínimo, Traitement donnée, Data processing, Tratamiento datos, Triage, Sorting, Tría
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of CSE, University of Connecticut, India
Department of CSE, IIT Kharagpur, India
Department of CSE, IIT Kharagpur, India
ISSN:
0302-9743
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17394429
Database:
PASCAL Archive
Weitere Informationen
The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied on the PDM model due to the fundamental nature of the problem. Several randomized algorithms are known for sorting. Most of the prior algorithms suffer from undue complications in memory layouts, implementation, or lack of tight analysis. In this paper we present a simple randomized algorithm that sorts in optimal time with high probablity and has all the desirable features for practical implementation.