Compiler techniques for data partitioning of sequentially iterated parallel loops
- 1 June 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 18 (3b), 187-200
- https://doi.org/10.1145/77726.255156
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Minimum distance: a method for partitioning recurrences for multiprocessorsIEEE Transactions on Computers, 1989
- Strategies for cache and local memory management by global program transformationJournal of Parallel and Distributed Computing, 1988
- Impact of Hierarchical Memory Systems On Linear Algebra Algorithm DesignThe International Journal of Supercomputing Applications, 1988
- On the problem of optimizing data transfers for complex memory systemsPublished by Association for Computing Machinery (ACM) ,1988
- Supernode partitioningPublished by Association for Computing Machinery (ACM) ,1988
- Stencils and Problem Partitionings: Their Influence on the Performance of Multiple Processor SystemsIEEE Transactions on Computers, 1987
- The influence of parallel decomposition strategies on the performance of multiprocessor systemsACM SIGARCH Computer Architecture News, 1985
- Algorithms for concurrent processorsPhysics Today, 1984