Go Back   hwbot.org > Overclocking & benchmarking > Benchmark software

Benchmark software Discuss benchmarking software.

Reply
Thread Tools
  #11  
Unread 05-09-2009, 00:35
allegratorial allegratorial is offline
maintenance bot
 
Join Date: Jan 2009
Location: UNITED STATES
Posts: 15
Default

iknowbetter
Posts: 1

Funny. Looks like someone was bold enough to create the account just to make that post.
__________________
Reply With Quote
  #12  
Unread 05-09-2009, 18:31
knopflerbruce knopflerbruce is offline
Killed by Chuck Norris
 
Join Date: Mar 2007
Location: Oslo, Norway
Posts: 3,904
Default

What would be nice to have is a program that would work this way: rank based on number of pi digits computed in (fixed time) seconds. That one would last "forever", since the score would increse with time, not approach zero, as we see with superpi 1m, and especially wprime32m. No idea if that's doable with this app, though...
__________________
Reply With Quote
  #13  
Unread 05-09-2009, 22:21
allegratorial allegratorial is offline
maintenance bot
 
Join Date: Jan 2009
Location: UNITED STATES
Posts: 15
Default

I like that idea. makes it more like 3DMark.

It probably isn't doable directly, but it something more like a binary search sort might work to find the largest computation that can be done in say xx minutes.

I'll ask author about this to see if he is interested.

One problem I can forsee right off the bat is that faster computers might not have enough ram to do it.
Suppose the benchmark is to find the largest computation that can be done in xx minutes, there will be a problem if the largest computation that will fit into ram is shorter than that.
__________________
Reply With Quote
  #14  
Unread 05-09-2009, 22:46
knopflerbruce knopflerbruce is offline
Killed by Chuck Norris
 
Join Date: Mar 2007
Location: Oslo, Norway
Posts: 3,904
Default

Quote:
Originally Posted by allegratorial View Post
I like that idea. makes it more like 3DMark.

It probably isn't doable directly, but it something more like a binary search sort might work to find the largest computation that can be done in say xx minutes.

I'll ask author about this to see if he is interested.

One problem I can forsee right off the bat is that faster computers might not have enough ram to do it.
Suppose the benchmark is to find the largest computation that can be done in xx minutes, there will be a problem if the largest computation that will fit into ram is shorter than that.
But I guess it's not the intention that all tests on HWBot can be run on any CPU back to 486's, so as long as it won't need more than 4GB I think it's ok.
__________________
Reply With Quote
  #15  
Unread 05-11-2009, 16:35
allegratorial allegratorial is offline
maintenance bot
 
Join Date: Jan 2009
Location: UNITED STATES
Posts: 15
Default

Here's the relevant part of his response.
(I've re-worded a few things to fill in the context.)

Quote:
It's an interesting idea, but it deviates too far from the original goals as a research project:

1. Break [a few world records] and provide some more numerical evidence on the irrationality of [Catalan's Constant] and [Euler's Constant].

2. Show that high-precision arithmetic can be efficiently paralleled.

3. Make a decent multi-threaded Pi-program.
Quote:
As for the memory problem... lol... I would say it'd be pretty bad. The longest thing I can fit comfortably under 6GB of ram takes like ~12 minutes on [dual X5482]...

I can't expect everyone to have more than 6GB right now since few people will overkill on ram.

So I guess that's a no.
__________________
Reply With Quote
Reply


Thread Tools

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Forum Jump


All times are GMT +1. The time now is 13:56.


Powered by vBulletin® Version 3.7.1
Copyright ©2000 - 2013, Jelsoft Enterprises Ltd.
Copyright COLARDYN IT GCV 2004 - 2013