By Topic

Measurements of parallelism in ordinary FORTRAN programs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

10 Author(s)
Kuck, David J ; Department of Computer Science University of Illinois ; Budnik, Paul P. ; Chen, Shyh-Ching ; Lawrie, Duncan H.
more authors

In the folklore of computer architecture there has been much speculation about the effectiveness of various machines in performing various computations. While it is easy to design a machine (or part of a machine) and study its effectiveness on this algorithm or that, it is rather difficult to make general effectiveness statements about classes of algorithms and machines. We are attempting to move in this direction, and this paper contains experimental measurements of a rather wide class of algorithms. Such measurements should be helpful in establishing some parameters of machine organization.

Published in:

Computer  (Volume:7 ,  Issue: 1 )