Parallel Computing Using the Prefix Problem

— —

S. Lakshmivarahan (Professor of Computer Science, Professor of Computer Science, University of Oklahoma) Sudarshan K. Dhall (Professor of Computer Science, Professor of Computer Science, University of Oklahoma)

Parallel Computing Using the Prefix Problem

S. Lakshmivarahan (Professor of Computer Science, Professor of Computer Science, University of Oklahoma), Sudarshan K. Dhall (Professor of Computer Science, Professor of Computer Science, University of Oklahoma)

$523

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Oxford University Press Inc
01 August 1994

Parallel processing

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.

By: S. Lakshmivarahan (Professor of Computer Science Professor of Computer Science University of Oklahoma), Sudarshan K. Dhall (Professor of Computer Science, Professor of Computer Science, University of Oklahoma)
Imprint: Oxford University Press Inc
Country of Publication: United States
Dimensions: Height: 243mm, Width: 163mm, Spine: 25mm
Weight: 632g
ISBN: 9780195088496
ISBN 10: 0195088492
Pages: 312
Publication Date: 01 August 1994
Audience: Professional and scholarly , Undergraduate
Format: Hardback
Publisher's Status: Active

Reviews for Parallel Computing Using the Prefix Problem

This book comprehensively surveys parallel prefix algorithms for shared memory and circuit models. It is probably the only book available in the literature for such a detailed treatment of the subject. For the research student there are a good number of exercises at the end of each chapter; the algorithms are also presented in a form that can be easily implemented. The notation, too, is very readable. * Rajesh K. Mansharamani, Tata Research Development and Design Centre, Pune, India, The Computer Journal, Vol. 38, No. 3, 1995 *

LOW FLAT RATE AUST-WIDE $9.90 DELIVERY INFO

Parallel Computing Using the Prefix Problem

S. Lakshmivarahan (Professor of Computer Science, Professor of Computer Science, University of Oklahoma), Sudarshan K. Dhall (Professor of Computer Science, Professor of Computer Science, University of Oklahoma)

$523

Hardback

Reviews for Parallel Computing Using the Prefix Problem

See Also

Contact Abbeys

Contact Galaxy

Contact Language

Contact Us

About ABBEY'S