State-of-the-art programming languages for high-performance computer systems require a significant code revision for the porting of the same algorithm between different architectures. To solve this problem, we propose...
详细信息
ISBN:
(纸本)9783030365929;9783030365912
State-of-the-art programming languages for high-performance computer systems require a significant code revision for the porting of the same algorithm between different architectures. To solve this problem, we propose an architecture-independent Set@l programming language, which develops the main concepts of the COLAMO and SETL programming languages. Set@l represents the solution of a computational problem as sets with various attributes and relations between them. Furthermore, the Set@l language is based on the paradigm of aspect-orientedprogramming and describes an algorithm and features of its implementation as separate modules of a program. The Set@l syntax supports the classification of collections by various criteria, such as the type of parallelism, definiteness and optional user's attributes. To deal with the indefinite collections emerging in the case of the algorithm modification, the Vopenka's classification of collections by definiteness of their elements is introduced into the syntax of the Set@l programming language. In this paper, we consider the example of the Set@l application for the coding of lower-upper decomposition. The code shows that aspects can adapt the parallelizing of the basic algorithm to the implementation on computer systems with reconfigurable and multiprocessor architectures.
暂无评论