search for: gsoc2013

>> (3) About detecting scop regions in bottom-up order. >> Detecting scop regions in bottom-up order can significantly speed up the scop detection pass. However, as I have discussed with Sebastian, detecting scops in bottom-up order and up-bottom order will lead to different results. As a result, we should not change the detection order. > >Sebastian had a patch for this. Does

On 06/06/2013 11:17 AM, Star Tan wrote: > Hi Tobias, > > > I am recently trying to set up the performance tester for FastPolly project. According to your suggestion, I plan to use the LNT infrastructure to set up the performance tester. For this purpose, I think I should do this job in three steps: > > > First, I will add PolyBench to LLVM test-suite since PolyBench is the

At 2013-06-30 08:34:34,"Tobias Grosser" <tobias at grosser.es> wrote: >On 06/29/2013 05:04 PM, Star Tan wrote: >> Hi all, >> >> >> >> I have investigated the compile-time overhead of "Polly Scop Detection" pass based on LNT testing results. >> This mail is to share some results I have found. >> >> >> (1) Analysis

On 07/01/2013 06:51 AM, Star Tan wrote: >> Great. Now we have two test cases we can work with. Can you > >> upload the LLVM-IR produced by clang -O0 (without Polly)? > Since tramp3d-v4.ll is to large (19M with 267 thousand lines), I would focus on the oggenc benchmark at firat. > I attached the oggenc.ll (LLVM-IR produced by clang -O0 without Polly), which compressed into the

Hi Tobias, I am recently trying to set up the performance tester for FastPolly project. According to your suggestion, I plan to use the LNT infrastructure to set up the performance tester. For this purpose, I think I should do this job in three steps: First, I will add PolyBench to LLVM test-suite since PolyBench is the critical benchmarks for FastPolly. I have adjust the PolyBench-c-3.2 so we

>Great. Now we have two test cases we can work with. Can you >upload the LLVM-IR produced by clang -O0 (without Polly)? Since tramp3d-v4.ll is to large (19M with 267 thousand lines), I would focus on the oggenc benchmark at firat. I attached the oggenc.ll (LLVM-IR produced by clang -O0 without Polly), which compressed into the file oggenc.tgz. >2) Check why the Polly scop detection is

Dear All I'd like to announce that this year LLVM Compiler Infrastructure Project again participates in Google Summer of Code program. More details for prospective students will follow. PS: Yes, this means that we're starting to discuss student proposals (if any) -- With best regards, Anton Korobeynikov Faculty of Mathematics and Mechanics, Saint Petersburg State University

Will someone in charge please complete LLVM's page at google-melange.com? Without that LLVM is missing in the list of participants: http://www.google-melange.com/gsoc/accepted_orgs/google/gsoc2013 On Mon, Apr 8, 2013 at 11:11 PM, Anton Korobeynikov <anton at korobeynikov.info> wrote: > Dear All > > I'd like to announce that this year LLVM Compiler Infrastructure > Project again participates in Google Summer of Code program. > > More details for prospective studen...

On 06/29/2013 05:04 PM, Star Tan wrote: > Hi all, > > > > I have investigated the compile-time overhead of "Polly Scop Detection" pass based on LNT testing results. > This mail is to share some results I have found. > > > (1) Analysis of "SCOP Detection Pass" for PolyBench (Attached file PolyBench_SCoPs.log) > Experimental results show that the

Hi all, I have investigated the compile-time overhead of "Polly Scop Detection" pass based on LNT testing results. This mail is to share some results I have found. (1) Analysis of "SCOP Detection Pass" for PolyBench (Attached file PolyBench_SCoPs.log) Experimental results show that the "SCOP Detection pass" does not lead to significant extra compile-time

Hi all, This is a GSoC 2013 proposal for LLVM project. Please see the formatted version at here: http://pacman.cs.tsinghua.edu.cn/~liuml07/files/gsoc2013-proposal-program-slicing.pdf Program slicing has been used in many applications, the criteria of which is a pair of statement and variables. I would like to write an inter-procedural program slicing pass in LLVM, which is able to calculate C program slices of source code effectively. There is no p...

Hi all, This is a GSoC 2013 proposal for LLVM project. Please see the formatted version at here: http://pacman.cs.tsinghua.edu.cn/~liuml07/files/gsoc2013-proposal-program-slicing.pdf Program slicing has been used in many applications, the criteria of which is a pair of statement and variables. I would like to write an inter-procedural program slicing pass in LLVM, which is able to calculate C program slices of source code effectively. There is no p...

Hello guys.I have begun work on writing my proposal as discussed on IRC and will submit a draft in a couple of days so that I can make it detailed and refine it after getting feedback. I wanted to know about the number of weeks a proposal should cover and also,is it okay if I set aside a buffer week somewhere in the middle of the summer for something like cleaning the code,working on the

Dear Tobias and all LLVM/Polly developers, Thank you very much for all your help and advice. I have submitted my proposal to GSoC 2013 application system: http://www.google-melange.com/gsoc/proposal/review/google/gsoc2013/star/1. Some tables and paragraphs are simplified to make it more readable on GSoC official pages. Any suggestion or comment would be appreciated. At 2013-05-03 19:05:05,"Tobias Grosser" <tobias at grosser.es> wrote: >On 05/03/2013 11:39 AM, Star Tan wrote: >> Dear Tobia...

Hi again, I was studying and building the lfort repository as I said I would do, but after a while I decided that I would like to work on flang instead. So, I forked flang and so far I've had pretty good success with it, here's what I've done: - Merged a pull request from a github user Michael Gottesman(He added support for latest llvm and cmake) - Fixed character literal continuation

...ril 27, 2013 2:53 PM > *To:* LLVM > *Subject:* [LLVMdev] GSoC Proposal: Inter-Procedure Program Slicing in > LLVM > > Hi all, > > This is a GSoC 2013 proposal for LLVM project. Please see the formatted > version at here: > http://pacman.cs.tsinghua.edu.cn/~liuml07/files/gsoc2013-proposal-program-slicing.pdf > > Program slicing has been used in many applications, the criteria > of which is a pair of statement and variables. I would like to write an > inter-procedural program slicing pass in LLVM, which is able to calculate C > program slices of source code e...

On 05/03/2013 11:39 AM, Star Tan wrote: > Dear Tobias, > > > Thank you very much for your very helpful advice. > > > Yes, -debug-pass and -time-passes are two very useful and powerful > options when evaluating the compile-time of each compiler pass. They > are exactly what I need! With these options, I can step into details > of the compile-time overhead of each pass.