Scheduling of Compute-Intensive Code Generated from Event-B Models: An Empirical Efficiency Study - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Scheduling of Compute-Intensive Code Generated from Event-B Models: An Empirical Efficiency Study

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.
Fichier principal
Vignette du fichier
978-3-642-30823-9_15_Chapter.pdf (257.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01527642 , version 1 (24-05-2017)

Licence

Attribution

Identifiers

Cite

Fredrik Degerlund. Scheduling of Compute-Intensive Code Generated from Event-B Models: An Empirical Efficiency Study. 12th International Conference on Distributed Applications and Interoperable Systems (DAIS), Jun 2012, Stockholm, Sweden. pp.177-184, ⟨10.1007/978-3-642-30823-9_15⟩. ⟨hal-01527642⟩
44 View
64 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More