MAST: A Modeling and Schedulability Analysis Suite for Real-Time Application

MAST is an open-source suite of tools to perform schedulability analysis of real-time distributed systems that assesses a rich variety of timing requirements. Via sensitivity analysis, you will know how far or close the system is from meeting those requirements. MAST uses a versatile and composable input model for the real-time behavior of the modules and platforms that form your system. MAST is distributed under a GPL free software license.

Some of the key features of MAST are:

  • MAST offers an advanced set of schedulability analysis techniques optimized for single processor and distributed systems.
  • It supports heterogeneous and hierarchical scheduling platforms with EDF and preemptible or non-preemptible fixed priority schedulers.
  • It includes automatic assignment of optimized priorities, ceilings and EDF scheduling parameters for end-to-end flows in distributed systems.
  • Blocking times for mutual exclusion resources are calculated automatically.
  • A discrete event simulator provides statistics of performance metrics for average-case timing behavior.
  • Sensitivity analysis is performed by calculating operation, task, node & system level slacks, which enable a fast design space exploration.
  • Model-based design is supported through input and results models that can be integrated into UML/MARTE models in the Eclipse environment.
  • Worst-case schedulability analysis: response times and jitter predictability.
  • Average-case distribution analysis: timing statistics through discrete event simulation.
  • Fully automated handling of passive protected shared resources:
    Support for priority inheritance, priority ceilings and stack-based protocols
    Automatic calculation of blocking time, priority ceilings, and preemption levels
  • Optimized assignment of priorities and deadlines to threads and messages in end-to-end distributed systems
  • Best-case execution time data are used to boost the least pessimistic offset based analysis for CPU’s and networks
  • It includes support for multipath end-to-end flows. This means flows may have join (barrier), fork (multicast), or merge (concentrator) event handlers. About now they are restricted to have no branch (delivery or query servers) event handlers, and may have only one single external event stimulus for each flow. These multipath end-to-end flows are analysed using the holistic analysis technique, which despite being pessimistic (with respect to the offset-based techniques) can bring safe results for such complex distributed systems.
  • The last version includes also three new analysis tools: Offset-based approximate for global-clock EDF, Offset-based approximate for local-clock EDF, and Offset-based approximate with precedence relations for local-clock EDF.

Link to the current binary version for Windows (
Link to the current binary version for Linux (

Installation instructions: MAST README

Comments are closed