Two Linux kernel problems
... are already written: For 2.4 1 2 3 4 and for 2.6 1 2 3 4 . The BitKeeper archive of 2.6 contains a ... Starzetz discovered two problems in the Linux Kernel. Both of them affects multicast enabled kernels. Our ... recent kernels are already written: For 2.4 1 2 3 4 and for 2.6 1 2 3 4 . The BitKeeper archive of 2.6 ... Two Linux kernel problems ... Two Linux kernel problems ...
Slide 1
... (int i = 0; i < N; i++) for (int j = 0; j < N; j++) for (int k = 0; k < N; k++) C[i][ j] += A[i][k] * B ... ; j++) for (int k = t_k; k < t_k + 32; k++) C[i][ j] += A[i][k] * B[k][ j]; Tiled 𝐶 = 𝐴 ∙ 𝐵 Only ... (int i = 0; i < N; i++) for (int j = 0; j < N; j++) for (int k = 0; k < N; k++) C[i][ j] += A[i][k] * B ... ; j++) for (int k = t_k; k < t_k + 32; k++) C[i][ j] += A[i][k] * B[k][ j]; Tiled 𝐶 = 𝐴 ∙ 𝐵 Only ... Slide 1 ...
Serie 3
... Serie 3 D-Math Prof. Dr. D.A. Salamon Differential Geometry I HS 17 October 10, 2017 Solution 3 1 ... → R, f(x) = x2 − 1 c) f : R2 → R2, f(x, y) = (x,−y) d) f : R2 → R2, f(x, y) = (y,−x) e) f : S2 → R3, f ... by an element of SO( 3) sending ξ to e3 and use Exercise 4 c) ). Thus from exercise 1, we already have ... Serie 3 D-Math Prof. Dr. D.A. Salamon Differential Geometry I HS 17 October 10, 2017 Solution 3 1 ... Serie 3 ...
Slide 1
... Space 0 1 2 3 4 5 j i 5 4 3 2 1 0 N = 4 j ≤ i i ≤ N = 4 0 ≤ j 0 ≤ i D = { (i, j) | 0 ≤ i ≤ N ∧ 0 ≤ j ≤ i ... & ThreadsIteration Space 𝐵𝐼𝐷 = { 𝑖, 𝑗 → 𝑖 4 % 2, 𝑗 3 % 2 } 0 1 10 i j 𝑇𝐼𝐷 = { 𝑖, 𝑗 → 𝑖 % 4, 𝑗 % 3 ... Space 0 1 2 3 4 5 j i 5 4 3 2 1 0 N = 4 j ≤ i i ≤ N = 4 0 ≤ j 0 ≤ i D = { (i, j) | 0 ≤ i ≤ N ∧ 0 ≤ j ≤ i ... & ThreadsIteration Space 𝐵𝐼𝐷 = { 𝑖, 𝑗 → 𝑖 4 % 2, 𝑗 3 % 2 } 0 1 10 i j 𝑇𝐼𝐷 = { 𝑖, 𝑗 → 𝑖 % 4, 𝑗 % 3 ... Slide 1 ...
Slide 1
... Production Reality 1. F1 2. F3 3. F2 spcl.inf.ethz.ch @spcl_eth 11 How to mechanize the expert? → Survey! C o ... @spcl_eth 17 I = {0 2 , 1 2 , 2 2 , 3 2 , 4 2 , 5 2 , 6 2 } J = {0,1,2} n = 5 ✔✔ Sweep3D ✖ MILC ✔ HOMME ... Production Reality 1. F1 2. F3 3. F2 spcl.inf.ethz.ch @spcl_eth 11 How to mechanize the expert? → Survey! C o ... @spcl_eth 17 I = {0 2 , 1 2 , 2 2 , 3 2 , 4 2 , 5 2 , 6 2 } J = {0,1,2} n = 5 ✔✔ Sweep3D ✖ MILC ✔ HOMME ... Slide 1 ...
Slide 1
... Scientific Language NetworkX Network Analysis in Python spcl.inf.ethz.ch @spcl_eth 3 0 1 2 3 4 5 6 7 8 9 10 ... 11 B = np.ndarray(( 3, 4), dtype=np.float64) A + B 0 1 2 3 4 5 6 7 8 9 10 11 9 8 7 6 5 4 3 2 1 0 - 1 -2 ... Scientific Language NetworkX Network Analysis in Python spcl.inf.ethz.ch @spcl_eth 3 0 1 2 3 4 5 6 7 8 9 10 ... 11 B = np.ndarray(( 3, 4), dtype=np.float64) A + B 0 1 2 3 4 5 6 7 8 9 10 11 9 8 7 6 5 4 3 2 1 0 - 1 -2 ... Slide 1 ...
Slide 1
... j i 5 4 3 2 1 0 N = 4 j ≤ i i ≤ N = 4 0 ≤ j 0 ≤ i D = { (i, j) | 0 ≤ i ≤ N ∧ 0 ≤ j ≤ i } (i, j ... , 𝑗 → 𝑖 4 % 2, 𝑗 3 % 2 } 0 1 10 i j 𝑇𝐼𝐷 = { 𝑖, 𝑗 → 𝑖 % 4, 𝑗 % 3 } T. Grosser, TH: Polly-ACC ... j i 5 4 3 2 1 0 N = 4 j ≤ i i ≤ N = 4 0 ≤ j 0 ≤ i D = { (i, j) | 0 ≤ i ≤ N ∧ 0 ≤ j ≤ i } (i, j ... , 𝑗 → 𝑖 4 % 2, 𝑗 3 % 2 } 0 1 10 i j 𝑇𝐼𝐷 = { 𝑖, 𝑗 → 𝑖 % 4, 𝑗 % 3 } T. Grosser, TH: Polly-ACC ... Slide 1 ...
Slide 1
... j i 5 4 3 2 1 0 N = 4 j ≤ i i ≤ N = 4 0 ≤ j 0 ≤ i D = { (i, j) | 0 ≤ i ≤ N ∧ 0 ≤ j ≤ i } (i, j ... , 𝑗 → 𝑖 4 % 2, 𝑗 3 % 2 } 0 1 10 i j 𝑇𝐼𝐷 = { 𝑖, 𝑗 → 𝑖 % 4, 𝑗 % 3 } T. Grosser, TH: Polly-ACC ... j i 5 4 3 2 1 0 N = 4 j ≤ i i ≤ N = 4 0 ≤ j 0 ≤ i D = { (i, j) | 0 ≤ i ≤ N ∧ 0 ≤ j ≤ i } (i, j ... , 𝑗 → 𝑖 4 % 2, 𝑗 3 % 2 } 0 1 10 i j 𝑇𝐼𝐷 = { 𝑖, 𝑗 → 𝑖 % 4, 𝑗 % 3 } T. Grosser, TH: Polly-ACC ... Slide 1 ...
Slide 1
... Modeling Iteration Space 0 1 2 3 4 5 j i 5 4 3 2 1 0 N = 4 j ≤ i i ≤ N = 4 0 ≤ j 0 ≤ i D = { (i, j) | 0 ≤ i ... Space 𝐵𝐼𝐷 = { 𝑖, 𝑗 → 𝑖 4 % 2, 𝑗 3 % 2 } 0 1 10 i j 𝑇𝐼𝐷 = { 𝑖, 𝑗 → 𝑖 % 4, 𝑗 % 3 } T ... Modeling Iteration Space 0 1 2 3 4 5 j i 5 4 3 2 1 0 N = 4 j ≤ i i ≤ N = 4 0 ≤ j 0 ≤ i D = { (i, j) | 0 ≤ i ... Space 𝐵𝐼𝐷 = { 𝑖, 𝑗 → 𝑖 4 % 2, 𝑗 3 % 2 } 0 1 10 i j 𝑇𝐼𝐷 = { 𝑖, 𝑗 → 𝑖 % 4, 𝑗 % 3 } T ... Slide 1 ...
Slide 1
... spcl.inf.ethz.ch @spcl_eth Tool: Polyhedral Modeling Iteration Space 0 1 2 3 4 5 j i 5 4 3 2 1 0 N = 4 j ≤ i i ≤ N ... 1 10 i j 𝑇𝐼𝐷 = { 𝑖, 𝑗 → 𝑖 % 4, 𝑗 % 3 } T. Grosser, TH: Polly-ACC: Transparent compilation to ... spcl.inf.ethz.ch @spcl_eth Tool: Polyhedral Modeling Iteration Space 0 1 2 3 4 5 j i 5 4 3 2 1 0 N = 4 j ≤ i i ≤ N ... 1 10 i j 𝑇𝐼𝐷 = { 𝑖, 𝑗 → 𝑖 % 4, 𝑗 % 3 } T. Grosser, TH: Polly-ACC: Transparent compilation to ... Slide 1 ...
