An Efficient Parallel Strong Orientation (February 1984) (Classic Reprint): Technical Report 109, Ultracomputer Note 67: Technical Report 109, Ultracomputer Note 67 (Classic Reprint) - Softcover

Inhaltsangabe

Explore how expert researchers break down complex graph problems with parallel computing. This book presents methods for solving graph orientation, connectivity, and related tasks using multiple processors in parallel environments. It combines practical algorithms with clear complexity analysis to show what can be computed quickly on powerful machines.

Readers will encounter step-by-step procedures, such as identifying key edges, leveraging Euler paths, and applying doubling techniques to derive fast, scalable results. The text emphasizes how to coordinate many work items to achieve time-efficient solutions while managing space and resource use. It also provides references to foundational work in parallel processing and discusses concrete performance bounds on modern parallel architectures.

• Concrete algorithms for parallel graph processing, including orientation and connectivity.


• Techniques like the doubling method and Euler-path based analyses to achieve speedups.


• Illustrations of how to structure computations across processors to balance time and space.


• Notes on complexity, scalability, and the historical context of Ultracomputer and PRAM models.

Ideal for practitioners and students who want solid, working guidance on parallel graph algorithms and performance considerations.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.