Array language support for parallel sparse computation
ICS '01 Proceedings of the 15th international conference on Supercomputing
The design and implementation of a region-based parallel programming language
The design and implementation of a region-based parallel programming language
Minimizing development and maintenance costs in supporting persistently optimized BLAS
Software—Practice & Experience - Research Articles
Sparse matrix storage revisited
Proceedings of the 2nd conference on Computing frontiers
| Hi-index | 0.00 |
In this paper a concept for structured mathematical programming within an object-oriented language is presented. It leads to better readable, more natural and more compact code in typical linear algebra applications and provides options for optimized implementation. We also discuss the realization of this concept as an extension of the programming language Active Oberon. We define new built-in array types that provide a slight modification of classical arrays in Oberon. By introducing range-valued indices as array designators, we permit the use of regular sub-domains of arrays as parameters of operators and procedures. The built-in types are complemented by custom array structured object types. The latter can be specified by the programmer and are designed to be syntactically compatible with the former. They provide the needed flexibility for the language.