Order Total (1 Item Items):
Shipping Destination:
Choice Model Parallel Computation by Vishkin (4 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (4)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (4)
- As New, Fine or Near Fine (No further results match this refinement)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (1)
- Not Print on Demand (2)
Language (1)
Price
- Any Price
- Under £ 20
- £ 20 to £ 40 (No further results match this refinement)
- Over £ 40 (No further results match this refinement)
Free Shipping
Seller Location
Seller Rating
-
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
On Choice of a Model of Parallel Computation Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
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.
-
Condition: New. Print on Demand pp. 26.
