Parallel Solutions to Geometric Problems on the Scan Model of Computation

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6467

Full metadata record

DC Field	Value	Language
dc.creator	Blelloch, Guy E.	-
dc.creator	Little, James J.	-
dc.date	2004-10-04T14:57:20Z	-
dc.date	2004-10-04T14:57:20Z	-
dc.date	1988-02-01	-
dc.date.accessioned	2013-10-09T02:45:34Z	-
dc.date.available	2013-10-09T02:45:34Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-952	-
dc.identifier	http://hdl.handle.net/1721.1/6467	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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.	-
dc.format	4068536 bytes	-
dc.format	1537411 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-952	-
dc.title	Parallel Solutions to Geometric Problems on the Scan Model of Computation	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI