Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site brl-vgr.ARPA
Path: utzoo!watmath!clyde!burl!ulysses!harpo!seismo!brl-tgr!brl-vgr!gwyn
From: gwyn@brl-vgr.ARPA (Doug Gwyn )
Newsgroups: net.unix-wizards
Subject: Re: IBM 1620 10000x10000 digit multiplication
Message-ID: <1347@brl-vgr.ARPA>
Date: Fri, 4-May-84 06:41:56 EDT
Article-I.D.: brl-vgr.1347
Posted: Fri May  4 06:41:56 1984
Date-Received: Sat, 5-May-84 01:21:29 EDT
References: <493@ihuxa.UUCP>
Organization: Ballistics Research Lab
Lines: 4

The 1620 instruction cycle time was on the order of 20us.  With
an order NlogN multiplication algorithm one could multiply two
(N=10000)-digit numbers in one second, barely.  (BCD arithmetic,
remember.)  The question is, how good was the 1620's algorithm?