Abstract
Accelerators are becoming increasingly prevalent in distributed computation. FPGAs have been shown to be fast and power efficient for particular tasks, yet scheduling on FPGA-based multi-accelerator systems is challenging when workloads vary significantly in granularity in terms of task size and/or number of computational units required. We present a novel approach for dynamically scheduling tasks on networked multi-FPGA systems which maintains high performance, even in the presence of irregular tasks. Our topological ranking-based scheduling allows realistic irregular workloads to be processed while maintaining a significantly higher level of performance than existing schedulers.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Conference on Field-Programmable Technology 2018, Naha, Okinawa, Japan |
| Publisher | IEEE Press |
| Pages | 318-321 |
| DOIs | |
| Publication status | Published - 10 Dec 2018 |
| Event | International Conference on Field-Programmable Technology (FPT'18) - Naha, Okinawa, Japan Duration: 10 Dec 2018 → 14 Dec 2018 http://www.fpt18.sakura.ne.jp/ |
Conference
| Conference | International Conference on Field-Programmable Technology (FPT'18) |
|---|---|
| Abbreviated title | FPT'18 |
| Country/Territory | Japan |
| City | Naha, Okinawa |
| Period | 10/12/18 → 14/12/18 |
| Internet address |
Keywords
- Runtime scheduling
- Lattice
- Representation
- Multi-FPGA
Fingerprint
Dive into the research topics of 'Lattice-based scheduling for multi-FPGA systems'. Together they form a unique fingerprint.Student theses
-
Heterogeneity-aware scheduling and data partitioning for system performance acceleration
Yu, T. (Author), Thomson, J. D. (Supervisor), 29 Jul 2020Student thesis: Doctoral Thesis (PhD)
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver