Displaying 14 results from an estimated 14 matches for "p_0".
Did you mean:
p0
2013 Jul 29
0
[LLVMdev] [Polly] Analysis of the expensive compile-time overhead of Polly Dependence pass
On 07/29/2013 09:15 AM, Sven Verdoolaege wrote:
> On Mon, Jul 29, 2013 at 07:37:14AM -0700, Tobias Grosser wrote:
>> On 07/29/2013 03:18 AM, Sven Verdoolaege wrote:
>>> On Sun, Jul 28, 2013 at 04:42:25PM -0700, Tobias Grosser wrote:
>>>> Sven: In terms of making the behaviour of isl easier to understand,
>>>> it may make sense to fail/assert in case
2013 Jul 31
1
[LLVMdev] [Polly] Analysis of the expensive compile-time overhead of Polly Dependence pass
...8; i++) { for (ctr = 0; ctr < 8; ctr++) { x1 = input[i*64 + ctr*8 + 1] ; x0 = input[i*64 + ctr*8 + 0] ; input[i*64 + ctr*8 + 0] = x0 - x1; input[i*64 + ctr*8 + 1] = x0 + x1; input[i*64 + ctr*8 + 2] = x0 * x1; }
Without this patch file, Polly would produce the Context as follows:
Context:
[p_0, p_1, p_2] -> { : p_0 >= -9223372036854775808 and p_0 <= 9223372036854775807 and p_1 >= -9223372036854775808 and p_1 <= 9223372036854775807 and p_2 >= -9223372036854775808 and p_2 <= 9223372036854775807 } p0: {0,+,128}<%for.cond2.preheader> p1: {2,+,128}<%for.cond2.pre...
2013 Jul 26
6
[LLVMdev] [Polly] Analysis of the expensive compile-time overhead of Polly Dependence pass
Hi Sebastian,
Recently, I found the "Polly - Calculate dependences" pass would lead to significant compile-time overhead when compiling some loop-intensive source code. Tobias told me you found similar problem as follows:
http://llvm.org/bugs/show_bug.cgi?id=14240
My evaluation shows that "Polly - Calculate dependences" pass consumes 96.4% of total compile-time overhead
2013 Jul 28
0
[LLVMdev] [Polly] Analysis of the expensive compile-time overhead of Polly Dependence pass
...to ScopInfo, but I need your
> help on handling some problems about ISL and SCEV.
I copied the list as the discussion may be helpful for others.
@Sven, no need to read all. Just search for your name.
[..]
>>The interesting observation is, that Polly introduces three parameters
>>(p_0, p_1, p_2) for this SCoP, even though in the C source code only the
>>variable 'i' is SCoP invariant. However, due to the way
>>SCEVExpr(essions) in LLVM are nested, Polly sees three scop-invariant
>>SCEVExpr(essions) which are all translated into independent parameters.
&...
2010 Sep 08
11
problem with outer
...message. i hope someone can help me.
Error in dim(robj) <- c(dX, dY) :
dims [product 16] do not match the length of object [1]
p_11=seq(0,0.3,0.1)
p_12=seq(0.1,0.4,0.1)
guete = function(p_11,p_12) {
set.seed(1000)
S_vek=matrix(0,nrow=N,ncol=1)
for(i in 1:N) {
X_0=rmultinom(q-1,size=1,prob=p_0)
X_1=rmultinom(n-q+1,size=1,prob=cbind(p_11,p_12,(1-p_11-p_12)))
N_0=apply(X_0[,(n-2*k-L+1):(n-k-L)],1,sum)
N_1=apply(X_1[,(n-q-k+2):(n-q+1)],1,sum)
S_vek[i]=((sum(((N_1-k*cbind(p_11,p_12,(1-p_11-p_12)))^2)/k*cbind(p_11,p_12,(1-p_11-p_12))))/(sum(((N_0-k*p_0)^2)/k*p_0)))-1
}
1-mean(f_1<=S_vek &a...
2013 Jul 26
0
[LLVMdev] [Polly] Analysis of the expensive compile-time overhead of Polly Dependence pass
...+ 1] ;
input[i*64 + ctr*8 + 0] = x0 - x1;
input[i*64 + ctr*8 + 1] = x0 + x1;
input[i*64 + ctr*8 + 2] = x0 * x1;
}
// SCoP end
bar(); // Unknown function call stops further expansion of SCoP
}
}
Which is translated to the following scop:
Context:
[p_0, p_1, p_2] -> { : p_0 >= -2147483648 and p_0 <= 2147483647
and p_1 >= -2147483648 and p_1 <= 2147483647 and p_2 >= -2147483648 and
p_2 <= 2147483647 }
p_0: {0,+,128}<%for.cond2.preheader>
p_1: {2,+,128}<%for.cond2.preheader>
p_2: {4,+,128}<%for....
2013 Jul 26
0
[LLVMdev] [Polly] Analysis of the expensive compile-time overhead of Polly Dependence pass
...t; input[i*64 + ctr*8 + 1] = x0 + x1;
> input[i*64 + ctr*8 + 2] = x0 * x1;
> }
> // SCoP end
>
> bar(); // Unknown function call stops further expansion of SCoP
> }
>}
>
>Which is translated to the following scop:
>
> Context:
> [p_0, p_1, p_2] -> { : p_0 >= -2147483648 and p_0 <= 2147483647
>and p_1 >= -2147483648 and p_1 <= 2147483647 and p_2 >= -2147483648 and
>p_2 <= 2147483647 }
> p_0: {0,+,128}<%for.cond2.preheader>
> p_1: {2,+,128}<%for.cond2.preheader>
> p_2...
2013 May 03
2
[LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
...{
for
(c4=max(ceild(-c3-p_1-30,20),c2);c4<=min(min(floord(-c3,20),c2+31),p_4-1);c4++)
{
for (c5=max(c3,-20*c4-p_1+1);c5<=min(-20*c4,c3+31);c5++) {
Stmt_for_body41(c4,-20*c4-c5);
}
}
}
}
}
if ((ni >= 1) && (nk >= 1) && (p_0 >= 1) && (p_4 >= 1)) {
for (c2=0;c2<=p_0-1;c2+=32) {
for
(c3=max(-32*floord(-12*p_0+p_4+10,32)-32*p_0,-32*c2-32*floord(-12*c2+p_4+10,32)-640);c3<=-20*c2;c3+=32)
{
for
(c4=max(ceild(-c3-p_4-30,20),c2);c4<=min(min(floord(-c3,20),c2+31),p_0-1);c4++)
{...
2010 Sep 26
8
the function doesn´t work
hey, my function doesn?t work. can somebody help me?
the graphic doesn?t work and also the function. thnx a lot.
N=10
n=100
p_0=c(1/5,1-1/5)
power = function(p,m) {
set.seed(1000)
H=matrix(0,nrow=N,ncol=1)
for(i in 1:N) {
x <- matrix(rnorm(n, 0, 0.5), ncol = m)
y <- matrix(rnorm(n, 0, 0.8), ncol = m)
l <- diag(cor(x, y))
q_1 = qnorm(0.05, 0, 0.05)
q_2 = qnorm(1 - 0.05, 0, 0.05)
p <- (l^2)/sum(l^2)
H[i] &...
2013 May 03
0
[LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
Dear Tobias,
Thank you very much for your very helpful advice.
Yes, -debug-pass and -time-passes are two very useful and powerful options when evaluating the compile-time of each compiler pass. They are exactly what I need! With these options, I can step into details of the compile-time overhead of each pass. I have finished some preliminary testing based on two randomly selected files from
2013 May 02
2
[LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
On 04/30/2013 04:13 PM, Star Tan wrote:
> Hi all,
[...]
> How could I find out where the time is spent on between two adjacent Polly passes? Can anyone give me some advice?
Hi Star Tan,
I propose to do the performance analysis using the 'opt' tool and
optimizing LLVM-IR, instead of running it from within clang. For the
'opt' tool there are two commands that should help
2009 Oct 29
1
How to turn individual consecutive information into survival objects?
Dear R List,
I have a dataset with the following structure:
"""personal_id, p_0, p_1, p_2, .... , p_36, p_37
1, NA, 1, 4, .... , 1, NA
2, NA, NA, NA, .... , 4, NA
.
.
.
6020, NA, 3, 3, ...., NA, NA
6021, NA, 2, 2, ...., 4, NA
"""
I used some made-up data. It is just meant to show the structure of the dataset.
The variables of interest are p_0, ... p_37. Th...
2013 May 03
0
[LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
...30,20),c2);c4<=min(min(floord(-c3,20),c2+31),p_4-1);c4++)
>{
> for (c5=max(c3,-20*c4-p_1+1);c5<=min(-20*c4,c3+31);c5++) {
> Stmt_for_body41(c4,-20*c4-c5);
> }
> }
> }
> }
>}
>if ((ni >= 1) && (nk >= 1) && (p_0 >= 1) && (p_4 >= 1)) {
> for (c2=0;c2<=p_0-1;c2+=32) {
> for
>(c3=max(-32*floord(-12*p_0+p_4+10,32)-32*p_0,-32*c2-32*floord(-12*c2+p_4+10,32)-640);c3<=-20*c2;c3+=32)
>{
> for
>(c4=max(ceild(-c3-p_4-30,20),c2);c4<=min(min(floord(-c3,20),c2+31),...
2008 Jun 30
4
Rebuild of kernel 2.6.9-67.0.20.EL failure
Hello list.
I'm trying to rebuild the 2.6.9.67.0.20.EL kernel, but it fails even without
modifications.
How did I try it?
Created a (non-root) build environment (not a mock )
Installed the kernel.scr.rpm and did a
rpmbuild -ba --target=`uname -m` kernel-2.6.spec 2> prep-err.log | tee
prep-out.log
The build failed at the end:
Processing files: kernel-xenU-devel-2.6.9-67.0.20.EL
Checking