Choice Model Parallel Computation by Vishkin Uzi (3 results)
- Softcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
£ 20.93
Free ShippingShips within U.S.A.Quantity: 15 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
£ 20.19
£ 3.29 shippingShips from United Kingdom to U.S.A.Quantity: 15 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
More images- Softcover
- Print on Demand
Seller: Forgotten Books, London, United KingdomForgotten Books
Contact seller4-star sellerCondition: New
£ 13.34
Free ShippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
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 paral…lel 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.
