Items related to Supersaturated Paracomputer Algorithms (Classic Reprint)
Synopsis
Discover supersaturated paracomputer algorithms and how they tackle large problems with parallel power.
This overview of Supersaturated Paracomputer Algorithms explains how a many‑processor setup can break traditional limits to solve data problems faster. It presents a framework for thinking about problem size, processor size, and the idea of supersaturation where data scales beyond the number of processing elements.
The text frames the scope and value in practical, approachable terms, focusing on how these ideas translate into concrete methods, comparisons, and results. It explains core concepts, like processor size, problem size, and time complexity, and then shows how they apply to a broad class of problems.- Learn what a paracomputer is and what supersaturation means for running time and speedup.
- See how operations like replace-add enable data sharing and synchronization across many processing elements.
- Explore concrete algorithms for summing, sorting, median finding, and transforms, with emphasis on time bounds and parallelization.
- Understand how the architecture compares to ultracomputers and shared-memory machines, plus where each shines.
"synopsis" may belong to another edition of this title.
Search results for Supersaturated Paracomputer Algorithms (Classic Reprint)
Seller Image
Supersaturated Paracomputer Algorithms (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book breaks new ground in the field of parallel computation, presenting a new kind of parallel algorithmâ"supersaturated algorithmsâ"that have applications for a wide range of problems. The author presents algorithms for solving a range of problems, including integer summing, permutation, packing, merging, sorting, and finding the median, and analyzes their complexities and speedups. Many of the algorithms the author presents are completely parallelizable, attaining maximal speedup for sufficiently large problem sizes, and represent significant theoretical advances and new insights into parallel computation. This book will be of great value to researchers and students in the field, as well as programmers seeking to utilize parallel computation techniques for practical applications. 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 # 9781332876686_0
Buy New
US$ 17.43
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Supersaturated Paracomputer Algorithms Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332876686
Stock Image
Supersaturated Paracomputer Algorithms 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. Seller Inventory # LW-9781332876686
Buy New
US$ 28.34
US$ 4.44 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available