Open AccessBook
An introduction to parallel algorithms
TLDR
This book provides an introduction to the design and analysis of parallel algorithms, with the emphasis on the application of the PRAM model of parallel computation, with all its variants, to algorithm analysis.Abstract:
Written by an authority in the field, this book provides an introduction to the design and analysis of parallel algorithms. The emphasis is on the application of the PRAM (parallel random access machine) model of parallel computation, with all its variants, to algorithm analysis. Special attention is given to the selection of relevant data structures and to algorithm design principles that have proved to be useful. Features *Uses PRAM (parallel random access machine) as the model for parallel computation. *Covers all essential classes of parallel algorithms. *Rich exercise sets. *Written by a highly respected author within the field. 0201548569B04062001read more
Citations
More filters
Book ChapterDOI
Optimized Pipelined Parallel Merge Sort on the Cell BE
Jörg Keller,Christoph Kessler +1 more
TL;DR: This work investigates mappings of merger nodes to SPEs, designed to provide optimal trade-offs between load balancing, buffer memory consumption, and communication load on the on-chip bus and solves this multi-objective optimization problem by deriving an integer linear programming formulation and compute Pareto-optimal solutions.
Journal ArticleDOI
Graph algorithms: parallelization and scalability
TL;DR: This position paper answers both questions in the affirmative about how to parallelize sequential graph algorithms and guarantee convergence at the correct results as long as the sequential algorithms are correct.
Proceedings ArticleDOI
Multi-Core Defense System (MSDS) for Protecting Computer Infrastructure against DDoS Attacks
TL;DR: This paper updates the research work by moving the bodyguard paradigm, which is to help security software developers from the current serialized paradigm, to a multi-core paradigm, into the new Ubiquitous Multi-Core Framework.
Journal ArticleDOI
Exploiting few inversions when sorting: sequential and parallel algorithms
TL;DR: The main results are that X can be sorted in-place, i.e. using only O ( log n ) bits of extra space, in time O(n log( Inv(X) n )) , which is optimal with respect to the number of inversions.
Posted Content
Parallel Batch-Dynamic $k$-Clique Counting
TL;DR: This paper studies new batch-dynamic algorithms for $k$-clique counting, which are dynamic algorithms where the updates are batches of edge insertions and deletions, and develops an algebraic algorithm based on parallel fast matrix multiplication.
References
More filters
Book
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
TL;DR: This chapter discusses sorting on a Linear Array with a Systolic and Semisystolic Model of Computation, which automates the very labor-intensive and therefore time-heavy and expensive process of manually sorting arrays.
Book
Computer Architecture and Parallel Processing
Kai Hwang,Faye A. Briggs +1 more
TL;DR: The authors have divided the use of computers into the following four levels of sophistication: data processing, information processing, knowledge processing, and intelligence processing.
Journal ArticleDOI
Data parallel algorithms
W. Daniel Hillis,Guy L. Steele +1 more
TL;DR: The success of data parallel algorithms—even on problems that at first glance seem inherently serial—suggests that this style of programming has much wider applicability than was previously thought.
Proceedings ArticleDOI
Parallelism in random access machines
Steven Fortune,James C. Wyllie +1 more
TL;DR: A model of computation based on random access machines operating in parallel and sharing a common memory is presented and can accept in polynomial time exactly the sets accepted by nondeterministic exponential time bounded Turing machines.
Journal ArticleDOI
The Parallel Evaluation of General Arithmetic Expressions
TL;DR: It is shown that arithmetic expressions with n ≥ 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can be evaluated in time 4 log 2 + 10(n - 1) using processors which can independently perform arithmetic operations in unit time.