A Parallel Algorithm Synthesis Procedure for High-Performance Computer Architectures
Autor Gerard G. L. Meyer, Ian N. Dunnen Limba Engleză Hardback – 30 apr 2003
To navigate this environment, algorithm designers need a road map, a detailed procedure they can use to efficiently develop high performance, portable parallel algorithms. The focus of this book is to draw such a road map. The Parallel Algorithm Synthesis Procedure can be used to design reusable building blocks of adaptable, scalable software modules from which high performance signal processing applications can be constructed. The hallmark of the procedure is a semi-systematic process for introducing parameters to control the partitioning and scheduling of computation and communication. This facilitates the tailoring of software modules to exploit different configurations of multiple processors, multiple floating-point units, and hierarchical memories. To showcase the efficacy of this procedure, the book presents threecase studies requiring various degrees of optimization for parallel execution.
Preț: 618.74 lei
Preț vechi: 773.43 lei
-20% Nou
Puncte Express: 928
Preț estimativ în valută:
109.47€ • 127.54$ • 95.60£
109.47€ • 127.54$ • 95.60£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780306477430
ISBN-10: 0306477432
Pagini: 128
Ilustrații: XI, 108 p.
Dimensiuni: 160 x 241 x 12 mm
Greutate: 0.37 kg
Ediția:2003
Editura: Springer Us
Locul publicării:New York, NY, United States
ISBN-10: 0306477432
Pagini: 128
Ilustrații: XI, 108 p.
Dimensiuni: 160 x 241 x 12 mm
Greutate: 0.37 kg
Ediția:2003
Editura: Springer Us
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
1. Introduction.- Notation and Conventions.- Organization.- 2. Parallel Computing.- 1 Architectures.- 2 Programming Models.- 3 Performance Metrics.- 3. Parallel Algorithm Synthesis Procedure.- 1 Architectural Model for Algorithm Synthesis.- 2 Synthesis Procedure.- 3 Related Work.- 4. Review of Matrix Factorization.- 1 Givens-based Solution Procedures.- 2 Householder-based Solution Procedures.- 5. Case Study 1: Parallel Fast Givens QR.- 1 Parallel Fast Givens Algorithm.- 2 Communication Procedures.- 3 Related Work.- 4 Experimental Results.- 6. Case Study 2: Parallel Compact WY QR.- 1 Parallel Compact WY Algorithm.- 2 Related Work.- 3 Experimental Results.- 7. Case Study 3: Parallel Bidiagonalization.- 1 Parallel Matrix Bidiagonalization Algorithm.- 2 Related Work.- 3 Experimental Results.- 8. Conclusion.- References.