Improving the efficiency of automated protocol implementations using a configurable FDT compiler

  • Authors:
  • H Koenig;P Langendoerfer;H Krumm

  • Affiliations:
  • Brandenburg University of Technology at Cottbus, Department of Computer Science, P.O. Box 101344, D-03013 Cottbus, Germany;Brandenburg University of Technology at Cottbus, Department of Computer Science, P.O. Box 101344, D-03013 Cottbus, Germany;University of Dortmund, Department of Computer Science, D-44221 Dortmund, Germany

  • Venue:
  • Computer Communications
  • Year:
  • 2000
  • Real-Time tasks in SDL

    SAM'12 Proceedings of the 7th international conference on System Analysis and Modeling: theory and practice

Quantified Score

Hi-index 0.24

Visualization

Abstract

The integration of efficient implementation techniques, which have been proven in manual coding, into FDT compilers is difficult because of the semantic constraints of the FDTs and the lack of language means to flexibly adapt to a given implementation context. In this paper, we discuss ways to improve the efficiency of automated protocol implementations to make them applicable to real-life implementations. For solution, we introduce the concept of a configurable FDT compiler that supports the application of different implementation techniques and the adjustment of the implementation to the given implementation context. The paper discusses the semantic conflicts to be solved when applying optimizing implementation techniques. It introduces a compile time reordering of transitions to cope with these problems. Finally we present measurements that prove a considerable efficiency gain of the generated code as well as a comparison with the Cadvanced compiler of the SDT tool set.