메뉴 건너뛰기




Volumn , Issue , 2002, Pages 11-18

Schedulability analysis of window-constrained execution time tasks for real-time control

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION TIME; CONTROLLER PARAMETER; DYNAMIC-PRIORITY SCHEDULING; FEASIBILITY TESTS; HARD REAL-TIME SYSTEMS; OPERATING CONDITION; SCHEDULABILITY ANALYSIS; TASK ACTIVATIONS;

EID: 77955445383     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMRTS.2002.1019181     Document Type: Conference Paper
Times cited : (20)

References (14)
  • 2
    • 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 IEEE Real-Time Systems Symposium, pages 182-190, 1990.
    • (1990) IEEE Real-Time Systems Symposium , pp. 182-190
    • Baruah, S.1    Mok, A.2    Rosier, L.3
  • 3
    • 0038525587 scopus 로고    scopus 로고
    • PhD thesis, Universitat de les Illes Balears, Departament de Ciencies Matematiques i Informatica, Enero
    • G. Bernat. Specification and analysis of weakly hard real-time systems. PhD thesis, Universitat de les Illes Balears, Departament de Ciencies Matematiques i Informatica, Enero 1998.
    • (1998) Specification and Analysis of Weakly Hard Real-time Systems
    • Bernat, G.1
  • 6
    • 0002792672 scopus 로고
    • Control robotics: The procedural control of physical processors
    • M. Dertouzos. Control robotics: the procedural control of physical processors. In IFIP Congress, pages 807-813, 1974.
    • (1974) IFIP Congress , pp. 807-813
    • Dertouzos, M.1
  • 7
    • 0024915921 scopus 로고
    • The rate monotonic scheduling algorithm: Exact characterization and average case behaviour
    • J. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behaviour. In IEEE Real-Time Systems Symposium, pages 166-171, 1989.
    • (1989) IEEE Real-Time Systems Symposium , pp. 166-171
    • Lehoczky, J.1    Sha, L.2    Ding, Y.3
  • 8
    • 84976788276 scopus 로고
    • A note on the preemptive scheduling of periodic, real-time tasks
    • J. Leung and R. Merrill. A note on the preemptive scheduling of periodic, real-time tasks. Information Processing Letters, 18:115-118, 1980.
    • (1980) Information Processing Letters , vol.18 , pp. 115-118
    • Leung, J.1    Merrill, R.2
  • 9
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a hardreal-time environment
    • C. Liu and J.W.Layland. Scheduling algorithms for multiprogramming in a hardreal-time environment. JACM, 23:46-68, 1973.
    • (1973) JACM , vol.23 , pp. 46-68
    • Liu, C.1    Layland, J.W.2
  • 10
    • 0030196996 scopus 로고    scopus 로고
    • Improvement in feasibility testing for real-time tasks
    • I. Ripoll, A. Crespo, and A. Mok. Improvement in feasibility testing for real-time tasks. Journal of Real-Time Systems, 11:19-40, 1996.
    • (1996) Journal of Real-Time Systems , vol.11 , pp. 19-40
    • Ripoll, I.1    Crespo, A.2    Mok, A.3
  • 11
    • 0032296746 scopus 로고
    • Task period selection and schedulability in real-time systems
    • D. Seto, J. Lehoczky, and L. Sha. Task period selection and schedulability in real-time systems. In IEEE Real-Time Systems Symposium, pages 188-198, 1989.
    • (1989) IEEE Real-Time Systems Symposium , pp. 188-198
    • Seto, D.1    Lehoczky, J.2    Sha, L.3
  • 13
    • 0028413120 scopus 로고
    • Fixed-priority sensitivity analysis for linear compute time models
    • April
    • S. Vestal. Fixed-priority sensitivity analysis for linear compute time models. IEEE Transactions on Software Engineering, 20(4):308-317, April 1994.
    • (1994) IEEE Transactions on Software Engineering , vol.20 , Issue.4 , pp. 308-317
    • Vestal, S.1


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