Подписаться
Thomas Luinaud
Thomas Luinaud
Подтвержден адрес электронной почты в домене polymtl.ca
Название
Процитировано
Процитировано
Год
Bridging the Gap: FPGAs as Programmable Switches
T Luinaud, T Stimpfling, JS da Silva, Y Savaria, JMP Langlois
2020 IEEE 21st International Conference on High Performance Switching and …, 2020
102020
One for All, All for One: A Heterogeneous Data Plane for Flexible P4 Processing
JS da Silva, T Stimpfling, T Luinaud, B Fradj, B Boughzala
2018 IEEE 26th International Conference on Network Protocols (ICNP), 440-441, 2018
102018
Design Principles for Packet Deparsers on FPGAs
T Luinaud, J Santiago da Silva, JMP Langlois, Y Savaria
The 2021 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays …, 2021
62021
An FPGA Coarse Grained Intermediate Fabric for Regular Expression Search
T Luinaud, Y Savaria, JM Langlois
Proceedings of the on Great Lakes Symposium on VLSI 2017, 423-426, 2017
52017
An FPGA-based HW/SW Co-Verification Environment for Programmable Network Devices
M Su, JP David, Y Savaria, B Pontikakis, T Luinaud
2022 IEEE International Symposium on Circuits and Systems (ISCAS), 2529-2533, 2022
12022
An FPGA Overlay Architecture for Cost Effective Regular Expression Search
T Luinaud, Y Savaria, JM Langlois
Proceedings of the 2017 ACM/SIGDA International Symposium on Field …, 2017
12017
Symbolic Analysis for Data Plane Programs Specialization
T Luinaud, JMP Langlois, Y Savaria
ACM Transactions on Architecture and Code Optimization 20 (1), 1-21, 2022
2022
Optimisation de la compilation de déparseurs pour processeurs réseau implémentés sur FPGA
T Luinaud
Polytechnique Montréal, 2022
2022
Unleashing the Power of FPGAs as Programmable Switches
T Luinaud, T Stimpfling, J Santiago Da Silva, Y Savaria, JMP Langlois
Proceedings of the 2020 ACM/SIGDA International Symposium on Field …, 2020
2020
Algorithmes et architectures pour l'implémentation de la détection d'expressions régulières
T Luinaud
Ecole Polytechnique, Montreal (Canada), 2017
2017
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–10