Distributing the comparison of DNA and protein sequences across heterogeneous supercomputers
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Circulating shared-registers for multiprocessor systems
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
Multi-grained parallel computers can be very effective on computationally intensive problems that have important serial and parallel components. We introduce the Mesh SuperHet, a model of this type consisting of the close coupling of a d-dimensional toroidal mesh of coarse-grained processors to a serial machine consisting of memory modules connected via a low-diameter network to a serial processor. We exhibit problems for which the Mesh SuperHet is superior to its serial or parallel components alone and develop tight performance bounds for sorting, the fast Fourier transform, and matrix multiplication. As multi-grained machines become more common, studies such as this will both reveal the fundamental limitations on such architectures and set the context for algorithm development.