Sparse Matrix Structure for Dynamic Parallelisation Efficiency-Reference-Cited by-同舟云学术

Sparse Matrix Structure for Dynamic Parallelisation Efficiency

Published:2000 Issue: Volume: Page:519-526
ISSN:0302-9743
Container-title:Euro-Par 2000 Parallel Processing
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44520-X_69

Reference12 articles.

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.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hypermatrix oriented supernode amalgamation;The Journal of Supercomputing;2008-03-04

2. Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking;Applicable Algebra in Engineering, Communication and Computing;2007-03-06

3. Optimization of a Statically Partitioned Hypermatrix Sparse Cholesky Factorization;Applied Parallel Computing. State of the Art in Scientific Computing;2006

4. Improving Performance of Hypermatrix Cholesky Factorization;Euro-Par 2003 Parallel Processing;2003

5. Reducing Overhead in Sparse Hypermatrix Cholesky Factorization;High Performance Computational Science and Engineering