A Max-Min Scheduling Algorithm Based on TAS Mechanism

Abstract

Abstract In order to solve the problem of too many guard bands and gate control lists (GCL) caused by time triggered (TT) flow scheduling per flow, this paper proposes a maximum minimum cycle scheduling algorithm based on time aware shaping (TAS) mechanism. At the same time, a period shift algorithm is proposed to overcome the excessive super period of TT flow. The results show that compared with the conventional scheduling methods, this method can ensure the deterministic transmission requirements of TT flows, and reduce the number of protection bands and GCLs.