Displaying 6 results from an estimated 6 matches for "petabrick".
Did you mean:
petabricks
2011 Nov 10
0
[LLVMdev] Alternate instruction sequences
...se, in order to choose the "best" version, the IR-level
> transform would have to know the details of the cache/memory subsytems
> of the current arch.
There has been some good work in this general area by Jason Ansel and
collaborators at MIT. They have developed a project called PetaBricks
(which has been released under the MIT license) --
http://projects.csail.mit.edu/petabricks/ -- and I think that this is
going to be a very important technique, at least for numerical
algorithms, in the near future. As there is apparently interest, I think
that we should strongly consider added an...
2011 Nov 10
2
[LLVMdev] Alternate instruction sequences
On Thu, 10 Nov 2011 10:46:27 +0100, Duncan Sands wrote:
> Hi Carlo, the general policy is to canonicalize IR to some particular
> choice. For example, if I1, I2, etc are all equivalent to each
> other,
> then usually one of them will have been chosen as the canonical form
> (say I1) and all the others will be turned into I1. If this is not
> the best choice for some target,
2012 Nov 27
0
[LLVMdev] loop pragmas
...in a higher-level language, like Julia, MATLAB, ... that can deliver much of the needed information to the compilers, for example by using parallel programming patterns (see Berkeley Parlab), and that allows a compiler to choose among different implementations of algorithms and data structures (see Petabricks). Building compiler front-ends, middle-ends and back-ends from scratch that can use all information available in such programs and that produce high-quality code for a range of architectures is undoable for most if not all research labs.
And it should also not be necessary: many excellent lower-...
2012 Nov 22
1
[LLVMdev] loop pragmas
> Other types of annotations that are
> "harmless" are probably good to have, for example "unroll-by" (assuming
> that this is a suggestion to the compiler, not an order).
| To my knowledge, we are avoiding to allow the user to 'tune' the
| compiler. Manual tuning may be good for a certain piece of hardware, but
| will have negative effects on other platforms.
2012 Nov 21
4
[LLVMdev] loop pragmas
On 11/21/2012 11:32 AM, Tobias Grosser wrote:
> On 11/21/2012 03:45 PM, Krzysztof Parzyszek wrote:
>>
>> I'm thinking of this in terms of parallelization directives. The
>> optimizations that rely on such annotations would need to be done as
>> early as possible, before any optimization that could invalidate them.
>> If the annotation can become false, you are
2012 Nov 27
4
[LLVMdev] loop pragmas
...nguage, like Julia, MATLAB, ... that can deliver much
> of the needed information to the compilers, for example by using
> parallel programming patterns (see Berkeley Parlab), and that allows
> a compiler to choose among different implementations of algorithms
> and data structures (see Petabricks). Building compiler front-ends,
> middle-ends and back-ends from scratch that can use all information
> available in such programs and that produce high-quality code for a
> range of architectures is undoable for most if not all research
> labs.
>
> And it should also not be nec...