Synchronous Parallel Computation: A Survey (Classic Reprint) - Softcover

Inhaltsangabe

Excerpt from Synchronous Parallel Computation: A Survey

Upper bounds on the worst-case resource requirements 'of algorithms which are designed for a orgu pram are usually presented as: Depth O(y) for z processors and m common memory locations (y,z,m may be functions of the input parameters.) An equivalent formulation of such a result is: Depth for all p z processors and m common memory locations for the same y,z and m. We use mostly the second formulation and emphasize algorithms where y*z is not significantly bigger than the running time of the best sequential algorithm for the same problem. All the elementary operations required to handle a problem, including allocation of processors to subtasks; must be taken into account in evaluating the time complexity of these algorithms.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

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