BibSLEIGH — Albert

Travelled to:

1 × Austria
1 × Cyprus
1 × France
1 × Germany
1 × Korea
2 × China
2 × Italy
8 × USA

Collaborated with:

C.Bastoul L.Pouchet N.Vasilache E.Rohou P.Sadayappan S.Verdoolaege R.Upadrasta J.Cavazos M.Pouzet B.Diouf F.Rastello A.Beletska M.Bachir S.A.A.Touati P.Amiranoff P.Feautrier D.Barthou J.Collard A.Susungi N.A.Rink J.Castrillón C.Tadonki R.Leupers N.M.Lê A.Pop F.Z.Nardelli M.Benabderrahmane T.Grosser J.Holewinski E.Park U.Beaugnon A.Pouille J.A.Pienaar M.Duranton C.Eisenbeis C.Pagetti F.Plateau U.Bondhugula J.Ramanujam N.Wehn M.Roodzant J.Stahl L.Fanucci B.Janson D.Nuzman S.Dyshel I.Rosen K.Williams D.Yuste A.Zaks I.Huismann J.Stiller J.Fröhlich

Talks about:

optim (7) polyhedr (6) model (6) time (3) iter (3) generat (2) vector (2) toward (2) tensor (2) system (2)

Person: Albert Cohen

DBLP: Cohen:Albert

Facilitated 2 volumes:

Contributed to:

2014

2013

2011

2010

2008

2007

2006

1998

2017

2018

2017

Wrote 21 papers:

CGO-2014-GrosserCHSV #hybrid: Hybrid Hexagonal/Classical Tiling for GPUs (TG, AC, JH, PS, SV), p. 66.
DATE-2014-LeupersWLRSFCJ #towards: Technology transfer towards Horizon 2020 (RL, NW, RL, MR, JS, LF, AC, BJ), p. 1.
CGO-2013-DioufCR #heuristic #polynomial: A polynomial spilling heuristic: Layered allocation (BD, AC, FR), p. 10.
POPL-2013-UpadrastaC #scheduling #using: Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (RU, AC), pp. 483–496.
PPoPP-2013-LePCN #memory management #modelling #performance: Correct and efficient work-stealing for weak memory models (NML, AP, AC, FZN), pp. 69–80.
CGO-2011-NuzmanDRRWYCZ: Vapor SIMD: Auto-vectorize once, run everywhere (DN, SD, ER, IR, KW, DY, AC, AZ), pp. 151–160.
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.
SAS-2011-VerdoolaegeCB #approximate #integer #transitive #tuple: Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations (SV, AC, AB), pp. 216–232.
CC-2010-BenabderrahmanePCB: The Polyhedral Model Is More Widely Applicable Than You Think (MWB, LNP, AC, CB), pp. 283–303.
DAC-2010-CohenR #compilation #embedded #manycore: Processor virtualization and split compilation for heterogeneous multicore embedded systems (AC, ER), pp. 102–107.
LCTES-2008-BachirTC: Post-pass periodic register allocation to minimise loop unrolling degree (MB, SAAT, AC), pp. 141–150.
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.
CC-2006-VasilacheBC #code generation: Polyhedral Code Generation in the Real World (NV, CB, AC), pp. 185–201.
POPL-2006-CohenDEPPP #network #realtime: N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems (AC, MD, CE, CP, FP, MP), pp. 180–193.
SAS-2006-AmiranoffCF #abstract domain #relational: Beyond Iteration Vectors: Instancewise Relational Abstract Domains (PA, AC, PF), pp. 161–180.
POPL-1998-BarthouCC: Maximal Static Expansion (DB, AC, JFC), pp. 98–106.
GPCE-2017-SusungiRCHCTSF #composition #generative #optimisation #towards: Towards compositional and generative tensor optimizations (AS, NAR, JC, IH, AC, CT, JS, JF), pp. 169–175.
GPCE-2018-SusungiRCCT #metaprogramming #optimisation: Meta-programming for cross-domain tensor optimizations (AS, NAR, AC, JC, CT), pp. 79–92.
CC-2017-BeaugnonPPPC #optimisation: Optimization space pruning without regrets (UB, AP, MP, JAP, AC), pp. 34–44.