Mapping filtering streaming applications with communication costs

In this paper, we explore the problem of mapping filtering streaming applications on large-scale homogeneous platforms, with a particular emphasis on communication models and their impact. Filtering application 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 identify three significant realistic communication models. For each of them, we address the complexity of the following important problems:

• Type: Conference
• Year: 2009
• Where: SPAA
• Authors: Kunal Agrawal, Anne Benoit, Fanny Dufossé, Yves Robert
• Keywords: Large-scale Homogeneous Platforms, Parallel Computing, Realistic Communication Models, SPAA 2009