Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5941Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Blumberg, Andrew Justin | - |
| dc.date | 2004-10-04T14:15:45Z | - |
| dc.date | 2004-10-04T14:15:45Z | - |
| dc.date | 1996-12-01 | - |
| dc.date.accessioned | 2013-10-09T02:42:04Z | - |
| dc.date.available | 2013-10-09T02:42:04Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-1589 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5941 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | In this paper I describe and extend a new DNA computing paradigm introduced in Blumberg for building massively parallel machines in the DNA-computing models described by Adelman, Cai et. al., and Liu et. al. Employing only DNA operations which have been reported as successfully performed, I present an implementation of a Connection Machine, a SIMD (single-instruction multiple-data) parallel computer as an illustration of how to apply this approach to building computers in this domain (and as an implicit demonstration of PRAM equivalence). This is followed with a description of how to implement a MIMD (multiple-instruction multiple-data) parallel machine. The implementations described herein differ most from existing models in that they employ explicit communication between processing elements (and hence strands of DNA). | - |
| dc.format | 16 p. | - |
| dc.format | 398560 bytes | - |
| dc.format | 223460 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-1589 | - |
| dc.subject | AI | - |
| dc.subject | MIT | - |
| dc.subject | Artificial Intelligence | - |
| dc.subject | DNA Computing | - |
| dc.subject | Parallel Architecture | - |
| dc.title | General Purpose Parallel Computation on a DNA Substrate | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
