WorldCat Identities

Squier, Richard K.

Overview
Works: 5 works in 7 publications in 1 language and 16 library holdings
Publication Timeline
Key
Publications about  Richard K Squier Publications about Richard K Squier
Publications by  Richard K Squier Publications by Richard K Squier
Most widely held works by Richard K Squier
Efficient, scalable architectures for lattice-gas computations by Richard K Squier ( Book )
3 editions published in 1991 in English and held by 6 WorldCat member libraries worldwide
By developing and applying solutions to discrete isoperimetric problems to a pebbling game, upper bounds on throughput for machines computing problems with data dependency graphs based on the undirected graphs for the Hardy-de Pazzis-Pomeau (HPP) and Frisch-Hasslacher-Pomeau (FHP) lattice-gasses are shown. A particular architecture, the 'Wide Serial Architecture' (WSA), is shown to be within a factor of approximately 6 of the bound for the HPP-like computations, and within a factor of about 4.5 of the bound for the FHP-like computations
Computease : an introduction to computers, networks and issues of the information age ( Book )
1 edition published in 1998 in English and held by 4 WorldCat member libraries worldwide
Testing parallel simulators for two-dimensional lattice-gas automata by Richard K Squier ( Book )
1 edition published in 1990 in English and held by 3 WorldCat member libraries worldwide
The test patterns detect all significant one-bit errors. We include experimental results indicating that multiple bit errors are unlikely to escape detection."
General parallel computation without CPUs : VLSI realization of a particle machine by Richard K Squier ( Book )
1 edition published in 1995 in English and held by 2 WorldCat member libraries worldwide
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."
Programmable parallel arithmetic in cellular automata using a particle model by Richard K Squier ( Book )
1 edition published in 1994 in English and held by 1 WorldCat member library worldwide
Abstract: "In this paper we show how to embed practical computation in one-dimensional cellular automata using a model of computation based on collisions of moving particles. The cellular automata have small neighborhoods, and state spaces which are binary occupancy vectors. They can be fabricated in VLSI, and perhaps also in bulk media which support appropriate particle propagation and collisions. The model uses injected particles to represent both data and processors. Consequently, realizations are highly programmable, and do not have application-specific topology, in contrast with systolic arrays. We describe several practical calculations which can be carried out in a highly parallel way in a single cellular automaton, including addition, subtraction, multiplication, arbitrarily nested combinations of these operations, and finite-impulse-response digital filtering of a signal arriving in a continuous stream. These are all accomplished in time linear in the number of input bits, and with fixed-point arithmetic of arbitrary precision, independent of the hardware."
 
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.66 (from 0.23 for Computease ... to 0.96 for Efficient, ...)
Languages
English (7)