New Complexity Results on Array Contraction and Related Problems
- 1 May 2005
- journal article
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 40 (1) , 35-55
- https://doi.org/10.1007/s11265-005-4937-3
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- AUTOMATIC SCHEDULING OF HYPERMEDIA DOCUMENTS WITH ELASTIC TIMESParallel Processing Letters, 2004
- PICO: automatically designing custom computersComputer, 2002
- Complexity of Multi-dimensional Loop AlignmentPublished by Springer Nature ,2002
- On the complexity of loop fusionParallel Computing, 2000
- A linear algebra framework for automatic determination of optimal data layoutsIEEE Transactions on Parallel and Distributed Systems, 1999
- Automatic storage management for parallel programsParallel Computing, 1998
- Tools and techniques for automatic data layout: A case studyParallel Computing, 1998
- Loop parallelization algorithms: From parallelism extraction to code generationParallel Computing, 1998
- A Parametrized Loop Fusion Algorithm for Improving Parallelism and Cache LocalityThe Computer Journal, 1997
- ON THE ALIGNMENT PROBLEMParallel Processing Letters, 1994