Mapping Heterogeneous Distributed Applications on Clusters

Abstract

Abstract. Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one side, component-based approaches provide an abstraction suitable for development, but on the other side, actual hardware becomes every day more complex and heterogeneous. Despite this increasing gap, mapping components to processors and networks is commonly done manually and is mainly a matter of expertise. Worse, the amount of efforts required for this task rarely allows to further consider optimal hardware use or sensitivity analysis of data scaling. In this paper, we rely on a formal and experimentally sound model of performance and propose a constraint programming based framework to find consistent and efficient mappings of an application onto an architecture. Experiments show that an optimal mapping for a medium-sized application can be found in a few seconds.

Modularity for Large Virtual Reality Applications

“…Jubertie et al propose a cost model for the data-flow graph that could be extended to composite components (Jubertie, Melin, Vautard, & Lallouet, 2008). However, FlowVR components tend to be closer to design patterns than skeletons.…”

Performance Prediction for Mappings of Distributed Applications on PC Clusters

“…We focus our study on synchronization and concurrency effects on performance. A complete example of network performance analysis can be found in [8]. We first determine T exec (m) and LD(m) for each module m (table 6).…”