Quote Originally Posted by Jacka View Post
It's actually a HP Microserver.
Currently have 2x2TB and 2x1TB HDDs in it, but using 3130GB of the ~5500GB.

Just started this:
Code:
Constant :  Pi
Algorithm:  Chudnovsky Formula

Decimal Digits    :   250,000,000,000
Hexadecimal Digits:   207,620,505,931

Threads:    2
Mode   :    Advanced Swap  ( Disks = 1 )

Start Time: Wed Nov 09 16:55:49 2011


Allocating and Reserving Memory...      4.00 GB
Constructing FFT lookup tables...
Setting Permissions for File Allocation...


Begin Computation:

Summing Series:  17,628,417,340 terms
Summing...  0%
Woah... Can't imagine how long that will take. How are the 4 hard drives combined? Some sort of raid0 or spanning?

Quote Originally Posted by freeloader View Post
Bulldozer 4.3Ghz


Code:
Validation Version:    1.1

Program:               y-cruncher - Gamma to the eXtReMe!!!     ( www.numberworld.org )
                       Copyright 2008-2011 Alexander J. Yee    ( a-yee@u.northwestern.edu )


User:                  None Specified - You can edit this in "Username.txt".


Processor(s):          AMD FX(tm)-8120 Eight-Core Processor 
Logical Cores:         8
Physical Memory:       8,539,910,144 bytes  ( 8.00 GB )
CPU Frequency:         4,314,592,223 Hz

Program Version:       0.5.5 Build 9180 (fix 2) (x64 AVX - Windows ~ Hina)
Constant:              Pi
Algorithm:             Chudnovsky Formula
Decimal Digits:        1,000,000,000
Hexadecimal Digits:    Disabled
Threading Mode:        8 threads
Computation Mode:      Ram Only
Swap Disks:            0
Working Memory:        4.75 GB

Start Date:            Wed Nov 09 12:56:06 2011
End Date:              Wed Nov 09 13:03:58 2011

Computation Time:      453.098 seconds
Total Time:            471.971 seconds

CPU Utilization:           768.46 %
Multi-core Efficiency:     96.05 %

Last Digits:
6434543524 2766553567 4357021939 6394581990 5483278746  :  999,999,950
7139868209 3196353628 2046127557 1517139511 5275045519  :  1,000,000,000

Timer Sanity Check:        Passed
Frequency Sanity Check:    Passed
ECC Recovered Errors:      0
Checkpoint From:           None

----

Checksum:   b649ebc604ab20d70692927fb0a4ea2f70e81b9112b5ed310d3fd570c7c156f2
Nice! I think that's the first non ES Bulldozer result I've seen so far.

Quote Originally Posted by Krazeyivan View Post
I'm wondering whats the absolute bottom rung processor that you could use? And what program version would be best?

Is it technically feasible for a 486DX2 to run? How about a pentium 75?

Great work by the way
The oldest machine I've seen run this is a dual-socket Pentium Pro. I think the minimum OS requirement is Windows XP. So if a 486 can't run Windows XP, it probably don't be able to run the program. You'll also need at least 100mb of ram to do anything meaningful.

The next version of y-cruncher will has SSE3 as a minimum requirement, so that will push the minimum requirement to the later Pentium 4's.

It wasn't an easy decision to make: The 32-bit binaries rely on about 20,000 lines of older code that the 64-bit binaries don't use. However, this older code is incompatible with all the new code in v0.6.x. When I tried force compiling the 64-bit code on x86, the x86 SSE3 binary turned out to be the same speed, but the x86 no-SSE binary ended up being 20% slower (because the x87 FPU stack sucks*).

So I decided to just drop x86 no-SSE completely for v0.6.x. (which also allows me to cut out those 20,000 lines)

*It takes a very special kind of hand-tuning to make the x87 FPU efficient. These tricks tend to clash with the tricks that are used to make SSE efficient. So no more x87 FPU. I'm getting rid of those 20,000 lines and making SSE3 the minimum requirement.