Sparse Subroutines on Demand (updated version) (A.Bik)
9 Aug 1996 14:12:25 -0400

          From comp.compilers

Related articles
Sparse Subroutines on Demand (updated version) (1996-08-09)
| List of all articles for this month |

From: (A.Bik)
Newsgroups: comp.compilers
Date: 9 Aug 1996 14:12:25 -0400
Organization: Mathematics & Computer Science, Leiden University, Leiden, the Netherlands
Keywords: arithmetic, Fortran, available, WWW

Sparse Subroutine On Demand-service
The Computer and Software Systems group of the Department of Computer Science
at Leiden University proudly presents a WWW service.

Developing, optimizing, and maintaining sparse software by hand
is an error-prone and complex task. In an attempt to resolve
these problems, the group at Leiden uses an alternative approach
to the development of sparse software. Rather than dealing with
the sparsity of matrices at programming level, the sparsity is dealt with
at compilation level. A special kind of restructuring compiler,
referred to as a sparse compiler, automatically transforms a dense
program into efficient sparse code that operates on sparse storage schemes.

This experimental service provides you with an interface to our
FORTRAN `sparse' compiler and allows you to obtain sparse versions of
Level 2 BLAS and Level 3 BLAS subroutines. The compiler transforms
the program into a sparse version which is then sent back to you.

The Subroutine On Demand-service can be accessed through the following URL:

With respect to the first announcement of this service, we have
enabled the automatic generation of `from-file' initialization
routines that make it more easy to test the generated program.

We hope to welcome you to our service,

Best regards,

Aart J.C. Bik
Peter J.H. Brinkhaus
Peter M.W. Knijnenburg
Harry A.G. Wijshoff

Aart J.C. Bik (Post-Doc)
Department of Computer Science, Leiden University
PO Box 9512, 2300 RA LEIDEN The Netherlands

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.