๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient algorithm for spare allocation problems

โœ Scribed by Hung-Yau Lin; Fu-Min Yeh; Kuo, S.-Y.


Book ID
114668466
Publisher
IEEE
Year
2006
Tongue
English
Weight
377 KB
Volume
55
Category
Article
ISSN
0018-9529

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An approximation algorithm for the regis
โœ K. Jansen; J. Reiter ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 244 KB

In this paper we study the problem of register allocation in the presence of parallel conditional branches with a given branching depth d. We start from a scheduled flow graph and the goal is to find an assignment of the variables in the flow graph to a minimum number of registers. This problem can