{
"item_title" : "Parallel Computing Using Prefix Problem",
"item_author" : [" S. Lakshmivarahan", "Sudarshan Kumar Dhall "],
"item_description" : "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.",
"item_img_path" : "https://covers1.booksamillion.com/covers/bam/0/19/508/849/0195088492_b.jpg",
"price_data" : {
"retail_price" : "91.00", "online_price" : "91.00", "our_price" : "91.00", "club_price" : "91.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Parallel Computing Using Prefix Problem
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9780195088496
- ISBN-10: 0195088492
- Publisher: Oxford University Press
- Publish Date: July 1994
- Dimensions: 9 x 6 x 0.88 inches
- Shipping Weight: 1.33 pounds
- Page Count: 320
Related Categories
