David W. Walker

David W. Walker

Auto-generated profile, based on publicly available information

David W. Walker

Cardiff University

Research Focus & Metrics

Academic Career Length

39Years (1988-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 1996 in Applied Numerical Mathematics
Verified
Journal Article
Closed access
JDJ.J. Dongarra
J.J. Dongarra
BSB. Straughan
B. Straughan
DWD.W. Walker
D.W. Walker

22 May 1995 in Scientific Programming
Verified
Journal Article
Open access
PDF file
JCJaeyoung Choi
Jaeyoung Choi
JDJack J. Dongarra
Jack J. Dongarra
LOL. Susan Ostrouchov
L. Susan Ostrouchov
APAntoine P. Petitet
Antoine P. Petitet
DWDavid W. Walker
David W. Walker
RWR. Clint Whaley
R. Clint Whaley
This article discusses the core factorization routines included in the ScaLAPACK library. These routines allow the factorization and solution of a dense system of linear equations via LU, QR, and Cholesky. They are implemented using a block cyclic data distribution, and are built using de facto standard kernels for matrix and vector operations (BLAS and its parallel counterpart PBLAS) and message passing communication (BLACS). In implementing the ScaLAPACK routines, a major objective was to parallelize the corresponding sequential LAPACK using the BLAS, BLACS, and PBLAS as building blocks, leading to straightforward parallel implementations without a significant loss in performance. We present the details of the implementation of the ScaLAPACK factorization routines, as well as performance and scalability results on the Intel iPSC/860, Intel Touchstone Delta, and Intel Paragon System.

1 October 1994 in Concurrency: Practice and Experience
Verified
Journal Article
Closed access
PDF file
JCJaeyoung Choi
Jaeyoung Choi
DWDavid W. Walker
David W. Walker
JDJack J. Dongarra
Jack J. Dongarra

1 June 1995 in SIAM Review
Verified
Journal Article
Closed access
JDJack J. Dongarra
Jack J. Dongarra
DWDavid W. Walker
David W. Walker
This paper discusses the design of linear algebra libraries for high performance computers. Particular emphasis is placed on the development of scalable algorithms for multiple instruction multiple data (MIMD) distributed memory concurrent computers. A brief description of the EISPACK, LINPACK, and LAPACK libraries is given, followed by an outline of ScaLAPACK, which is a distributed memory version of LAPACK currently under development. The importance of block-partitioned algorithms in reducing the frequency of data movement between different levels of hierarchical memory is stressed. The use of such algorithms helps reduce the message startup costs on distributed memory concurrent computers. Other key ideas in our approach are the use of distributed versions of the Level 2 and Level 3 basic linear algebra subprograms (BLAS) as computational building blocks, and the use of basic linear algebra communication subprograms (BLACS) as communication building blocks. Together the distributed BLAS and the BLACS can be used to construct higher-level algorithms, and hide many details of the parallelism from the application developer. The block-cyclic data distribution is described and adopted as a good way of distributing block-partitioned matrices. Block-partitioned versions of the Cholesky and LU factorizations are presented, and optimization issues associated with the implementation of the LU factorization algorithm on distributed memory concurrent computers are discussed, together with its performance on the Intel Delta system. Finally, approaches to the design of library interfaces are reviewed.

1 August 1996 in Journal of Computational Physics
Verified
Journal Article
Closed access
BSB. Straughan
B. Straughan
DWD.W. Walker
D.W. Walker

1 July 1996 in Communications of the ACM
Verified
Journal Article
Open access
PDF file
JDJack J. Dongarra
Jack J. Dongarra
SOSteve W. Otto
Steve W. Otto
MSMarc Snir
Marc Snir
DWDavid Walker
David Walker
This article discussessome of MPI's more interesting features,including point-to-point communication, userdefineddatatypes, collective communications, andgroups, contexts, and communicators.