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.
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-01527642
Contributor : Hal Ifip <>
Submitted on : Wednesday, May 24, 2017 - 5:22:59 PM
Last modification on : Monday, May 27, 2019 - 4:26:06 PM
Long-term archiving on : Monday, August 28, 2017 - 12:50:07 AM

File

978-3-642-30823-9_15_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

72

Files downloads

122