Real-Time Scheduling Algorithms for Cyclic Communication Set in Networks-on-chip
Networks-on-chip(NoC) has been introduced to offer high on-chip communication bandwidth for large-scale multi-core systems.How to guarantee real-time communication in NoC is a key research problem.In this paper,we propose two real time scheduling algorithms(CS-TI and CS-VC) for cyclic communication set and analyze the sufficient utilization bounds of two algorithms.We compare our algorithms with the existing fixed-priority algorithm which is the state of the art.Experimental results show that the acceptance rates of our algorithms are higher than that of the fixed-priority algorithm.And the smaller the communication set size and the NoC size,the higher the acceptance rate.Comparing with CS-VC,CS-TI has the low er acceptance rate.How ever CS-TI can be applied to common NoC as it does not require extra hardw are support.