My Wish Lists Login / Join

Efficient Parallel Algorithms

By: No Information Available

Write A Review

Paperback | 2 April 1990

At a Glance

Paperback
268 Pages

Dimensions(cm)
23.5 x 19.1 x 1.4

Paperback

RRP $95.95

$86.75

10%OFF

or 4 interest-free payments of $21.69 with

Ships in 5 to 7 business days

This is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelisation. It is self-contained and presumes no special knowledge of parallel computers or particular mathematics. The book emphasises designing algorithms within the timeless and abstracted context of a high-level programming language rather than within highly specific computer architectures. This is an approach which concentrates on the essence of algorithmic theory, determining and taking advantage of the inherently parallel nature of certain types of problem. The authors present regularly-used techniques and a range of algorithms which includes some of the more celebrated and well-known. Efficient Parallel Algorithms is targeted at non-specialists who are considering entering the field of parallel algorithms. It will be particularly useful for courses aimed at advanced undergraduate or new postgraduate students of computer science and mathematics.

Industry Reviews

"...a coherent introduction for all those who wish to enter this new field of research...a valuable contribution to the expository literature and will certainly become a favoured introduction to the field of parallel algorithms." Mathematical Reviews "Highly recommended." Choice "...a successful introduction to the area of parallel algorithms and to methods for parallelisation." N. I. Yanev, Mathematical Reviews

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Mathematics Algebra Computing & I.T.Computer Science Computer Architecture & Logic Design Parallel Processing Computer Programming & Software Development Algorithms & Data Structures Applied Mathematics Mathematical Modelling Programming & Scripting Languages

Preface	p. vii
Introduction	p. 1
The model of parallel computation	p. 2
Some general algorithmic techniques	p. 6
Reducing the number of processors	p. 11
Examples of fast parallel computations on vectors and lists	p. 13
Bibliography	p. 19
Graph algorithms	p. 20
Parallel computations on trees	p. 21
Paths, spanning trees, connected components and blocks	p. 24
Eulerian circuits and maximal matchings	p. 40
Colouring of graphs	p. 56
Bibliographic notes	p. 85
Bibliography	p. 85
Expression evaluation	p. 88
Constructing the expression tree	p. 88
A parallel pebble game with applications to expression evaluation	p. 95
An optimal parallel algorithm for expression evaluation	p. 103
The optimal parallel transformation of regular expressions to non-deterministic finite automata	p. 112
Evaluation of generalised expressions: straight-line programs	p. 122
More efficient algorithms for dynamic programming	p. 133
A more algebraic point of view: a method of simultaneous substitutions	p. 138
Bibliographic notes	p. 139
Bibliography	p. 140
Parallel recognition and parsing of context-free languages	p. 142
Parallel recognition of general context-free languages	p. 143
Parallel recognition of unambiguous context-free languages	p. 154
Parallel parsing of general context-free languages	p. 158
Optimal parallel recognition and parsing of bracket languages	p. 165
Optimal parallel recognition of input-driven languages	p. 175
Bibliographic notes	p. 178
Bibliography	p. 179
Fast parallel sorting	p. 180
Batcher's sorting networks	p. 181
Cole's optimal parallel merge sort	p. 188
A theoretical optimal sorting network: Paterson's version of the algorithm of Ajtai, Komlos and Szemeredi	p. 198
Bibliographic notes	p. 215
Bibliography	p. 215
Parallel string matching	p. 217
Analysis of the text	p. 219
Preprocessing the pattern	p. 225
Complexity of the whole pattern-matching algorithm	p. 233
Bibliographic notes	p. 234
Bibliography	p. 234
P-completeness: hardly parallelisable problems	p. 235
A first P-complete problem	p. 236
A selection of P-complete problems	p. 240
Bibliographic notes	p. 254
Bibliography	p. 255
Index of definitions, techniques and algorithms	p. 257
Table of Contents provided by Syndetics. All Rights Reserved.

Efficient Parallel Algorithms

At a Glance

Paperback

Industry Reviews

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Parallel Processing

Building Microservices

Designing Fine-Grained Systems 2nd Edition

Learning Opentelemetry

Setting Up and Operating a Modern Observability System

Site Reliability Engineering

How Google Runs Production Systems

Making Embedded Systems

2nd Edition - Design Patterns for Great Software

Fundamentals of Software Architecture, 2nd Edition

A Modern Engineering Approach

Cloud Computing

Concepts and Technologies

Introduction to High Performance Computing for Scientists and Engineers

Chapman & Hall/CRC Computational Science

Building Resilient Distributed Systems

Patterns and Practices for Stable Software

Modern Concurrency in Java

A Deep Dive Into Virtual Threads, Structured Concurrency, and Scoped Values

Server-Side Webassembly

Building Portable and Secure Multi-Language Apps

The Book of WebGPU

MLOps with Databricks

Machine Learning End-To-End

Rust Atomics and Locks

Low-Level Concurrency in Practice

Software Architecture: The Hard Parts

Modern Trade-Off Analyses for Distributed Architectures

Observability Engineering

Achieving Production Excellence

The Coder Cafe

Euro-Par 2025: Parallel Processing Workshops

Euro-Par 2025 Satellite Events, Dresden, Germany, August 25-29, 2025, Revised Selected Papers

Technology Strategy Patterns

Architecture as Strategy

Programming Android with Kotlin

Achieving Structured Concurrency with Coroutines

Foundations of Scalable Systems

Designing Distributed Architectures

Fundamentals of Metadata Management

Uncover the Meta Grid and Unlock Data, Information, and Knowledge Management

Modern System Administration

Managing Reliable and Sustainable Systems

Practical Microservices

Build Event-Driven Architectures with Event Sourcing and Cqrs

Flow Architectures

The Future of Streaming and Event-Driven Integration

This product is categorised by