We address the problem of broadcasting on mesh architectures with arbitrary (non-power-two) dimensions. It is assumed that such mesh architectures employ cut-through or worm-hole routing. The main results are an algorithm for performing an optimal minimum-spanning tree broadcast when messages are not pipelined, a pipelined algorithm that is similar to Ho and Johnson's EDST algorithm for hypercu...

26 Connection Machine CM-1 routing network on 16 processors of an Intel iPSC/860, and on a simulation of a slotted-ring architecture that is executed on up to 64 processors of the Intel Touchstone Delta. Signiicant performance beneets are observed, and the eeectiveness of (and need for) dynamic remapping clearly demonstrated. Acknowledgements We thank Subhas Roy for his programming contribution...

An automated routine method was developed for the determination of trace metals using a flow injection system into a direct current plasma spectrometer. The characteristic emission in the 'Spectra- Metrics' three-electrode jet is channelled through an echelle grating to the detector of the instrument. The emission signal is continuously recorded, and, after digitalization, calculated and record...

The complete exchange (or all-to-all personalized) communication pattern occurs frequently in many important parallel computing applications. We discuss several algorithms to perform complete exchange on a two dimensional mesh connected computer with worm-hole routing. We propose algorithms for both power-of-two and non power-of-two meshes as well as an algorithm which works for any arbitrary m...

A characteristic-based. windward numerical prccerlure for solving three-dimensional Maxwell equations iii the time domain has been successfully ported to the Ititpi Touchstone Delta ninlticoniputer. The riumerical results by concurrent computation duplicated the earlier simulations of an oscillating electric dipole on a vector processor and compared w~11 with the exact solutioti. 'I'lie paralle...