Implementation of lattice gases using FPGAs

  • Paul Shaw
  • Paul Cockshott
  • Peter Barrie


Lattice gas models have been widely studied over the last decade due to their simplicity and scope for parallelism. Standard parallel computers based on the stored-program paradigm can run such models quickly but are expensive. We report here a new approach based on reconfigurable logic circuits. A circuit is constructed to realize the behaviour of the model. The suitability of this method is demonstrated by modelling sound propagation in a lattice gas. For this application it is shown that supercomputer performance can be achieved at a fraction of supercomputer cost.


Cellular Automaton Space Module Piston Position Adder Circuit Memory Board 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Gary D. Doolen (Ed.), “Lattice Gas Methods for Partial Differential Equations, Theory, Applications and Hardware,”Physica D, 47, 1991, Proceedings of the NATO Advanced Research Workshop, held at Los Alamos National Laboratory, September 1989.Google Scholar
  2. 2.
    P. Manneville, N. Boccara, G. Vichniac, and R. Bidaux (Eds.), “Cellular Automata and Modelling of Complex Physical Systems,”Springer Proceedings in Physics, Springer, Vol. 46, 1989, Proceedings of the Winter School, Les Houches, France, February 1989.Google Scholar
  3. 3.
    R. Monaco (Ed.), “Discrete Kinetic Theory, Lattice Gas Dynamics, and Foundations of Hydrodynamics,”World Scientific, 1989, Proceedings of the Workshop held in Torino, Italy, September 1988.Google Scholar
  4. 4.
    Tommaso Toffoli, “CAM: A high-performance cellular-automaton machine,”Physica D, Vol. 10, pp. 195–204, 1984.CrossRefGoogle Scholar
  5. 5.
    Tom Kean, “Configurable Logic: A Dynamically Programmable Cellular Architecture and its VLSI Implementation,” Ph.D. Thesis, University of Edinburgh, December 1989.Google Scholar
  6. 6.
    F. Raimbault, D. Lavenier, S. Rubini, and B. Pottier, “Fine grain parallelism on a MIMD machine using FPGAs,” D.A. Buell and K.L. Pocek (Eds.),Proceedings of IEEE Workshop on FPGAs for Custom Computing Machines, pp. 2–8, Napa, CA, April 1993.Google Scholar
  7. 7.
    M. Gokhale, W. Holmes, A. Kopser, S. Lucas, R. Minnich, D. Sweely, and D.Lopresti, “Building and using a highly parallel programmable logic array,”Computer, Vol. 24, No. 1, pp. 81–89, January 1991.CrossRefGoogle Scholar
  8. 8.
    Peter M. Athanas and A. Lynn Abbott, “Real-time image processing on a custom computing platform,”Computer, Vol. 28, No. 2, pp. 16–24, February 1995.CrossRefGoogle Scholar
  9. 9.
    Arne Linde, Tomas NordStröm, and Mikael Taveniku, “Using FPGAs to implement a reconfigurable highly parallel computer,”Proceedings of the Second International Workshop on Field-Programmable Logic and Applications, pp. 199–210, Springer-Verlag, Vienna, Austria, 1992.Google Scholar
  10. 10.
    N. Howard and R.W. Taylor, “Reconfigurable logic: Technology and applications,”Computing & Control Engineering Journal, Vol. 3, pp. 235–240, 1992.CrossRefGoogle Scholar
  11. 11.
    K. Bouazza, J. Champeau, P. Ng, B. Pottier, and S. Rubini, “Experimental cellular automata on the ArMen machine,” In P. Quinton and Y Robert (Eds.),Proceedings of the Workshop on Algorithms and Parallel VLSI Architectures II, Bonas, France, Elsevier Science Publishers, pp. 317–322, June 1993.Google Scholar
  12. 12.
    Paul Cockshott, Paul Shaw, Peter Barrie, and George J Milne, “Scalable cellular array architecture,”Computing & Control Engineering Journal, Vol. 3, pp. 219–224, 1992.CrossRefGoogle Scholar
  13. 13.
    Peter Barrie, Paul Cockshott, George J Milne, and Paul Shaw, “Design and verification of a highly concurrent machine,”Microprocessors and Microsystems, Vol. 16, pp. 115–123, 1992.CrossRefGoogle Scholar
  14. 14.
    J. Hardy, O. de Pazzis, and Y. Pomeau, “Molecular dynamics of a lattice gas: Transport properties and time correlation functions,”Physical Review A, Vol. 13, pp. 1949–1960, 1976.CrossRefGoogle Scholar
  15. 15.
    U. Frisch, B. Hasslacher, and Y. Pomeau, “Lattice-gas automata for the Navier-Stokes equation,”Physical Review Letters, Vol. 56, pp. 1505–1508, 1986.CrossRefGoogle Scholar
  16. 16.
    Tommaso Toffoli and Norman Margolus,Cellular Automata Machines, MIT Press, 1987.Google Scholar
  17. 17.
    Algotronix Ltd,CAL1024 DataSheet, 1992.Google Scholar
  18. 18.
    Tsutomu Shimomura, Gary D. Doolen, Brosl Hasslacher, and Castor Fu, “Calculations using lattice gas techniques,”Los Alamos Science, Special Issue, pp. 201–210, 1987.Google Scholar
  19. 19.
    Bruce M. Boghosian, “Lattice gases illustrate the power of cellular automata in physics,”Computers in Physics, pp. 585–590, 1991.Google Scholar
  20. 20.
    Tommaso Toffoli and Norman Margolus, “Programmable matter,”Physica D, Vol. 47, pp. 263–272, 1991.MathSciNetCrossRefGoogle Scholar
  21. 21.
    George Milne, Paul Cockshott, George McCaskill, and Peter Barrie, “Realising massively concurrent systems on the SPACE machine,” D.A. Buell and K.L. Pocek (Eds.),Proceedings of the IEEE Workshop on FPGAs for Custom Computing Machines, Napa, California, pp. 26–32, April 1993.Google Scholar
  22. 22.
    Gordon Russell, Paul Shaw, John McInnes, and Neil Ferguson, “The rapid simulation of urban traffic using field-programmable gate arrays,” Technical Report RR-159-94, Department of Computer Science, University of Strathclyde, June 1994.Google Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Paul Shaw
    • 1
  • Paul Cockshott
    • 1
  • Peter Barrie
    • 1
  1. 1.Department of Computer ScienceUniversity of StrathclydeGlasgow

Personalised recommendations