Restructuring the BLAS level 1 routine for computing the modified givens transformation

Authors:
Tim Hopkins
Affiliations:
Univ. of Kent, Canterbury, UK
Venue:
ACM SIGNUM Newsletter
Year:
1997

Citing 8
Cited 1

Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programs

ACM Transactions on Mathematical Software (TOMS)
NPATH: a measure of execution path complexity and its applications

Communications of the ACM
A critique of cyclomatic complexity as a software metric

Software Engineering Journal
Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs

ACM Transactions on Mathematical Software (TOMS)
Algorithm 653: Translation of algorithm 539: PC-BLAS, basic linear algebra subprograms for FORTRAN usage with the INTEL 8087, 80287 numeric data processor

ACM Transactions on Mathematical Software (TOMS)
Restructuring software: a case study

Software—Practice & Experience
Basic Linear Algebra Subprograms for Fortran Usage

ACM Transactions on Mathematical Software (TOMS)
An extension to the cyclomatic measure of program complexity

ACM SIGPLAN Notices

Algorithm 830: Another visit with standard and modified givens transformations and a remark on algorithm 539

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We look at how both logical restructuring and improvements available from successive versions of Fortran allow us to reduce the complexity (measured by a number of the commonly used software metrics) of the Level 1 BLAS code used to compute the modified Givens transformation. With these reductions in complexity we claim that we have improved both the maintainability and clarity of the code; in addition, we report a fix to a minor problem with the original code. The performance of two commercial Fortran restructuring tools is also reported.