Abstract
A control parallel and a novel data parallel implementation of a polygon clipping algorithm on transputers and the DAP respectively were presented and contrasted. In general it is not easy to compare the performance and cost-effectiveness of a MIMD and SIMD parallel processor for a particular task. There are a number of parameters whose values can not accurately be determined without implementations on both machines (such as the exact value of algorithmic complexity and processor utilisation) and the optimal algorithms for each task and parallel processor are rarely known. Comparisons are further complicated by differences in the size, vintage and cost of the relevant machines.
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1989). 6 Control parallel versus data parallel polygon clipping. In: Theoharis, T. (eds) Algorithms for Parallel Polygon Rendering. Lecture Notes in Computer Science, vol 373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51394-9_6
Download citation
DOI: https://doi.org/10.1007/3-540-51394-9_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51394-0
Online ISBN: 978-3-540-46204-0
eBook Packages: Springer Book Archive