Tobias Grosser
2013-Mar-23 17:37 UTC
[LLVMdev] [Polly]GSoC Proposal: Reducing LLVM-Polly Compiling overhead
On 03/23/2013 05:23 PM, tanmx_star wrote:> Dear Tobies, > > Sorry for the late reply. > > I have checked the experiment and I found some of the data is mismatched because of incorrect manual copy and paste, so I have written a Shell script to automatically collect data. Newest data is listed in the attached file.Yes, automatizing those experiments to make them reproducible is a very good idea. I did not yet verify the numbers, but will as soon as your script is online. Two comments: o Can you run also with the following flags: D: -O3 -load LLVMPolly.so -mllvm -polly -mllvm -polly-optimizer=none E: -O3 -load LLVMPolly.so -mllvm -polly -mllvm -polly-optimizer=none -mllvm -polly-code-generator=none o Some numbers are again fishy: adi: In your previous report you reported 0.953 seconds, the website now says 1.839 seconds. ludcmp: In your previous report you reported 0.391 seconds, the website now says 1.346 seconds instrument: It seems you rounded the previous numbers to one significant digit and calculated the performance difference from the rounded numbers. I would prefer if you would use the original numbers and you would only round when displaying/printing the results> Tobies, I have made a simple HTML page (attached polly-compiling-overhead.html) to show the experimental data and my plans for this project. I think a public webpage can be helpful for our further discussion. If possible, could you put it on Polly website (Either a public link or a temporary webpage) ?Yes, I believe a website is a very good start to illustrate your findings and to organize the information that you got. For now I propose to host it yourself as I expect it to change often and you waiting for me to add changes just adds overhead (there are plenty of free hosting services). We can later move it to the Polly website. Some comments on the content: - Just put your name as the person who runs the project I appreciate that you put my name on the top, but this is work you started and that you will use as a summer of code project application. So you should be the only person mentioned there - Cite properly Also, as this will later become an application, I believe it is necessary to make clear what part of the document comes from you and which part was something you got from reviews/external sources. Specifically, if you copy a larger text from one of my emails, please mark it accordingly. - Typo 'memeory'> I think I will try to remove unnecessary code transformations for canonicalization in next step.Are you referring to the region simplification change, I was proposing earlier? I believe this is a good change to work on as it is simple, self contained and also a conceptual cleanup. After this patch, I believe it is necessary to get more details about your performance numbers to understand better where your work will be beneficial. All the best, Tobi
Star Tan
2013-Apr-23 09:01 UTC
[LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
Hi all, This is Star Tan, who proposed a project to reduce the Polly compiling overhead several days ago. After that, I kept on moving forward for this project. By now, I am much familiar with Polly and LLVM. Thanks to the help from Polly and LLVM group, I have also provided some LLVM-Polly patch files for this project, such as r179673, r179586, r179159, r179158, r179157, r178530. I am confident that I am on the right position to propose a GSoC project. I have wrote a GSoC proposal draft in https://gist.github.com/tanstar/5441808. I am pleased to answer any questions about this project. Any advice or comment would be appreciated. Thank you very much! Best regards, Star Tan. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130423/7b124036/attachment.html>
tanmx_star
2013-Apr-26 03:08 UTC
[LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
Hi all, I have updated my GSoS proposal: "FastPolly: Reducing LLVM-Polly Compiling overhead" (https://gist.github.com/tanstar/5441808). I think the pass ordering problem you discussed early can be also investigated in this project! Is there any comment or advice about my proposal? I appreciate all your help and advice. Thanks, Star Tan Proposal: https://gist.github.com/tanstar/5441808>Hi all, > > >This is Star Tan, who proposed a project to reduce the Polly compiling overhead several days ago. After that, I kept on moving forward for this project. By now, I am much familiar with Polly and LLVM. Thanks to the help from Polly and LLVM group, I have also provided some LLVM-Polly patch files for this project, such as r179673, r179586, r179159, r179158, r179157, r178530. I am confident that I am on the right position to propose a GSoC project. > > >I have written a GSoC proposal draft in https://gist.github.com/tanstar/5441808. I am pleased to answer any questions about this project. Any advice or comment would be appreciated. > > >Thank you very much! > > >Best regards, >Star Tan.
Possibly Parallel Threads
- [LLVMdev] [Polly]GSoC Proposal: Reducing LLVM-Polly Compiling overhead
- [LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
- [LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
- [LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
- [LLVMdev] [FastPolly]: Update of Polly's performance on LLVM test-suite