A Column Arrangement Algorithm for a Coarse-grained Reconfigurable Architecture


Share/Save/Bookmark

Guo, Y. and Hoede, C. and Smit, G.J.M. (2006) A Column Arrangement Algorithm for a Coarse-grained Reconfigurable Architecture. In: Proceedings of the International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA'06), 26-29 Jun 2005, Las Vegas, Nevada, USA (pp. pp. 117-122).

open access
[img]
Preview
PDF
89kB
Abstract:In a coarse-grained reconfigurable architecture, the functions of resources such as Arithmetic Logic Units (ALUs) can be reconfigured. Unlike the programmability of a general purpose processor, the programmability of a coarse-grained reconfigurable architecture is limited. The limitation might be the number of different patterns or the number of different configurations of each ALU. This paper presents a column arrangement algorithm to sort the elements of patterns to reduce the number of configurations of each reconfigurable ALU. The experimental results show that this algorithm leads to nearly optimal results.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66370
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 238180