What people are saying - Write a review
We haven't found any reviews in the usual places.
A LinearWork Parallel Algorithm for Finding Minimum Spanning Trees
Improved Bounds for Routing and Sorting on MultiDimensional Meshes
Parallel Sorting by Overpartitioning
14 other sections not shown
Other editions - View all
algorithm applied architecture array assume average bandwidth bits block cache called column communication complexity computation connected consider consists constant construction contains contraction copies corresponding defined definition denote described destination distributed edges efficient elements example execution expected factor Figure function give given graph implementation increases initial input instruction iteration least Lemma length linear load balancing lower bound machines mapped matrix memory mesh messages method node Note O(log obtained operations optimal output packets parallel Parallel Algorithms performance phase PRAM present probability problem processors Proof prove queue Radix Sort random receives requires routing running schedule sequence sequential consistency simple simulation sorting step sublist takes task technique Theorem tion tree unit vertices write