Re: Graph Coloring and Register Allocation

TOUATI Sid <touati@prism.uvsq.fr>
23 Dec 2003 00:19:53 -0500

          From comp.compilers
Related articles
Graph Coloring and Register Allocation rsherry8@comcast.net (Robert Sherry) (2003-12-20)
Re: Graph Coloring and Register Allocation danwang74@hotmail.com (Daniel C. Wang) (2003-12-21)
Re: Graph Coloring and Register Allocation anton@mips.complang.tuwien.ac.at (2003-12-21)
Re: Graph Coloring and Register Allocation richard@imagecraft.com (Richard F. Man) (2003-12-21)
Re: Graph Coloring and Register Allocation touati@prism.uvsq.fr (TOUATI Sid) (2003-12-23)
| List of all articles for this month |
From: TOUATI Sid <touati@prism.uvsq.fr>
Newsgroups: comp.compilers
Date: 23 Dec 2003 00:19:53 -0500
Organization: Universite de Versailles Saint-Quentin-en-Yvelines
References: 03-12-117
Keywords: registers, architecture
Posted-Date: 23 Dec 2003 00:19:53 EST

Graph coloring was an old technique for register allocation on old
sequantial processors. Nowadays, it is questionable if classical graph
coloring of interference graphs can still solve the problem of register
allocation, since fine-grain parallelism has been introduced since many
decades. So, the problem became different, since you have to handle not
only registers, but also you have to take care of parallelism.


S

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.