Summary: 2 2.5 3 3.5 4 4.5 5 5.5
0
0.5
1
1.5
2
2.5
3
3.5
4
Speedup versus the number of processors for three image sizes
log2(N)
log2(SP(N))
128 128
256 x 256
512 x 512
linear speedup
N = number of processors
Figure 1: The performance of the Sequential­
Scanning based Parallel Watershed Algorithm

Source: Albert-Ludwigs-Universität Freiburg, Institut für Informatik,, Lehrstuhls für Mustererkennung und Bildverarbeitung

Collections: Computer Technologies and Information Sciences