5 citations · 9 across the 5 of their papers we have counts for
5 papers
HACCLE: Metaprogramming for Secure Multi-Party Computation -- Extended Version
Yuyan Bao, Kirshanthan Sundararajah, Raghav Malik +17
Cryptographic techniques have the potential to enable distrusting parties to collaborate in fundamentally new ways, but their practical implementation poses numerous challenges. An…
A sparse multidimensional FFT for real positive vectors
Pierre-David Letourneau, Harper Langston, Benoit Meister +1
We present a sparse multidimensional FFT (sMFFT) randomized algorithm for real positive vectors. The algorithm works in any fixed dimension, requires (O(R log(R) log(N)) ) samples…
Efficient Compilation to Event-Driven Task Programs
Benoit Meister, Muthu Baskaran, Benoit Pradelle +2
As illustrated by the emergence of a class of new languages and runtimes, it is expected that a large portion of the programs to run on extreme scale computers will need to be writ…
Optimizing the domain wall fermion Dirac operator using the R-Stream source-to-source compiler
Meifeng Lin, Eric Papenhausen, M. Harper Langston +4
The application of the Dirac operator on a spinor field, the Dslash operation, is the most computation-intensive part of the lattice QCD simulations. It is often the key kernel to…
A Tale of Three Runtimes
Nicolas Vasilache, Muthu Baskaran, Tom Henretty +4
This contribution discusses the automatic generation of event-driven, tuple-space based programs for task-oriented execution models from a sequential C specification. We developed…