- 24 Aug, 2007 6 commits
-
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
- 23 Aug, 2007 5 commits
-
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
Originally, we wanted to only use binary ones, at least initially. But this would a lot of fiddling with selectors when converting to/from generic array representations. This is both inefficient and hard to implement. Instead, we will limit the arity of our sums/product representation to, say, 16 (it's 3 at the moment) and initially refuse to vectorise programs for which this is not sufficient. This allows us to implement everything in the library. Later, we can implement the necessary splitting.
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
- 22 Aug, 2007 7 commits
-
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
- 08 Aug, 2007 3 commits
-
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
- 07 Aug, 2007 2 commits
-
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
- 02 Aug, 2007 2 commits
-
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
- 01 Aug, 2007 5 commits
-
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
- 31 Jul, 2007 4 commits
-
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
- 26 Jul, 2007 1 commit
-
-
rl@cse.unsw.edu.au authored
-
- 25 Jul, 2007 4 commits
-
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
rl@cse.unsw.edu.au authored
-
- 16 Jul, 2007 1 commit
-
-
rl@cse.unsw.edu.au authored
-