GraphML-Based Exploration and Evaluation of Efficient Parallelization Alternatives for Automation Firmware

  • Jürgen Bregenzer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6502)

Motivation

Graphs are an accepted and popular way of representing and solving problems of various kinds. Thus, applications of graphs as well as related topics such as graph visualization and graph representation are numerous. Our application is located in the domain of industrial automation and driven by the need of parallelizing our controller’s firmware for the upcoming multi-core CPUs. As efficiency matters, we thereby aim at gaining maximum performance increases by spending no more implementation effort than necessary. In order to achieve that objective, we at first want to explore, evaluate and visualize those efficient parallelization alternatives by means of a graph-based model of our firmware. Thus, we are currently developing the EEEPA (Exploration and Evaluation of Efficient Parallelization Alternatives) tool for this purpose. Thereby, we have chosen and extended GraphML [1], a widespread format for graph representation.

References

  1. 1.
    Brandes, U., Eiglsperger, M., Herman, I., Himsolt, M., Marshall, M.S.: GraphML Progress Report: Structural Layer Proposal. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 501–512. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jürgen Bregenzer
    • 1
  1. 1.Bosch Rexroth AG, Lohr am Main, GermanyUniversity of WürzburgGermany

Personalised recommendations