## The 3rd Symposium on the Frontiers of Massively Parallel Computation: proceedings of the Third Symposium |

### From inside the book

Try this search over all volumes: **step**

Results 1-0 of 0

### What people are saying - Write a review

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

### Contents

A New Parallel Algorithm for the Knapsack Problem and Its Implementation | 2 |

Asymptotically Efficient Hypercube Algorithms for Computational Geometry | 8 |

Optimal ProcessorTime Tradeoffs on Massively Parallel | 21 |

Copyright | |

58 other sections not shown

### Common terms and phrases

2-way stripes partition applications architecture array assigned binary bit-serial Bitonic sort broadcast calculation cell cessors chip column complexity Connection Machine convolution coordinates cross-stitching data structure diagonal efficiency equation execution Figure framebuffer function global graph hardware hash table Hough transform hypercube IEEE implementation input instantiations integer iteration Kalman filter linear log2 loop mapping mask MasPar massively parallel matrix memory modules merge mesh method MIMD mode multiplication multiprocessor NCUBE neighbor nodes number of nodes number of processors operation OPS5 optimal overhead parallel algorithm parallel computer parallel conflict resolution Parallel Processing performance phase pixels PRAM problem processing elements radiosity reconfigurable RHS actions rithm routing rule scalability sequence sequential serial shared memory SIMD simulation sort speedup step stored surrogate file synchronous technique tion tool movements update variables vector VLSI