𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Parallel Algorithms

✍ Scribed by Harald RÀcke

Publisher
FakultΓ€t fΓΌr Informatik, Technische UniversitΓ€t MΓΌnchen
Year
2014
Tongue
English
Leaves
289
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Table of Contents

Organizational Matters
Contents
Literatur
Foundations
Introduction
PRAM Algorithms
Basic Algorithms
Prefix Sum
Parallel Prefix
Divide & Conquer β€” Merging
Maximum Computation
Inserting into a (2,3)-tree
Symmetry Breaking
List Ranking
Tree Algorithms
Searching and Sorting
Sorting Networks
Lower Bounds
Simulations between PRAMs
Some Networks

πŸ“œ SIMILAR VOLUMES

Parallel Algorithms
πŸ“ Parallel Algorithms
✍ M.H. Alsuwaiyel πŸ“‚ Library πŸ“… 2023 πŸ› World Scientific Publishing 🌐 English

This book is an introduction to the field of parallel algorithms and the underpinning techniques to realize the parallelization. The emphasis is on designing algorithms within the timeless and abstracted context of a high-level programming language. The focus of the presentation is on practical appl

Parallel Algorithms
πŸ“ Parallel Algorithms
✍ M. H. Alsuwaiyel πŸ“‚ Library πŸ“… 2022 πŸ› World Scientific Publishing 🌐 English
Parallel Algorithms
πŸ“ Parallel Algorithms
✍ Guy E. Blelloch, Bruce M. Maggs πŸ“‚ Library πŸ› Carnegie Mellon University (CMU) 🌐 English
Parallel Numerical Algorithms
πŸ“ Parallel Numerical Algorithms
✍ T. L. Freeman, C. Phillips πŸ“‚ Library πŸ“… 1992 πŸ› Prentice Hall 🌐 English

With the increasing use of more powerful multiprocessor computer systems comes the need to develop parallel implementations of numerical methods which were originally developed for use with uniprocessors. Focusing on shared and local memory MIMD parallel computer systems, this volume is designed to

Parallel Numerical Algorithms
πŸ“ Parallel Numerical Algorithms
✍ David E. Keyes (auth.), David E. Keyes, Ahmed Sameh, V. Venkatakrishnan (eds.) πŸ“‚ Library πŸ“… 1997 πŸ› Springer Netherlands 🌐 English

<p>In this volume, designed for computational scientists and engineers working on applications requiring the memories and processing rates of large-scale parallelism, leading algorithmicists survey their own field-defining contributions, together with enough historical and bibliographical perspectiv