Irregular Data-Parallel Objects in C++

. Most data-parallel languages use arrays to support parallelism. This regular data structure allows a natural development of regular parallel algorithms. The implementation of irregular algorithms requires a programming effort to project the irregular data structures onto regular structures. We first propose in this paper a classification of existing data-parallel languages. We briefly describe their irregular and dynamic aspects, and derive different levels where irregularity and dynamicity may be introduced. We propose then a new irregular and dynamic data-parallel programming model, called Idole. Finally we discuss its integration in the C++ language, and present an overview of the Idole extension of C++. 1 Irregularity and Data-Parallelism The evolution of data-parallel languages mimics closely the evolution of sequential languages. Keeping in mind efficiency and simplicity, compilers have supported, in a first step, only regular data structures: arrays in sequential languages, v..