D
Dario Korolija
Researcher at ETH Zurich
Publications - 10
Citations - 84
Dario Korolija is an academic researcher from ETH Zurich. The author has contributed to research in topics: Computer science & Field-programmable gate array. The author has an hindex of 3, co-authored 6 publications receiving 18 citations. Previous affiliations of Dario Korolija include École Polytechnique Fédérale de Lausanne.
Papers
More filters
Proceedings Article
Do OS abstractions make sense on FPGAs
TL;DR: Coyote is built and evaluated, an open source, portable, configurable “shell” for FPGAs which provides a full suite of OS abstractions, working with the host OS.
Proceedings ArticleDOI
Enzian: an open, general, CPU/FPGA platform for systems software research
David Cock,Abishek Ramdas,Daniel David Schwyn,Michael Giardino,A. M. Turowski,Zhenhao He,Nora Hossle,Dario Korolija,Melissa Licciardello,K. N. Martsenko,Reto Achermann,Gustavo Alonso,Timothy Roscoe +12 more
TL;DR: It is shown that a research group can design and build a more general, open, and affordable hardware platform for hybrid systems research, and Enzian is capable of duplicating the functionality of existing CPU/FPGA systems with comparable performance but in an open, flexible system.
Proceedings Article
Tackling Hardware/Software co-design from a database perspective.
Gustavo Alonso,Timothy Roscoe,David Cock,Mohsen Ewaida,Kaan Kara,Dario Korolija,David Sidler,Zeke Wang +7 more
TL;DR: The paper focuses on the possibilities offered by the combination of Enzian+doppioDB in terms of enabling novel data processing systems.
Proceedings ArticleDOI
EasyNet: 100 Gbps Network for HLS
TL;DR: In this article, the authors integrate an open-source 100 Gbps TCP/IP stack into a state-of-the-art FPGA development framework (Xilinx Vitis) without degrading its performance and provide a set of MPI-like communication primitives for both point-to-point and collective operations as a High Level Synthesis (HLS) library.
Proceedings ArticleDOI
FPGA-Assisted Deterministic Routing for FPGAs
TL;DR: Motivated by the approaches used in FPGA-accelerated graph processing, this work proposes and implements three acceleration strategies: reducing the number of expensive random memory accesses, parallel and pipelined computation, and efficient hardware priority queues.