High-Performance Scientific Computing - Algorithms and Applications (Paperback, 2012 ed.)

This book presents the state of the art in parallel numerical algorithms, applications, architectures, and system software. The book examines various solutions for issues of concurrency, scale, energy efficiency, and programmability, which are discussed in the context of a diverse range of applications. Features: includes contributions from an international selection of world-class authorities; examines parallel algorithm-architecture interaction through issues of 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.

General

Imprint:	Springer London
Country of origin:	United Kingdom
Release date:	February 2014
First published:	2012
Editors:	Michael W. Berry • Kyle A. Gallivan • Efstratios Gallopoulos • Ananth Grama • Bernard Philippe • Yousef Saad • Faisal Saied
Dimensions:	235 x 155 x 19mm (L x W x T)
Format:	Paperback
Pages:	350
Edition:	2012 ed.
ISBN-13:	978-1-4471-5888-2
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers Books > Computing & IT > Applications of computing > Databases > General
LSN:	1-4471-5888-1
Barcode:	9781447158882

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!