Automatic synthesis of out-of-core algorithms

Authors:
Yannis Klonatos;Andres Nötzli;Andrej Spielmann;Christoph Koch;Victor Kuncak
Affiliations:
EPFL, Lausanne, Vaud, Switzerland;EPFL, Lausanne, Vaud, Switzerland;EPFL, Lausanne, Vaud, Switzerland;EPFL, Lausanne, Vaud, Switzerland;EPFL, Lausanne, Vaud, Switzerland
Venue:
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Year:
2013

Citing 20
Cited 1

Algebraic identities for program calculation

The Computer Journal - Special issue on Lazy functional programming
Calculating Sized Types

Higher-Order and Symbolic Computation
Database Management Systems

Database Management Systems
Static prediction of heap space usage for first-order functional programs

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Naturally Embedded Query Languages

ICDT '92 Proceedings of the 4th International Conference on Database Theory
Logical and Computational Aspects of Programming with Sets/Bags/Lists

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
GPUTeraSort: high performance graphics co-processor sorting for large database management

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Lightweight semiformal time complexity analysis for purely functional data structures

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fast parallel GPU-sorting using a hybrid algorithm

Journal of Parallel and Distributed Computing
A Practical Quicksort Algorithm for Graphics Processors

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A tuning framework for software-managed memory hierarchies

Proceedings of the 17th international conference on Parallel architectures and compilation techniques
FSort: external sorting on flash-based sensor devices

Proceedings of the Sixth International Workshop on Data Management for Sensor Networks
FAST: Flash-aware external sorting for mobile database systems

Journal of Systems and Software
Static determination of quantitative resource usage for higher-order programs

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
FAST: fast architecture sensitive tree search on modern CPUs and GPUs

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Closed-Form Upper Bounds in Static Cost Analysis

Journal of Automated Reasoning
Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization

SIAM Journal on Optimization
Encyclopedia of Parallel Computing

Encyclopedia of Parallel Computing
External Sorting on Flash Memory Via Natural Page Run Generation

The Computer Journal

Synthesis modulo recursive functions

Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a system for the automatic synthesis of efficient algorithms specialized for a particular memory hierarchy and a set of storage devices. The developer provides two independent inputs: 1) an algorithm that ignores memory hierarchy and external storage aspects; and 2) a description of the target memory hierarchy, including its topology and parameters. Our system is able to automatically synthesize memory-hierarchy and storage-device-aware algorithms out of those specifications, for tasks such as joins and sorting. The framework is extensible and allows developers to quickly synthesize custom out-of-core algorithms as new storage technologies become available.