Faster Optimal Parallel Pre?x Sums and List Ranking - Softcover

Unknown

 
9781333329112: Faster Optimal Parallel Pre?x Sums and List Ranking

Synopsis

This book presents a new algorithm for the prefix sums problem which runs in optimal time using an optimal number of processors. This algorithm has applications to the list ranking problem. The author provides a detailed analysis of the algorithm and its implementation, as well as a discussion of its significance. The book is well-written and accessible to readers with a basic understanding of computer science. It is a valuable resource for researchers and practitioners working in the field of parallel algorithms.

"synopsis" may belong to another edition of this title.

Other Popular Editions of the Same Title