Description: Parallel Computing Using the Prefix Problem by S. Lakshmivarahan, Sudarshan K. Dhall This is an introduction to those aspects of parallel programming and parallel algorithms that relate to a single topic: the prefix problem. This approach provides intense development of a single computational tool used in many parallel computations, showing and discussing its techniques. This may be used for graduate courses, seminars and topics courses. FORMAT Hardcover LANGUAGE English CONDITION Brand New Publisher 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. Author Biography S. Lakshmivarahan is a George Lynn Cross Research Professor at the School of Computer Science, University of Oklahoma. Table of Contents 1: The Prefix Problem and Its Applications2: Parallel Machines and Models--An Overview3: Parallel Prefix Algorithms on Arrays4: Parallel Prefix Algorithms on Linked Lists5: Parallel Prefix Circuits6: Size Vs. Depth Trade-Off in Parallel Prefix Circuits7: Methods for Bounding Fan-out8: Constant Depth Prefix Circuits with Unbounded Fan-inAppendices Review "The book is well organized and the exposition is self-contained. Furthermore, there are many interesting exercises at the end of each chapter. The reviewer recommends this book for use in a graduate class on parallel algorithm design and for researchers in parallel algorithm design." --Mathematical Reviews"The book is well organized and the exposition is self-contained. Furthermore, there are many interesting exercises at the end of each chapter. The reviewer recommends this book for use in a graduate class on parallel algorithm design and for researchers in parallel algorithm design." --Mathematical Reviews Long 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. Review Text "The book is well organized and the exposition is self-contained. Furthermore, there are many interesting exercises at the end of each chapter. The reviewer recommends this book for use in a graduate class on parallel algorithm design and for researchers in parallel algorithm design." --Mathematical Reviews"The book is well organized and the exposition is self-contained. Furthermore, there are many interesting exercises at the end of each chapter. The reviewer recommends this book for use in a graduate class on parallel algorithm design and for researchers in parallel algorithm design." --Mathematical Reviews Review Quote "The book is well organized and the exposition is self-contained.Furthermore, there are many interesting exercises at the end of each chapter.The reviewer recommends this book for use in a graduate class on parallelalgorithm design and for researchers in parallel algorithm design."--Mathematical Reviews Details ISBN0195088492 Author Sudarshan K. Dhall Short Title PARALLEL COMPUTING USING PREFI Language English ISBN-10 0195088492 ISBN-13 9780195088496 Media Book Format Hardcover Year 1994 Position Associate Professor of Psychiatry Imprint Oxford University Press Inc Place of Publication New York Country of Publication United States Affiliation Director, Institute of Marine and Coastal Sciences, Rutgers University, NJ, USA DOI 10.1604/9780195088496 UK Release Date 1994-09-08 AU Release Date 1994-09-08 NZ Release Date 1994-09-08 US Release Date 1994-09-08 Death 1955 Edited by Francisco Werner Birth 1938 Qualifications R.N., B.S.N., Ocn Publisher Oxford University Press Inc Publication Date 1994-09-08 DEWEY 004.35 Illustrations line figures Audience Professional & Vocational Pages 320 We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:6791937;
Price: 228.13 AUD
Location: Melbourne
End Time: 2024-12-27T14:12:22.000Z
Shipping Cost: 0 AUD
Product Images
Item Specifics
Restocking fee: No
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 30 Days
ISBN-13: 9780195088496
Book Title: Parallel Computing Using the Prefix Problem
Number of Pages: 312 Pages
Language: English
Publication Name: Parallel Computing Using the Prefix Problem
Publisher: Oxford University Press Inc
Publication Year: 1994
Subject: Computer Science
Item Height: 243 mm
Item Weight: 632 g
Type: Textbook
Author: Sudarshan K. Dhall, S. Lakshmivarahan
Item Width: 163 mm
Format: Hardcover