Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Meister, Benoit"'
Autor:
Bao, Yuyan, Sundararajah, Kirshanthan, Malik, Raghav, Ye, Qianchuan, Wagner, Christopher, Jaber, Nouraldin, Wang, Fei, Ameri, Mohammad Hassan, Lu, Donghang, Seto, Alexander, Delaware, Benjamin, Samanta, Roopsha, Kate, Aniket, Garman, Christina, Blocki, Jeremiah, Letourneau, Pierre-David, Meister, Benoit, Springer, Jonathan, Rompf, Tiark, Kulkarni, Milind
Cryptographic techniques have the potential to enable distrusting parties to collaborate in fundamentally new ways, but their practical implementation poses numerous challenges. An important class of such cryptographic techniques is known as Secure M
Externí odkaz:
http://arxiv.org/abs/2009.01489
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 and runs in O( R log^2(R) log(N)) complexity (where N is the total siz
Externí odkaz:
http://arxiv.org/abs/1604.06682
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 written as graphs of event-driven tasks (EDTs). EDT runtime systems, which
Externí odkaz:
http://arxiv.org/abs/1601.05458
Autor:
Lin, Meifeng, Papenhausen, Eric, Langston, M. Harper, Meister, Benoit, Baskaran, Muthu, Izubuchi, Taku, Jung, Chulwoo
Publikováno v:
PoS(LATTICE 2015)022
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 optimize to achieve maximum performance on various platforms. Here we
Externí odkaz:
http://arxiv.org/abs/1512.01542
Autor:
Vasilache, Nicolas, Baskaran, Muthu, Henretty, Tom, Meister, Benoit, Langston, M. Harper, Tavarageri, Sanket, Lethin, Richard
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 a hierarchical mapping solution using auto-parallelizing compiler tech
Externí odkaz:
http://arxiv.org/abs/1409.1914
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
[Research Report] 2010, pp.30
The polyhedral model is a well-known compiler optimization framework for the analysis and transformation of affine loop nests. We present a new method concerning a difficult geometric operation that is raised by this model: the integer affine transfo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::283465388693e400dee0ce0dfd2766e3
https://hal.inria.fr/inria-00534686/file/rapport.pdf
https://hal.inria.fr/inria-00534686/file/rapport.pdf
Autor:
Pradelle, Benoit, Baskaran, Muthu, Henretty, Tom, Meister, Benoit, Konstantinidis, Athanasios, Lethin, Richard
Publikováno v:
2016 IEEE High Performance Extreme Computing Conference (HPEC); 2016, p1-7, 7p
Autor:
Mattson, Timothy G., Cledat, Romain, Cave, Vincent, Sarkar, Vivek, Budimlic, Zoran, Chatterjee, Sanjay, Fryman, Josh, Ganev, Ivan, Knauerhase, Robin, Min Lee, Meister, Benoit, Nickerson, Brian, Pepperling, Nick, Seshasayee, Bala, Tasirlar, Sagnak, Teller, Justin, Vrvilo, Nick
Publikováno v:
2016 IEEE High Performance Extreme Computing Conference (HPEC); 2016, p1-7, 7p
Publikováno v:
2016 New York Scientific Data Summit (NYSDS); 2016, p1-4, 4p