Á¤º¸°úÇÐȸ ³í¹®Áö A : ½Ã½ºÅÛ ¹× ÀÌ·Ð
ÇѱÛÁ¦¸ñ(Korean Title) |
À׿© ¿©À¯½Ã°£À» ÀÌ¿ëÇÑ ¿¬¼º ºñÁֱ⠎ºÅ©µéÀÇ È¿À²ÀûÀÎ ½ºÄÉÁÙ¸µ |
¿µ¹®Á¦¸ñ(English Title) |
Efficient Scheduling of Soft Aperiodic Tasks Using Surplus Slack Time |
ÀúÀÚ(Author) |
±èÈñÇå
¹ÚÇкÀ
¹Ú¹®ÁÖ
¹Ú¹Î±Ô
Á¶À¯±Ù
Á¶¼ºÁ¦
Heeheon Kim
Xuefeng Piao
Moonju Park
Minkyu Park
Yookun Cho
Seongje Cho
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 36 NO. 01 PP. 0009 ~ 0020 (2009. 02) |
Çѱ۳»¿ë (Korean Abstract) |
¸¶°¨½Ã°£ÀÌ ÀÖ´Â Áֱ⠎ºÅ©¿Í ¸¶°¨½Ã°£ÀÌ ¾ø´Â ºñÁֱ⠎ºÅ©°¡ °øÁ¸ÇÏ´Â °æ¼º ½Ç½Ã°£ ½Ã½ºÅÛ¿¡¼´Â Áֱ⠎ºÅ©ÀÇ ¸¶°¨½Ã°£°ú ºñÁֱ⠎ºÅ©ÀÇ ºü¸¥ ÀÀ´ä½Ã°£À» º¸ÀåÇÏ´Â °ÍÀÌ Áß¿äÇÏ´Ù. º» ³í¹®¿¡¼´Â ºñÁֱ⠎ºÅ© 󸮿¡ È¿À²ÀûÀÌ¸é¼ Àß ¾Ë·ÁÁ® ÀÖ´Â ¾Ë°í¸®ÁòÀÎ Total Bandwidth Server(TBS) º¸´Ù Çâ»óµÈ ¾Ë°í¸®ÁòÀÎ Enhanced TBS(ETBS)¸¦ Á¦½ÃÇÑ´Ù. ETBS´Â Earliest Deadline First(EDF) ½ºÄÉÁÙ¸µ ¾Ë°í¸®ÁòÀ» »ç¿ëÇÏ´Â ´ÜÀÏ󸮱⠽ýºÅÛ¿¡¼ ÁÖ±â ÀÛ¾÷ÀÇ ´ÜÀ§ ¼öÇà½Ã°£¸¶´Ù È®º¸ÇÒ ¼ö ÀÖ´Â À׿© ¿©À¯½Ã°£À» ÀÌ¿ëÇØ ¿Â¶óÀÎÀ¸·Î ºñÁֱ⠎ºÅ©¿¡ ¸¶°¨½Ã°£À» ºÎ¿©ÇÏ´Â ¾Ë°í¸®ÁòÀÌ´Ù. Á¦½ÃÇÑ ¾Ë°í¸®ÁòÀº ÁÖ±â ¹× ºñÁֱ⠎ºÅ©µéÀÌ Ã³¸®±âÀÇ ÀÌ¿ë·üÀ» ¸ðµÎ ÀÌ¿ëÇÒ ¼ö ÀÖ°Ô Çϸç ÁÖ¾îÁø Áֱ⠎ºÅ©µéÀÇ ¸¶°¨½Ã°£À» º¸ÀåÇÑ´Ù. ETBS ¾Ë°í¸®ÁòÀº TBS¿Í °°Àº °è»ê º¹Àâµµ À» °¡Áö¸é¼µµ TBSº¸´Ù ÁÁÀº ÀÀ´ä½Ã°£À» °¡ÁüÀ» ÀÌ·ÐÀûÀ¸·Î º¸¿´°í, Á¤·®ÀûÀÎ ÀÀ´ä½Ã°£ Â÷ÀÌ´Â ¸ðÀǽÇÇèÀ» ÅëÇØ º¸¿´´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
In a real-time system with both hard real-time periodic tasks and soft real-time aperiodic tasks, it is important to guarantee the deadlines of each periodic task as well as obtain fast response time for each aperiodic task. This paper proposes Enhanced Total Bandwidth Server (ETBS) with possibly shorter response time than Total Bandwidth Server (TBS), which is efficient and widely used for servicing aperiodic tasks. For uniprocessor system using Earliest Deadline First (EDF) scheduling algorithm, ETBS assigns an on-line deadline to each aperiodic task considering a surplus slack time which gained for every unit execution time of periodic job. The proposed method can fully utilize the processor while meeting all the deadlines of periodic tasks. We show that the proposed ETBS provides better response time of aperiodic tasks than TBS theoretically, but has the same computational complexity as TBS, O(1). Simulation results show that the response time of aperiodic tasks with ETBS are shorter than one with TBS. |
Å°¿öµå(Keyword) |
½Ç½Ã°£ ½ºÄÉÁÙ¸µ ¾Ë°í¸®Áò
Real-time scheduling algorithm
ºñÁֱ⠎ºÅ©
Aperiodic task
ÀÀ´ä½Ã°£
Response time
¸¶°¨½Ã°£
Deadline
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|