Basic techniques for numerical linear algebra on bulk synchronous parallel computers

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

Volumn 1196, Issue , 1997, Pages 46-57

  Bisseling, Rob H ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; LINEAR ALGEBRA; NUMERICAL ANALYSIS;

BULK SYNCHRONOUS PARALLEL; BULK SYNCHRONOUS PARALLEL MODELS; COMMUNICATION TIME; LU DECOMPOSITION; MACHINE PARAMETERS; NUMERICAL EXPERIMENTS; NUMERICAL LINEAR ALGEBRA; PORTABLE SOFTWARE;

PARALLEL PROCESSING SYSTEMS;

EID: 84944457322     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62598-4_78     Document Type: Conference Paper

References (15)

1. R. H. Bisseling and L. D. J. C. Loyens. Towards peak parallel LINPACK performance on 400 transputers. Supercomputer, 45:20-27, 1991.
2. R. H. Bisseling and W. F. McColl. Scientific computing on bulk synchronous parallel architectures. In B. Pehrson and I. Simon, editors, Technology and Foundations: In]ormation Processing '9, Vol. 1, volume 51 of IFIP Transactions A, pages 509-514. Elsevier Science Publishers, Amsterdam, 1994.
3. R. It. Bisseling and J. G. G. van de Vorst. Parallel LU decomposition on a transpurer network. In G. A. van Zee and J. G. G. van de Vorst, editors, Parallel Computing 1988, volume 384 of Lecture Notes in Computer Science, pages 61-77. Springer-Verlag, Berlin, 1989.
4. J. J. Dongarra and D. W. Walker. Software fibraries for linear algebra computations on high performance computers. SIAM Review, 37(2):151-180, 1995.
5. G. C. Fox, M. A. Johnson, G. A. Lyzenga, S. W. Otto, K. Salmon, and D. W. Walker. Solving Problems on Concurrent Processors: Vol. I, General Techniques and Regular Problems. Prentice Hall, Englewood Cliffs, N J, 1988.
6. A. V. Gerbessiotis and L. G. Valiant. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22(2):251-267, 1994.
7. M. W Goudreau, J. M. D. Hill, K. Lung, B. McColl, S. B. Rao, D. C. Stefanescu, T. Suel, and T. Tsantilas. A proposal for the BSP Worldwide standard library. Technical report, Oxford Parallel, Oxford, UK, Apr. 1996.
8. B. A. Hendrickson and D. E. Womble. The torus-wrap mapping for dense matrix calculations on massively parallel computers. SIAM Journal on Scientific Computing, 15(5):1201-1226, 1994.
9. B. H. H. Juurlink and H. A. G. Wijshoff, Communication primitives for BSP computers. Information Processing Letters, to appear, 1996.
10. W. F. McColl. Scalable computing. In :J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, volume 1000 of Lecture Notes in Computer Science, pages 46-61. Springer-Verlag, Berlin, 1995.
11. R. Miller. A library for bulk synchronous parallel programming. In General Purpose Parallel Computing, pages 100-108. British Computer Society Parallel Processing Specialist Group, 1993.
12. D. P. O'Leary and G. W. Stewart. Data-flow algorithms for parallel matrix computations. Communications of the ACM, 28(8):840-853, 1985.
13. P. Timmers. Implementing dense Cholesky factorization on a BSP computer. Master's thesis, Department of Mathematics, Utrecht University, Utrecht, the Netherlands, June 1994.
14. L. G. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11:350-361, 1982.
15. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.