|
|
|
#11
|
|||
|
|||
|
iknowbetter
Posts: 1 Funny. Looks like someone was bold enough to create the account just to make that post. |
|
#12
|
|||
|
|||
|
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...
|
|
#13
|
|||
|
|||
|
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. |
|
#14
|
|||
|
|||
|
Quote:
|
|
#15
|
|||
|
|||
|
Here's the relevant part of his response.
(I've re-worded a few things to fill in the context.) Quote:
Quote:
So I guess that's a no. |
![]() |
| Thread Tools | |
|
|