BibSLEIGH — Louis-Noel

Travelled to:

1 × China
1 × Cyprus
1 × Estonia
1 × Germany
1 × India
1 × United Kingdom
2 × France
6 × USA

Collaborated with:

P.Sadayappan A.Cohen J.Ramanujam F.Rastello C.Bastoul S.Krishnamoorthy M.Kong N.Fauzia Wenlei Bao K.Stock J.Cavazos N.Vasilache V.Elango F.Franchetti M.Ravishankar A.Rountev J.Kim M.Benabderrahmane Changwan Hong Travis Augustine Janarthanan Sarma Gabriel Rodríguez 0001 E.Park T.Claveirole S.Lombardy S.O'Connor J.Sakarovitch R.Veras T.Henretty R.Dathathri T.Grosser J.Shirako K.Sharma V.Sarkar J.Holewinski R.Ramamurthi U.Bondhugula S.Rajbhandari R.J.Harrison A.C.0001 Aravind Sukumaran-Rajam P.S.Rawat

Talks about:

optim (6) model (6) transform (5) polyhedr (5) data (4) code (4) program (3) generat (3) iter (3) multidimension (2)

Person: Louis-Noël Pouchet

DBLP: Pouchet:Louis=No=euml=l

Facilitated 1 volumes:

Contributed to:

2015

2014

2013

2012

2011

2010

2008

2007

2005

2016

2018

2019

Wrote 21 papers:

CGO-2015-FauziaPS #memory management: Characterizing and enhancing global memory data coalescing on GPUs (NF, LNP, PS), pp. 12–22.
POPL-2015-ElangoRPRS #complexity #data access #on the #source code: On Characterizing the Data Access Complexity of Programs (VE, FR, LNP, JR, PS), pp. 567–580.
PPoPP-2015-RavishankarDEPRRS #code generation #distributed #memory management: Distributed memory code generation for mixed Irregular/Regular computations (MR, RD, VE, LNP, JR, AR, PS), pp. 65–75.
PLDI-2014-StockKGPRRS #framework #order #reuse: A framework for enhancing data reuse via associative reordering (KS, MK, TG, LNP, FR, JR, PS), p. 10.
PLDI-2013-KongVSFPS #code generation: When polyhedral transformations meet SIMD code generation (MK, RV, KS, FF, LNP, PS), pp. 127–138.
CC-2012-ShirakoSFPRSS #bound: Analytical Bounds for Optimal Tile Size Selection (JS, KS, NF, LNP, JR, PS, VS), pp. 101–121.
PLDI-2012-HolewinskiRRFPRS #analysis: Dynamic trace-based analysis of vectorization potential of applications (JH, RR, MR, NF, LNP, AR, PS), pp. 371–382.
CC-2011-HenrettySPFRS #architecture #layout: Data Layout Transformation for Stencil Computations on Short-Vector SIMD Architectures (TH, KS, LNP, FF, JR, PS), pp. 225–245.
CGO-2011-ParkPCCS #modelling #optimisation #predict: Predictive modeling in a polyhedral optimization space (EP, LNP, JC, AC, PS), pp. 119–129.
POPL-2011-PouchetBBCRSV #optimisation: Loop transformations: convexity, pruning and optimization (LNP, UB, CB, AC, JR, PS, NV), pp. 549–562.
CC-2010-BenabderrahmanePCB: The Polyhedral Model Is More Widely Applicable Than You Think (MWB, LNP, AC, CB), pp. 283–303.
PLDI-2008-PouchetBCC #multi #optimisation: Iterative optimization in the polyhedral model: part ii, multidimensional time (LNP, CB, AC, JC), pp. 90–100.
CGO-2007-PouchetBCV #optimisation: Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time (LNP, CB, AC, NV), pp. 144–156.
CIAA-2005-ClaveiroleLOPS: Inside Vaucanson (TC, SL, SO, LNP, JS), pp. 116–128.
CC-2016-RajbhandariKKPR #on the #recursion #traversal: On fusing recursive traversals of K-d trees (SR, JK, SK, LNP, FR, RJH, PS), pp. 152–162.
PLDI-2016-HongB0KPRRS #array #effectiveness #multi: Effective padding of multidimensional arrays to avoid cache conflict misses (CH, WB, AC0, SK, LNP, FR, JR, PS), pp. 129–144.
POPL-2016-BaoKPRS #named #source code #verification: PolyCheck: dynamic verification of iteration space transformations on affine programs (WB, SK, LNP, FR, PS), pp. 539–554.
PLDI-2018-HongSKRKPRS #analysis #gpu #kernel #optimisation #using: GPU code optimization using abstract kernel emulation and sensitivity analysis (CH, ASR, JK, PSR, SK, LNP, FR, PS), pp. 736–751.
POPL-2018-BaoKPS #behaviour #modelling #source code: Analytical modeling of cache behavior for affine programs (WB, SK, LNP, PS), p. 26.
PLDI-2019-AugustineSP0 #generative: Generating piecewise-regular code from irregular structures (TA, JS, LNP, GR0), pp. 625–639.
PLDI-2019-KongP #manycore #modelling: Model-driven transformations for multi- and many-core CPUs (MK, LNP), pp. 469–484.