search for: aesop

Hi, We would like to inform the community that we're releasing a version of our research compiler, "AESOP", developed at UMD using LLVM. AESOP is a distance-vector-based autoparallelizing compiler for shared-memory machines. The source code and some further information is available at http://aesop.ece.umd.edu The main components of the released implementation are loop memory dependence analysis...

Hi Rahul, Thanks for your interest! Our work does not attempt to make any significant contributions to alias analysis, and acts as a client to existing LLVM AA. Furthermore, the options passed to the AESOP frontend scripts are obeyed at compile time, but at link time certain transformations occur unconditionally. Here, AESOP has actually thwarted your experiment by performing inlining just before link-time. You can disable this in ~/aesop/blank/Makefile. It does this unconditionally as a standard se...

On 03/03/2013 02:09 PM, Timothy Mattausch Creech wrote: > Hi, > We would like to inform the community that we're releasing a version of our research compiler, "AESOP", developed at UMD using LLVM. AESOP is a distance-vector-based autoparallelizing compiler for shared-memory machines. The source code and some further information is available at > > http://aesop.ece.umd.edu > > The main components of the released implementation are loop memory...

Hi Timothy, > We would like to inform the community that we're releasing a version of our research compiler, "AESOP", developed at UMD using LLVM. AESOP is a distance-vector-based autoparallelizing compiler for shared-memory machines. The source code and some further information is available at > > http://aesop.ece.umd.edu > > The main components of the released implementation are loop memory...

On Mon, Mar 04, 2013 at 03:01:15PM +0800, 陳韋任 (Wei-Ren Chen) wrote: > Hi Timothy, > > > We would like to inform the community that we're releasing a version of our research compiler, "AESOP", developed at UMD using LLVM. AESOP is a distance-vector-based autoparallelizing compiler for shared-memory machines. The source code and some further information is available at > > > > http://aesop.ece.umd.edu > > > > The main components of the released implementa...

...7:28 AM, Timothy Mattausch Creech <tcreech at umd.edu>wrote: > On Mon, Mar 04, 2013 at 03:01:15PM +0800, 陳韋任 (Wei-Ren Chen) wrote: > > Hi Timothy, > > > > > We would like to inform the community that we're releasing a version > of our research compiler, "AESOP", developed at UMD using LLVM. AESOP is a > distance-vector-based autoparallelizing compiler for shared-memory > machines. The source code and some further information is available at > > > > > > http://aesop.ece.umd.edu > > > > > > The main component...

