Generic programming and high-performance libraries

Abstract

Generic programming is an especially attractive paradigm for developing libraries for high-performance computing because it simultaneously emphasizes generality and efficiency. In the generic programming approach, interfaces are based on sets of specified requirements on types, rather than on any particular types, allowing algorithms to inter-operate with any data types meeting the necessary requirements. These sets of requirements, known as concepts, can specify syntactic as well as semantic requirements. Besides providing a powerful means of describing interfaces to maximize software reuse, concepts provide a uniform mechanism for more closely coupling libraries with compilers and for effecting domain-specific library-based compiler extensions. To realize this goal however, programming languages and their associated tools must support concepts as first-class constructs. In this paper we advocate better syntactic and semantic support to make concepts first-class and present results demonstrating the kinds of improvements that are possible with static checking, compiler optimization, and algorithm correctness proofs for generic libraries based on concepts.Keywords: Generic programming, software libraries, static analysis, highlevel optimization, formal verification 1 2 Gregor et al.

Graph Trace Analysis and Generic Algorithms for Interdependent Reconfigurable System Design and Control

“…This simplifies the development of design and control concepts for solving complex, multidomain, interdependent system problems. Because of the resemblance that this methodology has to the object‐oriented information management principles used in generic programming (Järvi et al 2004), it is referred to as generic analysis.…”