Back to the main page

Mailing List Logs for ShadowRN

Message no. 1
From: "Robert A. Hayden" <hayden@*******.MANKATO.MSUS.EDU>
Subject: How to waste time
Date: Wed, 16 Feb 1994 16:33:29 -0600
How to waste CPU time?
I have a program that will calculate pi to an infitesimal number of places.

Run it.

Annoy admin. :-)

____ Robert A. Hayden <=> hayden@*******.mankato.msus.edu
\ /__ -=-=-=-=- <=> -=-=-=-=-
\/ / Finger for Geek Code Info <=> In the United States, they
\/ Finger for PGP 2.3a Public Key <=> first came for us in Colorado...
-=-=-=-=-=-=-=-
(GEEK CODE 1.0.1) GAT d- -p+(---) c++(++++) l++ u++ e+/* m++(*)@ s-/++
n-(---) h+(*) f+ g+ w++ t++ r++ y+(*)
Message no. 2
From: Loki <jek5313@******.TAMU.EDU>
Subject: Re: How to waste time
Date: Thu, 17 Feb 1994 21:05:13 -0600
Re: Rob Hayden;
>
> How to waste CPU time?
> I have a program that will calculate pi to an infitesimal number of places.

I doubt it. Firstly, you mean "infinite", not "infinitesimal." If
you want
infinitesimal, try 22/7.

Secondly, the current record is held by a pair of brothers who built the
equivalent of a Cray YMP in their apartment through mail order catalogs, and
was calculated out to 40 billion decimal places. So far, that is as exact as
they have designed algorithms for.

Outside of that, I'd love to see a copy.


--

Dark Thought Publications & Doom Technologies, Inc.
>>> Working on solutions best left in the dark.
Message no. 3
From: Gian-Paolo Musumeci <musumeci@***.LIS.UIUC.EDU>
Subject: Re: How to waste time
Date: Fri, 18 Feb 1994 08:02:04 -0600
I would like directions on how to built that sort of a computer, please. I
could use a Cray YMP equivalent. =) In fact, I need it to run certain programs
but I shan't elaborate on their purpose in this forum.
Message no. 4
From: "Robert A. Hayden" <hayden@*******.MANKATO.MSUS.EDU>
Subject: Re: How to waste time
Date: Fri, 18 Feb 1994 22:29:00 -0600
On Thu, 17 Feb 1994, Loki wrote:

> I doubt it. Firstly, you mean "infinite", not "infinitesimal."
If you want
> infinitesimal, try 22/7.

Oh hush

> Secondly, the current record is held by a pair of brothers who built the
> equivalent of a Cray YMP in their apartment through mail order catalogs, and
> was calculated out to 40 billion decimal places. So far, that is as exact as
> they have designed algorithms for.

Hmm, I went to 100,000 last night. it's not 40 billion, but It was a
geeky thing to to.

> Outside of that, I'd love to see a copy.

Of what?

____ Robert A. Hayden <=> hayden@*******.mankato.msus.edu
\ /__ -=-=-=-=- <=> -=-=-=-=-
\/ / Finger for Geek Code Info <=> In the United States, they
\/ Finger for PGP 2.3a Public Key <=> first came for us in Colorado...
-=-=-=-=-=-=-=-
(GEEK CODE 1.0.1) GAT d- -p+(---) c++(++++) l++ u++ e+/* m++(*)@ s-/++
n-(---) h+(*) f+ g+ w++ t++ r++ y+(*)
Message no. 5
From: Loki <jek5313@******.TAMU.EDU>
Subject: Re: How to waste time
Date: Sat, 19 Feb 1994 20:51:50 -0600
Hayden:
-->
--> Oh hush
-->

Yes massa. Right away massa. Whatever you say, massa.

-->
--> > Outside of that, I'd love to see a copy.
-->
--> Of what?
-->


Please note the context. A copy of the program. Whaddya think?!



--

Dark Thought Publications & Doom Technologies, Inc.
>>> Working on solutions best left in the dark.
Message no. 6
From: "Robert A. Hayden" <hayden@*******.MANKATO.MSUS.EDU>
Subject: Re: How to waste time
Date: Sun, 20 Feb 1994 00:37:14 -0600
/* "pi.c", program for computing digits of numerical value of PI.
Copyright (C) 1991 Aubrey Jaffer.
See the file "COPYING" for terms applying to this program.

(pi <n> <d>) prints out <n> digits of pi in groups of <d> digits.

'Spigot' algorithm origionally due to Stanly Rabinowitz.
This algorithm takes time proportional to the square of <n>/<d>.
This fact can make comparisons of computational speed between systems
of vastly differring performances quicker and more accurate.

Try (pi 100 5)
The digit size <d> will have to be reduced for larger <n> or an
overflow error will occur. */

