General Purpose Parallel Computation on a DNA Substrate
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 pr...
Main Author: | |
---|---|
Language: | en_US |
Published: |
2004
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/5941 |
_version_ | 1811076472315576320 |
---|---|
author | Blumberg, Andrew Justin |
author_facet | Blumberg, Andrew Justin |
author_sort | Blumberg, Andrew Justin |
collection | MIT |
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). |
first_indexed | 2024-09-23T10:22:42Z |
id | mit-1721.1/5941 |
institution | Massachusetts Institute of Technology |
language | en_US |
last_indexed | 2024-09-23T10:22:42Z |
publishDate | 2004 |
record_format | dspace |
spelling | mit-1721.1/59412019-04-12T08:05:49Z General Purpose Parallel Computation on a DNA Substrate Blumberg, Andrew Justin AI MIT Artificial Intelligence DNA Computing Parallel Architecture 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). 2004-10-04T14:15:45Z 2004-10-04T14:15:45Z 1996-12-01 AIM-1589 http://hdl.handle.net/1721.1/5941 en_US AIM-1589 16 p. 398560 bytes 223460 bytes application/postscript application/pdf application/postscript application/pdf |
spellingShingle | AI MIT Artificial Intelligence DNA Computing Parallel Architecture Blumberg, Andrew Justin General Purpose Parallel Computation on a DNA Substrate |
title | General Purpose Parallel Computation on a DNA Substrate |
title_full | General Purpose Parallel Computation on a DNA Substrate |
title_fullStr | General Purpose Parallel Computation on a DNA Substrate |
title_full_unstemmed | General Purpose Parallel Computation on a DNA Substrate |
title_short | General Purpose Parallel Computation on a DNA Substrate |
title_sort | general purpose parallel computation on a dna substrate |
topic | AI MIT Artificial Intelligence DNA Computing Parallel Architecture |
url | http://hdl.handle.net/1721.1/5941 |
work_keys_str_mv | AT blumbergandrewjustin generalpurposeparallelcomputationonadnasubstrate |