Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > Scheduling of Compute-Intensiv...

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

Fredrik Degerlund, Scheduling of Compute-Intensive Code Generated from Event-B Models: An Empirical Efficiency Study. In: Karl Göschka, Seif Haridi (Eds.), Distributed Applications and Interoperable Systems (Proc. of DAIS 2012), Lecture Notes in Computer Science 7272, 177–184, Springer, 2012.

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.

BibTeX entry:

@INPROCEEDINGS{inpDegerlund_Fredrik12a,
  title = {Scheduling of Compute-Intensive Code Generated from Event-B Models: An Empirical Efficiency Study},
  booktitle = {Distributed Applications and Interoperable Systems (Proc. of DAIS 2012)},
  author = {Degerlund, Fredrik},
  volume = {7272},
  series = {Lecture Notes in Computer Science},
  editor = {Göschka, Karl and Haridi, Seif},
  publisher = {Springer},
  pages = {177–184},
  year = {2012},
  keywords = {Parallel computing, Event-B, Scheduling, Message passing, Efficiency},
}

Belongs to TUCS Research Unit(s): Distributed Systems Laboratory (DS Lab)

Publication Forum rating of this publication: level 1

Edit publication