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
Non-Universality in Computation, and the Demise of the Church-Turing Thesis †
Naya Nagy,Selim G. Akl +1 more
TL;DR: The focus of the work is to analyze the effect of external natural phenomena on the various components of a computational process, namely, the input phase, the calculation phase (including the algorithm and the computing agents themselves), and the output phase.
Posted Content
NC Algorithms for Popular Matchings in One-Sided Preference Systems and Related Problems
Changyong Hu,Vijay K. Garg +1 more
TL;DR: In this paper, the first NC algorithm for the popular matching problem without ties was given, which is the only NC algorithm known for the matching problem in preference systems prior to this work.
Book ChapterDOI
Work-sensitive Dynamic Complexity of Formal Languages
TL;DR: In this article, the authors study the amount of work required for dynamically answering membership and range queries for formal languages in parallel constant time with polynomially many processors, and propose a framework for specifying dynamic, parallel, constant-time programs that require small amounts of work.
Proceedings ArticleDOI
Performance and Scalability of XML Query Processing
Gaetan Hains,Muath Alrammal +1 more
TL;DR: This paper discusses basic issues about the performance of semi-structured query processing in very large data sets based on recent algorithm-engineering work, on the state of the art in performance management for XML query processing and on theoretical studies about the complexity structure of the querying problem.
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.