The Set@l Programming Language and Its Application for Coding Gaussian Elimination

Abstract

The development of new heterogeneous architectures for computer systems is an advanced research direction in the field of supercomputer engineering. At the same time, software porting between different heterogeneous architectures requires significant code revision as a consequence of the architectural limitations of the programming languages available. To solve this problem, we propose Set@l, a new architecture-independent programming language which extends some ideas of the COLAMO and SETL programming languages. In Set@l, an algorithm and its parallelization are described by separated modules of the program. This is determined by the application of the set-theoretic code view and the aspect-oriented programming paradigm. The source code in Set@l is architecture-independent and represents the solution to a computational problem as an information graph specified in terms of set theory and relational calculus. Aspects adapt a universal algorithm to the architecture and configuration of a particular computer system by means of partition and classification of sets. In contrast to SETL, Set@l offers different classification criteria for collections, particularly in accordance with the type of parallelism. Sets of indefinite type of parallelism are denoted as implicit ones. In the paper, we describe the fundamentals of architecture-independent programming in the Set@l language and consider an example in which Set@l is applied for coding Gaussian elimination.