Displaying 6 results from an estimated 6 matches for "codelets".
2017 Nov 28
2
Publication LLVM Related Publications Submission
...al
performance. Autotuning
substantially improves default parameters in
many scenarios
but it is a costly process requiring a long iterative
evaluation.
We propose an automatic piecewise autotuner based on CERE
(Codelet
Extractor and REplayer). CERE decomposes applications into
small
pieces called codelets: each codelet maps to a loop or to an
OpenMP
parallel region and can be replayed as a standalone
program.
Codelet autotuning achieves better speedups at a lower tuning
cost. By
grouping codelet invocations with the same performance
behavior, CERE
reduces the number of loops or OpenMP regions to be...
2018 Jan 30
0
Publication LLVM Related Publications Submission
...ng
> substantially improves default parameters in many scenarios
> but it is a costly process requiring a long iterative evaluation.
> We propose an automatic piecewise autotuner based on CERE (Codelet
> Extractor and REplayer). CERE decomposes applications into small
> pieces called codelets: each codelet maps to a loop or to an OpenMP
> parallel region and can be replayed as a standalone program.
> Codelet autotuning achieves better speedups at a lower tuning cost. By
> grouping codelet invocations with the same performance behavior, CERE
> reduces the number of loops or O...
2016 Feb 24
1
Publication : CERE LLVM Based Codelet Extractor and REplayer
Hello,
We have published two papers which build upon the LLVM
Compiler Infrastructure. Would it be possible to include them in the
LLVM related publications at http://llvm.org/pubs/ ?
I attach below
the bibliographic references:
"CERE: LLVM Based Codelet Extractor and
REplayer for Piecewise Benchmarking and Optimization"
P. de Oliveira
Castro, C. Akel, E. Petit, M. Popov, and W.
2003 May 31
4
faster mdct's
...aliasing). I tried that
this evening (see attached mdct.[ch]), but it's only about 30% faster than
the Vorbis MDCT for 2048 samples, although the advantage increases for
larger sizes (e.g. 60% faster for 128k samples). It could be made
substantially more efficient by generating special purpose codelets to
avoid separate pre/post-processing passes...we know our DCT-IV code is not
optimal. (It also doesn't use SIMD.)
The above two codes compute an unwindowed MDCT, and give the same results
as the one in your mdct.c, but I can also easily make one with a window
function built in (to avoid the...
2008 Mar 18
0
[LLVMdev] Google Summer of Code 2008
...nd might provide a faster LAPACK library for the open source world.
FFTW is another hugely important numerical library that could be used for
benchmarking. Aside from simply getting FFTW to work using llvm-gcc, an
interesting project might be to rewrite the OCaml source code in FFTW to
generate codelets on-the-fly using LLVM or the CLang front-end. LLVM can
probably beat GCC here, not least because an LLVM-based implementation would
not be limited to a set of precompiled codelets. This could help the millions
of people who use FFTW.
On an unrelated note, LLVM has great potential for improving...
2008 Mar 18
2
[LLVMdev] Google Summer of Code 2008
Hello, Everyone
LLVM recently was approved to take part in Google Summer of Code 2008.
We welcome everyone to apply for this program.
The list of ideas for (possible) projects is located at
http://llvm.org/OpenProjects.html. Surely you can suggest any other
project, if you feel, that it definitely can be useful.
Our common requirement for student is to submit proposal to LLVM
Developers