31 Mar 2002 23:36:34 -0500

Related articles |
---|

Short Graph Coloring Question chiefwiggum@eircom.net (Stephen Molloy) (2002-03-31) |

Re: Short Graph Coloring Question dan@dberlin.org (Daniel Berlin) (2002-04-06) |

Re: Short Graph Coloring Question mlacey@microsoft.com (Mark Lacey \[MSFT\]) (2002-04-06) |

Re: Short Graph Coloring Question dakupoto@ece.utexas.edu (Amal Banerjee) (2002-04-06) |

Re: Short Graph Coloring Question Sid-Ahmed-Ali.TOUATI@inria.fr (Sid Ahmed Ali TOUATI) (2002-04-13) |

From: | "Stephen Molloy" <chiefwiggum@eircom.net> |

Newsgroups: | comp.compilers |

Date: | 31 Mar 2002 23:36:34 -0500 |

Organization: | Compilers Central |

References: | <Pine.BSI.4.40.0203291645550.1371-100000@tom.iecc.com> |

Keywords: | optimize, question |

Posted-Date: | 31 Mar 2002 23:36:34 EST |

Graph Coloring Short Question

Interference Information

Variable | Interferes With

a | b,c,d,e

b | a,c,e

c | a,b,d

d | a,c

e | a,b

Show with graph coloring how we can put them in three registers?

Remove any node with less than K edges (K=3)

1. remove e

2. remove d

3. remove b

4. remove a

5. remove c

How do we get from here to register allocation?

I'm looking for the method not the answer, just a part of the method

I'm looking for - the bit where you go from reducing the graph to

allocating into registers.

I have tried google but I get too complex examples. I've also tried

the groups archive but I found nothing relevant.

Thank you,

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.