메뉴 건너뛰기




Volumn , Issue , 2010, Pages 25-36

LLF schedulability analysis on multiprocessor platforms

Author keywords

[No Author keywords available]

Indexed keywords

MULTI PROCESSOR SCHEDULING; MULTI-PROCESSOR PLATFORMS; PRE-EMPTIVE SCHEDULING; SCHEDULABILITY ANALYSIS; SCHEDULABILITY TEST; SINGLE PROCESSORS;

EID: 79951788025     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2010.13     Document Type: Conference Paper
Times cited : (26)

References (25)
  • 1
    • 84974687699 scopus 로고
    • Scheduling algorithms for multi-programming in a hard-real-time environment
    • C. Liu and J. Layland, "Scheduling algorithms for multi-programming in a hard-real-time environment," Journal of the ACM, vol. 20, no. 1, pp. 46-61, 1973.
    • (1973) Journal of the ACM , vol.20 , Issue.1 , pp. 46-61
    • Liu, C.1    Layland, J.2
  • 2
    • 0020271514 scopus 로고
    • On the complexity of fixed-priority scheduling of periodic real-time tasks
    • J. Leung and J. Whitehead, "On the complexity of fixed-priority scheduling of periodic real-time tasks," Performance Evaluation, vol. 2, pp. 237-250, 1982.
    • (1982) Performance Evaluation , vol.2 , pp. 237-250
    • Leung, J.1    Whitehead, J.2
  • 3
    • 0037287966 scopus 로고    scopus 로고
    • Efficient real-time scheduling algorithms for multiprocessor systems
    • S. Cho, S.-K. Lee, S. Ahn, and K.-J. Lin, "Efficient real-time scheduling algorithms for multiprocessor systems," IEICE Trans. on Communications, vol. E85-B, no. 12, pp. 2859-2867, 2002.
    • (2002) IEICE Trans. on Communications , vol.E85-B , Issue.12 , pp. 2859-2867
    • Cho, S.1    Lee, S.-K.2    Ahn, S.3    Lin, K.-J.4
  • 4
    • 0037206559 scopus 로고    scopus 로고
    • Deadline-based scheduling of periodic task systems on multiprocessors
    • A. Srinivasan and S. Baruah, "Deadline-based scheduling of periodic task systems on multiprocessors," Information Processing Letters, vol. 84, no. 2, pp. 93-98, 2002.
    • (2002) Information Processing Letters , vol.84 , Issue.2 , pp. 93-98
    • Srinivasan, A.1    Baruah, S.2
  • 5
    • 0035696095 scopus 로고    scopus 로고
    • Static-priority scheduling on multiprocessors
    • B. Andersson, S. Baruah, and J. Jonsson, "Static-priority scheduling on multiprocessors," in RTSS, 2001, pp. 193-202.
    • (2001) RTSS , pp. 193-202
    • Andersson, B.1    Baruah, S.2    Jonsson, J.3
  • 6
    • 0001326859 scopus 로고    scopus 로고
    • Proportionate progress: A notion of fairness in resource allocation
    • S. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel, "Proportionate progress: a notion of fairness in resource allocation," Algorithmica, vol. 15, no. 6, pp. 600-625, 1996.
    • (1996) Algorithmica , vol.15 , Issue.6 , pp. 600-625
    • Baruah, S.1    Cohen, N.K.2    Plaxton, C.G.3    Varvel, D.A.4
  • 7
    • 38949135956 scopus 로고    scopus 로고
    • An optimal real-time scheduling algorithm for multiprocessors
    • H. Cho, B. Ravindran, and E. D. Jensen, "An optimal real-time scheduling algorithm for multiprocessors," in RTSS, 2006, pp. 101-110.
    • (2006) RTSS , pp. 101-110
    • Cho, H.1    Ravindran, B.2    Jensen, E.D.3
  • 8
    • 84884693359 scopus 로고    scopus 로고
    • Early-release fair scheduling
    • J. H. Anderson and A. Srinivasan, "Early-release fair scheduling," in ECRTS, 2000, pp. 35-43.
    • (2000) ECRTS , pp. 35-43
    • Anderson, J.H.1    Srinivasan, A.2
  • 9
    • 34547286633 scopus 로고    scopus 로고
    • Multiprocessor scheduling with few preemptions
    • B. Andersson and E. Tovar, "Multiprocessor scheduling with few preemptions," in RTCSA, 2006, pp. 322-334.
    • (2006) RTCSA , pp. 322-334
    • Andersson, B.1    Tovar, E.2
  • 10
    • 52049101764 scopus 로고    scopus 로고
    • Work-conserving optimal real-time scheduling on multiprocessors
    • K. Funaoka, S. Kato, and N. Yamasaki, "Work-conserving optimal real-time scheduling on multiprocessors," in ECRTS, 2008, pp. 13-22.
    • (2008) ECRTS , pp. 13-22
    • Funaoka, K.1    Kato, S.2    Yamasaki, N.3
  • 11
    • 52049084771 scopus 로고    scopus 로고
    • Sporadic multiprocessor scheduling with few preemptions
    • B. Andersson and K. Bletsas, "Sporadic multiprocessor scheduling with few preemptions," in ECRTS, 2008, pp. 243-252.
    • (2008) ECRTS , pp. 243-252
    • Andersson, B.1    Bletsas, K.2
  • 12
    • 68549125063 scopus 로고    scopus 로고
    • Optimal virtual cluster-based multiprocessor scheduling
    • A. Easwaran, I. Shin, and I. Lee, "Optimal virtual cluster-based multiprocessor scheduling," Real-Time Systems, vol. 43, no. 1, pp. 25-59, 2009.
    • (2009) Real-Time Systems , vol.43 , Issue.1 , pp. 25-59
    • Easwaran, A.1    Shin, I.2    Lee, I.3
  • 14
    • 24144439370 scopus 로고    scopus 로고
    • Comparison of deadline-based scheduling algorithms for periodic real-time tasks on multiprocessor
    • M. Park, S. Han, H. Kim, S. Cho, and Y. Cho, "Comparison of deadline-based scheduling algorithms for periodic real-time tasks on multiprocessor," IEICE Transaction on Information and Systems, vol. E88-D, pp. 658-661, 2005.
    • (2005) IEICE Transaction on Information and Systems , vol.E88-D , pp. 658-661
    • Park, M.1    Han, S.2    Kim, H.3    Cho, S.4    Cho, Y.5
  • 15
    • 0024933288 scopus 로고
    • Multiprocessor on-line scheduling of hard-real-time tasks
    • M. L. Dertouzos and A. K. Mok, "Multiprocessor on-line scheduling of hard-real-time tasks," IEEE Transactions on Software Engineering, vol. 15, pp. 1497-1506, 1989.
    • (1989) IEEE Transactions on Software Engineering , vol.15 , pp. 1497-1506
    • Dertouzos, M.L.1    Mok, A.K.2
  • 17
    • 0024774131 scopus 로고
    • A new algorithm for scheduling periodic, real-time tasks
    • J. Y.-T. Leung, "A new algorithm for scheduling periodic, real-time tasks," Algorithmica, vol. 4, pp. 209-219, 1989.
    • (1989) Algorithmica , vol.4 , pp. 209-219
    • Leung, J.Y.-T.1
  • 18
    • 84880861455 scopus 로고
    • Preemptively scheduling hard-real-time sporadic tasks on one processor
    • S. Baruah, A. Mok, and L. Rosier, "Preemptively scheduling hard-real-time sporadic tasks on one processor," in RTSS, 1990, pp. 182-190.
    • (1990) RTSS , pp. 182-190
    • Baruah, S.1    Mok, A.2    Rosier, L.3
  • 19
    • 33746717141 scopus 로고    scopus 로고
    • Improved schedulability analysis of EDF on multiprocessor platforms
    • M. Bertogna, M. Cirinei, and G. Lipari, "Improved schedulability analysis of EDF on multiprocessor platforms," in ECRTS, 2005, pp. 209-218.
    • (2005) ECRTS , pp. 209-218
    • Bertogna, M.1    Cirinei, M.2    Lipari, G.3
  • 21
    • 48649089958 scopus 로고    scopus 로고
    • Response-time analysis for globally scheduled symmetric multiprocessor platforms
    • M. Bertogna and M. Cirinei, "Response-time analysis for globally scheduled symmetric multiprocessor platforms," in RTSS, 2007, pp. 149-160.
    • (2007) RTSS , pp. 149-160
    • Bertogna, M.1    Cirinei, M.2
  • 22
    • 53549097658 scopus 로고    scopus 로고
    • Global EDF-based scheduling with efficient priority promotion
    • S. Kato and N. Yamasaki, "Global EDF-based scheduling with efficient priority promotion," in RTCSA, 2008, pp. 197-206.
    • (2008) RTCSA , pp. 197-206
    • Kato, S.1    Yamasaki, N.2
  • 23
    • 77955922215 scopus 로고    scopus 로고
    • Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
    • N. Fisher, J. Goossens, and S. Baruah, "Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible," Real-Time Systems, vol. 45, pp. 26-71, 2010.
    • (2010) Real-Time Systems , vol.45 , pp. 26-71
    • Fisher, N.1    Goossens, J.2    Baruah, S.3
  • 24
    • 0042209421 scopus 로고    scopus 로고
    • Optimal time-critical scheduling via resource augmentation
    • C. Phillips, C. Stein, E. Torng, and J. Wein, "Optimal time-critical scheduling via resource augmentation," Algorithmica, vol. 32, pp. 163-200, 2002.
    • (2002) Algorithmica , vol.32 , pp. 163-200
    • Phillips, C.1    Stein, C.2    Torng, E.3    Wein, J.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.