summaryrefslogtreecommitdiff
path: root/omega/examples/lu
diff options
context:
space:
mode:
authorTuowen Zhao <ztuowen@gmail.com>2016-09-17 03:22:53 +0000
committerTuowen Zhao <ztuowen@gmail.com>2016-09-17 03:22:53 +0000
commit75ff98e4d65862ff5b36b533b4f6e3ea71ede1d5 (patch)
tree498ac06b4cf78568b807fafd2619856afff69c28 /omega/examples/lu
parent29efa7b1a0d089e02a70f73f348f11878955287c (diff)
downloadchill-75ff98e4d65862ff5b36b533b4f6e3ea71ede1d5.tar.gz
chill-75ff98e4d65862ff5b36b533b4f6e3ea71ede1d5.tar.bz2
chill-75ff98e4d65862ff5b36b533b4f6e3ea71ede1d5.zip
cmake build
Diffstat (limited to 'omega/examples/lu')
-rw-r--r--omega/examples/lu41
1 files changed, 0 insertions, 41 deletions
diff --git a/omega/examples/lu b/omega/examples/lu
deleted file mode 100644
index 800d8a0..0000000
--- a/omega/examples/lu
+++ /dev/null
@@ -1,41 +0,0 @@
-# Perform imperfect loop interchange of LU decomposition
-# to get jki form and then block the k and i loops
-#
-#for k = 1 to n do
-# for i = k+1 to n do
-# a(i,k) = a(i,k) / a(k,k)
-# for j = k+1 to n do
-# a(i,j) = a(i,j) - a(k,j)*a(i,k)
-# endfor
-# endfor
-#endfor
-#
-#
-
-symbolic n;
-
-IS10 := {[k,i] : 1 <= k <= n && k+1 <= i <= n};
-IS20 := {[k,i,j] : 1 <= k <= n && k+1 <= i <= n && k+1 <= j <= n};
-
-T10 := {[k,i] -> [t1,t2,k,k,i]:
-exists (alpha,beta: t1 = 64beta+1 && k-1 = alpha + 64 beta &&
- alpha >= 0 && alpha <= 63)
-&& exists (gamma,delta: t2 = 64delta && i = gamma +64delta &&
- gamma >= 0 && gamma <= 63)};
-
-T20 := {[k,i,j] -> [t1,t2,j,k,i]:
-exists (alpha,beta: t1 = 64beta+1 && k-1 = alpha + 64 beta &&
- alpha >= 0 && alpha <= 63)
-&& exists (gamma,delta: t2 = 64delta && i = gamma +64delta &&
- gamma >= 0 && gamma <= 63)};
-
-T10;
-T20;
-
-# Generate code with different ammounts of overhead remove
-# The more overhead we remove, the more code duplication may occur
-codegen 0 T10:IS10,T20:IS20;
-codegen 1 T10:IS10,T20:IS20;
-codegen 2 T10:IS10,T20:IS20;
-codegen 3 T10:IS10,T20:IS20;
-