High-Performance Scientific Computing

Algorithms and Applications

  • Michael W. Berry
  • Kyle A. Gallivan
  • Efstratios Gallopoulos
  • Ananth Grama
  • Bernard Philippe
  • Yousef Saad
  • Faisal Saied

Table of contents

  1. Front Matter
    Pages I-XIII
  2. Kyle A. Gallivan, Efstratios Gallopoulos, Ananth Grama, Bernard Philippe, Eric Polizzi, Yousef Saad et al.
    Pages 1-44
  3. William Jalby, David C. Wong, David J. Kuck, Jean-Thomas Acquaviva, Jean-Christophe Beyler
    Pages 75-95
  4. Harmen L. A. van der Spek, C. W. Mattias Holm, Harry A. G. Wijshoff
    Pages 97-122
  5. Jack Dongarra, Jakub Kurzak, Piotr Luszczek, Stanimire Tomov
    Pages 123-146
  6. Carl Christian Kjelgaard Mikkelsen
    Pages 147-156
  7. Murat Manguoglu
    Pages 171-184
  8. Martin Bečka, Gabriel Okša, Marián Vajteršic
    Pages 185-197
  9. Allison H. Baker, Robert D. Falgout, Tzanio V. Kolev, Ulrike Meier Yang
    Pages 261-279
  10. Kyle A. Gallivan, Chunhong Qi, P.-A. Absil
    Pages 281-293
  11. Mu Wang, Xiaoge Wang
    Pages 295-310
  12. Andrey A. Puretskiy, Michael W. Berry
    Pages 327-342
  13. Back Matter
    Pages 343-346

About this book


Advances in the development of parallel algorithms and system software now enable the ever-increasing power of scalable high-performance computers to be harnessed for scientific computing applications at fidelities that rival – and in many cases exceed – experimental methodologies.

This comprehensive text/reference, inspired by the visionary work of Prof. Ahmed H. Sameh, represents the state of the art in parallel numerical algorithms, applications, architectures, and system software. Articles in this collection address solutions to various challenges arising from concurrency, scale, energy efficiency, and programmability. These solutions are discussed in the context of diverse applications, ranging from scientific simulations to large-scale data analysis and mining.

Topics and features:

  • Includes contributions from an international selection of world-class authorities, inspired by the work of Prof. Ahmed H. Sameh
  • Examines various aspects of parallel algorithm-architecture interaction through articles on computational capacity-based codesign and automatic restructuring of programs using compilation techniques
  • Reviews emerging applications of numerical methods in information retrieval and data mining
  • Discusses the latest issues in dense and sparse matrix computations for modern high-performance systems, multicores, manycores and GPUs, and several perspectives on the Spike family of algorithms for solving linear systems
  • Presents outstanding challenges and developing technologies, and puts these in their historical context

This authoritative reference is a must-read for researchers and graduate students in disciplines as diverse as computational fluid dynamics, signal processing, and structural mechanics. Professionals involved in applications that rely on high-performance computers will also find the text an essential resource.


High Performance Computing Parallel Linear Algebra Parallel Numerical Algorithms Parallel Solvers Scientific Computing

Editors and affiliations

  • Michael W. Berry
    • 1
  • Kyle A. Gallivan
    • 2
  • Efstratios Gallopoulos
    • 3
  • Ananth Grama
    • 4
  • Bernard Philippe
    • 5
  • Yousef Saad
    • 6
  • Faisal Saied
    • 7
  1. 1.Dept. Electrical Eng. & Computer ScienceUniversity of TennesseeKnoxvilleUSA
  2. 2.Department of MathematicsFlorida State UniversityTallahasseeUSA
  3. 3.Dept. Computer Engineering & InformaticsUniversity of PatrasPatrasGreece
  4. 4.Department of Computer SciencePurdue UniversityWest LafayetteUSA
  5. 5.IRISAINRIA Rennes - Bretagne AtlantiqueRennesFrance
  6. 6.Dept. of Computer Science & EngineeringUniversity of MinnesotaMinneapolisUSA
  7. 7.Department of Computer SciencePurdue UniversityWest LafayetteUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag London Limited 2012
  • Publisher Name Springer, London
  • eBook Packages Computer Science
  • Print ISBN 978-1-4471-2436-8
  • Online ISBN 978-1-4471-2437-5
  • Buy this book on publisher's site