Show simple item record

dc.contributor.authorZippel, Richarden_US
dc.date.accessioned2007-04-23T17:56:57Z
dc.date.available2007-04-23T17:56:57Z
dc.date.issued1991-12en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR91-1256en_US
dc.identifier.urihttps://hdl.handle.net/1813/7096
dc.description.abstractWe present a fine grained, massively parallel SIMD architecture called the data structure accelerator and demonstrate its use in a number of problems in computational geometry. This architecture is extremely dense and highly scalable. Systems of 10$^6$ processing elements can be feasibly embedded in work stations. We advocate that this architecture be used in tandem with conventional single sequence machines and with small scale, shared memory multiprocessors. We present a language for programming such heterogeneous systems that smoothly encorporates the SIMD instructions of the data structure accelerator with conventional single sequence code. [footnote: This is an expanded version of a paper that was presented at the Jerusalem Conference on Information Technology, October 1990.]en_US
dc.format.extent2699915 bytes
dc.format.extent712299 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleThe Data Structure Accelerator Architectureen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics