A switch scheduling algorithm for periodic messages using laxity decomposition method

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Jaehong Shim Articles by Kyongok Yun Articles by Kyunghee Choi Articles by Gihyun Jung Articles by Seungkyu Park Articles by Dugkyoo Choi

Fourth International Workshop on Real-Time Computing Systems and Applications (RTCSA'97)

Taipei, TAIWAN

October 27-October 29

ISBN: 0-8186-8073-3

	ASCII Text	x
	Jaehong Shim, Kyongok Yun, Kyunghee Choi, Gihyun Jung, Seungkyu Park, Dugkyoo Choi, "A switch scheduling algorithm for periodic messages using laxity decomposition method," Real-Time Computing Systems and Applications, International Workshop on, pp. 192, Fourth International Workshop on Real-Time Computing Systems and Applications (RTCSA'97), 1997.

	BibTex	x
	@article{ 10.1109/RTCSA.1997.629217, author = {Jaehong Shim and Kyongok Yun and Kyunghee Choi and Gihyun Jung and Seungkyu Park and Dugkyoo Choi}, title = {A switch scheduling algorithm for periodic messages using laxity decomposition method}, journal ={Real-Time Computing Systems and Applications, International Workshop on}, volume = {0}, year = {1997}, isbn = {0-8186-8073-3}, pages = {192}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.1997.629217}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Real-Time Computing Systems and Applications, International Workshop on TI - A switch scheduling algorithm for periodic messages using laxity decomposition method SN - 0-8186-8073-3 SP EP A1 - Jaehong Shim, A1 - Kyongok Yun, A1 - Kyunghee Choi, A1 - Gihyun Jung, A1 - Seungkyu Park, A1 - Dugkyoo Choi, PY - 1997 KW - 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 VL - 0 JA - Real-Time Computing Systems and Applications, International Workshop on ER -

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.1997.629217

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.