000192877 001__ 192877
000192877 005__ 20190415234915.0
000192877 037__ $$aCONF
000192877 245__ $$aRegister Allocation in the SPUR Lisp Compiler
000192877 269__ $$a1986
000192877 260__ $$bACM$$c1986
000192877 336__ $$aConference Papers
000192877 520__ $$aRegister allocation is an important component of most compilers, particularly those for RISC machines. The SPUR Lisp compiler uses a sophisticated, graph-coloring algorithm developed by Fredrick Chow [Chow84]. This paper describes the algorithm and the techniques used to implement it efficiently and evaluates its performance on several large programs. The allocator successfully assigned most temporaries and local variables to registers in a wide variety of functions. Its execution cost is moderate.
000192877 700__ $$aLarus, James R.
000192877 700__ $$aHilfinger, Paul N.
000192877 773__ $$tACM SIGPLAN 1986 Symposium on Compiler Construction$$q255-263
000192877 8564_ $$uhttp://doi.acm.org/10.1145/12276.13337$$zURL
000192877 909C0 $$xU12814$$0252497$$pUPLARUS
000192877 909CO $$ooai:infoscience.tind.io:192877$$qGLOBAL_SET$$pconf$$pIC
000192877 937__ $$aEPFL-CONF-192877
000192877 973__ $$rREVIEWED$$sPUBLISHED$$aOTHER
000192877 980__ $$aCONF