I. DUFF, M.MORRONE, ANDG. RADICATI, A proposal for user level sparse BLAS, Tech. Report TR/PA/92/86, CERFACS, Nov. 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....numerically stable, i.e. floating point exceptions can be easily generated if the methods selected are unsuited for the problem. Any production library code must be able to trap any such error before it arises so that a meaningful error message is returned to the user. If the SPARSE BLAS proposal [3] is accepted, then NSPCG will need to be broken up into its component parts (if its code is to be used at all) At present, NSPCG is called with the preconditioner routine having a different name for each data format. The alternative that SPARSE BLAS opens up is to remove the need for the ....

I. S. Duff, M. Marrone, and G. Radicatti. A proposal for user level sparse blas. to appear, 1992.

....interfaces for these four operations are defined for a variety of common data structures and a set of guidelines is given to define interfaces for new data structures. The primary purpose of this toolkit is to provide a set of basic routines upon which the User Level Sparse BLAS, as described in [9], can be built. This paper is a revision of the original proposal found in [14] Keywords Sparse matrices, sparse data structures, programming standards, sparse BLAS. 1 Introduction Standard interfaces for numerical linear algebra software have been shown to be very useful if the interface is ....

....using a variety of common data structures. Some well known examples of this are SPARSKIT by Saad [18] and the Iterative BLAS of Oppe and Kincaid [17] The proposal described here is similar to the above two examples but is expressly developed to support the User Level Sparse BLAS proposed in [9]. Beyond this explicit relationship to the User Level Sparse BLAS, we want to emphasize that these kernels are generally useful for other high level interfaces. In particular, for object oriented interfaces such as those described in [20, 12, 15] the sparse BLAS toolkit routines can serve as ....

[Article contains additional citation context not shown here]

Iain Duff, Michele Marrone, and Giuseppe Radicati. A proposal for user level sparse BLAS. Technical Report TR/PA/92/85, CERFACS, December 1992.

.... and Technology Gaithersburg, Maryland 20899 August 1997 Abstract This paper describes the functionality and use of the NIST Fortran Sparse BLAS Library Reference Implementation, which provides computational support underlying the interfaces proprosed in Carney, et al. 2] and Duff, et al. [6]. The implementation provides routines for matrix matrix AXPY operations and the solution of sparse triangular systems for thirteen common sparse storage formats. The computational routines are written in Fortran, and the set of mid level Toolkit interfaces provided are callable from both ....

....(http: www.netlib.org utk papers blast forum.html) has provided an active interchange of ideas regarding the standardization of sparse and parallel BLAS. Though community consensus on interface specifics has certainly not been achieved, particularly for parallel BLAS, the User Level Sparse BLAS [6] and the Sparse BLAS Toolkit [2] provide coordinated proposals for two sparse BLAS interface layers, the former mimicking the dense BLAS interface and the latter providing a foundational layer of storage format specific interfaces. The NIST Fortran Sparse BLAS Library Reference Implementation ....

[Article contains additional citation context not shown here]

I. Duff, M. Marrone, and G. Radicati, A proposal for user level sparse blas, Tech. Report TR/PA/92/85, CERFACS, Toulouse, France, 1992.

