Cluster-M Paradigms for High-Order Heterogeneous Procedural Specification Computing

Abstract

In this paper, we study an approach called superconcurrency for identifying and employing an optimal, heterogeneous suite of processors to solve traditional supercomputing problems. We discuss mainly two components of superconcurrency: Optimal selection theory, and Parallel programming tools. We briefly describe a number of existing parallel programming tools and present a parallel programming model called Cluster-M. This model efficiently provides a programming paradigm for high-order heterogeneous procedural specification computing. Using ClusterM, portable software can be generated which may be mapped onto various configurations of heterogeneous supercomputing.