Re: [abc] cflow call graph timings

I think these are worth putting in the paper. What do you think?

Laurie

+-------------------------------------------------------------+
| Laurie Hendren, Professor, School of Computer Science |
| McGill University |
| 318 McConnell Engineering Building tel: (514) 398-7391 |
| 3480 University Street fax: (514) 398-3883 |
| Montreal, Quebec H3A 2A7 hendren@cs.mcgill.ca |
| CANADA http://www.sable.mcgill.ca/~hendren |
| http://wwww.sable.mcgill.ca http://aspectbench.org |
+-------------------------------------------------------------+

On Fri, 15 Apr 2005, Ondrej Lhotak wrote:

> I've split out the cflow timings into encoding the call graph in bdds
> and actually doing the analysis and changing advice lists. Here's the
> breakdown. All times are in ms.
>
> Notice that: 1) encoding the CG is the bulk of the time 2) analysis
> itself is quite quick, except in sablecc 3) bigger CG (CHA) takes longer
> to encode 4) analysis takes a bit longer on bigger CG
>
> Analysis/advice lists:
> PTA CHA
> ConaSim 395 668
> sablecc 90138 101137
> ants 207 128
> conastack 152 174
> figure 73 100
> quicksort 67 95
> lodsim 576 1293
> weka 1917 2153
>
> Encoding CG in BDDs:
> PTA CHA
> ConaSim 19919 47418
> sablecc 155913 211815
> ants 24970 61446
> conastack 19315 57910
> figure 17395 44657
> quicksort 19222 45051
> lodsim 27903 148714
> weka 82384 207530
>
>
>
>
Received on Sat Apr 16 00:20:57 2005