Follow
Oleksandr Zinenko
Oleksandr Zinenko
Google Brain
Verified email at google.com - Homepage
Title
Cited by
Cited by
Year
Tensor comprehensions: Framework-agnostic high-performance machine learning abstractions
N Vasilache, O Zinenko, T Theodoridis, P Goyal, Z DeVito, WS Moses, ...
arXiv preprint arXiv:1802.04730, 2018
3572018
MLIR: A compiler infrastructure for the end of Moore's law
C Lattner, M Amini, U Bondhugula, A Cohen, A Davis, J Pienaar, R Riddle, ...
arXiv preprint arXiv:2002.11054, 2020
1512020
Mlir: Scaling compiler infrastructure for domain specific computation
C Lattner, M Amini, U Bondhugula, A Cohen, A Davis, J Pienaar, R Riddle, ...
2021 IEEE/ACM International Symposium on Code Generation and Optimization …, 2021
1192021
The next 700 accelerated layers: From mathematical expressions of network computation graphs to accelerated gpu kernels, automatically
N Vasilache, O Zinenko, T Theodoridis, P Goyal, Z Devito, WS Moses, ...
ACM Transactions on Architecture and Code Optimization (TACO) 16 (4), 1-26, 2019
452019
Modeling the conflicting demands of parallelism and temporal/spatial locality in affine scheduling
O Zinenko, S Verdoolaege, C Reddy, J Shirako, T Grosser, V Sarkar, ...
Proceedings of the 27th International Conference on Compiler Construction, 3-13, 2018
432018
Opening polyhedral compiler's black box
L Bagnères, O Zinenko, S Huot, C Bastoul
Proceedings of the 2016 International Symposium on Code Generation and …, 2016
332016
Domain-specific multi-level IR rewriting for GPU
T Gysi, C Müller, O Zinenko, S Herhut, E Davis, T Wicky, O Fuhrer, ...
arXiv preprint arXiv:2005.13014, 2020
202020
Declarative loop tactics for domain-specific optimization
L Chelini, O Zinenko, T Grosser, H Corporaal
ACM Transactions on Architecture and Code Optimization (TACO) 16 (4), 1-25, 2019
182019
Clint: A direct manipulation tool for parallelizing compute-intensive program parts
O Zinenko, S Huot, C Bastoul
2014 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC …, 2014
172014
Manipulating visualization, not codes
O Zinenko, C Bastoul, S Huot
International Workshop on Polyhedral Compilation Techniques (IMPACT), 8, 2015
162015
TC-CIM: Empowering tensor comprehensions for computing-in-memory
A Drebes, L Chelini, O Zinenko, A Cohen, H Corporaal, T Grosser, ...
IMPACT 2020-10th International Workshop on Polyhedral Compilation Techniques, 2020
142020
Progressive raising in multi-level ir
L Chelini, A Drebes, O Zinenko, A Cohen, N Vasilache, T Grosser, ...
2021 IEEE/ACM International Symposium on Code Generation and Optimization …, 2021
112021
Domain-specific multi-level IR rewriting for GPU: The Open Earth compiler for GPU-accelerated climate simulation
T Gysi, C Müller, O Zinenko, S Herhut, E Davis, T Wicky, O Fuhrer, ...
ACM Transactions on Architecture and Code Optimization (TACO) 18 (4), 1-23, 2021
102021
Unified polyhedral modeling of temporal and spatial locality
O Zinenko, S Verdoolaege, C Reddy, J Shirako, T Grosser, V Sarkar, ...
Inria Paris, 2017
102017
Declarative transformations in the polyhedral model
O Zinenko, L Chelini, T Grosser
Inria; ENS Paris-Ecole Normale Supérieure de Paris; ETH Zurich; TU Delft …, 2018
92018
Polygeist: Raising C to Polyhedral MLIR
WS Moses, L Chelini, R Zhao, O Zinenko
2021 30th International Conference on Parallel Architectures and Compilation …, 2021
82021
Visual program manipulation in the polyhedral model
O Zinenko, S Huot, C Bastoul
ACM Transactions on Architecture and Code Optimization (TACO) 15 (1), 1-25, 2018
72018
Dual-layer hardware and software management in cluster systems
S Stirenko, O Zinenko, D Gribenko
Proc. Third Int. Conf.” High Performance Computing” HPC-UA, 380-385, 2013
72013
Polygeist: Affine c in mlir
WS Moses, L Chelini, R Zhao, O Zinenko
IMPACT, 2021
52021
Composable and Modular Code Generation in MLIR: A Structured and Retargetable Approach to Tensor Compiler Construction
N Vasilache, O Zinenko, AJC Bik, M Ravishankar, T Raoux, A Belyaev, ...
arXiv preprint arXiv:2202.03293, 2022
42022
The system can't perform the operation now. Try again later.
Articles 1–20