Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14278
For citation please use:
Main Title: Memory Management for Union-Find Algorithms
Author(s): Fiorio, Christophe
Gustedt, Jens
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15505
http://dx.doi.org/10.14279/depositonce-14278
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: 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.
Subject(s): memory
algorithm
random access memory
RAM
sequential access memory
SAM
CPU
image segmentation
Issue Date: 1996
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 1996, 523
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-523-1996.pdf
Format: Adobe PDF | Size: 143.51 kB
DownloadShow Preview
Thumbnail
Report-523-1996.ps
Format: Postscript | Size: 422.3 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.