Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Kolson, David"'
Publikováno v:
Scopus-Elsevier
Autor:
Kolson, David J.
In conventional compilation, register allocation—the mapping of program variables to the registers of the target architecture—plays an important role in the performance of application code. In particular, for load/store architectures, good regist
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::ca23c8700b66a7d28235512020a1bad7
https://escholarship.org/uc/item/7976z7w0
https://escholarship.org/uc/item/7976z7w0
One of the challenging tasks in code generation for embedded systems is register assignment. When more live variables than registers exist, some variables will necessarily be accessed from data memory. Because loops are typically executed many times
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::38766d01e82a03dd320f7dd0c2b21c2e
https://escholarship.org/uc/item/0w3605wb
https://escholarship.org/uc/item/0w3605wb
This paper presents a new technique for the problem of allocating and assigning registers to variables in loops. Traditionally, cyclic variables (variables written in the current iteration and read in subsequent iterations) are split at the loop boun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::8b1535f0b7e8543e45a779c6962048e7
https://escholarship.org/uc/item/81k8c2ws
https://escholarship.org/uc/item/81k8c2ws
This paper presents a new technique for the problem of allocating and assigning registers to variables in loops. Traditionally, cyclic variables (variables written in the current iteration and read in subsequent iterations) are split at the loop boun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::c4d61d33e5804b8d0fade6125d2994a9
https://escholarship.org/uc/item/81k8c2ws
https://escholarship.org/uc/item/81k8c2ws
Loops are the main source of parallelism in applications. The issue of finding an optimal register allocation to loops has been an open issue for some time. In this case optimal refers to the minimization of spills from registers to memory. In this p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::3fa8f822b274a86d05ac408fb98b95a0
https://escholarship.org/uc/item/7bh1r086
https://escholarship.org/uc/item/7bh1r086
Previously Percolation Based Synthesis (PBS) was proposed as a new approach to the task of scheduling in High-Level Synthesis and demonstrated favorable results. PBS is an adaptation of well-founded compiler techniques with several desirable properti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::e97ca09891bbf38a18bad416ec2b513e
https://escholarship.org/uc/item/61q681cn
https://escholarship.org/uc/item/61q681cn
Autor:
Kolson, David J., Nicolau, Alexandru
Loops are the main source of parallelism in applications. The issue of finding an optimal register allocation to loops has been an open issue for some time. In this case optimal refers to the minimization of spills from registers to memory. In this p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::88e36afb489b21de3b2118729c019768
https://escholarship.org/uc/item/9rb045mv
https://escholarship.org/uc/item/9rb045mv
Autor:
Kolson, David J., Nicolau, Alexandru
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits & Systems. Nov96, Vol. 15 Issue 11, p1354. 11p. 2 Black and White Photographs, 1 Diagram, 5 Charts, 2 Graphs.
Publikováno v:
Proceedings of the 31st Annual Design Automation Conference; 6/ 6/1994, p149-154, 6p