RESOURCE-INDEPENDENT REPRESENTATION OF SORTING NETWORKS IN Set@l PROGRAMMING LANGUAGE

Abstract

The development of scalable parallel programs for high-performance computer systems with reconfigurable and hybrid architectures is an important problem in the field of modern supercomputer engineering. Resource-independent applied software in the high-level COLAMO programming language describes only the limited number of the algorithm implementations for some configurations due to the inductive principle of the information graph forming. However, the creation of efficient resource-independent parallel software requires programming tool that supports both induction and reduction of calculations. To solve the problem, we propose the application of the Set@l programming language based on the aspect-oriented programming paradigm and set-theoretical code representation. According to the aspect-oriented concept, Set@l describes an algorithm for the problem solution and its parallelizing and other implementation features as separated program modules – source code and various aspects. The programming language being considered has much in common with traditional set-theory-based languages such as SETL, SETLX and SETL2, but Set@l introduces the essential classification of collections by parallelism, definiteness, orderliness and other criteria. In contrast to the high-level COLAMO programming language, Set@l specifies the full information graph of a computational problem in the absolutely parallel form and describes the reduction principles for all configurations of a computer system as independent aspects of a program. In this paper, we demonstrate that the aspect-oriented sorting program in the Set@l language defines different types of quadratic sorting networks and various methods of their partition and reduction.