default search action
Mathias Jacquelin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c23]Marcelo Orenes-Vera
, Ilya Sharapov
Wafer-Scale Fast Fourier Transforms. ICS 2023: 180-191 - [c22]Hatem Ltaief
Scaling the "Memory Wall" for Multi-Dimensional Seismic Processing with Algebraic Compression on Cerebras CS-2 Systems. SC 2023: 6:1-6:12 - [c21]Julian Bellavita
symPACK: A GPU-Capable Fan-Out Sparse Cholesky Solver. SC Workshops 2023: 1171-1184 - [c20]Ryuichi Sai
Massively Distributed Finite-Volume Flux Computation. SC Workshops 2023: 1713-1720 - [i12]Ryuichi Sai, Mathias Jacquelin, François P. Hamon, Mauricio Araya-Polo, Randolph R. Settgast:
Massively Distributed Finite-Volume Flux Computation. CoRR abs/2304.11274 (2023) - 2022
- [c19]Mathias Jacquelin
Scalable Distributed High-Order Stencil Computations. SC 2022: 30:1-30:13 - [i11]Mathias Jacquelin, Mauricio Araya-Polo, Jie Meng:
Massively scalable stencil algorithm. CoRR abs/2204.03775 (2022) - [i10]Marcelo Orenes-Vera, Ilya Sharapov, Robert Schreiber, Mathias Jacquelin, Philippe Vandermersch, Sharan Chetlur:
Wafer-Scale Fast Fourier Transforms. CoRR abs/2209.15040 (2022) - 2021
- [j8]Mathias Jacquelin, Esmond G. Ng, Barry W. Peyton:
Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes. SIAM J. Matrix Anal. Appl. 42(3): 1337-1364 (2021) - 2020
- [j7]Victor Wen-zhe Yu
ELSI - An open infrastructure for electronic structure solvers. Comput. Phys. Commun. 256: 107459 (2020)
2010 – 2019
- 2019
- [c18]John Bachan, Scott B. Baden, Steven A. Hofmeyr, Mathias Jacquelin, Amir Kamil
UPC++: A High-Performance Communication Framework for Asynchronous Computation. IPDPS 2019: 963-973 - 2018
- [j6]Victor Wen-zhe Yu, Fabiano Corsetti
ELSI: A unified software interface for Kohn-Sham electronic structure solvers. Comput. Phys. Commun. 222: 267-285 (2018) - [j5]Mathias Jacquelin, Lin Lin, Chao Yang:
PSelInv - A distributed memory parallel algorithm for selected inversion: The non-symmetric case. Parallel Comput. 74: 84-98 (2018) - [c17]Mathias Jacquelin, Lin Lin, Weile Jia, Yonghua Zhao, Chao Yang:
A Left-Looking Selected Inversion Algorithm and Task Parallelism on Shared Memory Systems. HPC Asia 2018: 54-63 - [c16]Mathias Jacquelin, Esmond G. Ng, Barry W. Peyton:
Fast and effective reordering of columns within supernodes using partition refinement. CSC 2018: 76-86 - [c15]Yang Liu, Mathias Jacquelin, Pieter Ghysels, Xiaoye S. Li:
Highly scalable distributed-memory sparse triangular solution algorithms. CSC 2018: 87-96 - [c14]Grey Ballard
A 3D Parallel Algorithm for QR Decomposition. SPAA 2018: 55-65 - [i9]Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Nicholas Knight:
A 3D Parallel Algorithm for QR Decomposition. CoRR abs/1805.05278 (2018) - 2017
- [j4]Mathias Jacquelin
PSelInv - A Distributed Memory Parallel Algorithm for Selected Inversion: The Symmetric Case. ACM Trans. Math. Softw. 43(3): 21:1-21:28 (2017) - [c13]Ariful Azad, Mathias Jacquelin
The Reverse Cuthill-McKee Algorithm in Distributed-Memory. IPDPS 2017: 22-31 - [c12]Mathias Jacquelin
Towards Highly scalable Ab Initio Molecular Dynamics (AIMD) Simulations on the Intel Knights Landing Manycore Processor. IPDPS 2017: 234-243 - [c11]John Bachan, Dan Bonachea
The UPC++ PGAS library for Exascale Computing. PAW@SC 2017: 7:1-7:4 - [c10]Eric J. Bylaska, Mathias Jacquelin, Wibe A. de Jong
Performance Evaluation of NWChem Ab-Initio Molecular Dynamics (AIMD) Simulations on the Intel® Xeon Phi™ Processor. ISC Workshops 2017: 404-418 - [i8]Mathias Jacquelin, Lin Lin, Chao Yang:
PSelInv - A Distributed Memory Parallel Algorithm for Selected Inversion: the non-symmetric Case. CoRR abs/1708.04539 (2017) - 2016
- [c9]Mathias Jacquelin
Enhancing Scalability and Load Balancing of Parallel Selected Inversion via Tree-Based Asynchronous Communication. IPDPS 2016: 192-201 - [i7]Mathias Jacquelin, Lin Lin, Weile Jia, Yonghua Zhao, Chao Yang:
A Left-Looking Selected Inversion Algorithm and Task Parallelism on Shared Memory Systems. CoRR abs/1604.02528 (2016) - [i6]Mathias Jacquelin, Yili Zheng, Esmond Ng, Katherine A. Yelick:
An Asynchronous Task-based Fan-Both Sparse Cholesky Solver. CoRR abs/1608.00044 (2016) - [i5]Ariful Azad, Mathias Jacquelin, Aydin Buluç, Esmond G. Ng:
The Reverse Cuthill-McKee Algorithm in Distributed-Memory. CoRR abs/1610.08128 (2016) - 2015
- [j3]Grey Ballard
Reconstructing Householder vectors from Tall-Skinny QR. J. Parallel Distributed Comput. 85: 3-31 (2015) - [i4]Mathias Jacquelin, Lin Lin, Nathan Wichmann, Chao Yang:
Enhancing the scalability and load balancing of the parallel selected inversion algorithm via tree-based asynchronous communication. CoRR abs/1504.04714 (2015) - 2014
- [c8]Grey Ballard
Reconstructing Householder Vectors from Tall-Skinny QR. IPDPS 2014: 1159-1170 - [c7]Laura Grigori, Mathias Jacquelin
Performance Predictions of Multilevel Communication Optimal LU and QR Factorizations on Hierarchical Platforms. ISC 2014: 76-92 - [i3]Mathias Jacquelin, Lin Lin, Chao Yang:
PSelInv - A Distributed Memory Parallel Algorithm for Selected Inversion : the Symmetric Case. CoRR abs/1404.0447 (2014) - 2013
- [j2]Jack J. Dongarra, Mathieu Faverge, Thomas Hérault
Hierarchical QR factorization algorithms for multi-core clusters. Parallel Comput. 39(4-5): 212-232 (2013) - [i2]Laura Grigori, Mathias Jacquelin, Amal Khabou:
Multilevel communication optimal LU and QR factorizations for hierarchical platforms. CoRR abs/1303.5837 (2013) - 2012
- [j1]Tudor David, Mathias Jacquelin
Scheduling streaming applications on a complex multicore platform. Concurr. Comput. Pract. Exp. 24(15): 1726-1750 (2012) - 2011
- [b1]Mathias Jacquelin:
Memory-aware algorithms : from multicores to large scale platforms. (Algorithmes orientés mémoire : des processeurs multi-cœurs aux plates-formes à grande échelle). École normale supérieure de Lyon, France, 2011 - [c6]Franck Cappello, Mathias Jacquelin
Comparing archival policies for Blue Waters. HiPC 2011: 1-10 - [c5]Mathias Jacquelin
On Optimal Tree Traversals for Sparse Matrix Factorization. IPDPS 2011: 556-567 - [c4]Mathias Jacquelin
Memory-Aware Algorithms and Scheduling Techniques: From Multicore Processors to Petascale Supercomputers. IPDPS Workshops 2011: 2038-2041 - [c3]Henricus Bouwmeester, Mathias Jacquelin
Tiled QR factorization algorithms. SC 2011: 7:1-7:11 - [i1]Henricus Bouwmeester, Mathias Jacquelin, Julien Langou, Yves Robert:
Tiled QR factorization algorithms. CoRR abs/1104.4475 (2011) - 2010
- [c2]Matthieu Gallet, Mathias Jacquelin
Scheduling complex streaming applications on the Cell processor. IPDPS Workshops 2010: 1-8
2000 – 2009
- 2009
- [c1]Mathias Jacquelin
Complexity Analysis and Performance Evaluation of Matrix Product on Multicore Architectures. ICPP 2009: 196-203
Coauthor Index
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-10-07 21:25 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: