Optimizing I/O for big array analytics
- 1 April 2012
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 5 (8), 764-775
- https://doi.org/10.14778/2212351.2212358
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- The Polyhedral Model Is More Widely Applicable Than You ThinkLecture Notes in Computer Science, 2010
- Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory HierarchiesInternational Journal of Parallel Programming, 2006
- Polyhedral Code Generation in the Real WorldLecture Notes in Computer Science, 2006
- Improving Data Locality by ChunkingLecture Notes in Computer Science, 2003
- Efficient and extensible algorithms for multi query optimizationACM SIGMOD Record, 2000
- Compiler optimizations for improving data localityACM SIGPLAN Notices, 1994
- Some efficient solutions to the affine scheduling problem. I. One-dimensional timeInternational Journal of Parallel Programming, 1992
- Dataflow analysis of array and scalar referencesInternational Journal of Parallel Programming, 1991
- Multiple-query optimizationACM Transactions on Database Systems, 1988
- The Organization of Computations for Uniform Recurrence EquationsJournal of the ACM, 1967