No abstract available.
Cited By
- Bagnères L, Zinenko O, Huot S and Bastoul C Opening polyhedral compiler's black box Proceedings of the 2016 International Symposium on Code Generation and Optimization, (128-138)
- Bayliss S and Constantinides G Optimizing SDRAM bandwidth for custom FPGA loop accelerators Proceedings of the ACM/SIGDA international symposium on Field Programmable Gate Arrays, (195-204)
- Bielecki W and Palkowski M Using free scheduling for programming graphic cards Facing the Multicore-Challenge II, (72-83)
- Long S and Fursin G (2009). Systematic search within an optimisation space based on Unified Transformation Framework, International Journal of Computational Science and Engineering, 4:2, (102-111), Online publication date: 1-Jul-2009.
- Daylight E, Vandecappelle A and Catthoor F (2008). The formalism underlying EASYMAP, Science of Computer Programming, 72:3, (71-135), Online publication date: 1-Aug-2008.
- Hu Q, Kjeldsberg P, Vandecappelle A, Palkovic M and Catthoor F (2007). Incremental hierarchical memory size estimation for steering of loop transformations, ACM Transactions on Design Automation of Electronic Systems, 12:4, (50-es), Online publication date: 1-Sep-2007.
- Kulkarni P, Whalley D and Tyson G Evaluating Heuristic Optimization Phase Order Search Algorithms Proceedings of the International Symposium on Code Generation and Optimization, (157-169)
- Vasilache N, Bastoul C and Cohen A Polyhedral code generation in the real world Proceedings of the 15th international conference on Compiler Construction, (185-201)
- Li F, Chen G, Kandemir M and Brooks R A compiler-based approach to data security Proceedings of the 14th international conference on Compiler Construction, (188-203)
- Long S and O'Boyle M Adaptive java optimisation using instance-based learning Proceedings of the 18th annual international conference on Supercomputing, (237-246)
- Chatterjee S, Parker E, Hanlon P and Lebeck A Exact analysis of the cache behavior of nested loops Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, (286-297)
- Chatterjee S, Parker E, Hanlon P and Lebeck A (2001). Exact analysis of the cache behavior of nested loops, ACM SIGPLAN Notices, 36:5, (286-297), Online publication date: 1-May-2001.
- Danckaert K, Catthoor F and De Man H A preprocessing step for global loop transformations for data transfer optimization Proceedings of the 2000 international conference on Compilers, architecture, and synthesis for embedded systems, (34-40)
- Quilleré F, Rajopadhye S and Wilde D (2000). Generation of Efficient Nested Loops from Polyhedra, International Journal of Parallel Programming, 28:5, (469-498), Online publication date: 1-Oct-2000.
- O'Boyle M and Knijnenburg P (1999). Nonsingular Data Transformations, International Journal of Parallel Programming, 27:3, (131-159), Online publication date: 1-Jun-1999.
- O'Boyle M and Knijnenburg P Non-singular data transformations Proceedings of the 11th international conference on Supercomputing, (309-316)
- Lim A and Lam M Maximizing parallelism and minimizing synchronization with affine transforms Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (201-214)
- Kelly W, Pugh W, Rosser E and Shpeisman T (1996). Transitive Closure of Infinite Graphs and Its Applications, International Journal of Parallel Programming, 24:6, (579-598), Online publication date: 1-Dec-1996.
- Xue J Affine-by-Statement Transformations of Imperfectly Nested Loops Proceedings of the 10th International Parallel Processing Symposium, (34-38)
- Tang P and Gao N Vectorization beyond data dependences Proceedings of the 9th international conference on Supercomputing, (434-443)
- Li W Compiler cache optimizations for banded matrix problems Proceedings of the 9th international conference on Supercomputing, (21-30)
- Pugh W and Wonnacott D (1995). Going Beyond Integer Programming with the Omega Test to Eliminate False Data Dependences, IEEE Transactions on Parallel and Distributed Systems, 6:2, (204-211), Online publication date: 1-Feb-1995.
- Sass R and Mutka M Enabling unimodular transformations Proceedings of the 1994 ACM/IEEE conference on Supercomputing, (753-762)
- Sass R and Mutka M Transformations on Doubly Nested Loops Proceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques, (343-346)
- Pugh W Counting solutions to Presburger formulas Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, (121-134)
- Pugh W (1994). Counting solutions to Presburger formulas, ACM SIGPLAN Notices, 29:6, (121-134), Online publication date: 1-Jun-1994.
- Maslov V Lazy array data-flow dependence analysis Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (311-325)
Index Terms
- A framework for unifying reordering transformations
Recommendations
A general framework for iteration-reordering loop transformations
This paper describes a general framework for representing iteration-reordering transformations. These transformations can be both matrix-based and non-matrix-based. Transformations are defined by rules for mapping dependence vectors, rules for mapping ...
A general framework for iteration-reordering loop transformations
PLDI '92: Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementationThis paper describes a general framework for representing iteration-reordering transformations. These transformations can be both matrix-based and non-matrix-based. Transformations are defined by rules for mapping dependence vectors, rules for mapping ...
The Switch Reordering Contagion: Preventing a Few Late Packets from Ruining the Whole Party
Packet reordering has now become one of the most significant bottlenecks in next-generation switch designs. A switch practically experiences a reordering delay contagion, such that a few late packets may affect a disproportionate number of other ...