flat assembler
Message board for the users of flat assembler.
Index
> Main > Permutation algo speed test |
Author |
|
madmatt 29 Oct 2006, 09:33
I get about 3390ms (Intel Celeron 2.7ghz, 1GB ram). Is this for a school project or something?
|
|||
29 Oct 2006, 09:33 |
|
LocoDelAssembly 29 Oct 2006, 15:51
3453 ms execution speed (AMD Athlon64 +3200 [2.0 GHz S939]).
|
|||
29 Oct 2006, 15:51 |
|
r22 29 Oct 2006, 19:03
madmatt, it's not for any project. Just an interesting algorithm I've been meaning to code up.
I'm thinking that permutations can be done in parallel with eachother. Using a multi-threaded approach, but despite the rather small and simplistic size to the algorithm analysis is somewhat complex. |
|||
29 Oct 2006, 19:03 |
|
rugxulo 29 Oct 2006, 19:51
P4 2.52Ghz 512 MB RAM
Quote:
|
|||
29 Oct 2006, 19:51 |
|
r22 29 Oct 2006, 22:19
Thanks for all the results.
Now some optimizations for the current algorithm or aa alternative algorithm to test would be interesting. |
|||
29 Oct 2006, 22:19 |
|
< Last Thread | Next Thread > |
Forum Rules:
|
Copyright © 1999-2024, Tomasz Grysztar. Also on GitHub, YouTube.
Website powered by rwasa.