4th International ICST Conference on Simulation Tools and Techniques

Research Article

A New Fast Algorithm for Connecting the INET Simulation Framework to Applications in Real-time

Download47 downloads
  • @INPROCEEDINGS{10.4108/icst.simutools.2011.245506,
        author={Michael T\'{y}xen and Irene R\'{y}ngeler and Brad Penoff and Alan Wagner},
        title={A New Fast Algorithm for Connecting the INET Simulation Framework to Applications in Real-time},
        proceedings={4th International ICST Conference on Simulation Tools and Techniques},
        publisher={ICST},
        proceedings_a={SIMUTOOLS},
        year={2012},
        month={4},
        keywords={OMNeT++ MPI Real-time scheduler software-in-the-loop},
        doi={10.4108/icst.simutools.2011.245506}
    }
    
  • Michael Tüxen
    Irene Rüngeler
    Brad Penoff
    Alan Wagner
    Year: 2012
    A New Fast Algorithm for Connecting the INET Simulation Framework to Applications in Real-time
    SIMUTOOLS
    ICST
    DOI: 10.4108/icst.simutools.2011.245506
Michael Tüxen1,*, Irene Rüngeler2, Brad Penoff3, Alan Wagner3
  • 1: Muenster University of Applied Sciences
  • 2: Münster University of Applied Sciences
  • 3: University of British Columbia
*Contact email: tuexen@fh-muenster.de

Abstract

The coupling of real implementations with simulations helps the developer to better understand the behavior of the real system by shifting to the simulation the parts of the overall system that he cannot influence. This was done for MPI programs in MPI-NeTSim, where the network and transport protocol are simulated in OMNeT++ but the original MPI code executes unchanged. We previously developed a static time factoring algorithm to accurately handle the discrepancies between the wall clock time of the application and the virtual simulation time. However, the original algorithm proved to be too slow for simulations with a higher number of hosts and a greater amount of data. In this paper, we introduce a faster adaptive algorithm that no longer uses time factors nor requires a full system-wide synchronization but still meets the conditions of the ordering of events in a distributed system. The new algorithm scales to significantly more hosts and data.