메뉴 건너뛰기




Volumn , Issue , 1999, Pages 242-249

QoS guarantee using probabilistic deadlines

Author keywords

[No Author keywords available]

Indexed keywords

ABSOLUTE DEADLINES; PROBABILISTIC APPROACHES; QOS GUARANTEE; SCHEDULABILITY ANALYSIS; STATISTICAL GUARANTEE; SYSTEM RESOURCES; TASK INSTANCE;

EID: 78650905464     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMRTS.1999.777471     Document Type: Conference Paper
Times cited : (69)

References (24)
  • 4
    • 0031373950 scopus 로고    scopus 로고
    • Exploiting skips in periodic tasks for enhancing aperiodic responsiveness
    • San Francisco
    • M. Caccamo and G. Buttazzo. Exploiting skips in periodic tasks for enhancing aperiodic responsiveness. In IEEE Real-Time Systems Symposium, pages 330-339, San Francisco, 1997.
    • (1997) IEEE Real-Time Systems Symposium , pp. 330-339
    • Caccamo, M.1    Buttazzo, G.2
  • 6
    • 0029345475 scopus 로고
    • Aperiodic servers in a deadline scheduling environment
    • T. M. Ghazalie and T. Baker. Aperiodic servers in a deadline scheduling environment. Real-Time Systems, 9, 1995.
    • (1995) Real-Time Systems , pp. 9
    • Ghazalie, T.M.1    Baker, T.2
  • 7
    • 0024937041 scopus 로고
    • Performance analysis of minimum laxity and earliest deadline scheduling in a real-time system
    • DOI 10.1109/12.40851
    • J. Hong, X. Tan, and D. Towsley. A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system. IEEE TRANSACTIONS ON COMPUTERS, 38(12):1736-1744, December 1989. (Pubitemid 20642733)
    • (1989) IEEE Transactions on Computers , vol.38 , Issue.12 , pp. 1736-1744
    • Hong, J.1    Tan, X.2    Towsley, D.3
  • 16
    • 0020271514 scopus 로고
    • On the complexity of fixed priority scheduling of periodic real-time tasks
    • J. Leung and J. W. Whitehead. On the complexity of fixed priority scheduling of periodic real-time tasks. Performance Evaluation, 2(4), 1982.
    • (1982) Performance Evaluation , vol.2 , Issue.4
    • Leung, J.1    Whitehead, J.W.2
  • 17
    • 84974687699 scopus 로고
    • Scheduling alghorithms for multiprogramming in a hard real-time environment
    • C. L. Liu and J. Layland. Scheduling alghorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1), 1973.
    • (1973) Journal of the ACM , vol.20 , Issue.1
    • Liu, C.L.1    Layland, J.2
  • 18
    • 84938157299 scopus 로고
    • A dynamic priority assignment technique for streams with (m,k)-firm deadlines
    • december
    • P. R. M. Hamdaoui. A dynamic priority assignment technique for streams with (m,k)-firm deadlines. IEEE TRANSACTIONS ON COMPUTERS, 44(12):1443-1451, december 1995.
    • (1995) IEEE TRANSACTIONS ON COMPUTERS , vol.44 , Issue.12 , pp. 1443-1451
    • Hamdaoui, P.R.M.1
  • 22
    • 0030109034 scopus 로고    scopus 로고
    • Scheduling aperiodic tasks in dynamic priority systems
    • M. Spuri and G. Buttazzo. Scheduling aperiodic tasks in dynamic priority systems. Real-Time Systems, 10(2), 1996.
    • (1996) Real-Time Systems , vol.10 , Issue.2
    • Spuri, M.1    Buttazzo, G.2


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