On supernode transformation with minimized total running time
- 1 May 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 9 (5), 417-428
- https://doi.org/10.1109/71.679213
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Optimal semi-oblique tilingIEEE Transactions on Parallel and Distributed Systems, 2003
- On supernode transformation with minimized total running timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Performance prediction of PVM programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- (Pen)-ultimate tiling?Integration, 1994
- FINDING OPTIMUM WAVEFRONT OF PARALLEL COMPUTATION∗Parallel Algorithms and Applications, 1994
- LINEAR SCHEDULING IS NEARLY OPTIMALParallel Processing Letters, 1991
- Scanning polyhedra with DO loopsPublished by Association for Computing Machinery (ACM) ,1991
- Practical dependence testingPublished by Association for Computing Machinery (ACM) ,1991
- More iteration space tilingPublished by Association for Computing Machinery (ACM) ,1989
- Supernode partitioningPublished by Association for Computing Machinery (ACM) ,1988