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
A common feature of many scalable parallel machines is non-uniform memory access - a processor can ...
This working note examines different Fortran implementations of the Basic Linear Algebra Subprograms...
<p>The BLAS library is one of the central libraries for the implementation of numerical algorithms. ...
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 BLAS might benefi...
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 basic linear alge...
First we report on a orre tion and improvement to the Level 1 Blas routine srotmg for omputing the...
International audienceNumerical reproducibility failures appear in massively par-allel floating-poin...
this paper we describe a strategy that will make it possible, after applying a small number of chang...
This article describes the design rationale, a C implementation, and conformance testing of a subse...
The Fortran--90 standard requires an intrinsic function matmul which multiplies two matrices togethe...
Successful languages like Fortran keep changing and tend to become more complex, often containing ol...
A common feature of many scalable parallel machines is non-uniform memory access - a processor can ...
This working note examines different Fortran implementations of the Basic Linear Algebra Subprograms...
<p>The BLAS library is one of the central libraries for the implementation of numerical algorithms. ...
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 BLAS might benefi...
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 basic linear alge...
First we report on a orre tion and improvement to the Level 1 Blas routine srotmg for omputing the...
International audienceNumerical reproducibility failures appear in massively par-allel floating-poin...
this paper we describe a strategy that will make it possible, after applying a small number of chang...
This article describes the design rationale, a C implementation, and conformance testing of a subse...
The Fortran--90 standard requires an intrinsic function matmul which multiplies two matrices togethe...
Successful languages like Fortran keep changing and tend to become more complex, often containing ol...
A common feature of many scalable parallel machines is non-uniform memory access - a processor can ...
This working note examines different Fortran implementations of the Basic Linear Algebra Subprograms...
<p>The BLAS library is one of the central libraries for the implementation of numerical algorithms. ...