search for: tian05

...an do to support OpenMP. This might be a good choice for initial implementation. 3) Do some carefully chosen optimizations before procedurization. Do heavylifting (like loop restructuring optimizations) after procedurization. Some effort, a lot of benefit. This is essentially what is described in [Tian05] (referenced in our proposal). 4) Make all optimizations thread-aware. Best approach in theory, no compilers exist that go as far. Our proposal make all these choices possible. One can implement 1) in half an hour, yet keep the door opened for a better solution. Yours, Andrey --- Software Engine...

...derstand you're talking about an initial implementation. > 3) Do some carefully chosen optimizations before procedurization. Do > heavylifting (like loop restructuring optimizations) after > procedurization. Some effort, a lot of benefit. This is essentially > what is described in [Tian05] (referenced in our proposal). What are the important optimizations? > 4) Make all optimizations thread-aware. Best approach in theory, no > compilers exist that go as far. This is probably not practical. It may be fine in academia but in production environments the resources don't ex...

...fferent from what I have in mind. Basically, the plan is to perform analysis and some optimizations before procedurization, and do the rest (including loop restructuring) after it. This is not mentioned in the proposal (we tried to be succint -- only 20 pages long! :-)), but explained in detail in [Tian05] (sorry, the link in the proposal doesn't lead you directly to pdf file; use this one instead: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.97.3763&rep=rep1&type=pdf). Yours, Andrey

...gt; is > > to perform analysis and some optimizations before procedurization, > > and > > do the rest (including loop restructuring) after it. This is not > > mentioned in the proposal (we tried to be succint -- only 20 pages > > long! :-)), but explained in detail in [Tian05] (sorry, the link in > > the proposal doesn't lead you directly to pdf file; use this one > > instead: > > http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.97.3763&rep=rep1&type=pdf). > > With regard to what you're proposing, the paper actually leave...

...nd. Basically, the plan > is > to perform analysis and some optimizations before procedurization, > and > do the rest (including loop restructuring) after it. This is not > mentioned in the proposal (we tried to be succint -- only 20 pages > long! :-)), but explained in detail in [Tian05] (sorry, the link in > the proposal doesn't lead you directly to pdf file; use this one > instead: > http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.97.3763&rep=rep1&type=pdf). With regard to what you're proposing, the paper actually leaves a lot unexplained. The...

...to perform analysis and some optimizations before procedurization, >> > and >> > do the rest (including loop restructuring) after it. This is not >> > mentioned in the proposal (we tried to be succint -- only 20 pages >> > long! :-)), but explained in detail in [Tian05] (sorry, the link in >> > the proposal doesn't lead you directly to pdf file; use this one >> > instead: >> > http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.97.3763&rep=rep1&type=pdf). >> >> With regard to what you're proposing, the p...

...might be a good > choice for initial implementation. > > 3) Do some carefully chosen optimizations before procedurization. Do > heavylifting (like loop restructuring optimizations) after > procedurization. Some effort, a lot of benefit. This is essentially > what is described in [Tian05] (referenced in our proposal). I think you're missing the point here. The whole idea of LLVM IR is that it doesn't have various "forms" that are valid at different points in the optimizer. Even very late lowering passes like strength reduction are pure IR to IR passes that do n...

...ang or another frontend or a some other mid-level IR. > You're assuming all optimization is done by LLVM. That's not true in general. Sorry, but what you said are your opinions, not data-driven agruments. We all have opinions. The arguments I listed are supported by data presented in [Tian05], referenced in our proposal. Do you have data supporting your opinions? Yours, Andrey --- Software Engineer Intel Compiler Team Intel Corp. On Tue, Oct 2, 2012 at 5:15 AM, <greened at obbligato.org> wrote: > Hal Finkel <hfinkel at anl.gov> writes: > > Hi Hal, > >>...

Hal Finkel <hfinkel at anl.gov> writes: Hi Hal, > As you may know, this is the third such proposal over the past two > months, one by me > (http://lists.cs.uiuc.edu/pipermail/llvmdev/2012-August/052472.html) This link seems to be broken. I missed your earlier proposal and would like to read it. As with this proposal, I fear any direct parallelization support in LLVM is going to

...hesis, University of Alberta, Edmonton, > Alberta, Canada, 2000. Available at: > http://www.airs.com/dnovillo/Papers/Thesis.pdf > > [OpenMP11] “OpenMP Application Program Interface”, Version 3.1, July > 2011. Available at: http://www.openmp.org/mp-documents/OpenMP3.1.pdf > > [Tian05] Xinmin Tian, Milind Girkar, Aart Bik and Hideki Saito, > “Practical Compiler Techniques on Efficient Multithreaded Code > Generation for OpenMP Programs”, The Computer Journal, September 2005, > pp.588-601. Available at: http://dl.acm.org/citation.cfm?id=1095017 -- Hal Finkel Postdoct...

...xplicitly Parallel Programs”, PhD Thesis, University of Alberta, Edmonton, Alberta, Canada, 2000. Available at: http://www.airs.com/dnovillo/Papers/Thesis.pdf [OpenMP11] “OpenMP Application Program Interface”, Version 3.1, July 2011. Available at: http://www.openmp.org/mp-documents/OpenMP3.1.pdf [Tian05] Xinmin Tian, Milind Girkar, Aart Bik and Hideki Saito, “Practical Compiler Techniques on Efficient Multithreaded Code Generation for OpenMP Programs”, The Computer Journal, September 2005, pp.588-601. Available at: http://dl.acm.org/citation.cfm?id=1095017 -------------- next part -------------- A...

...Thesis, University of Alberta, Edmonton, > Alberta, Canada, 2000. Available at: > http://www.airs.com/dnovillo/Papers/Thesis.pdf > > [OpenMP11] “OpenMP Application Program Interface”, Version 3.1, July > 2011. Available at: http://www.openmp.org/mp-documents/OpenMP3.1.pdf > > [Tian05] Xinmin Tian, Milind Girkar, Aart Bik and Hideki Saito, > “Practical Compiler Techniques on Efficient Multithreaded Code > Generation for OpenMP Programs”, The Computer Journal, September 2005, > pp.588-601. Available at: http://dl.acm.org/citation.cfm?id=1095017 > > > ___________...

...hesis, University of Alberta, Edmonton, > Alberta, Canada, 2000. Available at: > http://www.airs.com/dnovillo/Papers/Thesis.pdf > > [OpenMP11] “OpenMP Application Program Interface”, Version 3.1, July > 2011. Available at: http://www.openmp.org/mp-documents/OpenMP3.1.pdf > > [Tian05] Xinmin Tian, Milind Girkar, Aart Bik and Hideki Saito, > “Practical Compiler Techniques on Efficient Multithreaded Code > Generation for OpenMP Programs”, The Computer Journal, September 2005, > pp.588-601. Available at: http://dl.acm.org/citation.cfm?id=1095017 -- Hal Finkel Postdoct...