Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Iooss, Guillaume"'
Publikováno v:
36th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '24), Jun 2024, Nantes, France
When designing an algorithm, one cares about arithmetic/computational complexity, but data movement (I/O) complexity plays an increasingly important role that highly impacts performance and energy consumption. For a given algorithm and a given I/O mo
Externí odkaz:
http://arxiv.org/abs/2404.16443
Autor:
Derumigny, Nicolas, Gruber, Fabian, Bastian, Théophile, Iooss, Guillaume, Guillon, Christophe, Pouchet, Louis-Noël, Rastello, Fabrice
In a super-scalar architecture, the scheduler dynamically assigns micro-operations ($\mu$OPs) to execution ports. The port mapping of an architecture describes how an instruction decomposes into $\mu$OPs and lists for each $\mu$OP the set of ports it
Externí odkaz:
http://arxiv.org/abs/2012.11473
Autor:
Iooss, Guillaume
Durant ces dernières années, Il est de plus en plus compliqué d'écrire du code qui utilise une architecture au mieux de ses capacités. Certaines opérations clefs ont soit un accélérateur dédié, ou admettent une implémentation finement opti
Externí odkaz:
http://www.theses.fr/2016LYSEN019/document
Autor:
Jin, Tian, Prajapati, Nirmal, Ranasinghe, Waruna, Iooss, Guillaume, Zou, Yun, Rajopadhye, Sanjay, Wonnacott, David
Polyhedral compilers perform optimizations such as tiling and parallelization; when doing both, they usually generate code that executes "barrier-synchronized wavefronts" of tiles. We present a system to express and generate code for hybrid schedules
Externí odkaz:
http://arxiv.org/abs/1610.07236
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Iooss, Guillaume1 (AUTHOR) guillaume.iooss@gmail.com, Alias, Christophe2 (AUTHOR), Rajopadhye, Sanjay3 (AUTHOR)
Publikováno v:
International Journal of Parallel Programming. Jun2021, Vol. 49 Issue 3, p376-409. 34p.
Autor:
Krakow, Lucas W., Rabiet, Louis, Zou, Yun, Iooss, Guillaume, Chong, Edwin K.P., Rajopadhye, Sanjay
Publikováno v:
In Procedia Computer Science 2014 29:1277-1288
Autor:
Iooss, Guillaume, Cohen, Albert, Potop-Butucaru, Dumitru, Pouzet, Marc, Bregeon, Vincent, Souyris, Jean, Baufreton, Philippe
Publikováno v:
IMPACT 2022-12th International Workshop on Polyhedral Compilation Techniques
IMPACT 2022-12th International Workshop on Polyhedral Compilation Techniques, Jun 2022, Budapest, Hungary. pp.1-12
IMPACT 2022-12th International Workshop on Polyhedral Compilation Techniques, Jun 2022, Budapest, Hungary. pp.1-12
International audience; The design and implementation of reactive, hard real-time systems involves modeling and generating efficient code for the integration of harmonic multi-periodic tasks. The simple principles of synchronous reactive programming
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1992527b8c3c1872d8c7e49b3eeafccf
https://hal.inria.fr/hal-03901645
https://hal.inria.fr/hal-03901645
Autor:
Derumigny, Nicolas, Bastian, Théophile, Gruber, Fabian, Iooss, Guillaume, Guillon, Christophe, Pouchet, Louis-Noel, Rastello, Fabrice
Publikováno v:
CGO 2022-International Symposium on Code Generation and Optimization
CGO 2022-International Symposium on Code Generation and Optimization, Apr 2022, Seoul, South Korea. pp.1-12
CGO 2022-International Symposium on Code Generation and Optimization, Apr 2022, Seoul, South Korea. pp.1-12
International audience; In a super-scalar architecture, the scheduler dynamically assigns micro-operations (µOPs) to execution ports. The port mapping of an architecture describes how an instruction decomposes into µOPs and lists for each µOP the
Autor:
Derumigny, Nicolas, Gruber, Fabian, Bastian, Th��ophile, Iooss, Guillaume, Guillon, Christophe, Pouchet, Louis-No��l, Rastello, Fabrice
In a super-scalar architecture, the scheduler dynamically assigns micro-operations ($\mu$OPs) to execution ports. The port mapping of an architecture describes how an instruction decomposes into $\mu$OPs and lists for each $\mu$OP the set of ports it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36cd4ad100b2d92cd44365482d6ad56b
https://hal.inria.fr/hal-03114933v3/document
https://hal.inria.fr/hal-03114933v3/document