An algorithm based on the Hungarian method for register reduction during complex functional unit allocation

Autor:	W.R. Cyre, Ta-Cheng Lin
Rok vydání:	2002
Předmět:	Reduction (complexity) Register (music) Hungarian algorithm Computer science High-level synthesis Resource allocation (computer) Parallel computing Operand Algorithm Unit (ring theory) Register allocation
Zdroj:	Proceedings IEEE SOUTHEASTCON '97. 'Engineering the New Century'.
DOI:	10.1109/secon.1997.598606
Popis:	The trends of high-level synthesis are moving from using elementary operations to more complicated operations. These complex operations are implemented by using complicated functional units. Most complex components only have single data I/O ports (buses) so that memory devices, such as stacks, are inside the components to hold the input operands and results for execution. Traditional register allocation algorithms can not be applied directly because the internal memory devices can used to hold the intermediate values. An algorithm which is based on the Hungarian Method has been developed to minimize the use of registers when complex functional units are used.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::50acc3492f557dcdbb01bd8c7637cf51 https://doi.org/10.1109/secon.1997.598606 Zobrazit plný text záznamu