packages/dph.git
9 years agoMake combine2 work with selectors
Roman Leshchinskiy [Mon, 7 Jun 2010 07:57:14 +0000 (07:57 +0000)] 
Make combine2 work with selectors

9 years agoMove selectors to the backend where they belong
Roman Leshchinskiy [Mon, 7 Jun 2010 05:27:07 +0000 (05:27 +0000)] 
Move selectors to the backend where they belong

9 years agoFiddle with enum*Each functions
Roman Leshchinskiy [Mon, 7 Jun 2010 04:10:40 +0000 (04:10 +0000)] 
Fiddle with enum*Each functions

9 years agoNeeds the -rtsopts
benl@ouroborus.net [Wed, 9 Jun 2010 07:18:54 +0000 (07:18 +0000)] 
Needs the -rtsopts

9 years agoAdd vector version of quickhull to Makefile
benl@ouroborus.net [Wed, 9 Jun 2010 07:16:55 +0000 (07:16 +0000)] 
Add vector version of quickhull to Makefile

9 years agoAdd parallel vector version of quickhull
benl@ouroborus.net [Wed, 9 Jun 2010 06:45:46 +0000 (06:45 +0000)] 
Add parallel vector version of quickhull

9 years agoDon't measure time to create input vector in quickhull vector version (duh)
benl@ouroborus.net [Tue, 8 Jun 2010 08:42:48 +0000 (08:42 +0000)] 
Don't measure time to create input vector in quickhull vector version (duh)

9 years agoAdded Data.Seq version to QuickHull.hs benchmark
Manuel M T Chakravarty [Mon, 7 Jun 2010 11:05:33 +0000 (11:05 +0000)] 
Added Data.Seq version to QuickHull.hs benchmark

9 years agoMore delaunay optimisations
Roman Leshchinskiy [Mon, 7 Jun 2010 03:03:27 +0000 (03:03 +0000)] 
More delaunay optimisations

9 years agoOptimise delaunay a bit
Roman Leshchinskiy [Mon, 7 Jun 2010 01:25:42 +0000 (01:25 +0000)] 
Optimise delaunay a bit

9 years agoRemove repeatc*
Roman Leshchinskiy [Mon, 7 Jun 2010 01:12:28 +0000 (01:12 +0000)] 
Remove repeatc*

9 years agoOptimise vectorised versions of not, (||) and (&&)
Roman Leshchinskiy [Mon, 7 Jun 2010 01:04:13 +0000 (01:04 +0000)] 
Optimise vectorised versions of not, (||) and (&&)

9 years agoAdd indexedP and friends
Roman Leshchinskiy [Fri, 4 Jun 2010 08:28:49 +0000 (08:28 +0000)] 
Add indexedP and friends

9 years agoAdd inline pragmas
Roman Leshchinskiy [Fri, 4 Jun 2010 08:28:33 +0000 (08:28 +0000)] 
Add inline pragmas

9 years agoParallel list version using 'par'
Manuel M T Chakravarty [Mon, 7 Jun 2010 01:59:43 +0000 (01:59 +0000)] 
Parallel list version using 'par'

9 years agoStart on Vector version of quickhull
benl@ouroborus.net [Fri, 4 Jun 2010 08:02:44 +0000 (08:02 +0000)] 
Start on Vector version of quickhull

9 years agoAdd benchmarking version of delaunay
Roman Leshchinskiy [Fri, 4 Jun 2010 04:54:14 +0000 (04:54 +0000)] 
Add benchmarking version of delaunay

9 years agoFix bug in delaunay
Roman Leshchinskiy [Fri, 4 Jun 2010 04:48:50 +0000 (04:48 +0000)] 
Fix bug in delaunay

9 years agoAdd missing files and svg generation to list delaunay
Roman Leshchinskiy [Fri, 4 Jun 2010 02:04:13 +0000 (02:04 +0000)] 
Add missing files and svg generation to list delaunay

