On Sat Jul 28 21:17:05 2007, [email protected] wrote: > Profiling some of the PGE tests reveals that our register allocation > is fairly > expensive. Most of the time is in computing our dominators, and most > of that > time goes through repeated calls to set_contains. > > I don't know enough about graphs and sets to see if we're using the > naive > O(n^2) algorithm, or the Cooper, Harvey, Kennedy algorithm; someone > who likes > CS more than I do and loves algorithms should peruse the paper and the > code: > > http://www.hipersoft.rice.edu/grads/publications/dom14.pdf > > compilers/imcc/reg_alloc.c. > > -- c
I'm going to reject this ticket, as: 1) moving from imcc to pirc 2) ticket 2 years old; lots of changes in parrot since then, current slowdowns should be re-identified with... 3) ... the new profiling runcore. -- Will "Coke" Coleda _______________________________________________ http://lists.parrot.org/mailman/listinfo/parrot-dev
