메뉴 건너뛰기




Volumn , Issue , 2011, Pages 125-135

Is semi-partitioned scheduling practical?

Author keywords

implementation study; multiprocessor real time scheduling; real time systems; schedulability; semi partitioned scheduling

Indexed keywords

EXPERIMENTAL COMPARISON; IMPLEMENTATION STUDY; REAL TIME SCHEDULING; REAL-TIME SCHEDULING ALGORITHMS; SCHEDULABILITY; SEMI-PARTITIONED SCHEDULING;

EID: 80053027129     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECRTS.2011.20     Document Type: Conference Paper
Times cited : (73)

References (32)
  • 2
    • 38749117531 scopus 로고    scopus 로고
    • An EDF-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems
    • DOI 10.1007/s11241-007-9035-0
    • J. Anderson, V. Bud, and U. Devi. An EDF-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems. Real-Time Syst., 38:85-131, 2008. (Pubitemid 351177440)
    • (2008) Real-Time Systems , vol.38 , Issue.2 , pp. 85-131
    • Anderson, J.H.1    Bud, V.2    Devi, U.C.3
  • 9
    • 79951790068 scopus 로고    scopus 로고
    • An empirical comparison of global, partitioned, and clustered multiprocessor EDF schedulers
    • A. Bastoni, B. Brandenburg, and J. Anderson. An empirical comparison of global, partitioned, and clustered multiprocessor EDF schedulers. In Proc. of the 31st Real-Time Sys. Symp., pp. 14-24, 2010.
    • (2010) Proc. of the 31st Real-Time Sys. Symp. , pp. 14-24
    • Bastoni, A.1    Brandenburg, B.2    Anderson, J.3
  • 11
    • 77649285842 scopus 로고    scopus 로고
    • Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
    • K. Bletsas and B. Andersson. Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound. In Proc. of the 30th Real-Time Sys. Symp., pp. 447-456, 2009.
    • (2009) Proc. of the 30th Real-Time Sys. Symp. , pp. 447-456
    • Bletsas, K.1    Andersson, B.2
  • 14
    • 67249130359 scopus 로고    scopus 로고
    • On the scalability of real-time scheduling algorithms on multicore platforms: A case study
    • B. Brandenburg, J. Calandrino, and J. Anderson. On the scalability of real-time scheduling algorithms on multicore platforms: A case study. In Proc. of the 29th Real-Time Sys. Symp., pp. 157-169, 2008.
    • (2008) Proc. of the 29th Real-Time Sys. Symp. , pp. 157-169
    • Brandenburg, B.1    Calandrino, J.2    Anderson, J.3
  • 19
    • 35348814541 scopus 로고    scopus 로고
    • PhD thesis, University of North Carolina, Chapel Hill, North Carolina
    • U. Devi. Soft Real-Time Scheduling on Multiprocessors. PhD thesis, University of North Carolina, Chapel Hill, North Carolina, 2006.
    • (2006) Soft Real-Time Scheduling on Multiprocessors
    • Devi, U.1
  • 27
    • 77149167575 scopus 로고    scopus 로고
    • Generalized tardiness bounds for global multiprocessor scheduling
    • February
    • H. Leontyev and J. Anderson. Generalized tardiness bounds for global multiprocessor scheduling. Real-Time Sys., 44(1):26-71, February 2010.
    • (2010) Real-Time Sys. , vol.44 , Issue.1 , pp. 26-71
    • Leontyev, H.1    Anderson, J.2
  • 31
    • 84863035627 scopus 로고    scopus 로고
    • UNC Real-Time Group
    • RT homepage. http://www.cs. unc.edu/~anderson/litmus-rt.
    • RT Homepage


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