default search action
Vincent Loechner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c18]Vincent Alba, Olivier Aumage, Denis Barthou, Raphaël Colin, Marie Christine Counilh, Stéphane Genaud, Amina Guermouche, Vincent Loechner, Arun Thangamani:
Performance Portability of Generated Cardiac Simulation Kernels Through Automatic Dimensioning and Load Balancing on Heterogeneous Nodes. IPDPS (Workshops) 2024: 1006-1015 - 2023
- [c17]Arun Thangamani, Tiago Trevisan Jost, Vincent Loechner, Stéphane Genaud, Bérenger Bramas:
Lifting Code Generation of Cardiac Physiology Simulation to Novel Compiler Technology. CGO 2023: 68-80 - [c16]Tiago Trevisan Jost
, Arun Thangamani
GPU Code Generation of Cardiac Electrophysiology Simulation with MLIR. Euro-Par 2023: 549-563 - 2021
- [j10]Paul Godard
Efficient Out-of-Core and Out-of-Place Rectangular Matrix Transposition and Rotation. IEEE Trans. Computers 70(11): 1942-1948 (2021)
2010 – 2019
- 2019
- [c15]Paul Godard, Vincent Loechner, Cédric Bastoul, Frédéric Soulier, Guillaume Muller:
A Flexible and Distributed Runtime System for High-Throughput Constrained Data Streams Generation. IPDPS Workshops 2019: 718-728 - 2017
- [j9]Toufik Baroudi, Rachid Seghir
Optimization of Triangular and Banded Matrix Operations Using 2d-Packed Layouts. ACM Trans. Archit. Code Optim. 14(4): 55:1-55:19 (2017) - [c14]Harenome Razanajato, Cédric Bastoul, Vincent Loechner:
Lifting Barriers Using Parallel Polyhedral Regions. HiPC 2017: 338-347 - 2014
- [j8]Alexandra Jimborean
Dynamic and Speculative Polyhedral Parallelization Using Compiler-Generated Skeletons. Int. J. Parallel Program. 42(4): 529-545 (2014) - 2013
- [c13]Alexandra Jimborean
Dynamic and Speculative Polyhedral Parallelization of Loop Nests Using Binary Code Patterns. ICCS 2013: 2575-2578 - [c12]Jean-François Dollinger
Adaptive Runtime Selection for GPU. ICPP 2013: 70-79 - 2012
- [j7]Rachid Seghir
Integer affine transformations of parametric ℤ-polytopes and applications to loop nest optimization. ACM Trans. Archit. Code Optim. 9(2): 8:1-8:27 (2012) - [c11]Alexandra Jimborean, Luis Mastrangelo, Vincent Loechner, Philippe Clauss
VMAD: An Advanced Dynamic Program Analysis and Instrumentation Framework. CC 2012: 220-239 - [c10]Alexandra Jimborean
Adapting the polyhedral model as a framework for efficient speculative parallelization. PPoPP 2012: 295-296 - 2011
- [c9]Alexandra Jimborean
VMAD: A virtual machine for advanced dynamic analysis of programs. ISPASS 2011: 125-126 - [c8]Benoît Pradelle, Philippe Clauss, Vincent Loechner:
Adaptive runtime selection of parallel schedules in the polytope model. SpringSim (HPC) 2011: 81-88
2000 – 2009
- 2007
- [j6]Sven Verdoolaege
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions. Algorithmica 48(1): 37-66 (2007) - 2006
- [c7]Rachid Seghir
Memory optimization by counting points in integer transformations of parametric polytopes. CASES 2006: 74-82 - 2004
- [c6]Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe:
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations. CASES 2004: 248-258 - 2002
- [j5]Vincent Loechner, Benoît Meister, Philippe Clauss
Precise Data Locality Optimization of Nested Loops. J. Supercomput. 21(1): 37-76 (2002) - 2001
- [c5]Vincent Loechner, Benoît Meister, Philippe Clauss:
Data Sequence Locality: A Generalization of Temporal Locality. Euro-Par 2001: 262-272 - 2000
- [j4]Vincent Loechner, Catherine Mongenet:
Communication Optimization for Affine Recurrence Equations Using Broadcast and Locality. Int. J. Parallel Program. 28(1): 47-102 (2000) - [j3]Vincent Loechner, Catherine Mongenet:
Memory Cost Due to Anticipated Broadcast. Parallel Process. Lett. 10(2/3): 177-188 (2000)
1990 – 1999
- 1998
- [j2]Philippe Clauss
Parametric Analysis of Polyhedral Iteration Spaces. J. VLSI Signal Process. 19(2): 179-194 (1998) - 1997
- [j1]Vincent Loechner, Doran K. Wilde:
Parameterized Polyhedra and Their Vertices. Int. J. Parallel Program. 25(6): 525-549 (1997) - [c4]Vincent Loechner, Catherine Mongenet:
Solutions to the Communication Minimization Problem for Affine Recurrence Equations. Euro-Par 1997: 328-337 - 1996
- [c3]Philippe Clauss, Vincent Loechner:
Parametric Analysis of Polyhedral Iteration Spaces. ASAP 1996: 415- - [c2]Vincent Loechner, Catherine Mongenet:
OPERA: a toolbox for loop parallelization. Software Engineering for Parallel and Distributed Systems 1996: 134-145 - 1995
- [c1]Vincent Loechner, Catherine Mongenet:
A toolbox for affine recurrence equations parallelization. HPCN Europe 1995: 263-268
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:22 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: