default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenoît Meister
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c27]Yuyan Bao
, Kirshanthan Sundararajah, Raghav Malik, Qianchuan Ye, Christopher Wagner, Nouraldin Jaber, Fei Wang, Mohammad Hassan Ameri, Donghang Lu, Alexander Seto, Benjamin Delaware, Roopsha Samanta, Aniket Kate, Christina Garman, Jeremiah Blocki, Pierre-David Letourneau, Benoît Meister, Jonathan Springer, Tiark Rompf, Milind Kulkarni:
HACCLE: metaprogramming for secure multi-party computation. GPCE 2021: 130-143- 2020
- [c26]Muthu Manikandan Baskaran, Charles Jin, Benoît Meister, Jonathan Springer:
Automatic Mapping and Optimization to Kokkos with Polyhedral Compilation. HPEC 2020: 1-7 - [i4]Yuyan Bao, Kirshanthan Sundararajah, Raghav Malik, Qianchuan Ye, Christopher Wagner, Fei Wang, Mohammad Hassan Ameri, Donghang Lu, Alexander Seto, Benjamin Delaware, Roopsha Samanta, Aniket Kate, Christina Garman, Jeremiah Blocki, Pierre-David Letourneau, Benoît Meister, Jonathan Springer, Tiark Rompf, Milind Kulkarni:
HACCLE: An Ecosystem for Building Secure Multi-Party Computations. CoRR abs/2009.01489 (2020)
2010 – 2019
- 2019
- [j4]Eric Papenhausen, Matthew Harper Langston, Benoît Meister, Richard Lethin, Klaus Mueller:
PUMA-V: Optimizing Parallel Code Performance Through Interactive Visualization. IEEE Computer Graphics and Applications 39(1): 84-99 (2019) - [c25]Charles Jin, Muthu Manikandan Baskaran, Benoît Meister:
POSTER: Automatic Parallelization Targeting Asynchronous Task-Based Runtimes. PACT 2019: 465-466 - [c24]Charles Jin, Muthu Manikandan Baskaran, Benoît Meister, Jonathan Springer:
Automatic Parallelization to Asynchronous Task-Based Runtimes Through a Generic Runtime Layer. HPEC 2019: 1-11 - [c23]Benoît Meister, Eric Papenhausen, Benoît Pradelle:
Polyhedral Tensor Schedulers. HPCS 2019: 504-512 - 2017
- [c22]Benoît Pradelle, Benoît Meister, Muthu Manikandan Baskaran, Jonathan Springer, Richard Lethin:
Polyhedral Optimization of TensorFlow Computation Graphs. ESPT/VPA@SC 2017: 74-89 - 2016
- [c21]Tahina Ramananandro, Paul Mountcastle, Benoît Meister, Richard Lethin:
A unified Coq framework for verifying C programs with floating-point computations. CPP 2016: 15-26 - [c20]Timothy G. Mattson, Romain Cledat, Vincent Cavé, Vivek Sarkar, Zoran Budimlic, Sanjay Chatterjee, Joshua B. Fryman, Ivan Ganev, Robin Knauerhase, Min Lee, Benoît Meister, Brian Nickerson, Nick Pepperling, Bala Seshasayee, Sagnak Tasirlar, Justin Teller, Nick Vrvilo:
The Open Community Runtime: A runtime system for extreme scale computing. HPEC 2016: 1-7 - [c19]Benoît Pradelle, Muthu Manikandan Baskaran, Thomas Henretty, Benoît Meister, Athanasios Konstantinidis, Richard Lethin:
Polyhedral compilation for energy efficiency. HPEC 2016: 1-7 - [c18]Benoît Pradelle, Benoît Meister, Muthu Manikandan Baskaran, Athanasios Konstantinidis, Thomas Henretty, Richard Lethin:
Scalable Hierarchical Polyhedral Compilation. ICPP 2016: 432-441 - [c17]Eric Papenhausen, Klaus Mueller, Harper Langston, Benoît Meister, Richard Lethin:
An Interactive Visual Tool for Code Optimization and Parallelization Based on the Polyhedral Model. ICPP Workshops 2016: 309-318 - [c16]Kelly Livingston, Aaron Myles Landwehr, José Monsalve Diaz, Stéphane Zuckerman, Benoît Meister, Guang R. Gao:
Energy Avoiding Matrix Multiply. LCPC 2016: 55-70 - [c15]Muthu Manikandan Baskaran, Benoît Pradelle, Benoît Meister, Athanasios Konstantinidis, Richard A. Lethin:
Automatic Code Generation and Data Management for an Asynchronous Task-Based Runtime. ESPT@SC 2016: 34-41 - [i3]Benoît Meister, Muthu Manikandan Baskaran, Benoît Pradelle, Thomas Henretty, Richard Lethin:
Efficient Compilation to Event-Driven Task Programs. CoRR abs/1601.05458 (2016) - [i2]Pierre-David Letourneau, Harper Langston, Benoît Meister, Richard Lethin:
A sparse multidimensional FFT for real positive vectors. CoRR abs/1604.06682 (2016) - 2015
- [c14]Jonathon Cai, Muthu Manikandan Baskaran, Benoît Meister, Richard Lethin:
Optimization of symmetric tensor computations. HPEC 2015: 1-7 - [c13]Sanket Tavarageri, Benoît Meister, Muthu Manikandan Baskaran, Benoît Pradelle, Thomas Henretty, Athanasios Konstantinidis, Ann Johnson, Richard Lethin:
Automatic cluster parallelization and minimizing communication via selective data replication. HPEC 2015: 1-7 - [c12]Eric Papenhausen, Bing Wang, Harper Langston, Muthu Manikandan Baskaran, Thomas Henretty, Taku Izubuchi, Ann Johnson, Chulwoo Jung, Meifeng Lin, Benoît Meister, Klaus Mueller, Richard Lethin:
Polyhedral user mapping and assistant visualizer tool for the r-stream auto-parallelizing compiler. VISSOFT 2015: 180-184 - 2014
- [c11]Muthu Manikandan Baskaran, Benoît Meister, Richard Lethin:
Low-overhead load-balanced scheduling for sparse tensor computations. HPEC 2014: 1-6 - [c10]Andres Marquez, Joseph B. Manzano, Shuaiwen Leon Song, Benoît Meister, Sunil Shrestha, Thomas St. John, Guang R. Gao:
ACDT: Architected Composite Data Types trading-in unfettered data access for improved execution. ICPADS 2014: 289-297 - [c9]Muthu Manikandan Baskaran, Benoît Meister, Richard Lethin:
Parallelizing and optimizing sparse tensor computations. ICS 2014: 179 - [i1]Nicolas Vasilache, Muthu Manikandan Baskaran, Thomas Henretty, Benoît Meister, Harper Langston, Sanket Tavarageri, Richard Lethin:
A Tale of Three Runtimes. CoRR abs/1409.1914 (2014) - 2013
- [c8]Nicolas Vasilache, Muthu Manikandan Baskaran, Benoît Meister, Richard Lethin:
Memory reuse optimizations in the R-Stream compiler. GPGPU@ASPLOS 2013: 42-53 - [c7]Nicholas P. Carter, Aditya Agrawal, Shekhar Borkar, Romain Cledat, Howard David, Dave Dunning, Joshua B. Fryman, Ivan Ganev, Roger A. Golliver, Rob C. Knauerhase, Richard Lethin, Benoît Meister, Asit K. Mishra, Wilfred R. Pinfold, Justin Teller, Josep Torrellas, Nicolas Vasilache, Ganesh Venkatesh, Jianping Xu:
Runnemede: An architecture for Ubiquitous High-Performance Computing. HPCA 2013: 198-209 - [c6]Harper Langston, Muthu Manikandan Baskaran, Benoît Meister, Nicolas Vasilache, Richard Lethin:
Re-Introduction of communication-avoiding FMM-accelerated FFTs with GPU acceleration. HPEC 2013: 1-6 - 2012
- [j3]Rachid Seghir, Vincent Loechner, Benoît Meister:
Integer affine transformations of parametric ℤ-polytopes and applications to loop nest optimization. ACM Trans. Archit. Code Optim. 9(2): 8:1-8:27 (2012) - [c5]Muthu Manikandan Baskaran, Benoît Meister, Nicolas Vasilache, Richard Lethin:
Efficient and scalable computations with sparse tensors. HPEC 2012: 1-6 - [c4]Muthu Manikandan Baskaran, Nicolas Vasilache, Benoît Meister, Richard Lethin:
Automatic communication optimizations through memory reuse strategies. PPoPP 2012: 277-278 - 2011
- [r1]Benoît Meister, Nicolas Vasilache, David Wohlford, Muthu Manikandan Baskaran, Allen Leung, Richard Lethin:
R-Stream Compiler. Encyclopedia of Parallel Computing 2011: 1756-1765 - 2010
- [c3]Allen Leung, Nicolas Vasilache, Benoît Meister, Muthu Manikandan Baskaran, David Wohlford, Cédric Bastoul, Richard Lethin:
A mapping path for multi-GPGPU accelerated computers from a portable high level programming abstraction. GPGPU 2010: 51-61
2000 – 2009
- 2004
- [c2]Benoît Meister:
Periodic Polyhedra. CC 2004: 134-149 - 2002
- [j2]Vincent Loechner, Benoît Meister, Philippe Clauss:
Precise Data Locality Optimization of Nested Loops. J. Supercomput. 21(1): 37-76 (2002) - 2001
- [c1]Vincent Loechner, Benoît Meister, Philippe Clauss:
Data Sequence Locality: A Generalization of Temporal Locality. Euro-Par 2001: 262-272 - 2000
- [j1]Philippe Clauss, Benoît Meister:
Automatic memory layout transformations to optimize spatial locality in parameterized loop nests. SIGARCH Comput. Archit. News 28(1): 11-19 (2000)
Coauthor Index
aka: Richard Lethin
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
