Mapping filtering streaming applications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Algorithmica Year : 2012

Mapping filtering streaming applications


In this paper, we explore the complexity of mapping filtering streaming applications on large-scale homogeneous and heterogeneous platforms, with a particular emphasis on communication models and their impact. Filtering applications are streaming applications where each node also has a selectivity which either increases or decreases the size of its input data set. This selectivity makes the problem of scheduling these applications more challenging than the more studied problem of scheduling "non-filtering" streaming workflows. We address the complexity of the following two problems: Evaluation: Given a mapping of nodes to processors, how can one compute the period and latency? Optimization: Given a filtering workflow, how can one compute the mapping and schedule that minimize the period or latency? A solution to this problem requires generating both the mapping and the associated operation list--the order in which each processor executes its assigned tasks. We address this general problem in two steps. First, we address the simplified model without communication cost. In this case, the evaluation problems are easy, and the optimization problems have polynomial complexity on homogeneous platforms. However, we show that the optimization problems become NP-hard on heterogeneous platforms. Second, we consider platforms with communication costs. Clearly, due to the previous results, the optimization problems on heterogeneous platforms are still NP-hard. Therefore we come back to homogeneous platforms and extend the framework with three significant realistic communication models. Now even evaluation problems become difficult, because the mapping must now be enriched with an operation list that provides the time-steps at which each computation and each communication occurs in the system: determining the best operation list has a combinatorial nature. Not too surprisingly, optimization problems are NP-hard too. Altogether, this paper provides a comprehensive overview of the additional difficulties induced by heterogeneity and communication costs.

Dates and versions

hal-00763349 , version 1 (10-12-2012)



Kunal Agrawal, Anne Benoit, Fanny Dufossé, Yves Robert. Mapping filtering streaming applications. Algorithmica, 2012, 62 (1), pp.258-308. ⟨10.1007/s00453-010-9453-6⟩. ⟨hal-00763349⟩
97 View
0 Download



Gmail Facebook X LinkedIn More