Add to ORKGWe 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
This article describes the design rationale, a C implementation, and conformance testing of a subset...
We begin by using a software metric tool to generate a number of software complexity measures and we...
A current trend in high-performance computing is to decompose a large linear algebra problem into ba...
We look at how both logical restructuring and improvements available from successive versions of For...
We look at how both logical restructuring and improvements available from successive versions of For...
We look at how both logical restructuring and improvements available from successive versions of For...
We look at how both logical restructuring and improvements available from successive versions of For...
We use knot count and path count metrics to identify which routines in the Level 1 basic linear alge...
First we report on a correction and improvement to the Level 1 Blas routine srotmg for computing the...
We use knot count and path count metrics to identify which routines in the Level 1 BLAS might benefi...
First we report on a orre tion and improvement to the Level 1 Blas routine srotmg for omputing the...
We propose a set of new Fortran reference implementations, based on an algorithm proposed by Kahan, ...
This article describes the design rationale, a C implementation, and conformance testing of a subse...
A common feature of many scalable parallel machines is non-uniform memory access - a processor can ...
The Fortran--90 standard requires an intrinsic function matmul which multiplies two matrices togethe...
This article describes the design rationale, a C implementation, and conformance testing of a subset...
We begin by using a software metric tool to generate a number of software complexity measures and we...
A current trend in high-performance computing is to decompose a large linear algebra problem into ba...
We look at how both logical restructuring and improvements available from successive versions of For...
We look at how both logical restructuring and improvements available from successive versions of For...
We look at how both logical restructuring and improvements available from successive versions of For...
We look at how both logical restructuring and improvements available from successive versions of For...
We use knot count and path count metrics to identify which routines in the Level 1 basic linear alge...
First we report on a correction and improvement to the Level 1 Blas routine srotmg for computing the...
We use knot count and path count metrics to identify which routines in the Level 1 BLAS might benefi...
First we report on a orre tion and improvement to the Level 1 Blas routine srotmg for omputing the...
We propose a set of new Fortran reference implementations, based on an algorithm proposed by Kahan, ...
This article describes the design rationale, a C implementation, and conformance testing of a subse...
A common feature of many scalable parallel machines is non-uniform memory access - a processor can ...
The Fortran--90 standard requires an intrinsic function matmul which multiplies two matrices togethe...
This article describes the design rationale, a C implementation, and conformance testing of a subset...
We begin by using a software metric tool to generate a number of software complexity measures and we...
A current trend in high-performance computing is to decompose a large linear algebra problem into ba...