search for: pollydependence

...t;< "Read: " << Read << "\n" >>> >>> This patch is unreadable in the mail. However, the one you submitted >>> looked good and was committed. >>> >>>> With this patch file, we can reduce the compile-time percentage of PollyDependence from 98.5% to 15.3%. Unfortunately, the compile-time percentage of PollyDependence for benchmarks, such as "nestedloop", is still very high. >>> >>> It would be good to get an up-to-date comparison with the latest patch >>> having gone into Polly. >> >&...

...45caac039/Polly-top10 Based on the comparison between "clang -O3" and "polly -O3" listed on: http://188.40.87.11:8000/db_default/v4/nts/18?compare_to=14&baseline=14 we can see Polly's compile-time overhead is mainly resulted by some expensive Polly passes such as PollyDependence, PollyOptimization and PollyCodegen. Especially, I notice that the PollyDependence can lead to significant extra compile-time overhead. Its compile-time percentage for some expensive benchmarks can be summarized as: nestedloop: 41.4% (Polly - Calculate dependence) salsa20: 98.5% (Pol...

...<< Read << "\n" >>>> >>>> This patch is unreadable in the mail. However, the one you submitted >>>> looked good and was committed. >>>> >>>>> With this patch file, we can reduce the compile-time percentage of PollyDependence from 98.5% to 15.3%. Unfortunately, the compile-time percentage of PollyDependence for benchmarks, such as "nestedloop", is still very high. >>>> >>>> It would be good to get an up-to-date comparison with the latest patch >>>> having gone into Polly...

...baseline=14 Please compare against clang -O3 -load LLVMPolly.so, otherwise especially the compile time of the small binaries includes the overhead of loading the Polly shared object file. > we can see Polly's compile-time overhead is mainly resulted by some expensive Polly passes such as PollyDependence, PollyOptimization and PollyCodegen. Especially, I notice that the PollyDependence can lead to significant extra compile-time overhead. Its compile-time percentage for some expensive benchmarks can be summarized as: > nestedloop: 41.4% (Polly - Calculate dependence) > salsa20:...

...of loading Polly shared object file is very small (usually less than 1%). Their overhead can be viewed on:     http://188.40.87.11:8000/db_default/v4/nts/15?compare_to=14&baseline=14 >> we can see Polly's compile-time overhead is mainly resulted by some expensive Polly passes such as PollyDependence, PollyOptimization and PollyCodegen. Especially, I notice that the PollyDependence can lead to significant extra compile-time overhead. Its compile-time percentage for some expensive benchmarks can be summarized as: >>      nestedloop:  41.4% (Polly - Calculate dependence) >>      salsa...

...); + DEBUG(dbgs() << "Read: " << Read << "\n" >> >> This patch is unreadable in the mail. However, the one you submitted >> looked good and was committed. >> >>> With this patch file, we can reduce the compile-time percentage of PollyDependence from 98.5% to 15.3%. Unfortunately, the compile-time percentage of PollyDependence for benchmarks, such as "nestedloop", is still very high. >> >> It would be good to get an up-to-date comparison with the latest patch >> having gone into Polly. > > Yes, you can vie...

...peg       -37.70% However, Polly can still lead to significant compile-time overhead for many benchmarks. As shown on:     http://188.40.87.11:8000/db_default/v4/nts/31?compare_to=28&baseline=28 there are 11 benchmarks whose compile time are more than 2x than clang.  Furthermore, it seems that PollyDependence pass is still one of most expensive passes in Polly. Even without optimization and code generation, Polly also increases the compile time for some benchmarks. As shown on:     http://188.40.87.11:8000/db_default/v4/nts/29?compare_to=28&baseline=28 there are 10 benchmarks that require more than...

...t; However, Polly can still lead to significant compile-time overhead for many benchmarks. > As shown on: > http://188.40.87.11:8000/db_default/v4/nts/31?compare_to=28&baseline=28 > there are 11 benchmarks whose compile time are more than 2x than clang. Furthermore, it seems that PollyDependence pass is still one of most expensive passes in Polly. We need to look at these on a case by case base. 2x compile time increase for large programs, where Polly is just run on small parts is not what we want. However, for small micro kernels (e.g. Polybench) where we can significantly increase th...

...Polly can still lead to significant compile-time overhead for many benchmarks. >> As shown on: >>      http://188.40.87.11:8000/db_default/v4/nts/31?compare_to=28&baseline=28 >> there are 11 benchmarks whose compile time are more than 2x than clang.  Furthermore, it seems that PollyDependence pass is still one of most expensive passes in Polly. > >We need to look at these on a case by case base. 2x compile time  >increase for large programs, where Polly is just run on small parts is  >not what we want. However, for small micro kernels (e.g. Polybench)  >where we can signi...