DoubleMark (Prime Benchmark) - Open Source - Page 4 - Overclock.net

JoBlo69 · 02-12-08

Quote:

So you know i am pretty sure the issue lies somehow within the code utilizing Kernel32.DLL.

I think the code it self is fine, more or less guessing atm. Mainly because i see some strange calls being made from some functions that look odd. Maybe it's just part of C#. I'm not all that familiar with C#. I focus a lot of my time in C++, so there are some syntax issues that I'm not sure about yet...

I think im going to read up on this a little more before i start changing a whole lot...

Licht · 02-12-08

Quote:

Originally Posted by JoBlo69

I think the code it self is fine, more or less guessing atm. Mainly because i see some strange calls being made from some functions that look odd. Maybe it's just part of C#. I'm not all that familiar with C#. I focus a lot of my time in C++, so there are some syntax issues that I'm not sure about yet...

I think im going to read up on this a little more before i start changing a whole lot...

Like i said i'm a noob, have mercy.

michinmuri · 02-18-08

Quote:

Originally Posted by Kamakazi

1st of all this is cool.

Second of all, where do I get the rad megaman background?

I second your second, and also think that dskina needs to inform us where he got his.

killnine · 02-18-08

Quote:

Originally Posted by Licht

It is impossible on Windows to measure a length of time more precise then this

What? I dont think so. I use a multimedia timer that is much, much MUCH more accurate than this.

http://www.codeproject.com/KB/miscct...ediatimer.aspx

This is accurate down to single milliseconds.

Licht · 02-18-08

Quote:

Originally Posted by killnine

What? I dont think so. I use a multimedia timer that is much, much MUCH more accurate than this.

http://www.codeproject.com/KB/miscct...ediatimer.aspx

This is accurate down to single milliseconds.

The current time returned by DateTime.Now.Millisecond is accurate only to 10ms. I don't know if they are using a different methode of obtaining the start and end times or not but i know that that is only so accurate.

killnine · 02-19-08

It is a custom library that uses a faster timer than DateTime. I would highly recommend it.

I work for a company that needs single-millisecond resolution and this works fine.

For your purposes, it is much better than DateTime calls.

I am going to take a look at your code and see what I can do. I have only been doing C# for about a year but since I pretty much do it 8 hours a day, I am getting much better.

Licht · 02-19-08

Quote:

Originally Posted by killnine

It is a custom library that uses a faster timer than DateTime. I would highly recommend it.

I work for a company that needs single-millisecond resolution and this works fine.

For your purposes, it is much better than DateTime calls.

I am going to take a look at your code and see what I can do. I have only been doing C# for about a year but since I pretty much do it 8 hours a day, I am getting much better.

Only a year?

I've only been going... 2 months? I think.

Licht · 02-25-08

If anyone is still interested in the project, i've started from scratch. I'm gonna have the multi-threading problem fixed totally and completely as well as completely changing the shape of the application. I think anyone who is interested will be exstatic at next release. I'm quite confident in getting support once its ready.

shinya · 02-26-08

I dunno what algorithms you're using to check primality (i didn't see the code), but a lot of research has been done on such stuff.

Since your objective is stressing the system for benchmarking purposes, maybe you've no actual interest in efficiency - which eventually add complexity. But maybe you might wanna consider some cleaver stuff for future releases.

The "standard" algorithm to find prime numbers from 2 up to N is called Sieve of Eratosthenes. http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
It's easy to implement with a single core, but i have no idea how to adapt it for multiple cores! It sounds hard!

Other than that, you might be aware of the mersenne prime search http://www.mersenne.org (which found only mersenne primes, which is a prime in the form 2^p - 1, where p is a prime number), and the math behind it http://www.mersenne.org/math.htm

Hope it helps! Happy coding!

rabidgnome229 · 02-26-08

Quote:

Originally Posted by Licht

If anyone is still interested in the project, i've started from scratch. I'm gonna have the multi-threading problem fixed totally and completely as well as completely changing the shape of the application. I think anyone who is interested will be exstatic at next release. I'm quite confident in getting support once its ready.

What kind of help do you need? I'm in a class now that's entirely about the line between hardware and software, and I would be very interested in applying what I'm learning

		Overclock.net - Overclocking.net > Software, Programming and Coding > Coding and Programming
DoubleMark (Prime Benchmark) - Open Source

02-26-08	#39 (permalink)
shinya New to Overclock.net Join Date: Aug 2007 Posts: 8 Rep: 3 Unique Rep: 3 Trader Rating: 0	I dunno what algorithms you're using to check primality (i didn't see the code), but a lot of research has been done on such stuff. Since your objective is stressing the system for benchmarking purposes, maybe you've no actual interest in efficiency - which eventually add complexity. But maybe you might wanna consider some cleaver stuff for future releases. The "standard" algorithm to find prime numbers from 2 up to N is called Sieve of Eratosthenes. http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes It's easy to implement with a single core, but i have no idea how to adapt it for multiple cores! It sounds hard! Other than that, you might be aware of the mersenne prime search http://www.mersenne.org (which found only mersenne primes, which is a prime in the form 2^p - 1, where p is a prime number), and the math behind it http://www.mersenne.org/math.htm Hope it helps! Happy coding!

Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)