This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Measurements of parallelism in ordinary FORTRAN programs
Jan. 1974 (vol. 7 no. 1)
pp. 37-46
David J Kuck, Department of Computer Science University of Illinois
Paul P. Budnik, Department of Computer Science University of Illinois
Shyh-Ching Chen, Department of Computer Science University of Illinois
Duncan H. Lawrie, Department of Computer Science University of Illinois
Ross A. Towle, Department of Computer Science University of Illinois
Richard E. Strebendt, Department of Computer Science University of Illinois
Edward W. Davis, Goodyear Aerospace Corporation
Joseph Han, Chung Shan Institute of Science and Technology Hsien-Tien, Taipei, Taiwan
Paul W. Kraska, Control Data Corporation
Yoichi Muraoka, Nippon Telephone and Telegraph Corporation Tokyo, Japan
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.
Citation:
David J Kuck, Paul P. Budnik, Shyh-Ching Chen, Duncan H. Lawrie, Ross A. Towle, Richard E. Strebendt, Edward W. Davis, Joseph Han, Paul W. Kraska, Yoichi Muraoka, "Measurements of parallelism in ordinary FORTRAN programs," Computer, vol. 7, no. 1, pp. 37-46, Jan. 1974, doi:10.1109/MC.1974.6323440
Usage of this product signifies your acceptance of the Terms of Use.