SPAA: Proceedings of the ... ACM Symposium on Parallel Algorithms and Architectures, Volume 6, Part 1994Association for Computing Machinery, 1994 - Computer algorithms |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
A LinearWork Parallel Algorithm for Finding Minimum Spanning Trees | 11 |
Improved Bounds for Routing and Sorting on MultiDimensional Meshes | 26 |
Parallel Sorting by Overpartitioning | 46 |
Copyright | |
14 other sections not shown
Other editions - View all
Common terms and phrases
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
Bibliographic information
| Title | SPAA: Proceedings of the ... ACM Symposium on Parallel Algorithms and Architectures, Volume 6, Part 1994 |
| Contributors | ACM Special Interest Group for Automata and Computability Theory, Sigarch |
| Publisher | Association for Computing Machinery, 1994 |
| ISBN | 0897916719, 9780897916714 |
| Export Citation | BiBTeX EndNote RefMan |