Abstract
Dynamically reconfigurable FPGAs have the potential to dramatically improve logic density by time-sharing a physical FPGA device. This paper presents a network-flow based partitioning algorithm for dynamically reconfigurable FPGAs based on the architecture in [2]. Experiments show that our approach outperforms the enhanced force-directed scheduling method in [2] in terms of communication cost.
Original language | English |
---|---|
Title of host publication | FPGA '99 |
Subtitle of host publication | Proceedings of the 7th ACM/SIGDA International Symposium on Field Programmable Gate Arrays |
Publisher | Association for Computing Machinery (ACM) |
Pages | 187-194 |
Number of pages | 8 |
ISBN (Print) | 9781581130881 |
DOIs | |
Publication status | Published - 21 Feb 1999 |
Event | 7th ACM/SIGDA International Symposium on Field Programmable Gate Arrays, FPGA 1999 - Monterey, United States Duration: 21 Feb 1999 → 23 Feb 1999 https://dl.acm.org/doi/proceedings/10.1145/296399 |
Publication series
Name | Proceedings of the ACM/SIGDA International Symposium on Field Programmable Gate Arrays, FPGA |
---|
Conference
Conference | 7th ACM/SIGDA International Symposium on Field Programmable Gate Arrays, FPGA 1999 |
---|---|
Country/Territory | United States |
City | Monterey |
Period | 21/02/99 → 23/02/99 |
Internet address |
Scopus Subject Areas
- General Computer Science