Abstract
We present a parallel library which can be used for any lattice gas (LG) application. A highly reusable implementation, as well as a general parallelization scheme based on graph partitioning techniques are developed. We show that the performance we obtain with our approach compares favorably with the plain, classical implementation of LG models on regular domains whereas on irregular domains, it can even be better. We propose a theoretical expression for the execution time and we validate our analysis in the case of the problem of wave propagation in urban areas.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Rothman and S. Zaleski. Lattice-Gas Cellular Automata: Simple Models of Complex Hydrodynamics. Collection Aléa. Cambridge University Press, 1997.
B. Chopard and M. Droz. Cellular Automata Modeling of Physical Systems. Cambridge University Press, 1998.
Pascal O. Luthi. Lattice Wave Automata. PhD thesis, University of Geneva, 1998.
Frédéric Guidec, Patrice Calégari, and Pierre Kuonen. Parallel irregular software for wave propagation simulation. In HPCN'97 High-Parallel Computing and Networking, Lecture Notes in Computer Science, pages 84–94 Springer-Verlag, 1997.
S. Di Gregorio, R. Ringo, W. Spataro, Giandomenico Spezzano, and Domenico Talia. A parellel cellular environment for high performance scientific computing. In H. Liddell at al., editor, HPCN'96 High-Performance Computing and Networking, pages 514–521, Berlin, 1996. Springer-Verlag.
M. Garey, D. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoritical Computer Science, 1:237–267, 1976.
B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell system technical journal, 49(1):291–307, 1970.
Roberto Battiti, Alan Bertossi, and R. Rizzi. Randomized greedy algorithms for the hypergraph partitioning problem. In DIMACS Workshop on Randomization Methods in Algorithm Design, October 1997.
Roberto Battiti and Alan Bertossi. Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Transactions on Computers, to appear.
M. Laguna, T. A. feo, and H.C. Elrod. A greedy randomized adaptative search procedure for the two-partition problem. Operations Research, 42:667–687, 1994.
Thang Nguyen Bui and Byung Ro Moon. Genetic algorithm and graph partitioning. IEEE Transactions on Computers, 45(7):841–855, July 1996.
Gregor von Laszewski and Heinz Mühlenbein. Partitioning a graph with a parallel genetic algorithm. In Parallel problem solving from nature, pages 165–169, 1991.
D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation, Operations Research, 37:865–892, 1989.
Alex Pothen, H.D. Simon, Lien Wang, and Stephen T. Bernard. Towards a fast implementation of spectral nested dissection. In Supercomputing '92, pages 42–51, 1992.
George Karypis and Vipin Kumar. A fast and highly quality multilevel scheme for partitioning irregular graphs. Technical Report 95–035, Departement of Computer Science, University of Minnesota, 1995.
Robert Leland and Bruce Hendrickson. An, empirical study of static load balancing algorithms. In Scalable High-Performance Computing Conference (SHPCC'94), pages 682–685, 1994.
http://www-users.cs.umn.edu/~karypis/metis/.
George Karypis and Vipin Kumar. A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices, November 1997.
http://www.cs.sandia.gov/CRF/chac.html.
http://www.uni-paderborn.de/cs/robsy/party.html.
http://www.labri.u-bordeaux.fr/Equipe/ALiENor/membre/pelegrin/scotch/
B. Chopard, P.O. Luthi, and Jean-Frédéric Wagen. A lattice boltzmann method for wave propagation in urban microcells. IEEE Proceedings-Microwaves, Antennas and Propagation, 144:251–255, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag
About this paper
Cite this paper
Dupuis, A., Chopard, B. (1999). Lattice gas: An efficient and reusable parallel library based on a graph partitioning technique. In: Sloot, P., Bubak, M., Hoekstra, A., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1999. Lecture Notes in Computer Science, vol 1593. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0100593
Download citation
DOI: https://doi.org/10.1007/BFb0100593
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65821-4
Online ISBN: 978-3-540-48933-7
eBook Packages: Springer Book Archive