Lattice-based scheduling for multi-FPGA systems

Teng Yu, Bo Feng, Mark Stillwell, Liucheng Guo, Yuchun Ma, John Donald Thomson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


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 languageEnglish
Title of host publicationProceedings of the International Conference on Field-Programmable Technology 2018, Naha, Okinawa, Japan
PublisherIEEE Press
Publication statusPublished - 10 Dec 2018
EventInternational Conference on Field-Programmable Technology (FPT'18) - Naha, Okinawa, Japan
Duration: 10 Dec 201814 Dec 2018


ConferenceInternational Conference on Field-Programmable Technology (FPT'18)
Abbreviated titleFPT'18
CityNaha, Okinawa
Internet address


  • Runtime scheduling
  • Lattice
  • Representation
  • Multi-FPGA


Dive into the research topics of 'Lattice-based scheduling for multi-FPGA systems'. Together they form a unique fingerprint.

Cite this