Storage Forums: SR's D2OL Metacomputing Team - Storage Forums

Jump to content

Advertisement

  • (45 Pages)
  • +
  • « First
  • 22
  • 23
  • 24
  • 25
  • 26
  • Last »
  • You cannot start a new topic
  • You cannot reply to this topic

SR's D2OL Metacomputing Team permanent 'bumping' thread

#231 User is offline   Sling Icon

  • Member
  • Group: Member
  • Posts: 34
  • Joined: 13-October 02

Posted 17 November 2003 - 10:15 AM

16th Place in the All Time stats! Man, we are good!

#232 User is offline   CopyMaster Icon

  • Member
  • Group: Member
  • Posts: 132
  • Joined: 27-March 02

Posted 17 November 2003 - 11:24 AM

TFY looks pretty good in the daily stats. Right now they're 379 Candidates ahead with DPC between them and us.

#233 User is offline   CopyMaster Icon

  • Member
  • Group: Member
  • Posts: 132
  • Joined: 27-March 02

Posted 17 November 2003 - 11:25 AM

Of course, with "good" I mean "bad"... ;)

#234 User is offline   YK Icon

  • Group: Patron
  • Posts: 109
  • Joined: 29-December 01

Posted 17 November 2003 - 12:01 PM

Sling, on Nov 17 2003, 10:15 AM, said:

16th Place in the All Time stats!  Man, we are good!

It's especially amazing considering we have only been doing it a few weeks, where other teams have been registered for over two years.

#235 User is offline   Bob_D. Icon

  • Member
  • Group: Member
  • Posts: 128
  • Joined: 07-January 02

Posted 18 November 2003 - 12:04 AM

Just dumped 309 candidates from my 3 Borg'ed computers to add to my normal ~150 per day. Kept us within 400 of the Yogurt team which has really been crunching a lot recently.

Bob

#236 User is offline   Sivar Icon

  • Moderator
  • Group: Member
  • Posts: 3,452
  • Joined: 03-January 02

Posted 18 November 2003 - 12:39 AM

Screwdriver, on Nov 12 2003, 05:42 PM, said:

void main () {
  long NbDigits=10000, size=1+NbDigits/LB;
  long *r2 = (long *)malloc(size*sizeof(long));
  long *uk = (long *)malloc(size*sizeof(long));
  long k=1;
    SetToInteger (size, r2, 1); /* r2 = 1 */
  SetToInteger (size, uk, 1);	/* uk = 1 */
  while (!IsZero(size, uk)) {
    Div (size, uk, 57122); /* uk = u(k-1)/57122 * (2k-1)/(2k) */
    Div (size, uk, 2*k);  
    Mul (size, uk, 2*k-1);  
    Add (size, r2, uk);    /* r2 = r2+uk */
    k++;
  }
  Mul (size, r2, 239);  
  Div (size, r2, 169);  /* r2 = (239/169)*r2 */
  Print (size, r2);     /* Print out of sqrt(2) */
  free (r2);
  free (uk);

float sqrt(float x)
{
    float xh = 0.5f * x;
    int i = *(int*) &x;
    i = 0x5f3759df - (i >> 1);
    x = *(float*) &i;
    x = x * (1.5f - xh * x * x);
    return 1/x;  /* Return square root */
}

"No matter how far you've gone down the wrong road, TURN BACK."

#237 User is offline   Sivar Icon

  • Moderator
  • Group: Member
  • Posts: 3,452
  • Joined: 03-January 02

Posted 18 November 2003 - 12:40 AM

Oops, d2ol hasn't been running on my desktop for 2 days. :blink:
"No matter how far you've gone down the wrong road, TURN BACK."

#238 User is offline   ekhoo Icon

  • Member
  • Group: Member
  • Posts: 43
  • Joined: 06-January 02

Posted 19 November 2003 - 04:32 AM

Anyone know how to re-use a Node Id. My notebook hard drive decided to go with the click of death (It's a travelstar). And nope, I didn't back up D2OL's directory :(

Otherwise I'll end up with more nodes than real active nodes....

#239 User is offline   Clocker Icon

  • Group: Patron
  • Posts: 568
  • Joined: 29-December 01

Posted 19 November 2003 - 06:39 AM

ekhoo, on Nov 19 2003, 04:32 AM, said:

Anyone know how to re-use a Node Id. My notebook hard drive decided to go with the click of death (It's a travelstar). And nope, I didn't back up D2OL's directory  :(

Otherwise I'll end up with more nodes than real active nodes....

Not possible if you didn't do this:
http://forums.storag...topic=12423&hl=

C

#240 User is offline   Screwdriver Icon

  • Member
  • Group: Member
  • Posts: 401
  • Joined: 04-January 02

Posted 19 November 2003 - 01:34 PM

Sivar, on Nov 17 2003, 09:39 PM, said:

float sqrt(float x)
{
    float xh = 0.5f * x;
    int i = *(int*) &x;
    i = 0x5f3759df - (i >> 1);
    x = *(float*) &i;
    x = x * (1.5f - xh * x * x);
    return 1/x;  /* Return square root */
}

Nice code, looks much more efficient than the stuff I copied and pasted :)

Losing time does suck. Watch out people, Im catchin up ;)

  • (45 Pages)
  • +
  • « First
  • 22
  • 23
  • 24
  • 25
  • 26
  • Last »
  • You cannot start a new topic
  • You cannot reply to this topic

1 User(s) are reading this topic
0 members, 1 guests, 0 anonymous users