short *calloc();
main(c,v)
int c;char **v;{
int n 0,j=0,m,b=2,k=0,t,r=1,d=5;
long q;
short *a;
if(c>1)n=atoi(v[1]);
if(c>2)d=atoi(v[2]);
while(k++<d)r=r*10;
n=n/d+1;
k=m=3.322*n*d;
aÊlloc(1+m,2);
while(k)a[--k]=2;
for(a[m]=4;j<n;b=q%r){
q=0;
for(k=m;k;){
q+=a[k]*r;
t=(2*k+1);
a[k]=q%t;
q=q/t;
q*=k--;}
printf("%0*d%s",d,b+q/r,++j%10?" ":"\n");}
puts("");}


____ Robert A. Hayden <=> hayden@*******.mankato.msus.edu
\ /__ -=-=-=-=- <=> -=-=-=-=-
\/ / Finger for Geek Code Info <=> In the United States, they
\/ Finger for PGP 2.3a Public Key <=> first came for us in Colorado...
-=-=-=-=-=-=-=-
(GEEK CODE 1.0.1) GAT d- -p+(---) c++(++++) l++ u++ e+/* m++(*)@ s-/++
n-(---) h+(*) f+ g+ w++ t++ r++ y+(*)
Message no. 7
From: "J.D. Falk" <jdfalk@****.COM>
Subject: Re: How to waste time
Date: Mon, 21 Feb 1994 16:08:07 -0500
Rob sent me a copy privately a week or so ago, and I compiled it
and tried it out -- works great. It takes exponentially longer the more
digits you want, though (which makes sense, really), so that on this
system at 2 AM with only me and an idle sysadmin logged in, it took about
10-15 seconds to write a file with 1,000 places, and closer to a minute
for 2,000.
Message no. 8
From: "Robert A. Hayden" <hayden@*******.MANKATO.MSUS.EDU>
Subject: Re: How to waste time
Date: Mon, 21 Feb 1994 15:26:08 -0600
On Mon, 21 Feb 1994, J.D. Falk wrote:

> Rob sent me a copy privately a week or so ago, and I compiled it
> and tried it out -- works great. It takes exponentially longer the more
> digits you want, though (which makes sense, really), so that on this
> system at 2 AM with only me and an idle sysadmin logged in, it took about
> 10-15 seconds to write a file with 1,000 places, and closer to a minute
> for 2,000.

I ran one out to 200,000 places this weekend on Krypton. It took
something like 38 hours. Of course, the process was niced and others had
priority.

On my Linux workstation, 100,000 places took about 28 hours.

____ Robert A. Hayden <=> hayden@*******.mankato.msus.edu
\ /__ -=-=-=-=- <=> -=-=-=-=-
\/ / Finger for Geek Code Info <=> In the United States, they
\/ Finger for PGP 2.3a Public Key <=> first came for us in Colorado...
-=-=-=-=-=-=-=-
(GEEK CODE 1.0.1) GAT d- -p+(---) c++(++++) l++ u++ e+/* m++(*)@ s-/++
n-(---) h+(*) f+ g+ w++ t++ r++ y+(*)
Message no. 9
From: Gian-Paolo Musumeci <musumeci@***.LIS.UIUC.EDU>
Subject: Re: How to waste time
Date: Mon, 21 Feb 1994 18:20:27 -0600
If anyone's interested, I've got some (okay, a hell of a lot) of time on a
Cray C90. Send me a copy of the program, I'll run it on The Big Boy.

*cackle*
--------------- ----------------
Gian-Paolo Musumeci [caris9-4@****.edu]
Supercomputing Applications

Further Reading

If you enjoyed reading about How to waste time, you may also be interested in:

Disclaimer

These messages were posted a long time ago on a mailing list far, far away. The copyright to their contents probably lies with the original authors of the individual messages, but since they were published in an electronic forum that anyone could subscribe to, and the logs were available to subscribers and most likely non-subscribers as well, it's felt that re-publishing them here is a kind of public service.

Thwap!