Graph coloring data set

Andrew Appel <appel@cs.Princeton.EDU>
19 May 1996 18:28:28 -0400

          From comp.compilers
Related articles
Graph coloring data set appel@cs.Princeton.EDU (Andrew Appel) (1996-05-19)
| List of all articles for this month |
From: Andrew Appel <appel@cs.Princeton.EDU>
Newsgroups: comp.compilers
Date: 19 May 1996 18:28:28 -0400
Organization: Princeton University
Keywords: optimize, registers

For those of you interested in evaluating algorithms for graph-coloring
register allocation, we have compiled a set of almost twenty-eight thousand
register interference graphs generated by the Standard ML of New Jersey
compiler compiling itself.


See http://www.cs.princeton.edu/~appel/graphdata
for more information.


Andrew W. Appel, Princeton University, appel@princeton.edu
                Lal George, Bell Laboratories, lal.george@bell-labs.com


--

Post a followup to this message

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