| |
| Hierarchical scheduling methods have been widely adopted to simplify system analysis and to ensure schedulability. Compositional scheduling analysis can simplify the set of virtual links in a hierarchical way and prevent traffic from interfering during transmission, but it needs to be modified to fit an AFDX network. In this paper, a VLPR model is established to meet the demand of compositional scheduling analysis. Then, scheduling algorithms are modified to be non-preemptive due to the virtual link constraints. Unlike traditional virtual links, ours can have reasonable allocation methods. Two different scheduling algorithms, RM and EDF, have been added to the analysis of the VLPR model. The compositional scheduling methods in AFDX virtual links and sub-virtual links are shown reachable through simulations to ensure virtual link isolation and avoid competition for resources. |
|
| Keywords:AFDX network; Virtual link; Compositional schedulability analysis; BAG allocation |
|
