skip to content
General parallel computation without CPUs : VLSI realization of a particle machine Preview this item
ClosePreview this item
Checking...

General parallel computation without CPUs : VLSI realization of a particle machine

Author: Richard K Squier; Kenneth Steiglitz; Mariusz Jakubowski
Publisher: Princeton, N.J. : Princeton University, Dept. of Computer Science, [1995]
Series: Princeton University.; Department of Computer Science.; Research report
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "We describe an approach to parallel computation using particle propagation and collisons in a one-dimensional cellular automaton using a particle model -- a Particle Machine (PM). Such a machine has the parallelism, structural regularity, and local connectivity of systolic arrays, but is general and programmable. It contains no explicit multipliers, adders, or other fixed arithmetic operations; these are  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Richard K Squier; Kenneth Steiglitz; Mariusz Jakubowski
OCLC Number: 35862995
Notes: "February 1995."
Description: 18 pages : illustrations ; 28 cm.
Series Title: Princeton University.; Department of Computer Science.; Research report
Responsibility: Richard K. Squier, Ken Steiglitz, Mariusz Jakubowski.

Abstract:

Abstract: "We describe an approach to parallel computation using particle propagation and collisons in a one-dimensional cellular automaton using a particle model -- a Particle Machine (PM). Such a machine has the parallelism, structural regularity, and local connectivity of systolic arrays, but is general and programmable. It contains no explicit multipliers, adders, or other fixed arithmetic operations; these are implemented using fine-grain interactions of logical particles which are injected into the medium of the cellular automaton, and which represent both data and processors. We sketch a VLSI implementation of a PM, and estimate its speed and size. We next discuss the problem of determining whether a rule set for a PM is free of conflicts. In general, the question is undecidable, but enough side information is usually available in practice to answer the question in polynomial time. We then show how to implement division in time linear in the number of significant bits of the result, using an algorithm of Leighton. This complements similar previous results for fixed-point addition/subtraction and multiplication. The precision of the arithmetic is arbitrary, being determined by the particle groups used as input."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/35862995>
library:oclcnum"35862995"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/35862995>
rdf:typeschema:Book
schema:about
schema:about
<http://id.worldcat.org/fast/1141482>
rdf:typeschema:Intangible
schema:name"Systolic array circuits--Design and construction"@en
schema:name"Systolic array circuits--Design and construction."@en
schema:about
<http://id.worldcat.org/fast/975610>
rdf:typeschema:Intangible
schema:name"Integrated circuits--Very large scale integration--Design and construction"@en
schema:name"Integrated circuits--Very large scale integration--Design and construction."@en
schema:about
<http://id.worldcat.org/fast/1052928>
rdf:typeschema:Intangible
schema:name"Parallel processing (Electronic computers)"@en
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/1078674>
rdf:typeschema:Intangible
schema:name"Programmable array logic"@en
schema:name"Programmable array logic."@en
schema:about
<http://id.loc.gov/authorities/subjects/sh2008104742>
rdf:typeschema:Intangible
schema:name"Integrated circuits--Very large scale integration--Design and construction."@en
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1995"
schema:description"Abstract: "We describe an approach to parallel computation using particle propagation and collisons in a one-dimensional cellular automaton using a particle model -- a Particle Machine (PM). Such a machine has the parallelism, structural regularity, and local connectivity of systolic arrays, but is general and programmable. It contains no explicit multipliers, adders, or other fixed arithmetic operations; these are implemented using fine-grain interactions of logical particles which are injected into the medium of the cellular automaton, and which represent both data and processors. We sketch a VLSI implementation of a PM, and estimate its speed and size. We next discuss the problem of determining whether a rule set for a PM is free of conflicts. In general, the question is undecidable, but enough side information is usually available in practice to answer the question in polynomial time. We then show how to implement division in time linear in the number of significant bits of the result, using an algorithm of Leighton. This complements similar previous results for fixed-point addition/subtraction and multiplication. The precision of the arithmetic is arbitrary, being determined by the particle groups used as input.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/40500121>
schema:inLanguage"en"
schema:name"General parallel computation without CPUs : VLSI realization of a particle machine"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.