"Sebastian Sylvan" <[EMAIL PROTECTED]> writes:
> I think you need to run the Fasta benchmark with N=25 to
> generate the input file for this benchmark...
I made the file available at http://www.ii.uib.no/~ketil/knuc.input
-k
--
If I haven't seen further, it is by standing in the footprints
On 2/22/06, Simon Marlow <[EMAIL PROTECTED]> wrote:
> On 21 February 2006 17:21, Chris Kuklewicz wrote:
>
> > From the shooutout itself:
> >
> >
> http://shootout.alioth.debian.org/gp4/benchmark.php?test=knucleotide&lan
> g=ghc&id=3
> >
> > and
> >
> >
> http://shootout.alioth.debian.org/gp4/benchm
On 21 February 2006 17:21, Chris Kuklewicz wrote:
> From the shooutout itself:
>
>
http://shootout.alioth.debian.org/gp4/benchmark.php?test=knucleotide&lan
g=ghc&id=3
>
> and
>
>
http://shootout.alioth.debian.org/gp4/benchmark.php?test=knucleotide&lan
g=ghc&id=2
>
> (I forget the exact differe
Simon Marlow wrote:
> Brian Sniffen wrote:
>> On 2/10/06, Ketil Malde <[EMAIL PROTECTED]> wrote:
>>
>>
>>> Hmm...perhaps it is worth it, then? The benchmark may specify "hash
>>> table", but I think it is fair to interpret it as "associative data
>>> structure" - after all, people are using "assoc
Brian Sniffen wrote:
On 2/10/06, Ketil Malde <[EMAIL PROTECTED]> wrote:
Hmm...perhaps it is worth it, then? The benchmark may specify "hash
table", but I think it is fair to interpret it as "associative data
structure" - after all, people are using "associative arrays" that
(presumably) don't
On Feb 15, 2006, at 3:42 AM, Ketil Malde wrote:
Not sure how relevant this is, but I see there is a recently released
hash library here that might be a candidate for FFIing?
https://sourceforge.net/projects/goog-sparsehash/
The real issue isn't the algorithms involved; I saw the best
perf
On Wed, Feb 15, 2006 at 09:42:10AM +0100, Ketil Malde wrote:
>
> Not sure how relevant this is, but I see there is a recently released
> hash library here that might be a candidate for FFIing?
>
> https://sourceforge.net/projects/goog-sparsehash/
>
> | An extremely memory-efficient hash_map impl
Not sure how relevant this is, but I see there is a recently released
hash library here that might be a candidate for FFIing?
https://sourceforge.net/projects/goog-sparsehash/
| An extremely memory-efficient hash_map implementation. 2 bits/entry
| overhead! The SparseHash library contains severa
On 2/10/06, Ketil Malde <[EMAIL PROTECTED]> wrote:
> Hmm...perhaps it is worth it, then? The benchmark may specify "hash
> table", but I think it is fair to interpret it as "associative data
> structure" - after all, people are using "associative arrays" that
> (presumably) don't guarantee a hash
> indicates that it triggers a bug in 6.4.1
Ah, I missed that.
For my word counting indexes, I've settled on Data.Map, calculating an
Int or Integer hash for each word (depending on word length, which is
fixed). I haven't given it nearly the effort the shootout programs
have seen, though, so I'
Ketil Malde wrote:
> Chris Kuklewicz <[EMAIL PROTECTED]> writes:
>
>> Is Jan-Willem Maessen's Hash available anywhere? I could benchmark it.
>
> Did you ever get around to run the benchmark? I browsed around a bit,
> and found that the knucleotide is probably the worst GHC benchmark in
> the sh
Because Data.HashTable is tied rather specially into the internals of
Data.Typeable (I think I'm getting that right) it's hard to just drop
in a new module with the same name.
But for those eager to tinker, here are two modules for simple hash
tables by table doubling and for multiplicative
Bulat Ziganshin wrote:
> Hello Chris,
>
> Monday, January 23, 2006, 6:09:15 PM, you wrote:
>
> CK> Using -A400m I get 39s down from 55s. That is the best Data.HashTable
> time I
> CK> have seen. (Using -A10m and -A100m were a little slower).
>
> 1) "-A400m" is a bit unusual. "-H400m" for 500-meg
Hello Chris,
Monday, January 23, 2006, 6:09:15 PM, you wrote:
CK> Using -A400m I get 39s down from 55s. That is the best Data.HashTable time
I
CK> have seen. (Using -A10m and -A100m were a little slower).
1) "-A400m" is a bit unusual. "-H400m" for 500-meg machine, "-H800m"
for 1g computer and
On 23 January 2006 15:09, Chris Kuklewicz wrote:
> That is good to hear. The benchmark's tests take 1,250,000
> pre-generated
> strings as the keys. At the end, the string keys are 18 characters
> long, drawn randomly from a set of 4 characters. So the hash
> computations are a nontrivial hit.
Simon Marlow wrote:
> Bulat Ziganshin wrote:
>> Hello Chris,
>>
>> Monday, January 23, 2006, 12:27:53 PM, you wrote:
>>
>> CK> The only mutable data structure that come with GHC besides arrays is
>> CK> Data.Hashtable, which is not comptetitive with OCaml Hashtbl or DMD's
>> CK> associative arrays
Bulat Ziganshin wrote:
Hello Chris,
Monday, January 23, 2006, 12:27:53 PM, you wrote:
CK> The only mutable data structure that come with GHC besides arrays is
CK> Data.Hashtable, which is not comptetitive with OCaml Hashtbl or DMD's
CK> associative arrays (unless there is something great hidden
17 matches
Mail list logo
