Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | A Parallel Algorithm Synthesis Procedure for High-Performance Computer Architectures

A Parallel Algorithm Synthesis Procedure for High-Performance Computer Architectures

Dunn, Ian N., Meyer, Gerard G.L.

2003, XI, 108 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$139.00

(net) price for USA

ISBN 978-1-4419-8650-4

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$179.00

(net) price for USA

ISBN 978-0-306-47743-0

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$179.00

(net) price for USA

ISBN 978-1-4613-4658-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Despite five decades of research, parallel computing remains an exotic, frontier technology on the fringes of mainstream computing. Its much-heralded triumph over sequential computing has yet to materialize. This is in spite of the fact that the processing needs of many signal processing applications continue to eclipse the capabilities of sequential computing. The culprit is largely the software development environment. Fundamental shortcomings in the development environment of many parallel computer architectures thwart the adoption of parallel computing. Foremost, parallel computing has no unifying model to accurately predict the execution time of algorithms on parallel architectures. Cost and scarce programming resources prohibit deploying multiple algorithms and partitioning strategies in an attempt to find the fastest solution. As a consequence, algorithm design is largely an intuitive art form dominated by practitioners who specialize in a particular computer architecture. This, coupled with the fact that parallel computer architectures rarely last more than a couple of years, makes for a complex and challenging design environment.

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 three case studies requiring various degrees of optimization for parallel execution.

Content Level » Research

Keywords » Scala - algorithm design - algorithm synthesis - algorithms - communication - computer - computer architecture - linear optimization - optimization - parallel computing - parallel programming - processor - programming - scheduling - signal processing

Related subjects » Algebra - Communication Networks - Computational Science & Engineering - Signals & Communication - Theoretical Computer Science

Table of contents 

1. Introduction. 2. Parallel Computing. 3. Parallel Algorithm Synthesis Procedure. 4. Review of Matrix Factorization. 5. Case Study 1: Parallel Fast Givens QR. 6. Case Study 2: Parallel Compact WY QR. 7. Case Study 3: Parallel Bidiagonalization. 8. Conclusion.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Theory of Computation.