A method for exploiting communication/computation overlap in hypercubes
- 19 February 1998
- journal article
- Published by Elsevier BV in Parallel Computing
- Vol. 24 (2), 221-245
- https://doi.org/10.1016/s0167-8191(98)00005-2
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- COMMUNICATION PIPELINING IN HYPERCUBESParallel Processing Letters, 1996
- Overlapping communication and computation in hypercubesLecture Notes in Computer Science, 1996
- Overlapping Computations, Communications and I/O in Parallel SortingJournal of Parallel and Distributed Computing, 1995
- Efficient fast Hartley transform algorithms for hypercube-connected multicomputersIEEE Transactions on Parallel and Distributed Systems, 1995
- Block recursive algorithm to generate Jacobi-setsParallel Computing, 1993
- Cooley-Tukey FFT on the Connection MachineParallel Computing, 1992
- ARRAYS AND TREESPublished by Elsevier BV ,1992
- Optimum broadcasting and personalized communication in hypercubesIEEE Transactions on Computers, 1989
- Software pipelining: an effective scheduling technique for VLIW machinesACM SIGPLAN Notices, 1988
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965