search for: wwwse

...t does research on transactional memory. We are working on many aspects of (S)TM (STM algorithms and implementations, compiler support, infrastructure, ...) and collaborate with several other research groups. For example, I have worked on STM optimizations based on pointer analysis (see http://wwwse.inf.tu-dresden.de/ABSTRACTS/riegel2008partitioning.html and http://wwwse.inf.tu-dresden.de/ABSTRACTS/riegel2008objbased.html). These optimizations are implemented on top of our LLVM pass (see above) and use DSA. Coming back to the compiler support, I would suggest that the project should try t...

I'm happy to say that LLVM has 6 projects approved for Google SoC this year (3x more than last year!): [vmkit] "Generics support for N3" by Tilmann Schelle [clang] "Adding support for C++ classes in clang" by Argiris Kirtzidis [codegen] "PSP (Playstation Portable) support into LLVM Mips backend" by Bruno Cardoso Lopes [llvmir]

...ctional memory. We are working > on many aspects of (S)TM (STM algorithms and implementations, compiler > support, infrastructure, ...) and collaborate with several other research > groups. For example, I have worked on STM optimizations based on pointer > analysis (see > http://wwwse.inf.tu-dresden.de/ABSTRACTS/riegel2008partitioning.html and > http://wwwse.inf.tu-dresden.de/ABSTRACTS/riegel2008objbased.html). These > optimizations are implemented on top of our LLVM pass (see above) and use > DSA. > > Coming back to the compiler support, I would suggest that...

..._____ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu         http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev > > -- Martin Süßkraut Dresden University of Technology, Computer Science Department Systems Engineering Group Dresden, Germany http://wwwse.inf.tu-dresden.de

These are the contents of the generated file. Start >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> ; ModuleID = '<stdin>' target datalayout =

Torvald, This is nice work. Do you have a set of applications or benchmarks that you have transactionalized at the source level? If so, have you reported performance numbers for them somewhere? Thanks, --Vikram http://www.cs.uiuc.edu/~vadve http://llvm.org On Aug 19, 2007, at 3:22 PM, Torvald Riegel wrote: > I would like to announce the availability of compiler support for >

...__________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu         http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev > -- Martin Süßkraut Dresden University of Technology, Computer Science Department Systems Engineering Group Dresden, Germany http://wwwse.inf.tu-dresden.de

Hi Timo, Thanks for commenting. I feel like I have to justify why I don't want to use QEMU, which is fine since my choice is not frozen actually. QEMU is much more than what I need for dynamically instrumenting software. My goal is automated testing to find bugs, which can quickly be intensive in term of computational load. Thus I am trying to get the smallest (and fastest) tool. Even using

...ged if I knew that this is an easy thing for some of you, experts. If there was a public piece of code that does it already would be awesome of course. The paper is mentioning this (http://code.google.com/p/llvm-qemu/) but I am not sure it would lead me where I want. Any comment welcome. ( http://wwwse.inf.tu-dresden.de/hotdep/S2-1-candea-cameraReady_HotDep_2009.pdf) -- Alexandre -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20090929/2edf8fcb/attachment.html>

I would like to announce the availability of compiler support for generation of transactional code in LLVM IR. Our tool is called Tanger and it is an LLVM pass. You can download Tanger at: http://tinystm.org Transactional memory (TM) is viewed by a lot of people to be an important tool for enabling parallelism in a wide area of applications, and especially for developers that are not skilled

I am interested in writing a JIT that makes use of on-stack replacement. This essentially means that the JIT must be able to compile new versions of already compiled functions (eg: more optimized versions) and ensure that the code for the new functions is executed. I was wondering if LLVM offers any support for this. Suppose a function f calls a function g, and f is recompiled while g is running,

Hi, I'd like to see support for something like this. I have some comments, and I think there is existing work that you can reuse. TAS and CAS are _not_ theoretically equivalent. TAS is weaker because it can solve consensus in a nonblocking way only for 2 threads (it has consensus number 2), whereas CAS can solve consensus for any number of threads (infinite consensus number).

On Monday 09 July 2007 19:33, Scott Michel wrote: > Torvald Riegel wrote: > > Hi, > > > > I'd like to see support for something like this. I have some comments, > > and I think there is existing work that you can reuse. > > "reuse within the compiler." within the LLVM compiler framework, to be precise. > > > "While the processor may