....of the package and the calling sequences of each routine. In x4, we describe the algorithms implemented by the package. Finally, in x5 are instructions for getting a copy of the code. The routines described here di er from those in either SPARSKIT (see [9] or the proposed sparse BLAS (see [4] and [8] There is some overlap with SPARSKIT, but we are more interested in a data format not supported in SPARSKIT. The sparse BLAS have interfaces for multiplying a sparse matrix by a dense one, but not for multiplying two sparse matrices. Also, our routines are in the public domain with ....

I. Du, M. Marrone, and G. Radicati, A proposal for user level sparse BLAS, in preparation.

....functions will take the form of traditional Fortran and C style array loops. Classes at higher levels, e.g. the representation of a linear system, should then serve as administrators that delegate the actual work to lower level classes. This approach is essentially similar to the ideas of BLAS [1, 12]. In section 5 we provide specic performance numbers on the relative eOEciency of our implementations compared to Fortran and C code. The implementation of the prod functions in Figure 1 could also be accomplished by operator overloading where the multiplication operator is given a new ....

I. S. Duff, M. Marrone, and G. Radicati, A proposal for user level sparse BLAS, Technical Report TR/PA/92/85, CERFACS, Toulouse, France, 1992. (SPARKER Working Note # 1).

....National Laboratory z University of Tennessee Pi University of Notre Dame Mathematical Sciences Section Department of Computer Science Dept. of Computer Science Engineering Abstract We describe an object oriented sparse matrix library in C built upon the Level 3 Sparse BLAS proposal [5] for portability and performance across a wide class of machine architectures. The C library includes algorithms for various iterative methods and supports the most common sparse data storage formats used in practice. Besides simplifying the subroutine interface, the object oriented design ....

I. Duff, M. Marrone, G. Radicati, A Proposal for User Level Sparse BLAS, CERFACS Technical Report TR/PA/92/85, 1992.

....the form of traditional Fortran and C style array loops. Classes at higher levels, e.g. the representation of a linear system, should then serve as administrators that delegate the actual work to lower level classes. This approach is essentially similar to the ideas of BLAS [Anderson et al. 1992; Duff et al. 1992]. In section 5 we provide specific performance numbers on the relative efficiency of our implementations compared to Fortran and C code. The implementation of the prod functions in Figure 1 could also be accomplished by operator overloading where the multiplication operator is given a new ....

Duff, I. S., Marrone, M., and Radicati, G. 1992. A proposal for user level sparse BLAS. Technical Report TR/PA/92/85, CERFACS, Toulouse, France. (SPARKER Working Note # 1). Dyad Software. M++ Class Library. User's Guide. Dyad Software.

.... and Technology Gaithersburg, Maryland 20899 August 1997 Abstract This paper describes the functionality and use of the NIST Fortran Sparse BLAS Library Reference Implementation, which provides computational support underlying the interfaces proprosed in Carney, et al. 2] and Duff, et al. [6]. The implementation provides routines for matrix matrix AXPY operations and the solution of sparse triangular systems for thirteen common sparse storage formats. The computational routines are written in Fortran, and the set of mid level Toolkit interfaces provided are callable from both ....

....(http: www.netlib.org utk papers blast forum.html) has provided an active interchange of ideas regarding the standardization of sparse and parallel BLAS. Though community consensus on interface specifics has certainly not been achieved, particularly for parallel BLAS, the User Level Sparse BLAS [6] and the Sparse BLAS Toolkit [2] provide coordinated proposals for two sparse BLAS interface layers, the former mimicking the dense BLAS interface and the latter providing a foundational layer of storage format specific interfaces. The NIST Fortran Sparse BLAS Library Reference Implementation ....

[Article contains additional citation context not shown here]

I. Duff, M. Marrone, and G. Radicati, A proposal for user level sparse blas, Tech. Report TR/PA/92/85, CERFACS, Toulouse, France, 1992.

....sparse column (BSC) block coordinate (BCO) and variable block row (VBR) Symmetric and skew symmetric versions are also supported. The routines are written in ANSI C and are callable from Fortran and C through the interface proposed in the Sparse BLAS Toolkit[1] Also see the companion paper [2]. In addition to the Sparse BLAS Toolkit interface, developers have access to lightweight kernel routines. These Sparse BLAS Lite routines are unique to each parameter combination of the higher level Toolkit interface. The Lite routines are designed for minimal overhead; they have no case ....

....Scalar parameter double beta Scalar parameter int descra[ Descriptor argument. Nine element integer array: descra[0] matrix structure 0 : general 1 : symmetric 2 : Hermitian 3 : Triangular 4 : Skew(Anti) Symmetric 5 : Diagonal descra[1] upper lower triangular indicator 1 : lower 2 : upper descra[2] main diagonal type 0 : non unit 1 : unit descra[3] Array base 0 : C C compatible 1 : Fortran compatible descra[4] repeated indices (not currently supported) 0 : unknown 0.9 5 July dbcomm Sparse BLAS Toolkit Interface dbcomm 1 : no repeated indices double val scalar array of length nnz ....

[Article contains additional citation context not shown here]

I. Duff, M. Marrone, and G. Radicati, A proposal for user level sparse blas, Tech. Report TR/PA/92/85, CERFACS, 1992.

....in Figure 1. Here the operators such as and = have been overloaded to work with matrix and vectors formats. This code fragment works for all of the supported sparse storage classes and makes use of data and architecture specific computational kernels (such as the proposed Level 3 Sparse BLAS [4]) Various iterative methods, as described in Barrett et al. 1] have been incorporated into the design of IML , an Iterative Methods Library in C . The methods supported by the design of IML , together with their preconditioned counterparts, include: ffl Jacobi SOR (SOR) ffl Conjugate ....

I. Duff, M. Marrone, and G. Radicati. A proposal for user level sparse BLAS. Technical report, CERFACS TR/PA/92/85, 1992.

....interfaces for these four operations are defined for a variety of common data structures and a set of guidelines is given to define interfaces for new data structures. The primary purpose of this toolkit is to provide a set of basic routines upon which the User Level Sparse BLAS, as described in [9], can be built. This paper is a revision of the original proposal found in [12] Keywords Sparse matrices, sparse data structures, programming standards, sparse BLAS. 1 Introduction Standard interfaces for numerical linear algebra software have been shown to be very useful if the interface is ....

....using a variety of common data structures. Some well known examples of this are SPARSKIT by Saad [16] and the Iterative BLAS of Oppe and Kincaid [15] The proposal described here is similar to the above two examples but is expressly developed to support the User Level Sparse BLAS proposed in [9]. Beyond this explicit relationship to the User Level Sparse BLAS, we want to emphasize that these kernels are generally useful for other high level interfaces. In particular, for object oriented interfaces such as those described in [18, 10, 13] the sparse BLAS toolkit routines can serve as ....

[Article contains additional citation context not shown here]

Iain Duff, Michele Marrone, and Giuseppe Radicati. A proposal for user level sparse BLAS. Technical Report TR/PA/92/85, CERFACS, December 1992.

....a library would provide several default implementations. It has been our experience that the object oriented design makes this relatively easy to achieve. In Fig. 5 we give the calling sequence for a conjugate gradient algorithm contained in working notes for a proposed sparse BLAS standard [1]. Within the constraints of for (k=0; k maxit; k ) VDOT( vp, N, r, z, beta) beta r z c = beta betaold; betaold = beta; VAYPX(vp,N,c,z,p) p z c p MULT( itp, N, p, z ) z A p VDOT( vp, N, p, z, a ) a = beta a; a beta p z VAXPY( vp, N, a, p, u ) u ....

I. S. Duff, M. Marrone, and G. Radicati, A proposal for user level sparse BLAS, Tech. Rep. TR/PA/92/85, CERFACS, 1992. SPARKER Working note # 1.

....in which to use the libraries. With the first approach researchers are trying to make the libraries easier to use or to make the libraries more adaptable. For example, Gropp[13] designed a standard interface for subroutines and data structures. Reverse communication is being used by Duff and Heroux[8, 14] to allow subroutines to access user supplied data structures. Templates are being provide by Dongarra and others[3, 7] which allow programmers to write the subroutines for iterative methods using data structures supplied by the programmer. With the second approach, researchers are developing new ....

Duff, I. S., Marrone, M., and Radicati, G. A proposal for user level sparse BLAS. Tech. rep., CERFACS, November 1992.

....interfaces for these four operations are defined for a variety of common data structures and a set of guidelines is given to define interfaces for new data structures. The primary purpose of this toolkit is to provide a set of basic routines upon which the User Level Sparse BLAS, as described in [6], can be built. Keywords Sparse matrices, sparse data structures, programming standards, sparse BLAS. 1 Introduction Standard interfaces for numerical linear algebra software have been shown to be very useful if the interface is simple yet flexible enough for a wide variety of users. Examples ....

....using a variety of common data structures. Some well known examples of this are SPARSKIT by Saad [10] and the Iterative BLAS of Oppe and Kincaid [9] The proposal described here is similar to the above two examples but is expressly developed to support the User Level Sparse BLAS proposed in [6]. 1.1 Goals The current goals of this proposal are to define an initial set of basic, data structuredependent kernel routines for sparse iterative numerical methods and to establish a framework for extending this initial set as new data structures and operations are added. The purpose of these ....

[Article contains additional citation context not shown here]

Iain Duff, Michele Marrone, and Giuseppe Radicati. A proposal for user level sparse BLAS. In preparation.

....Oak Ridge National Laboratory z University of Tennessee Pi University of Notre Dame Mathematical Sciences Section Dept. of Computer Science Dept. of Computer Science Engineering Abstract We describe an object oriented sparse matrix library in C built upon the Level 3 Sparse BLAS proposal [5] for portability and performance across a wide class of machine architectures. The C library includes algorithms for various iterative methods and supports the most common sparse data storage formats used in practice. Besides simplifying the subroutine interface, the object oriented design ....

I. Duff, M. Marrone, G. Radicati, A Proposal for User Level Sparse BLAS, CERFACS Technical Report TR/PA/92/85, 1992.

....performance for applications employing indirect addressing or irregular access patterns is often lower than for applications involving dense matrices and regular access patterns. Efforts are underway to provide a comprehensive suite of support routines for sparse iterative linear equation solvers [12, 15]. If successful, they should provide a convenient basis on which to write reasonably efficient portable code using published standard interfaces. As discussed earlier, blocking several small messages into one large message can improve performance considerably if the message start up time is high ....

I. Duff, M. Marrone and G. Radicati. A proposal for user level sparse BLAS, SPARKER Working Note 1, CERFACS TR/PA/92/86, November, 1992.

....2 1. INTRODUCTION 1 Introduction The standardization of the basic linear algebra subprograms (BLAS) was a major step forward in enabling the development of portable high performance mathematical software for sequential platforms [7, 8, 12] At this point in time, standards for sparse BLAS [2, 9], for parallel BLAS [3, 4] and for communication subprograms [1] are being proposed. Furthermore, the message passing interface (MPI) has emerged as a suitable high performance standard for portable parallel libraries [10, 14] As these linear algebra proposals are being considered, particularly ....

....to sparse vector operations thus providing writers of sparse linear algebra software with the corresponding benefits in terms of portable high performance. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 5 In [2, 9, 11], a set of sparse BLAS were proposed for common matrix matrix (sparsedense) operations such as matrix matrix product and solution of triangular systems of equations. The proposals are broken down into a set of user level sparse BLAS [9] and a sparse BLAS toolkit [2, 11] The primary emphasis of ....

[Article contains additional citation context not shown here]

I. Duff, M. Marrone, and G. Radicati. A proposal for user level sparse BLAS. Technical report, CERFACS Technical Report TR/PA/92/85, 1992.

No context found.

I. DUFF, M.MORRONE, ANDG. RADICATI, A proposal for user level sparse BLAS, Tech. Report TR/PA/92/86, CERFACS, Nov. 1992.

No context found.

Ian S. Duff, Michele Marrone and Giuseppe Radicati, "A proposal for user level sparse BLAS," Technical Report TR/PA/92/85, CERFACS, Toulouse, France, 1992.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC