From 10013969971a6c2f3a8b0966323ae35e9a3fb1d8 Mon Sep 17 00:00:00 2001 From: Cliff Click Date: Mon, 10 Mar 2025 12:54:46 -0700 Subject: Update README.md --- chapter20/README.md | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) (limited to 'chapter20/README.md') diff --git a/chapter20/README.md b/chapter20/README.md index ae2b9df0..b06e1f7a 100644 --- a/chapter20/README.md +++ b/chapter20/README.md @@ -11,7 +11,9 @@ Chaitin's original: https://en.wikipedia.org/wiki/Register_allocation#CITEREFCha Briggs additions: https://dl.acm.org/doi/10.1145/177492.177575 -There are several other useful link that can be found by searching for Briggs +Nice lecture slides pdf of Briggs/Chaitin: https://aktemur.github.io/cs544/lectures/chapter%2013%20registerAllocation.pdf + +There are several other useful links that can be found by searching for Briggs or Chaitin in combination. Basically there was a spate of register allocation improvements in this era that made it into many high-end mainstream compilers. @@ -48,7 +50,7 @@ allocation quality becomes heavily dependent on splitting and coloring heuristics. Hence, much of the "high theory" will be used to drive the core coloring -algorithm, but much of the "actual success" will depend on a large collection +algorithm, but much of the actual success will depend on a large collection of heuristics. ### Coloring Rounds -- cgit v1.2.3