Displaying 4 results from an estimated 4 matches for "bound1".
Did you mean:
bound
2016 May 16
2
Determination of statements that contain only matrix multiplication
Hi Tobias,
could we use information about memory accesses of a SCoP statement and
def-use chains to determine statements, which don’t contain matrix
multiplication of the following form?
for (int i = 0; i < Upper Bound1; i++)
for (int j = 0; j < Upper Bound2; j++)
for (int k = 0; k < Upper Bound3; j++)
C[i][j] += A[i][k] * B[k][j]
We could probably check that memory access relations have the following form:
"accesses" : [
{
"kind" : "read",
"relation...
2013 Jul 05
0
[LLVMdev] Enabling vectorization with LLVM 3.3 for a DSL emitting LLVM IR
On 07/04/2013 01:39 PM, Stéphane Letz wrote:
> Hi,
>
> Our DSL can generate C or directly generate LLVM IR. With LLVM 3.3, we can vectorize the C produced code using clang with -O3, or clang with -O1 then opt -O3 -vectorize-loops. But the same program generating LLVM IR version cannot be vectorized with opt -O3 -vectorize-loops. So our guess is that our generated LLVM IR lacks some
2013 Jul 04
3
[LLVMdev] Enabling vectorization with LLVM 3.3 for a DSL emitting LLVM IR
Hi,
Our DSL can generate C or directly generate LLVM IR. With LLVM 3.3, we can vectorize the C produced code using clang with -O3, or clang with -O1 then opt -O3 -vectorize-loops. But the same program generating LLVM IR version cannot be vectorized with opt -O3 -vectorize-loops. So our guess is that our generated LLVM IR lacks some informations that are needed by the vectorization passes to
2016 May 17
4
Determination of statements that contain only matrix multiplication
...ccesses of a SCoP statement and
>> def-use chains to determine statements, which don’t contain matrix
>> multiplication of the following form?
>
> Assuming s/don't/do you want to pattern-match gemm kernels inside larger scops.
>
>
>> for (int i = 0; i < Upper Bound1; i++)
>> for (int j = 0; j < Upper Bound2; j++)
>> for (int k = 0; k < Upper Bound3; j++)
>> C[i][j] += A[i][k] * B[k][j]
>>
>> We could probably check that memory access relations have the following form:
>>
>> "accesses" : [
&g...