## Annual ACM Symposium on Parallel Algorithms and Architectures, Volume 2 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

MessagePassing Algorithms for a SIMD Torus with Coteries | 11 |

Tight Bounds for Oblivious Routing in the Hypercube | 31 |

Routing Multiple Paths in Hypercubes | 45 |

Copyright | |

20 other sections not shown

### Other editions - View all

### Common terms and phrases

array assume bits block Boolean Boolean functions butterfly cache cell cessors column computational geometry Computer Science constant construct context copies CREW PRAM cycle data structure defined delay denote destination dimension distributed edge efficient elements embedding entries execution factor faults Figure FORALL node function given gorithm graph grid grid graph Hankel matrix Hence hypercube IEEE implementation input integer intersection Lemma length linear logn lower bound machine mapping matrix Monge arrays multiplier n-tuple node number of processors O(logn operation optimal output P-complete packet parallel algorithms parallel computation partition path performance permutation phase planar planar graphs pointer jumping PRAM probability problem Proc processors Proof queue random recursive recursive doubling requires result rithm router routing algorithm scheduling scheme segments sequence sequential shared memory simulation steps subgraph Subphase switch synchronization Theorem tion vector vertex vertices Xd+i