WorldCat Identities

Squier, Richard K.

Works: 6 works in 9 publications in 1 language and 20 library holdings
Roles: Author
Classifications: BQ4570.S3, 294.3365
Publication Timeline
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

Besides the insight they provide into the optimal computational strategy, the methods of solution of the isoperimetric problems, such as the use of the Wulff Crystal, are of interest in their own right. An analytic study of the least-cost configuration for a multiple-pipeline WSA machine is undertaken. The use of overlap-save method is described, and the efficiency of the WSA architecture using this method is derived. A numerical search is used to find the least cost machine configuration as the problem size is scaled. A slightly super-linear speedup is shown over a moderate range of problem sizes, and the least-cost machine parameters are described
Religion and science in the mirror of Buddhism by Francisca Cho( Book )

2 editions published in 2015 in English and held by 5 WorldCat member libraries worldwide

Computease : an introduction to computers, networks and issues of the information age( Book )

1 edition published in 1998 in English and held by 3 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

Abstract: "We describe a test method for lattice-gas automata of the type introduced by Frisch, Hasslacher, and Pomeau. The test method consists of inserting test patterns into the initial state of the automaton and using a graphics display to detect errors. The test patterns are carefully constructed limit cycles that are disrupted by errors occurring at any level of the simulator system. The patterns can be run independently to test the system for debugging purposes, or they can be run as sub-simulations embedded in a larger lattice-gas simulation to detect faults at runtime. We describe the use of this method on a prototype parallel machine for lattice-gas simulations, and discuss the range of systems that can make use of this type of test method
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
Audience Level
  Kids General Special  
Audience level: 0.68 (from 0.46 for Computease ... to 0.76 for Efficient, ...)