DocumentCode
2879397
Title
An Efficient Algorithm for Finding Empty Space for Reconfigurable Systems
Author
Xiao, Yan ; Duan, Zhenhua ; Nie, Pengcheng
Author_Institution
Inst. of Comput. Theor. & Technol., Xidian Univ., Xi´´an, China
fYear
2009
fDate
29-31 July 2009
Firstpage
36
Lastpage
43
Abstract
The management of resources in reconfigurable systems is one of the most critical factors concerned deeply with the performance of dynamic reconfigurable systems. There are several algorithms for managing the empty space of reconfigurable systems, among which the basic scan line algorithm (SLA) is a relative efficient one. However, SLA suffers from two problems: redundancy and duplication. To solve duplication, the improved scan line algorithm (ISLA) is proposed in. However, the redundancy problem is remained. Therefore, we are motivated to over come this problem and propose an enhanced algorithm called ESLA based on SLA. ESLA solves problems of both redundancy and duplication. Further, Simulation experiments show that the performance of ESLA is better than ISLA.
Keywords
field programmable gate arrays; ESLA; dynamic reconfigurable systems; improved scan line algorithm; scan line algorithm; Algorithm design and analysis; Field programmable gate arrays; Flexible printed circuits; Hardware; Random access memory; Resource management; SRAM chips; Software algorithms; Software engineering; Space technology; design of algorithms; managing empty space; maximal empty rectangle; scan line algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Theoretical Aspects of Software Engineering, 2009. TASE 2009. Third IEEE International Symposium on
Conference_Location
Tianjin
Print_ISBN
978-0-7695-3757-3
Type
conf
DOI
10.1109/TASE.2009.13
Filename
5198485
Link To Document