...he possible paths I would like to generate something like: C1 (true) : WAW - S2->S1 , RAW - S3->S2 C1 (false) : WAW - S3->S1 So then it seems to me that building the dependence graph is essential. Are there no other Analysis/Transforms which require this type of information? I looked at AESOP (http://aesop.ece.umd.edu/doc/aesop-white-paper.pdf) which implements an autoparallelization framework and it seems they would need to do similar checks, the page hosting the code is currently offline. Thanks, Snehasish On Fri, Dec 27, 2013 at 12:24 PM, Preston Briggs <preston.briggs at gmail...

...- > From: "Timothy Mattausch Creech" <tcreech at umd.edu> > To: "Sebastian Dreßler" <dressler at zib.de> > Cc: "Aparna Kotha" <akotha at umd.edu>, llvmdev at cs.uiuc.edu > Sent: Sunday, March 3, 2013 11:32:49 AM > Subject: Re: [LLVMdev] AESOP autoparallelizing compiler > > Hi Sebastian, > Sure! The bulk of LMDA was written by Aparna Kotha (CCd). It > computes dependences between all instructions, computes the > resulting direction vectors in the function, then associates them > all with loops. > > At a...

Hi Sebastian, Sure! The bulk of LMDA was written by Aparna Kotha (CCd). It computes dependences between all instructions, computes the resulting direction vectors in the function, then associates them all with loops. At a high level, the dependence analysis consults with AliasAnalysis, and ScalarEvolution before resorting to attempting to understand the effective affine expressions and

Hi, On 03/03/2013 07:09 AM, Timothy Mattausch Creech wrote: > [...] > The main components of the released implementation are loop memory > dependence analysis and parallel code generation using calls to POSIX > threads. The loop memory dependence analysis sounds very interesting to me. Could you provide some more information regarding its capabilities? Cheers, Sebastian -- Mit

Hi Ganesh, Please have a look at: These core parts of LLVM: http://llvm.org/docs/doxygen/html/classllvm_1_1Loop.html#a72bbf45d2e00971f56bf8cfe4e1df01c http://llvm.org/docs/Vectorizers.html These research projects based on LLVM: http://polly.llvm.org http://aesop.ece.umd.edu I'm not sure what you mean by "identify intrinsic functions". If you really mean LLVM intrinsics, they are trivial to identify in LLVM (see http://llvm.org/docs/LangRef.html#intrinsic-functions for a high level introduction). If you mean something like idiom recognition,...

Hi, For one of our research projects, we are planning to use LLVM. We need the following features: 1. We need to aggressively fuse loops that have inter-loop dependencies. 2. We need to identify intrinsic functions and induction variables. 3. We need to detect few memory access patterns like copy, transpose-copy, stride-copy etc. 4. Lastly, auto-vectorization and

Package: logcheck Version: 1.2.54 When Postfix is configured to listen on port tcp/587 by uncommenting the "submission" line in the postfix master.cf, logcheck does not ignore the anvil statistics log entries - attached is a patch from the current SVN trunk. -------------- next part -------------- A non-text attachment was scrubbed... Name: logcheck_1531.diff Type: text/x-patch Size:

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 This tripped me up recently too, but i found i needed a different patch: 0 aesop:~# diff -u /etc/init.d/xendomains{.orig,} - --- /etc/init.d/xendomains.orig 2007-04-18 12:04:04.000000000 -0400 +++ /etc/init.d/xendomains 2007-04-18 13:00:28.000000000 -0400 @@ -128,9 +128,9 @@ parseln() { - - name=`echo "$1" | cut -c0-17` + name=`echo $1 | cut -d\ -f1` n...

Hi, I want to shares files over samba with names like "M*A*S*H - Episode" or "Aesop And Son: Episode" but have found it hasn't worked that well. I added mangled names = no to smb.conf so the name is not mangled and what happens is the full name is included in a directory listing but I can't read the file. There were a few times it did work so I want to know if anyon...

Hi I want to analyse the memory dependencies which exist in a loop at an intra iteration as well as inter iteration (loop carried dependencies). I looked at the DependenceAnalysis implementation which returns a lot of the information I require (based on a prior AliasAnalysis pass), however I need to pass the Src and Dst instructions in program order. I was wondering how I can collect all the

=================================================================== "United we stand, divided we fall." Aesop =================================================================== Release Announcements ===================== This is is the latest stable release of Samba 3.6. Major enhancements in Samba 3.6.10 include: o Respond correctly to FILE_STREAM_INFO requests (bug #9460). o Fix segfault when &qu...

=================================================================== "United we stand, divided we fall." Aesop =================================================================== Release Announcements ===================== This is is the latest stable release of Samba 3.6. Major enhancements in Samba 3.6.10 include: o Respond correctly to FILE_STREAM_INFO requests (bug #9460). o Fix segfault when &qu...

...work for main effects. Does such a thing exist already? Thank you for any thoughts, Josh -- Joshua Caplan, PhD Postdoctoral Associate Department of Ecology, Evolution, and Natural Resources Rutgers University 14 College Farm Rd, New Brunswick, NJ 08901 p 732-932-9383 f 732-932-8746 jcaplan at aesop.rutgers.edu

I want to set up a new CentOS install using version 7 and would like to experiment with various RAID levels. Anyone care to point out a tutorial? TIA Dave -- We hang petty thieves and appoint great ones to office -- Aesop