search for: 700x

I'm trying to run Heroes of might and magic 5 tribes of the east, All 2d and direct draw graphics works fine but not 3D graphics. Can some one tell me what I'm doing wrong. I'm using Ubuntu 64 bit on an Acer aspire 5020 laptop. I have an ATI 700x Graphics Card. I'm not using the ATI Drivers

Ok, I've seen discussion before on doing transfers (attended and unattended), there seems to be much confusion over it. As things sit, I've been trying (unsuccessfully) to do transfers with a zap channel (analog phone attached to TDM400). I have no idea what I'm missing. My current understanding is that I need to have transfer=yes in zapata.conf, do a flash hook, dial the 2nd

...ntly increase. I have posted results for the original code which contains 6 nested loops on http://llvm.org/bugs/show_bug.cgi?id=16843#c5 In fact, the compile time is exponentially growing as the depth of loop nest increases: 2-nested: ~2X 4-nested: ~10X 6-nested: ~50X 8-nested: ~200X 10-nested: ~700X 12-nested: ~2000X >> These store instructions significantly complicate the "polly-dependence" pass, and thus leading to high compile-time overhead. > >What do you mean by "complicated the 'polly-dependence' pass"? Without >-polly-prepare the scop that i...

...or the original code which contains 6 nested loops on http://llvm.org/bugs/show_bug.cgi?id=16843#c5 > > > In fact, the compile time is exponentially growing as the depth of loop nest increases: > 2-nested: ~2X > 4-nested: ~10X > 6-nested: ~50X > 8-nested: ~200X > 10-nested: ~700X > 12-nested: ~2000X Perfect. This is what I was expecting. Let's see what we can do about it. >> I think there are two angles we can have a look at: >> >> 1) Does -polly-prepare introduce unneeded dependences? >> >> This means, could we model the scalar depend...

On 08/15/2013 03:32 AM, Star Tan wrote: > Hi all, Hi, I tried to reproduce your findings, but could not do so. > I have investigated the 6X extra compile-time overhead when Polly compiles the simple nestedloop benchmark in LLVM-testsuite. (http://188.40.87.11:8000/db_default/v4/nts/31?compare_to=28&baseline=28). Preliminary results show that such compile-time overhead is resulted by

Hi all, I have investigated the 6X extra compile-time overhead when Polly compiles the simple nestedloop benchmark in LLVM-testsuite. (http://188.40.87.11:8000/db_default/v4/nts/31?compare_to=28&baseline=28). Preliminary results show that such compile-time overhead is resulted by the complicated polly-dependence analysis. However, the key seems to be the polly-prepare pass, which introduces