Programming Model to Develop Supercomputer Combinatorial Solvers

© 2017 IEEE. Novel architectures for massively parallel machines offer better scalability and the prospect of achieving linear speedup for sizable problems in many domains. The development of suitable programming models and accompanying software tools for these architectures remains one of the biggest challenges towards exploiting their full potential. We present a multi-layer software abstraction model to develop combinatorial solvers on massively-parallel machines with regular topologies. The model enables different challenges in the design and optimization of combinatorial solvers to be tackled independently (separation of concerns) while permitting problem-specific tuning and cross-layer optimization. In specific, the model decouples the issues of inter-node communication, n ode-level scheduling, problem mapping, mesh-level load balancing and expressing problem logic. We present an implementation of the model and use it to profile a Boolean satisfiability solver on simulated massively-parallel machines with different scales and topologies

Composition of message passing applications on-demand

Ensemble has been proposed as a methodology for designing and implementing message passing applications by composition of modular and reusable message passing components. In this paper we adapt Ensemble as a mechanism for composing message passing applications in a meta-computing context on demand. Ensemble is particularly effective in the case where users demand different process topologies to be created out of the same components. We demonstrate this case by an application from transaction processing and in particular parallel query execution based on the tree pipelining model. © Springer-Verlag Berlin Heidelberg 2000

Efficient Program Composition on Parix by the Ensemble Methodology

A message passing program composition methodology, called Ensemble, applied for Parix is presented. Ensemble overcomes the implementation problems and complexities in developing applications in message passing environments. Parallel applications are virtually specified by Process Communication Graphs (PCGs) annotated with communication information for Parix processes. Annotated PCGs are generated from application scripts by supporting tools. Reusable Parix executable components are defined from which all processes are created. A universal Parix program loader interprets the annotated PCGs creating the application processes from the reusable components and establishing their communication dependencies. Ensemble is applied to compose variations of Parix applications using the same reusable components. The methodology has been applied for PVM. Keywords: software engineering for parallel systems, message passing program composition, reusable message passing components, annotated process c..