Mesh partitioning for distributed systems

Proceedings - 7th International Symposium on High Performance Distributed Computing, HPDC 1998

Volumn 1998-July, Issue , 1998, Pages 292-300

  Chen, Jian ^a   Taylor, V ^a  

^a Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED DATABASE SYSTEMS; EFFICIENCY; GRAPHIC METHODS; MESH GENERATION; NETWORK PERFORMANCE;

COMPLEX PROBLEMS; DISTRIBUTED SYSTEMS; FINITE ELEMENT MESHES; HIGH PERFORMANCE NETWORKS; HIGH PERFORMANCE SYSTEMS; IRREGULAR PROBLEMS; MESH PARTITIONING; PROCESSOR PERFORMANCE;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33847144605     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPDC.1998.710015     Document Type: Conference Paper

References (25)

1. Stephen T. Barnard and Horst D. Simon. A fast multilevel impelementation of recursive spectral bisection for partitioning unstrctured problems. Technical report, NAS systems Division, Applied Research Branch, NASA Ames Research Center, 1993.
2. M. Berger and S. Bokhari. A partitioning strategy for non-uniform problems on multiprocessors. IEEE Transactions on Computers, C-36:5, 1987.
3. H. C. Chen, H. Gao, and S. Sarma. WHAMS3D project progress report PR-2. Technical Report 1112, University of Illinois CSRD, 1991.
4. Phyllis E. Crandall andMichael Quinn. A partitioning advisory system for network data-parallel processing. Concurrency: Practice and Experience, 7(5):479-495, August 1995.
5. Charbel Farhat and Micel Lesoinne. Automatic partitioning of unstructured meshes for the parallel solution of problems in computationalmechanics. International Journal for Numerical Methods in Engineering, 36:745-764, 1993.
6. I. Foster, J. Geisler, W. Gropp, N. Karonis, E. Lusk, G. Thiruvathukal, and S. Tuecke. A wide-area implementation of the Message Passing Interface. Parallel Computing, 1998. to appear.
7. I. Foster, J. Geisler, C. Kesselman, and S. Tuecke. Multimethod communication for high-performance networked computing systems. Journal on Parallel and Distributed Computer, to appear.
8. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NPCompleteness. W.H. Freeman and Company, New York, 1979.
9. A. George and J. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, New Jersey, 1981.
10. Andrew S. Grimshaw, Wm. A. Wulf, and the Legion team. The legion vision of a worldwide virtual computer. Communications of the ACM, 40(1), January 1997.
11. B. Hendrickson and R. Leland. The chaco user's guide. Technical Report SAND93-2339, Sandia National Laboratory, 1993.
12. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. Technical report, Sandia National Laboratories, June 1993.
13. J. Jamison and R. Wilder. vbns: The internet fast lane for research and education. IEEE Communications Magazine, January 1997.
14. George Karypis and Vipin Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. Technical report, Department of Computer Science, University of Minnesota, 1995.
15. B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 29:291-307, 1970.
16. B. Nour-Omid, A. Raefsky, and G. Lyzenga. Solving finite element equations on concurrent computers. In A. K. Noor, editor, Parallel Computations and Their Impact on Mechanics. ASME, 1987.
17. Alex Pothen, Horst D. Simon, and Kang-Pu Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11(3):430-452, July 1990.
18. Horst D. Simon. Partitiong of unstructured problems for parallel processing. Computing Systems in Engineering, 2(2/3):135-148, 1991.
19. Horst D. Simon and Charbel Farhat. Top/domdec: a software tool for mesh partitioning and parallel processing. Technical report, Report RNR-93-011, NASA, July 1993.
20. Horst D. Simon, Andrew Sohn, and Rupak Biswas. Harp: A fast spectral partitioner. In Proceedings of the Ninth ACM Symposium on Parallel Algorithms and Architectures, Newport, Rhode Island, June 22-25 1997.
21. Larry Smarr. Toward the 21st century. Communications of the ACM, 40(11):28-32, November 1997.
22. Valerie E. Taylor and Jian Chen. A decomposition method for efficient use of distributed supercomputers for finite element applications. In Proceedings of the 10th International Conference on Application-specific Systems, Architectures and Processors, Chicago, Illinois, August 1996.
23. Valerie E. Taylor and Jian Chen. Part: A partitioning tool for efficient use of distributed systems. In Proceedings of the 11th International Conference on Application-specific Systems, Architectures and Processors, Sweden, August 1997.
24. D. Vanderstraeten, C. Farhat, P. S. Chen, R. Keunings, and O. Zone. A retrofit based methodology for the fast generation and optimization of large-scale mesh partitions: Beyond the minimum interface size criterion. Technical report, Center for Aerospace Structures, University of Colorado, September 1994.
25. C. Walshaw, M. Cross, and M. Everett. Parallel dynamic graph partitioning for adaptive unstructured meshes. J. Par. Dist. Comput., 47(2):102-108, 1997.