0
Your cart

Your cart is empty

Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design > Parallel processing

Buy Now

Parallel Computing Using the Prefix Problem (Hardcover) Loot Price: R2,017
Discovery Miles 20 170
You Save: R2,938 (59%)
Parallel Computing Using the Prefix Problem (Hardcover): S. Lakshmivarahan, Sudarshan K. Dhall

Parallel Computing Using the Prefix Problem (Hardcover)

S. Lakshmivarahan, Sudarshan K. Dhall

 (sign in to rate)
Was R4,955 Loot Price R2,017 Discovery Miles 20 170 | Repayment Terms: R189 pm x 12* You Save R2,938 (59%)

Bookmark and Share

Expected to ship within 12 - 19 working days

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.

General

Imprint: Oxford UniversityPress
Country of origin: United States
Release date: September 1994
First published: July 1994
Authors: S. Lakshmivarahan (Professor of Computer Science) • Sudarshan K. Dhall (Professor of Computer Science)
Dimensions: 243 x 163 x 25mm (L x W x T)
Format: Hardcover
Pages: 312
ISBN-13: 978-0-19-508849-6
Categories: Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design > Parallel processing
Promotions
LSN: 0-19-508849-2
Barcode: 9780195088496

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners