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: -Given an execution graph, how can one compute the period and latency' A solution to this problem is an operation list which provides the time-steps at which each computation and each communication occurs in the system. -Given a filtering workflow problem, how can one compute the schedule that minimizes the period or latency' A solution to this problem requires generating both the execution graph and the associated operation list. Altogether, with three models, two problems and two objectives, we present 12 complexity results, thereby providing solid theoretical foundations for the study of filtering streaming applications