Memory Management for Union-Find Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1997

Memory Management for Union-Find Algorithms


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.

Dates and versions

inria-00549664 , version 1 (22-12-2010)



Christophe Fiorio, Jens Gustedt. Memory Management for Union-Find Algorithms. STACS: Symposium on Theoretical Aspects of Computer Science, Feb 1997, Lübeck, Germany. pp.67-79, ⟨10.1007/BFb0023449⟩. ⟨inria-00549664⟩
77 View
0 Download



Gmail Facebook Twitter LinkedIn More