Abstract
The sequential surface-to-surface intersection algorithm has been extensively studied in the past decade. With the advent of parallel processing machines, it is desirable to parallelize this algorithm to gain extra computation speed for real time applications. An earlier attempt to parallelize this algorithm was on shared memory parallel computer due to the highly shared model of data structure [Chang 1991). A shared memory machine is not available at every location. Instead, we have implemented it on distributed parallel computer iPSC/860 with 32 processors. The initial development was done using PVM software in heterogeneous environment consisting of Sun workstations and 486's which are easily available. Also several improvements were made to the existing algorithm. The empirical results of speedup and processor efficiency of this prototype are presented.
Recommended Citation
T. M. Burke and C. Sabharwal, "Data Parallel Implementation of Surface-To-Surface Intersection," Proceedings of the ACM Symposium on Applied Computing, pp. 353 - 357, Association for Computing Machinery, Feb 1996.
The definitive version is available at https://doi.org/10.1145/331119.331205
Department(s)
Computer Science
Keywords and Phrases
Data-parallel; Divide-and-conquer; Intersection; Sorting; Surfaces
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Association for Computing Machinery, All rights reserved.
Publication Date
18 Feb 1996
