DocumentCode
1890303
Title
A scheduling and allocation method to reduce data transfer time by dynamic reconfiguration
Author
Ito, Kazuhito
Author_Institution
Dept. of Electr. & Electron. Syst., Saitama Univ., Urawa, Japan
fYear
2000
fDate
9-9 June 2000
Firstpage
323
Lastpage
328
Abstract
In the era of deep submicron technology, wire delay on an LSI chip is becoming relatively larger than operation delay. Increase of execution speed by parallel processing may be limited due to the data transfer time between functional units, If we can dynamically reconfigure nearby functional units into desired operation type and execute operations on the reconfigured units, long data transfer is reduced and hence fast processing can be achieved. In this paper we propose a scheduling method to determine static operation execution time and functional unit allocation to achieve fast signal processing by considering dynamic reconfiguration of functional units. Results show the effectiveness of the proposed method.
Keywords
digital signal processing chips; large scale integration; parallel architectures; processor scheduling; reconfigurable architectures; resource allocation; DSP; data transfer time reduction; deep submicron technology; dynamic reconfiguration; dynamically reconfigurable LSI; fast signal processing; functional unit allocation; parallel processing; reconfigured units; scheduling method; static operation execution time; Adders; Delay effects; Dynamic scheduling; Hardware; Indium tin oxide; Iterative algorithms; Large scale integration; Parallel processing; Signal processing algorithms; Wire;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 2000. Proceedings of the ASP-DAC 2000. Asia and South Pacific
Conference_Location
Yokohama, Japan
Print_ISBN
0-7803-5973-9
Type
conf
DOI
10.1109/ASPDAC.2000.835118
Filename
835118
Link To Document