Path: csiph.com!optima2.xanadu-bbs.net!xanadu-bbs.net!news.glorb.com!border1.nntp.dca1.giganews.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED!nerds-end From: orchid.hybrid@gmail.com Newsgroups: comp.compilers Subject: Different approaches to register allocation (e.g. model transformer semantics) Date: Mon, 6 Jul 2015 16:05:44 -0400 (EDT) Organization: Compilers Central Lines: 9 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <15-07-001@comp.compilers> NNTP-Posting-Host: news.iecc.com Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 X-Trace: miucha.iecc.com 1436213144 3173 2001:470:1f07:1126:0:676f:7373:6970 (6 Jul 2015 20:05:44 GMT) X-Complaints-To: abuse@iecc.com NNTP-Posting-Date: Mon, 6 Jul 2015 20:05:44 +0000 (UTC) Keywords: code, optimize Posted-Date: 06 Jul 2015 16:05:44 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: csiph.com comp.compilers:1569 I read this paper about register allocation: Register Allocation By Model Transformer Semantics It was eye opening to me because it explained that graph coloring is not the whole story. Has anyone implemented the algorithm? or are there more papers about approaches like this I could read? I couldn't find any code and some details are missing.