Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

IFIP International Conference on Distributed Applications and Interoperable Systems

DAIS 2012: Distributed Applications and Interoperable Systems pp 177–184Cite as

  1. Home
  2. Distributed Applications and Interoperable Systems
  3. Conference paper
Scheduling of Compute-Intensive Code Generated from Event-B Models: An Empirical Efficiency Study

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

  • Fredrik Degerlund18 
  • Conference paper
  • 674 Accesses

Part of the Lecture Notes in Computer Science book series (LNCCN,volume 7272)

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.

This research was supported by the EU funded FP7 project DEPLOY (214158). http://www.deploy-project.eu

Download conference paper PDF

References

  1. Abrial, J.-R.: Modeling in Event-B: System and Software Engineering. Cambridge University Press (2010)

    Google Scholar 

  2. Abrial, J.-R., Butler, M., Hallerstede, S., Voisin, L.: An Open Extensible Tool Environment for Event-B. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol. 4260, pp. 588–605. Springer, Heidelberg (2006)

    CrossRef  Google Scholar 

  3. Degerlund, F., Grönblom, R., Sere, K.: Code generation and scheduling of Event-B models. Technical report, Turku Centre for Computer Science, TUCS (2011)

    Google Scholar 

  4. GNU Compiler Collection (GCC) web site, http://gcc.gnu.org/

  5. Grönblom, R.: A framework for code generation and parallel execution of Event-B models. Master’s thesis, Åbo Akademi University (2009)

    Google Scholar 

  6. Hallerstede, S.: On the purpose of Event-B proof obligations. Formal Aspects of Computing 23, 133–150 (2011)

    CrossRef  MATH  Google Scholar 

  7. Message Passing Interface forum, http://www.mpi-forum.org/

  8. MPICH2 web site, http://www.mcs.anl.gov/research/projects/mpich2/

  9. Wright, S.: Using EventB to Create a Virtual Machine Instruction Set Architecture. In: Börger, E., Butler, M., Bowen, J.P., Boca, P. (eds.) ABZ 2008. LNCS, vol. 5238, pp. 265–279. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Åbo Akademi University & TUCS - Turku Centre for Computer Science, Joukahainengatan 3-5, FIN-20520, Åbo, Finland

    Fredrik Degerlund

Authors
  1. Fredrik Degerlund
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Systems, Vienna University of Technology, Argentinierstrasse 8/184-1, 1040, Vienna, Austria

    Karl Michael Göschka

  2. Swedish Institute of Computer Science, Isafjordsgatan 22, 164 29, Kista, Sweden

    Seif Haridi

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Degerlund, F. (2012). Scheduling of Compute-Intensive Code Generated from Event-B Models: An Empirical Efficiency Study. In: Göschka, K.M., Haridi, S. (eds) Distributed Applications and Interoperable Systems. DAIS 2012. Lecture Notes in Computer Science, vol 7272. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30823-9_15

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-30823-9_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30822-2

  • Online ISBN: 978-3-642-30823-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature