What do you think?
Rate this book
Synchronous Parallel Computation: A Survey
Excerpt from Synchronous Parallel Computation
Upper bounds on the worst-case resource requirements 'of algorithms which are designed for a orgu pram are usually presented 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 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.
Upper bounds on the worst-case resource requirements 'of algorithms which are designed for a orgu pram are usually presented 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 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.
25 pages, Paperback
Published August 24, 2018
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
No one has reviewed this book yet.