Article View: comp.arch
Article #22373Re: 64-bit addresses
From: Wm E Davidsen Jr
Date: Mon, 12 Feb 1990 15:55
Date: Mon, 12 Feb 1990 15:55
13 lines
1183 bytes
1183 bytes
In article <10795@snow-white.udel.EDU> nelson@udel.edu (Mark Nelson) writes:
| Does anyone have an application which frequently multiplies 49-64
| bit integers? I'm not talking about indefinite precision arithmetic,
| but about numbers of exactly that many bits. Please let me know.
Well, yes, but I freely agree that the operation is some 55 bits x 4
bits or things like that, since the result doesn't overflow on a Cray. I
like the idea of using part of the FPU, but I am not sure the gates
saved would justify the complexity, or that gates would be saved at all.
--
bill davidsen (davidsen@crdos1.crd.GE.COM -or- uunet!crdgw1!crdos1!davidsen)
"Stupidity, like virtue, is its own reward" -me
Technical Details
Message-ID:
<2120@crdos1.crd.ge.COM>Path:
arc1-ca.pugleaf.net!utzoo!attcan!uunet!crdgw1!crdos1!davidsenReferences:
<9708@spool.cs.wisc.edu> <20270@cfctech.cfc.com> <11112@encore.Encore.COM> <10795@snow-white.udel.EDU>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!crdgw1!crdos1!davidsen From: davidsen@crdos1.crd.ge.COM (Wm E Davidsen Jr) Newsgroups: comp.arch Subject: Re: 64-bit addresses Message-ID: <2120@crdos1.crd.ge.COM> Date: 12 Feb 90 15:55:56 GMT References: <9708@spool.cs.wisc.edu> <20270@cfctech.cfc.com> <11112@encore.Encore.COM> <10795@snow-white.udel.EDU> Reply-To: davidsen@crdos1.crd.ge.com (bill davidsen) Organization: GE Corp R&D Center, Schenectady NY Lines: 13