Supersaturated Paracomputer Algorithms (Classic Reprint) - Hardcover

Clyde P. Kruskal

9780656751822: Supersaturated Paracomputer Algorithms (Classic Reprint)

Hardcover

ISBN 10: 0656751827 ISBN 13: 9780656751822

Publisher: Forgotten Books, 2018

View all copies of this ISBN edition

0 Used

2 New

From US$ 38.22

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.

Ideal for readers of parallel computing, algorithm design, and computer architecture who want a clear, practical view of these advanced ideas.

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