½Ç½Ã°£ ½Ã½ºÅÛÁß¿¡¼
LST¾Ë°í¸®Áò
Least-Slack-Time-First ¾Ë°í¸®Áò¿¡ ´ëÇؼ
ÀÌÇØÇϱ⠽±°Ô ¼³¸íÁ» ÇØÁֽǺРºÎŹµå¸³´Ï´Ù.
¿¹¸¦ µé¸é
5°³ÀÇ ÁÖ±âÀûÀÎ tasks A,B,C,D,E ÀÌ·¸°Ô ÀÖ°í
ÇÁ·Î¼¼½º´Â P1,P2,P3 3°³ ÀÖ°í,
A,B,C´Â period°¡ 2, excution timeÀÌ 1
D,E´Â period°¡ 8, excution timeÀÌ 6
°¢°¢ÀÇ release timeÀº 0ÀÌ°í, relatime deadline´Â °¢°¢ÀÇ period¶û °°½À´Ï´Ù.
1)°¢°¢ÀÇ ÀÛ¾÷À» LST ¾Ë°í¸®ÁòÀ¸·Î ³ªÅ¸³»´Â °Ì´Ï´Ù.(¸î°³ÀÇ ÀÛ¾÷Àº deadlineÀ» ¸ø¹ÌĨ´Ï´Ù.)
2)find a feasible schedule of the five tasks on three processors.
ºÎŹµå·Á¿ä.. |