Cover of Communication Complexity and Parallel Computing
Read Time: ~5.6 hr

Communication Complexity and Parallel Computing

by Juraj Hromkovič (1997)

About this book

This book is devoted to the investigation of a special topic in theoretical computer science - communication complexity as an abstract measure of the complexity of computing problems. Its main aim is to show how the theoretical study of communication complexity can be useful in the process of designing effective parallel algorithms. The author shows how to get important information about the parallel complexity (parallel time, the number of processors, the descriptional complexity of the topology of the parallel architecture) of specific computing problems from knowledge of their communication complexity. The book is written as a textbook for undergraduate and graduate students and provides a careful explanation of the subject as well as motivation for further research.

Setting / LocationGlobal
Story EraModern Era
Protagonist / CoreCommunication Complexity and Parallel Computing Lead Character

Readers who enjoyed this also loved

Cover of Foundations Of Geometric Algebra Computing

Foundations Of Geometric Algebra Computing

Dietmar Hildenbrand

<p>The author defines “Geometric Algebra Computing” as the geometrically intuitive development of algorithms using geometric algebra with a focus on their efficient implementation, and the goal of this book is to lay the foundations for the widespread use of geometric algebra as a powerful, intuitive mathematical language for engineering applications in academia and industry. The related technology is driven by the invention of conformal geometric algebra as a 5D extension of the 4D projective geometric algebra and by the recent progress in parallel processing, and with the specific conformal geometric algebra there is a growing community in recent years applying geometric algebra to applications in computer vision, computer graphics, and robotics.</p><p><p>This book is organized into three parts: in Part I the author focuses on the mathematical foundations; in Part II he explains the interactive handling of geometric algebra; and in Part III he deals with computing technology for high-performance implementations based on geometric algebra as a domain-specific language in standard programming languages such as C++ and OpenCL. The book is written in a tutorial style and readers should gain experience with the associated freely available software packages and applications.</p><p>The book is suitable for students, engineers, and researchers in computer science, computational engineering, and mathematics.

Cover of Developments in Reliable Computing

Developments in Reliable Computing

Tibor Csendes

The present volume contains 30 articles presented at SCAN-98, Budapest, Hungary. These papers cover all aspects of validation techniques in scientific computing, ranging from hardware requirements, elementary operations, high accuracy function evaluations and interval arithmetic to advanced validating techniques and applications in various fields of practical interest. Audience: This book is of interest to researchers and graduate students whose work involves validation techniques in scientific computing.

Cover of Periodic Integral and Pseudodifferential Equations with Numerical Approximation

Periodic Integral and Pseudodifferential Equations with Numerical Approximation

Jukka Saranen, Gennadi Vainikko

Classical boundary integral equations arising from the potential theory and acoustics (Laplace and Helmholtz equations) are derived. Using the parametrization of the boundary these equations take a form of periodic pseudodifferential equations. A general theory of periodic pseudodifferential equations and methods of solving are developed, including trigonometric Galerkin and collocation methods, their fully discrete versions with fast solvers, quadrature and spline based methods. The theory of periodic pseudodifferential operators is presented in details, with preliminaries (Fredholm operators, periodic distributions, periodic Sobolev spaces) and full proofs. This self-contained monograph can be used as a textbook by graduate/postgraduate students. It also contains a lot of carefully chosen exercises.

Cover of Algebra for computer science

Algebra for computer science

Lars Gårding, Torbjörn Tambour

The aim of this book is to teach the reader the topics in algebra which are useful in the study of computer science. In a clear, concise style, the author present the basic algebraic structures, and their applications to such topics as the finite Fourier transform, coding, complexity, and automata theory. The book can also be read profitably as a course in applied algebra for mathematics students.

Communication Complexity and Parallel Computing by Juraj Hromkovič | Literally Just Books