Parallel Computing Using the Prefix Problem

Parallel Computing Using the Prefix Problem

4.11 - 1251 ratings - Source



The prefix operation on a set of data is one of the simplest and most useful building blocks in parallel algorithms. This introduction to those aspects of parallel programming and parallel algorithms that relate to the prefix problem emphasizes its use in a broad range of familiar and important problems. The book illustrates how the prefix operation approach to parallel computing leads to fast and efficient solutions to many different kinds of problems. Students, teachers, programmers, and computer scientists will want to read this clear exposition of an important approach.Clearly, c0 = 0, and it can be verified that This semigroup is called set-reset semigroup or carrv semigroup. Let alt;S ... =P, cx =0 X 1 AT 2 =L $i c2 = l X | X2 X3 = Sy c3 = l X 1 X2 -V3 -^4 =: J~agt; c4=0 j X2 X% X4 X5 =: iS, cs = l Functions 0 1 e 0 1 /.


Title:Parallel Computing Using the Prefix Problem
Author: S. Lakshmivarahan, Sudarshan K. Dhall both with the School of Computer Science both at the University of Oklahoma
Publisher:Oxford University Press, USA - 1994-07-14
ISBN-13:

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

How it works:
  • 1. Register a free 1 month Trial Account.
  • 2. Download as many books as you like (Personal use)
  • 3. Cancel the membership at any time if not satisfied.


Click button below to register and download Ebook
Privacy Policy | Contact | DMCA