Access Restriction

Author Gauss, E. J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1959
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract It is shown that for a given problem different machine organizations will vary in time of solution over a nine-fold range. This holds even if it is assumed that the machines used the same arithmetic section and the same memory. The comparison is made on the basis of a typical problem—in this case the Kaczmarz iteration. An efficiency number is developed giving the relative solution time required by each organization. When the efficiency number of a single address machine is taken to be 1.0, the following numbers are obtained: four address machine, 1.25; single address machine with index registers, 2.5; complex organization, 9.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1959-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 6
Issue Number 4
Page Count 10
Starting Page 476
Ending Page 485

Open content in new tab

   Open content in new tab
Source: ACM Digital Library