Scheduling of compute-intensive code generated from event-b models: an empirical efficiency study

  • Authors:
  • Fredrik Degerlund

  • Affiliations:
  • Åbo Akademi University & TUCS - Turku Centre for Computer Science, Åbo, Finland

  • Venue:
  • DAIS'12 Proceedings of the 12th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Event-B is a tool-supported specification language that can be used e.g. for modelling of concurrent programs. This calls for code generation and a means of executing the resulting code. One approach is to preserve the original event-based nature of the model and use a run-time scheduler and message passing to execute the translated events on different computational nodes. In this paper, we consider the efficiency of such a solution when applied to a compute-intensive model. In order to mitigate overhead, we also use a method allowing computational nodes to repeat event execution without the involvement of the scheduler. To find out under what circumstances the approach performs most efficiently, we perform an empirical study with different parameters.