Interprocedural analysis for loop scheduling and data allocation
- 1 May 1998
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 24 (3-4) , 477-504
- https://doi.org/10.1016/s0167-8191(98)00022-2
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Reduction of cache coherence overhead by compiler data layout and loop transformationPublished by Springer Nature ,2006
- Communication-free hyperplane partitioning of nested loopsPublished by Springer Nature ,2006
- Index domain alignment: minimizing cost of cross-referencing between distributed arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Experience with efficient array data flow analysis for array privatizationPublished by Association for Computing Machinery (ACM) ,1997
- An Empirical Study of the Workload Distribution under Static SchedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- Processor preallocation and load balancing of DOALL loopsThe Journal of Supercomputing, 1994
- Global optimizations for parallelism and locality on scalable parallel machinesPublished by Association for Computing Machinery (ACM) ,1993
- Loop partitioning for distributed memory multiprocessors as unimodular transformationsPublished by Association for Computing Machinery (ACM) ,1991
- Optimization of array accesses by collective loop transformationsPublished by Association for Computing Machinery (ACM) ,1991
- Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel SupercomputersIEEE Transactions on Computers, 1987