On Choice of a Model of Parallel Computation Classic Reprint

Uzi Vishkin

ISBN 10: 133401678X ISBN 13: 9781334016783
Published by Forgotten Books, 2019
New PAP

From PBShop.store US, Wood Dale, IL, U.S.A. Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

AbeBooks Seller since April 7, 2005

This specific item is no longer available.

About this Item

Description:

New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781334016783

Report this item

Synopsis:

This book explores the problem of choosing a computation model for parallel computing. The author proposes choosing the model that permits the most computation in a given amount of time. Two main theorems are proven: the first asserts that for every exclusive-read exclusive-write parallel RAM or synchronous distributed machine, there exists a simulation of the Fetch-and-Add parallel RAM into the same machine that uses the same order of computational resources. This implies the choice of a Fetch-and-Add parallel RAM model of computation. The second theorem asserts that for every synchronous distributed machine, there exists a simulation of the exclusive-read exclusive-write parallel RAM into the same machine that uses the same order of computational resources. These findings further support the use of Fetch-and-Add primitives in parallel computation design.

"About this title" may belong to another edition of this title.

Bibliographic Details

Title: On Choice of a Model of Parallel Computation...
Publisher: Forgotten Books
Publication Date: 2019
Binding: PAP
Condition: New

Top Search Results from the AbeBooks Marketplace

Seller Image

Uzi Vishkin
Published by Forgotten Books, 2018
ISBN 10: 133401678X ISBN 13: 9781334016783
New Paperback
Print on Demand

Seller: Forgotten Books, London, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Paperback. Condition: New. Print on Demand. This book explores the problem of choosing a computation model for parallel computing. The author proposes choosing the model that permits the most computation in a given amount of time. Two main theorems are proven: the first asserts that for every exclusive-read exclusive-write parallel RAM or synchronous distributed machine, there exists a simulation of the Fetch-and-Add parallel RAM into the same machine that uses the same order of computational resources. This implies the choice of a Fetch-and-Add parallel RAM model of computation. The second theorem asserts that for every synchronous distributed machine, there exists a simulation of the exclusive-read exclusive-write parallel RAM into the same machine that uses the same order of computational resources. These findings further support the use of Fetch-and-Add primitives in parallel computation design. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781334016783_0

Contact seller

Buy New

US$ 17.19
Free Shipping
Ships from United Kingdom to U.S.A.

Quantity: Over 20 available

Add to basket

Stock Image

Uzi Vishkin
Published by Forgotten Books, 2019
ISBN 10: 133401678X ISBN 13: 9781334016783
New PAP

Seller: PBShop.store UK, Fairford, GLOS, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781334016783

Contact seller

Buy New

US$ 23.72
US$ 4.41 shipping
Ships from United Kingdom to U.S.A.

Quantity: 15 available

Add to basket