Sparse matrix structure for dynamic parallelisation efficiency

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1900, Issue , 2000, Pages 519-526

  Ast, Markus ^a   Barrado, Cristina ^b   Cela, José ^b   Fischer, Rolf ^a   Labarta, Jesús ^b   Laborda, Óscar ^b   Manz, Hartmut ^a   Schulz, Uwe ^a  

^a INTES Ingenieurgesellschaft für Technische Software mbH   (Germany)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE; DOMAIN DECOMPOSITION METHODS; PARALLEL PROCESSING SYSTEMS; SCHEDULING;

COMPUTATIONAL FLUIDS DYNAMICS; DATA DISTRIBUTION; DYNAMIC SCHEDULERS; ENGINEERING PROGRAM; MULTIPROCESSOR NETWORKS; PARALLELISATION; SINGLE PROCESSORS; STRUCTURAL MECHANICS;

MATRIX ALGEBRA;

EID: 33745307914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44520-x_69     Document Type: Conference Paper

References (12)

1. Abaqus product performance. http://www.abaqus.com/products/p_performace58.htm
2. M. Ast, R. Fischer, J. Labarta and H. Manz. “Run-Time Parallelization of Large FEM Analyses with PERMAS”. NASA’97 National Symposium. 1997.
3. T. Bui and C. Jones “A heuristic for reducing fill in sparse matrix factorization”. 6th SIAM Conf. Parallel Processing for Scientific Computing, pp.445-452, 1993.
4. S. Fink, S. Baden and S. Kohn. “Efficient Run-Time Support for Irregular Block-Structured Applications”. Journal of Parallel and Distributed Computing 50, pp.61-82. 1998.
5. T. Johnson. “A concurrent Dynamic Task Graph”. International Conference on Parallel Processing, 1993.
6. G. Karypis and V. Kumar. “A fast and highly quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing. 1995.
7. L. Komzsik, “Parallel Processing in MSC/Nastran’. 1993 MSC World Users Conference, Virginia, 1993. http://www.macsch.com
8. V. Kumar et al. “Introduction to parallel Computing. Design and analysis of algorithms. The Benjamin/Cumminngs Pub. 1994.
9. J. Liu. “Computational models and task scheduling for parallel sparse Cholesky factorization”. Parallel Computing 3, pp.327-342, 1986.
10. Marc product description. http://www.marc.com/Product/MARC
11. R. Schreiber. “Scalability of sparse direct solvers”. Graph theory and sparse matrix computations, The IMA volumes in mathematics and its applications, vol. 56, pp.191-209, 1993.
12. S. Venugopal, V. Naik. “Effects of partitioning and scheduling sparse matrix factorization on communications and load balance”. Supercomputing’91, pp.866-875, 1991.