Ads
related to: introduction to parallel algorithms book
Search results
Results from the WOW.Com Content Network
In computer science, a parallel algorithm, as opposed to a traditional serial algorithm, is an algorithm which can do multiple operations in a given time. It has been a tradition of computer science to describe serial algorithms in abstract machine models, often the one known as random-access machine .
The WT framework was adopted as the basic presentation framework in the parallel algorithms books JaJa (1992) and Keller, Kessler & Traeff (2001), as well as in the class notes Vishkin (2009). In the WT framework, a parallel algorithm is first described in terms of parallel rounds.
Introduction to Algorithms is a book on computer programming by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.The book is described by its publisher as "the leading algorithms text in universities worldwide as well as the standard reference for professionals". [1]
An algorithm that exhibits linear speedup is said to be scalable. [6] Analytical expressions for the speedup of many important parallel algorithms are presented in this book. [10] Efficiency is the speedup per processor, S p / p. [6] Parallelism is the ratio T 1 / T ∞. It represents the maximum possible speedup on any number of processors.
Many parallel programs require that their subtasks act in synchrony. This requires the use of a barrier. Barriers are typically implemented using a lock or a semaphore. [27] One class of algorithms, known as lock-free and wait-free algorithms, altogether avoids the use of locks and barriers. However, this approach is generally difficult to ...
These parallel algorithms are also known for being simple, by standards of other approaches to parallel algorithms. This large body of parallel algorithms knowledge for the PRAM model and their relative simplicity motivated building computers whose programming can be guided by these parallel algorithms.
In computing, a parallel programming model is an abstraction of parallel computer architecture, with which it is convenient to express algorithms and their composition in programs. The value of a programming model can be judged on its generality : how well a range of different problems can be expressed for a variety of different architectures ...
Batcher is credited with discovering two important parallel sorting algorithms: the odd-even mergesort and the bitonic mergesort. [ 6 ] [ 7 ] Batcher is known for his half-serious, half-humorous definition that "A supercomputer is a device for turning compute-bound problems into I/O-bound problems."
Ads
related to: introduction to parallel algorithms book