This paper introduces a heuristic-based scheduler to optimise the throughput and latency of stream programs with dynamic network structure. The novelty is the utilisation of positive and negative demands of the streamcommunications. It is a centralised approach to provide load balancing for stream programs with dynamic network structures. The approach is designed for shared-memory multi-core platforms. The experiments show that our scheduler performs significantly better than the reference implementation without demand considerations. © Springer International Publishing Switzerland 2013.
CITATION STYLE
Nguyen, V. T. N., & Kirner, R. (2013). Demand-based scheduling priorities for performance optimisation of stream programs on parallel platforms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8285 LNCS, pp. 357–369). https://doi.org/10.1007/978-3-319-03859-9_31
Mendeley helps you to discover research relevant for your work.