We address the problem of scheduling concurrent periodic real-time transactions on Multi-Domain Ring Bus (MDRB).The problem is challenging because although the bus allows multiple non-overlapping transactions to be executed concurrently, thedegree of concurrency depends on the topology of the bus and of executed transactions. This is a different challenge compared tothat of multi-processor real-time task scheduling. To solve this problem, first, we propose two novel efficient scheduling algorithmsfor topographically-acyclic transaction sets. The first algorithm is optimal for transaction sets under restrictive assumptions whilethe second one induces a competitive sufficient schedulable utilization bound for more general transaction sets. Then, we extendthese two algorithms for the scheduling of topographically-cyclic transaction sets. Extensive simulations show that the proposedalgorithm can schedule transaction sets with high bus utilization and is better than that of related works in most practical settings.The implementation of the algorithms in a real test-bed shows that they have relatively low execution-time overhead.
展开▼
