Javascript must be enabled for the correct page display

Distributed Determination of Connected Components

Sinnema, M. (2001) Distributed Determination of Connected Components. Master's Thesis / Essay, Computing Science.

[img]
Preview
Text
Infor_Ma_2001_MSinnema.CV.pdf - Published Version

Download (2MB) | Preview

Abstract

An important task in image processing is the labelling of connected components, which is a basic segmentation task. In this report we show how we parallelized Tarjan's disjoint set algorithm for determination of connected components on distributed memorysystems, e.g. a set of desktop computers connected via a network.We first give a sequential and a parallel solution for Tarjan's disjoint set algorithm. Secondly we show how to implement both algorithms. We also study the scalability of the algorithm.

Item Type: Thesis (Master's Thesis / Essay)
Degree programme: Computing Science
Thesis type: Master's Thesis / Essay
Language: English
Date Deposited: 15 Feb 2018 07:29
Last Modified: 15 Feb 2018 07:29
URI: http://fse.studenttheses.ub.rug.nl/id/eprint/8850

Actions (login required)

View Item View Item