메뉴 건너뛰기




Volumn , Issue , 2008, Pages 375-384

A unified hard/soft real-time schedulability test for global EDF multiprocessor scheduling

Author keywords

[No Author keywords available]

Indexed keywords

EARLIEST DEADLINE FIRST; HARD REAL-TIME; MULTI PROCESSOR SCHEDULING; NON-PREEMPTIVE; PSEUDO-POLYNOMIAL TIME COMPLEXITY; SCHEDULABILITY TEST; SOFT REAL TIME;

EID: 67249139393     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2008.15     Document Type: Conference Paper
Times cited : (24)

References (10)
  • 1
    • 35348820736 scopus 로고    scopus 로고
    • A comparison of global and partitioned EDF schedulability tests for multiprocessors
    • Florida State University
    • T. Baker. A comparison of global and partitioned EDF schedulability tests for multiprocessors. Technical Report TR-051101, Department of Computer Science, Florida State University, 2005.
    • (2005) Technical Report TR-051101, Department of Computer Science
    • Baker, T.1
  • 2
    • 0346935131 scopus 로고    scopus 로고
    • Multiprocessor EDF and deadline monotonic schedulability analysis
    • Dec.
    • T. P. Baker. Multiprocessor EDF and deadline monotonic schedulability analysis. In Proc. of the 24th IEEE Real-Time Systems Symposium, pages 120-129, Dec. 2003.
    • (2003) Proc. of the 24th IEEE Real-Time Systems Symposium , pp. 120-129
    • Baker, T.P.1
  • 3
    • 33746932478 scopus 로고    scopus 로고
    • The non-preemptive scheduling of periodic tasks upon multiprocessors
    • DOI 10.1007/s11241-006-4961-9
    • S. Baruah. The non-preemptive scheduling of periodic tasks upon multiprocessors. Real-time Systems, 32:9-20, 2006. (Pubitemid 44198100)
    • (2006) Real-Time Systems , vol.32 , Issue.1-2 , pp. 9-20
    • Baruah, S.K.1
  • 4


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