Talk:Register allocation

message: I can't tell what direction it's in, but please see:
http://www.cs.mtu.edu/~sliu/raa.pdf
: Link is dead now 84.209.121.30 (talk) 17:02, 3 June 2010 (UTC)
thread_title:  Plagiarism ?

message: What does NP-complete mean? I don't see it defined anywhere in the article and seems to assume expert knowledge with out any references...
: See NP (complexity), I added the link Madhu 23:30, 5 September 2005 (UTC)
thread_title:  NP-complete? 

message: The defintition of "R-colorable" isn't defined.  Basically the text says that a graph is R-colorable if another graph is R-colorable.  —Preceding unsigned comment added by 200.86.53.221 (talk) 01:37, 15 November 2007 (UTC)
thread_title:  R-colorable? 

message: Register pressure redirects to this article, but this term is not explained in this article. What does it mean? (This old version may give a hint, but needs to be checked) --Abdull (talk) 11:24, 1 April 2010 (UTC)
replies: text: I added a couple of sentences to the Introduction section. 84.209.121.30 (talk) 17:08, 3 June 2010 (UTC)
thread_title:  Register pressure 

message: Certain parts of the article make a frequent over-simplification that register allocation is equivalent to graph coloring. This has proven to be an inadequate explanation of the real problem of interest. For a recent summary, please see this article:
  http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2006/RR2006-13.pdf
in particular, one certainly cannot say that because one can reduce register allocation to an NP hard problem, then register allocation is NP-complete. The reductions for NP-hardness need to go the other way round! Again, please see the paper above or the papers cited there.  — Preceding unsigned comment added by Vkuncak (talk • contribs) 19:48, 10 December 2013 (UTC)
replies: text: Yeah, I have to agree with you here. There is actually a reduction in the right direction, but it is a lot more subtle than presented in the article. In particular, the register allocation problem for most actual computers seems to be easy. You only get NP hardness with certain restrictions on what a program can do.  — Preceding unsigned comment added by 2003:69:CD02:FE01:2E81:58FF:FEFF:8F4B (talk) 13:44, 29 December 2013 (UTC)
thread_title:  Graph coloring

message: Hi! We've been recently working on a literature search about register allocation. We were wondering if someone would oppose to the merging of the current register allocation wikipedia article and our current draft. The draft is available there: https://en.wikipedia.org/wiki/User:Grophi/sandbox, please note this is still a work in progress. We tried to keep the vast majority of the content proposed in the current article in the draft, but might have missed some parts. (Grophi (talk) 01:26, 9 January 2019 (UTC)
thread_title:  Possible merge ?

message: Some bibliographic entries are duplicated ;
* 
* 
 Done! Thanks! Grophi (talk) 17:58, 21 January 2019 (UTC)
thread_title:  General Comments 

message: === Principle ===
=== Challenges of register allocation ===
Maybe change the line in registers or outside registers to Inside or outside registers
  Done! Grophi (talk) 20:21, 24 January 2019 (UTC)
thread_title:  Context 

message: Maybe change the line in registers or outside registers to Inside or outside registers
  Done! Grophi (talk) 20:21, 24 January 2019 (UTC)
thread_title:  Challenges of register allocation 

message: Aliasing
* Weird formulation in when an assignment to one register can affect the value of another., maybe change to In some architectures,an assignment to one register can affect the value of another 
* Also maybe explain why it can affect the value of another register with aliasing, I don't know if it is outside of the scope of this article
Toomai93 (talk) 20:26, 22 January 2019 (UTC)
thread_title: Common problems raised in register allocation

message: Spill cost
* Maybe add an example ?
Toomai93 (talk) 16:23, 23 January 2019 (UTC)
thread_title:  Principle 

message: * Dacapo benchmark suite => a breif introduction of the benchmark would be great ! make a new wiki entry ?
SelimLakhdar (talk) 09:06, 28 January 2019 (UTC)
thread_title:  Comparison between the different techniques 

message: "It was first proposed by Chaitin et al." - here's an article by Robert Wagner from 1970 talking about using graph coloring for register allocation (using a macro assembler) https://hdl.handle.net/1813/5928
This article is not referenced by Chaitin's aricle, but both reference Yershov Helphelp101 (talk) 11:05, 12 April 2023 (UTC)
thread_title:  Robert Wagner's 1970 article 

message: Prior content in this article duplicated one or more previously published sources. The material was copied from: https://dl.acm.org/doi/pdf/10.1145/143103.143143. Copied or closely paraphrased material has been rewritten or removed and must not be restored, unless it is duly released under a compatible license. (For more information, please see "using copyrighted works from others" if you are not the copyright holder of this material, or "donating copyrighted materials" if you are.)
For legal reasons, we cannot accept copyrighted text or images borrowed from other web sites or published material; such additions will be deleted. Contributors may use copyrighted publications as a source of information, and, if allowed under fair use, may copy sentences and phrases, provided they are included in quotation marks and referenced properly. The material may also be rewritten, provided it does not infringe on the copyright of the original or plagiarize from that source. Therefore, such paraphrased portions must provide their source. Please see our guideline on non-free text for how to properly implement limited quotations of copyrighted text. Wikipedia takes copyright violations very seriously, and persistent violators will be blocked from editing. While we appreciate contributions, we must require all contributors to understand and comply with these policies. Thank you.  ARandomName123 (talk)Ping me!  22:13, 15 September 2023 (UTC)
replies: text: Note: The copyvio content was added when User:Grophi merged their version of the article with the original article in this diff:  ARandomName123 (talk)Ping me!  22:14, 15 September 2023 (UTC)
thread_title:  Copyright problem removed