9 years agoFirst attempt at Delaunay triangulation (doesn't work correctly yet)
Roman Leshchinskiy [Fri, 4 Jun 2010 00:59:57 +0000 (00:59 +0000)] 
First attempt at Delaunay triangulation (doesn't work correctly yet)

9 years agoAdd updateP and bpermuteP to the prelude
Roman Leshchinskiy [Fri, 4 Jun 2010 00:56:42 +0000 (00:56 +0000)] 
Add updateP and bpermuteP to the prelude

9 years agoAdd updatePA and bpermutePA
Roman Leshchinskiy [Fri, 4 Jun 2010 00:56:32 +0000 (00:56 +0000)] 
Add updatePA and bpermutePA

9 years agoAdd updatePR and friends
Roman Leshchinskiy [Fri, 4 Jun 2010 00:56:13 +0000 (00:56 +0000)] 
Add updatePR and friends

9 years agoOptimise bpermutePR<PArray a> slightly
Roman Leshchinskiy [Fri, 4 Jun 2010 00:55:49 +0000 (00:55 +0000)] 
Optimise bpermutePR<PArray a> slightly

9 years agoFix strictness bug in replicateUP
Roman Leshchinskiy [Fri, 4 Jun 2010 00:54:35 +0000 (00:54 +0000)] 
Fix strictness bug in replicateUP

9 years agoAdd traces
Roman Leshchinskiy [Fri, 4 Jun 2010 00:54:05 +0000 (00:54 +0000)] 
Add traces

9 years agoImplement slicePA_l
Roman Leshchinskiy [Fri, 4 Jun 2010 00:53:18 +0000 (00:53 +0000)] 
Implement slicePA_l

9 years agoFix bad bug in replicatePA_l
Roman Leshchinskiy [Fri, 4 Jun 2010 00:48:42 +0000 (00:48 +0000)] 
Fix bad bug in replicatePA_l

9 years agoAdd interleave{U|UP}
Roman Leshchinskiy [Fri, 4 Jun 2010 00:46:47 +0000 (00:46 +0000)] 
Add interleave{U|UP}

9 years agoFiddle with tracing functions
Roman Leshchinskiy [Fri, 4 Jun 2010 00:46:33 +0000 (00:46 +0000)] 
Fiddle with tracing functions

9 years agoWibbles to C quickhull for Solaris
benl@ouroborus.net [Thu, 3 Jun 2010 08:16:58 +0000 (08:16 +0000)] 
Wibbles to C quickhull for Solaris

9 years agoAdd C version of quickhull
benl@ouroborus.net [Thu, 3 Jun 2010 06:45:30 +0000 (06:45 +0000)] 
Add C version of quickhull

9 years agoAdd some optimisation rules
Roman Leshchinskiy [Tue, 1 Jun 2010 04:08:24 +0000 (04:08 +0000)] 
Add some optimisation rules

9 years agoAdd seq rules
Roman Leshchinskiy [Tue, 1 Jun 2010 04:07:37 +0000 (04:07 +0000)] 
Add seq rules

9 years agoAdd support for loading data from file to SVG QH
Roman Leshchinskiy [Mon, 31 May 2010 10:28:23 +0000 (10:28 +0000)] 
Add support for loading data from file to SVG QH

9 years agoFix test data generation for QH
Roman Leshchinskiy [Mon, 31 May 2010 10:27:59 +0000 (10:27 +0000)] 
Fix test data generation for QH

9 years agoAdd tracing support to TH generators
Roman Leshchinskiy [Mon, 31 May 2010 10:27:30 +0000 (10:27 +0000)] 
Add tracing support to TH generators

9 years agoAdd a couple of traceFn
Roman Leshchinskiy [Mon, 31 May 2010 10:27:13 +0000 (10:27 +0000)] 
Add a couple of traceFn

9 years agoRemove dead code
Roman Leshchinskiy [Mon, 31 May 2010 10:27:07 +0000 (10:27 +0000)] 
Remove dead code

9 years agoFix applPR<PArray a>
Roman Leshchinskiy [Mon, 31 May 2010 10:26:50 +0000 (10:26 +0000)] 
Fix applPR<PArray a>

9 years agoAdd plusSegd
Roman Leshchinskiy [Mon, 31 May 2010 10:21:58 +0000 (10:21 +0000)] 
Add plusSegd

9 years agoFix bug in bpermutePR<PArray a>
Roman Leshchinskiy [Mon, 31 May 2010 10:20:58 +0000 (10:20 +0000)] 
Fix bug in bpermutePR<PArray a>

9 years agoAdd import
Roman Leshchinskiy [Mon, 31 May 2010 10:19:12 +0000 (10:19 +0000)] 
Add import

9 years agoDerive Show for EitherS and MaybeS
Roman Leshchinskiy [Mon, 31 May 2010 10:18:53 +0000 (10:18 +0000)] 
Derive Show for EitherS and MaybeS

9 years agoTest data generator for Quickhull
Roman Leshchinskiy [Mon, 31 May 2010 03:04:22 +0000 (03:04 +0000)] 
Test data generator for Quickhull

9 years agoSlight optimisation in Quickhull
Roman Leshchinskiy [Thu, 27 May 2010 12:50:17 +0000 (12:50 +0000)] 
Slight optimisation in Quickhull

9 years agoAdd rule for zipWith/replicate
Roman Leshchinskiy [Thu, 27 May 2010 11:39:06 +0000 (11:39 +0000)] 
Add rule for zipWith/replicate

9 years agoUse -rtsopts when building test cases
Roman Leshchinskiy [Thu, 27 May 2010 09:05:00 +0000 (09:05 +0000)] 
Use -rtsopts when building test cases

9 years agoAdd a seq/sum rule
Roman Leshchinskiy [Thu, 27 May 2010 09:04:49 +0000 (09:04 +0000)] 
Add a seq/sum rule

9 years agoFix strictness of various Lifted combinators
Roman Leshchinskiy [Thu, 27 May 2010 09:04:25 +0000 (09:04 +0000)] 
Fix strictness of various Lifted combinators

9 years agoRemove unneeded parameters from indices_s
Roman Leshchinskiy [Thu, 27 May 2010 09:03:48 +0000 (09:03 +0000)] 
Remove unneeded parameters from indices_s

9 years agolengthsToSegd is no longer special
Roman Leshchinskiy [Thu, 27 May 2010 09:03:08 +0000 (09:03 +0000)] 
lengthsToSegd is no longer special

9 years agoSanitise zipU and unzipU
Roman Leshchinskiy [Thu, 27 May 2010 09:00:40 +0000 (09:00 +0000)] 
Sanitise zipU and unzipU

  * unzipU now return a lazy pair instead of a strict one

  * There is an unzipU/zipU rule

  * zip3, zipWith3 and unzip3 are defined in DPH_Interface

9 years agoMake packPA_l strict
Roman Leshchinskiy [Thu, 27 May 2010 01:33:43 +0000 (01:33 +0000)] 
Make packPA_l strict

9 years agoFix load balancing issue with indices_s
Roman Leshchinskiy [Wed, 26 May 2010 14:25:34 +0000 (14:25 +0000)] 
Fix load balancing issue with indices_s

9 years agoFix load balancing bug in segmented sums
Roman Leshchinskiy [Wed, 26 May 2010 04:57:32 +0000 (04:57 +0000)] 
Fix load balancing bug in segmented sums

9 years agoAdd exports
Roman Leshchinskiy [Wed, 26 May 2010 04:57:30 +0000 (04:57 +0000)] 
Add exports

9 years agoAdd debugging function
Roman Leshchinskiy [Wed, 26 May 2010 04:52:41 +0000 (04:52 +0000)] 
Add debugging function

9 years agoRewrite test data generation in quickhull
Roman Leshchinskiy [Thu, 20 May 2010 03:33:11 +0000 (03:33 +0000)] 
Rewrite test data generation in quickhull

9 years agoAdd a seq rule for scanlU (+) 0
Roman Leshchinskiy [Thu, 20 May 2010 03:32:12 +0000 (03:32 +0000)] 
Add a seq rule for scanlU (+) 0

This occurs quite frequently when calculating segment descriptors.
Nevertheless, it is a hack.

9 years agoImplement parallel lifted append
Roman Leshchinskiy [Thu, 20 May 2010 03:31:09 +0000 (03:31 +0000)] 
Implement parallel lifted append

This requires append_s and friends to take the segment descriptor of the
result as an additional parameter. This change is also propagated to the
Lifted stuff.

9 years agoImplement fold1SUP
Roman Leshchinskiy [Thu, 20 May 2010 03:30:07 +0000 (03:30 +0000)] 
Implement fold1SUP

9 years agoMake replicateSUP produce evenly distributed arrays
Roman Leshchinskiy [Thu, 20 May 2010 03:28:55 +0000 (03:28 +0000)] 
Make replicateSUP produce evenly distributed arrays

9 years agoMake enumFromStepLenUP more efficient
Roman Leshchinskiy [Thu, 20 May 2010 03:27:36 +0000 (03:27 +0000)] 
Make enumFromStepLenUP more efficient

9 years agoMake foldUP more efficient at the cost of a slight change in semantics
Roman Leshchinskiy [Thu, 20 May 2010 03:25:04 +0000 (03:25 +0000)] 
Make foldUP more efficient at the cost of a slight change in semantics

We now make no guarantees about how often the neutral element will be used. It
really has to be neutral.

9 years agoFix implementation of repeat_c
Roman Leshchinskiy [Thu, 20 May 2010 03:23:32 +0000 (03:23 +0000)] 
Fix implementation of repeat_c

9 years agoAdd a function for splitting a segment descriptor such that the data array will be...
Roman Leshchinskiy [Thu, 20 May 2010 03:22:31 +0000 (03:22 +0000)] 
Add a function for splitting a segment descriptor such that the data array will be evenly distributed

9 years agoAdd export
Roman Leshchinskiy [Thu, 20 May 2010 03:22:16 +0000 (03:22 +0000)] 
Add export

9 years agoChange various functions to use generateD/imapD
Roman Leshchinskiy [Thu, 20 May 2010 03:20:36 +0000 (03:20 +0000)] 
Change various functions to use generateD/imapD

9 years agoDelay inlining unitD
Roman Leshchinskiy [Thu, 20 May 2010 03:19:41 +0000 (03:19 +0000)] 
Delay inlining unitD

9 years agoOnly inline zipD in phase 0 to give some rules a chance to match in phase 1
Roman Leshchinskiy [Thu, 20 May 2010 03:18:57 +0000 (03:18 +0000)] 
Only inline zipD in phase 0 to give some rules a chance to match in phase 1

9 years agoNew combinators in DistST
Roman Leshchinskiy [Thu, 20 May 2010 03:18:20 +0000 (03:18 +0000)] 
New combinators in DistST

9 years agoAdd RULES for zipU/joinD and zipU/splitJoinD
Roman Leshchinskiy [Thu, 20 May 2010 03:16:27 +0000 (03:16 +0000)] 
Add RULES for zipU/joinD and zipU/splitJoinD

9 years agoCompletely change how mapD and friends are implemented
Roman Leshchinskiy [Thu, 20 May 2010 03:12:29 +0000 (03:12 +0000)] 
Completely change how mapD and friends are implemented

The basic combinators are now

generateD :: DT a => Gang -> (Int -> a) -> Dist a
imapD :: (DT a, DT b) => Gang -> (Int -> a -> b) -> Dist a -> Dist b

The Int argument is the index of the current thread. There is also

generateD_cheap :: DT a => Gang -> (Int -> a) -> Dist a

which is equivalent to generateD but just runs the computation sequentially.

9 years agoDon't inline scanD
Roman Leshchinskiy [Thu, 20 May 2010 03:11:56 +0000 (03:11 +0000)] 
Don't inline scanD

9 years agoMake joinD CONLIKE
Roman Leshchinskiy [Thu, 20 May 2010 03:10:29 +0000 (03:10 +0000)] 
Make joinD CONLIKE

9 years agoManually eta-expand mapUP
Roman Leshchinskiy [Thu, 20 May 2010 03:09:10 +0000 (03:09 +0000)] 
Manually eta-expand mapUP

9 years agoFix and use enumFromToEachUP
Roman Leshchinskiy [Thu, 20 May 2010 03:08:05 +0000 (03:08 +0000)] 
Fix and use enumFromToEachUP

9 years agoExport more stuff
Roman Leshchinskiy [Thu, 20 May 2010 03:06:41 +0000 (03:06 +0000)] 
Export more stuff

9 years agoAdd dependency
Roman Leshchinskiy [Thu, 20 May 2010 03:06:17 +0000 (03:06 +0000)] 
Add dependency

9 years agoTracing for gangs
Roman Leshchinskiy [Thu, 20 May 2010 03:05:22 +0000 (03:05 +0000)] 
Tracing for gangs

9 years agoAdd tracing facilities to Dist
Roman Leshchinskiy [Thu, 20 May 2010 03:04:20 +0000 (03:04 +0000)] 
Add tracing facilities to Dist

9 years agoUse divInt, modInt etc.
Roman Leshchinskiy [Thu, 20 May 2010 03:01:18 +0000 (03:01 +0000)] 
Use divInt, modInt etc.

9 years agoRefactoring to avoid making splitJoinD a loop breaker
Roman Leshchinskiy [Thu, 6 May 2010 10:13:16 +0000 (10:13 +0000)] 
Refactoring to avoid making splitJoinD a loop breaker

9 years agoAdd bangs
Roman Leshchinskiy [Thu, 6 May 2010 10:11:12 +0000 (10:11 +0000)] 
Add bangs

9 years agoRemove sequential gangs
Roman Leshchinskiy [Mon, 29 Mar 2010 09:11:03 +0000 (09:11 +0000)] 
Remove sequential gangs

9 years agoBuild system: Fix use of "rm" variables
Ian Lynagh [Sat, 8 May 2010 19:04:42 +0000 (19:04 +0000)] 
Build system: Fix use of "rm" variables

9 years agoAdd fftS to harness
benl@ouroborus.net [Thu, 1 Apr 2010 11:43:24 +0000 (11:43 +0000)] 
Add fftS to harness

9 years agoFix bugs in FFT benchmark
benl@ouroborus.net [Thu, 1 Apr 2010 11:18:46 +0000 (11:18 +0000)] 
Fix bugs in FFT benchmark

You can also now say
   seq/fft check

  and it will do a 1d transform of a step function,
  with both the FFT kernel and a DFT.

9 years agoPrint checksums of resulting matrices in mmult examples
benl@ouroborus.net [Thu, 1 Apr 2010 05:47:01 +0000 (05:47 +0000)] 
Print checksums of resulting matrices in mmult examples

9 years agoAdd to mmult C harness
benl@ouroborus.net [Thu, 1 Apr 2010 04:19:10 +0000 (04:19 +0000)] 
Add to mmult C harness
You can generate random matrices with -random, then save them
to file with -ddumpinput. Load them back up with the Haskell
version and check the output is the same.

9 years agoHacks to C mmult
benl@ouroborus.net [Thu, 1 Apr 2010 02:35:01 +0000 (02:35 +0000)] 
Hacks to C mmult

9 years agoFaster generation of random matrices for mmult
benl@ouroborus.net [Thu, 1 Apr 2010 02:06:01 +0000 (02:06 +0000)] 
Faster generation of random matrices for mmult

9 years agoStart on C ver of mmult
benl@ouroborus.net [Thu, 1 Apr 2010 02:01:17 +0000 (02:01 +0000)] 
Start on C ver of mmult

9 years agoSplit useful stuff out of C version of Laplace, and add to Makefile
benl@ouroborus.net [Thu, 1 Apr 2010 01:21:35 +0000 (01:21 +0000)] 
Split useful stuff out of C version of Laplace, and add to Makefile

9 years agoAdd DArray versions of mmult
benl@ouroborus.net [Thu, 1 Apr 2010 01:02:09 +0000 (01:02 +0000)] 
Add DArray versions of mmult

9 years agoAdd version of mmMult using traverse
benl@ouroborus.net [Thu, 1 Apr 2010 00:43:14 +0000 (00:43 +0000)] 
Add version of mmMult using traverse

9 years agoAdd to mmult harness
benl@ouroborus.net [Thu, 1 Apr 2010 00:31:02 +0000 (00:31 +0000)] 
Add to mmult harness

9 years agoMore fft
Roman Leshchinskiy [Wed, 31 Mar 2010 11:50:20 +0000 (11:50 +0000)] 
More fft

9 years agoAdded Any, test for fft
keller@cse.unsw.edu.au [Wed, 31 Mar 2010 11:43:58 +0000 (11:43 +0000)] 
Added Any, test for fft