Yes, auto-parallelization is not practical, but it solves something. So it should have benchmarks.<br><br><div class="gmail_quote">On Thu, Dec 8, 2011 at 09:08, 陳韋任 <span dir="ltr"><<a href="mailto:chenwj@iis.sinica.edu.tw">chenwj@iis.sinica.edu.tw</a>></span> wrote:<br>

<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">Hi Hal,<br>
<div class="im"><br>
> For auto-vectorization, look at:<br>
> <a href="http://polaris.cs.uiuc.edu/%7Egarzaran/doc/pact11.pdf" target="_blank">http://polaris.cs.uiuc.edu/~garzaran/doc/pact11.pdf</a><br>
> <a href="http://polaris.cs.uiuc.edu/%7Emaleki1/TSVC.tar.gz" target="_blank">http://polaris.cs.uiuc.edu/~maleki1/TSVC.tar.gz</a><br>
><br>
> If you're looking for auto-parallelization, I can ask around.<br>
<br>
</div>  Thanks for the sharing. If that doesn't bother you too much, I would like to<br>
know auto-parallelization benchmarks. :p<br>
<br>
  Just curious. I was thinking that auto-parallelization in compiler optimization<br>
is not mature/practical, that's why I thought there is no auto-parallelization<br>
benchmark. Do you know any project on this? Thanks.<br>
<div class="im"><br>
Regards,<br>
chenwj<br>
<br>
--<br>
Wei-Ren Chen (陳韋任)<br>
Computer Systems Lab, Institute of Information Science,<br>
Academia Sinica, Taiwan (R.O.C.)<br>
Tel:886-2-2788-3799 #1667<br>
Homepage: <a href="http://people.cs.nctu.edu.tw/%7Echenwj" target="_blank">http://people.cs.nctu.edu.tw/~chenwj</a><br>
<br>
</div><div><div></div><div class="h5">_______________________________________________<br>
LLVM Developers mailing list<br>
<a href="mailto:LLVMdev@cs.uiuc.edu">LLVMdev@cs.uiuc.edu</a>         <a href="http://llvm.cs.uiuc.edu" target="_blank">http://llvm.cs.uiuc.edu</a><br>
<a href="http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev" target="_blank">http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev</a><br>
</div></div></blockquote></div><br>