Lattice-based scheduling for multi-FPGA systems
MetadataShow full item record
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.
Yu , T , Feng , B , Stillwell , M , Guo , L , Ma , Y & Thomson , J D 2018 , Lattice-based scheduling for multi-FPGA systems . in Proceedings of the International Conference on Field-Programmable Technology 2018, Naha, Okinawa, Japan . IEEE Press , International Conference on Field-Programmable Technology (FPT'18) , Naha, Okinawa , Japan , 10/12/18 .conference
Proceedings of the International Conference on Field-Programmable Technology 2018, Naha, Okinawa, Japan
© 2018, IEEE. This work has been made available online in accordance with the publisherâ€™s policies. This is the author created accepted version manuscript following peer review and as such may differ slightly from the final published version. The final published version of this work is available at https://ieeexplore.ieee.org/
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.