Fourth International Workshop on Real-Time Computing Systems and Applications (RTCSA'97) A switch scheduling algorithm for periodic messages using laxity decomposition method Taipei, TAIWAN October 27-October 29 ISBN: 0-8186-8073-3
This paper presents a very unique and analytic method for scheduling real time messages routed through a non-blocking switch. The laxities of schedulable messages are decomposed and rearranged so that the packets to be scheduled in the next time instance are placed in the diagonal of the traffic matrix. The MLF algorithm we modified is utilized to schedule the messages. We present some examples and simulation results which show that the success rate is improved significantly regardless of the size of switch.
Index Terms:
time division multiple access; switch scheduling algorithm; periodic messages; laxity decomposition method; real time messages scheduling; laxities; schedulable messages; traffic matrix; MLF algorithm; simulation results
Citation:
Jaehong Shim, Kyongok Yun, Kyunghee Choi, Gihyun Jung, Seungkyu Park, Dugkyoo Choi, "A switch scheduling algorithm for periodic messages using laxity decomposition method," rtcsa, pp.192, Fourth International Workshop on Real-Time Computing Systems and Applications (RTCSA'97), 1997 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||