%0 Conference Proceedings
%T Scheduling of Compute-Intensive Code Generated from Event-B Models: An Empirical Efficiency Study
%+ Turku Centre for Computer Science
%+ Åbo Akademi University [Turku]
%A Degerlund, Fredrik
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 12th International Conference on Distributed Applications and Interoperable Systems (DAIS)
%C Stockholm, Sweden
%Y Karl Michael Göschka
%Y Seif Haridi
%I Springer
%3 Distributed Applications and Interoperable Systems
%V LNCS-7272
%P 177-184
%8 2012-06-13
%D 2012
%R 10.1007/978-3-642-30823-9_15
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01527642/document
%2 https://inria.hal.science/hal-01527642/file/978-3-642-30823-9_15_Chapter.pdf
%L hal-01527642
%U https://inria.hal.science/hal-01527642
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-DAIS
%~ IFIP-LNCS-7272