A communication scheduling algorithm for multi-FPGA systems

被引：3

作者：

Suh, J ^{[1
]}

Kang, DI ^{[1
]}

Crago, SP ^{[1
]}

机构：

[1] Univ So Calif, Inst Informat Sci, Arlington, VA 22203 USA

来源：

2000 IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES, PROCEEDINGS | 2000年

关键词：

D O I：

10.1109/FPGA.2000.903425

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

For multiple FPGA systems, the limited number of I/O pins causes many problems. To solve these problems, efficient communication scheduling among FPGAs is crucial for obtaining high CLB utilization. In this paper, lye provide a heuristic far the NP-complete scheduling algorithm. The experimental results show that our algorithm generates excellent communication schedules: more than 90% of the randomly generated problem instances were scheduled with less than 20% overhead compared with an optimal algorithm. The execution time of the scheduling algorithm is two orders of magnitude less than the optimal scheduling algorithm.

引用

页码：299 / 300

页数：2