Dept. of Electr. Eng., National Taiwan Univ.FEI-PEI LAIYeh, Chia-ChengChia-ChengYehLee, Hung-ChangHung-ChangLee2007-04-192018-07-062007-04-192018-07-061992-11http://ntur.lib.ntu.edu.tw//handle/246246/2007041910032294https://www.scopus.com/inward/record.uri?eid=2-s2.0-85066899684&doi=10.1109%2fTENCON.1992.271975&partnerID=40&md5=d3edd80b21150f77091745bd16515dd3A modified register allocation algorithm whose register cost uses distinct spots is introduced. With this method, the five range of a variable can be viewed as a collection of spots, which are coordinate distances. Together with the usage counts of a variable and the increased weight on variables in loop structures, the cost of each variable already in a register is estimated. In the case where a spill is unavoidable, a variable in a register with minimum cost is chosen. Primary results show that this method increases speed about 21% in terms of the number of load/store instructions when compared with Chow's graph-coloring method. © 1992 IEEE.application/pdf408728 bytesapplication/pdfen-USGraph colorings; Loop structure; Minimum cost; Register allocation; Cost estimatingjournal article10.1109/TENCON.1992.2719752-s2.0-85066899684http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910032294/1/00271975.pdf