Parallel Solutions to Geometric Problems on the Scan Model of Computation
dc.date.accessioned | 2004-10-04T14:57:20Z | |
dc.date.accessioned | 2018-11-24T10:13:59Z | |
dc.date.available | 2004-10-04T14:57:20Z | |
dc.date.available | 2018-11-24T10:13:59Z | |
dc.date.issued | 1988-02-01 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/6467 | |
dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6467 | |
dc.description.abstract | This paper describes several parallel algorithms that solve geometric problems. The algorithms are based on a vector model of computation---the scan-model. The purpose of this paper is both to show how the model can be used and to show a set of interesting algorithms, most of which have been implemented on the Connection Machine, a highly parallel single instruction multiple data (SIMD) computer. | en_US |
dc.format.extent | 4068536 bytes | |
dc.format.extent | 1537411 bytes | |
dc.language.iso | en_US | |
dc.title | Parallel Solutions to Geometric Problems on the Scan Model of Computation | en_US |
Files in this item
Files | Size | Format | View |
---|---|---|---|
AIM-952.pdf | 1.537Mb | application/pdf | View/ |
AIM-952.ps | 4.068Mb | application/postscript | View/ |