Work stealing strategies for parallel stream processing in soft real-time systems

  • Authors:
  • Sebastian Mattheis;Tobias Schuele;Andreas Raabe;Thomas Henties;Urs Gleim

  • Affiliations:
  • Fakultät für Informatik, Technische Universität München, Garching, Germany;Corporate Technology, Siemens AG, München, Germany;fortiss GmbH, München, Germany;Corporate Technology, Siemens AG, München, Germany;Corporate Technology, Siemens AG, München, Germany

  • Venue:
  • ARCS'12 Proceedings of the 25th international conference on Architecture of Computing Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Work stealing has proven to be an efficient technique for scheduling parallel computations. In its basic form, however, work stealing is not suitable for real-time applications, since the latency of a task is hardly predictable. In this paper, we propose a number of variants and extensions of work stealing suitable for stream processing applications. Such applications are frequently encountered in embedded systems, which often have to obey real-time constraints. Moreover, we give bounds on the maximum latency for certain stealing strategies. Our experimental results show a significant reduction of the latency using these strategies.