Memory Management for Union-Find Algorithms

Christophe Fiorio; Jens Gustedt

doi:10.1007/BFb0023449

Retour

Acte de colloque

Memory Management for Union-Find Algorithms

Christophe Fiorio et Jens Gustedt

14th Symposium on Theoretical Aspects of Computer Science, Vol.LNCS(1200), pp.67-79

STACS: Symposium on Theoretical Aspects of Computer Science (Lübeck, Germany, 27/02/1997–01/03/1997)

1997

DOI: https://doi.org/10.1007/BFb0023449

Résumé

Memory Management

Image Segmentation

Active Element

Random Access Memory

Real Time Performance

We provide a general tool to improve the real time performance of a broad class of Union-Find algorithms. This is done by minimizing the random access memory that is used and thus to avoid the well-known von Neumann bottleneck of synchronizing CPU and memory. A main application to image segmentation algorithms is demonstrated where the real time performance is drastically improved.

Fichiers et liens (1)

url

Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Titre: Memory Management for Union-Find Algorithms
Créateurs - sans rôle: Christophe Fiorio - Technische Universität Berlin
Jens Gustedt - Technische Universität Berlin
Contributeurs - sans rôle: Reischuk, Rüdiger
Morvan, Michel
Détails de publication: 14th Symposium on Theoretical Aspects of Computer Science, Vol.LNCS(1200), pp.67-79
Colloque: STACS: Symposium on Theoretical Aspects of Computer Science (Lübeck, Germany, 27/02/1997–01/03/1997)
Identifiants: 99151666909311
Unité académique: Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier - LIRMM
Langue: English
Type de ressource: Conference proceeding
Champs locaux: inria-00549664