Treffer: Cache-oblivious comparison-based algorithms on multisets

Title:
Cache-oblivious comparison-based algorithms on multisets
Authors:
FARZAN, Arash, FERRAGINA, Paolo, FRANCESCHINI, Gianni, MUNRO, J. Ian
Source:
Algorithms - ESA 2005 (13th annual European sympoisum, Palma de Mallorca, Sapin, October 3-6, 2005, proceedings)Lecture notes in computer science. :305-316
Publisher Information:
New York, NY: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 9 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, 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, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Gestion des mémoires et des fichiers (y compris la protection et la sécurité des fichiers), Memory and file management (including protection and security), Algorithme déterministe, Deterministic algorithms, Algorithme optimal, Optimal algorithm, Algoritmo óptimo, Algorithme randomisé, Randomized algorithm, Algoritmo aleatorizado, Antémémoire, Cache memory, Antememoria, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Mémoire accès direct, Random access memory, Memoria acceso directo, Mémoire ordinateur, Computer storage, Memoria ordinador, Multiensemble, Multiset, Multiconjunto
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
School of Computer Science, University of Waterloo, Canada
Department of Computer Science, University of Pisa, Italy
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17247007
Rights:
Copyright 2005 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.17247007
Database:
PASCAL Archive

Weitere Informationen

We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (the mode). We are interested in minimizing the cache complexity (or number of cache misses) of algorithms for these problems in the context under which cache size and block size are unknown. We give algorithms with cache complexities within a constant factor of the optimal for all the problems. In the case of determining the mode, the optimal algorithm is randomized as the deterministic algorithm differs from the lower bound by a sublogarithmic factor. We can achieve optimality either with a randomized method or if given, along with the input, lg lg of relative frequency of the mode with a constant additive error.