Lattice Gas: An Efficient and Reusable Parallel Library Based on a Graph Partitioning Technique

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.

[1]  Roberto Battiti,et al.  Randomized greedy algorithms for the hypergraph partitioning problem , 1997, Randomization Methods in Algorithm Design.

[2]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[3]  Catherine A. Schevon,et al.  Optimization by simulated annealing: An experimental evaluation , 1984 .

[4]  Lie Wang,et al.  Towards a fast implementation of spectral nested dissection , 1992, Proceedings Supercomputing '92.

[5]  Roberto Battiti,et al.  Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning , 1999, IEEE Trans. Computers.

[6]  Pierre Kuonen,et al.  Parallel irregular software for wave propagation simulation , 1998, Future Gener. Comput. Syst..

[7]  Byung Ro Moon,et al.  Genetic Algorithm and Graph Partitioning , 1996, IEEE Trans. Computers.

[8]  Daniel H. Rothman,et al.  Lattice-Gas Cellular Automata: Simple Models of Complex Hydrodynamics , 1997 .

[9]  Gregor von Laszewski,et al.  Partitioning a Graph with a Parallel Genetic Algorithm , 1990, PPSN.

[10]  Manuel Laguna,et al.  A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem , 1994, Oper. Res..

[11]  George Karypis,et al.  A Software Package for Partitioning Unstructured Graphs , Partitioning Meshes , and Computing Fill-Reducing Orderings of Sparse Matrices Version 5 . 0 , 1998 .

[12]  Bruce Hendrickson,et al.  An empirical study of static load balancing algorithms , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[13]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[14]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[15]  Bastien Chopard,et al.  Cellular Automata Modeling of Physical Systems: Index , 1998 .

[16]  Pierre Kuonen,et al.  Parallel Irregular Software for Wave Propagation Simulation , 1997, HPCN Europe.

[17]  B. Chopard,et al.  Lattice Boltzmann method for wave propagation in urban microcells , 1997 .

[18]  Rocco Rongo,et al.  A Parallel Cellular Environment for High Performance Scientific Computing , 1996, HPCN Europe.

[19]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..