Partitioning and scheduling technique for run time reconfigured systems Online publication date: Tue, 30-Sep-2014
by Bouraoui Ouni, Ramzi Ayadi, Abdellatif Mtibaa
International Journal of Computer Aided Engineering and Technology (IJCAET), Vol. 3, No. 1, 2011
Abstract: With tremendous improvement in FPGA technologies over the last decade, various high performances, low cost FPGAs are now available. This has enabled the development of cost effective, high speed reconfigurable boards called run time reconfigured (RTR) system. These boards, due to the abundant hardware resource available, enhance the amount of design parallelism by several magnitudes in comparison to ASIC designs of comparable cost. The advent of such high performance FPGA boards has brought a new research problem: the temporal partitioning problem. In the literature, the main objective of related algorithms in this field is to find the minimal execution time of the input graph on a fixed-size of area. However, this paper focuses on introducing a new temporal partitioning algorithm. It divides the input task graph into an optimal number of partitions and puts each task in the appropriate partition in order to decrease the transfer of data required between partitions of the design.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Aided Engineering and Technology (IJCAET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook