Show simple item record

Parallel Solutions to Geometric Problems on the Scan Model of Computation

dc.date.accessioned2004-10-04T14:57:20Z
dc.date.accessioned2018-11-24T10:13:59Z
dc.date.available2004-10-04T14:57:20Z
dc.date.available2018-11-24T10:13:59Z
dc.date.issued1988-02-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6467
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6467
dc.description.abstractThis 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.extent4068536 bytes
dc.format.extent1537411 bytes
dc.language.isoen_US
dc.titleParallel Solutions to Geometric Problems on the Scan Model of Computationen_US


Files in this item

FilesSizeFormatView
AIM-952.pdf1.537Mbapplication/pdfView/Open
AIM-952.ps4.068Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record