Parallel implementation of an algorithm for Delaunay triangulationThis work concerns the theory and practice of implementing Tanemura's algorithm for 3D Delaunay triangulation on Intel's Gamma prototype, a 128 processor MIMD computer. Tanemura's algorithm does not vectorize to any significant degree and requires indirect addressing. Efficient implementation on a conventional, vector processing, supercomputer is problematic. Efficient implementation on a parallel architecture is possible, however. In this work, speeds in excess of 8 times a single processor Cray Y-mp are realized on 128 processors of the Intel Gamma prototype.
Document ID
19950063875
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Merriam, Marshall L. (NASA Ames Research Center Moffett Field, CA, US, United States)
Date Acquired
August 17, 2013
Publication Date
January 1, 1992
Publication Information
Publisher: Elsevier Science Publishers B.V.
Subject Category
Fluid Mechanics And Heat Transfer
Accession Number
95A95474
Distribution Limits
Public
Copyright
Other
Available Downloads
There are no available downloads for this record.
Related Records
IDRelationTitle19950063758Collected WorksComputational fluid dynamics '92; Proceedings of the European Computational Fluid Dynamics Conference, 1st, Brussels, Belgium, Sep. 7-11, 1992. Vols. 1 & 2