## On the Suitability of the Connection Machine for Direct Particle SimulationStanford University, 1990 - 336 pages |

### What people are saying - Write a review

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

### Contents

The Connection Machine Computer Architecture | 5 |

Figure Page | 6 |

Implementation on the Connection Machine | 22 |

4 other sections not shown

### Common terms and phrases

allows bits boundary layer boundary particle calculation candidate pairs cell density cell index cell volume collision algorithm collision candidates collision number collision partners color computational Connection Machine Cray created data parallel algorithms degrees of freedom diatomic direct mapping direct particle simulation display distribution DSMC elements end wall energy exchange enumeration equation equilibrium Figure flow fraction free stream front end geometry space geometry table grid processors Hamming distance implementation inelastic collisions initial instruction internal energy McDonald mean free path merging grid message length molecules multi-grid necessary number density number of cells number of particles particle processors performance physical processors pixel post-collision problem processors representing quantity radix sort random rank requires result router communication sampling VP set selection rule shock wave sorting algorithm statistical independence step storage stored surface interaction temperature thermal three dimensional values vectorizable algorithms vibrational virtual processors visualization VP ratio VP set X X X X