메뉴 건너뛰기




Volumn , Issue , 2011, Pages 162-171

On the tractability of digraph-based task models

Author keywords

feasibility; real time task models; schedulability; tractability

Indexed keywords

FEASIBILITY; FEASIBILITY ANALYSIS; FEASIBILITY PROBLEM; FORMAL ANALYSIS; GLOBAL CONSTRAINTS; PERIODIC TASKS; REAL-TIME TASKS; SCHEDULABILITY; SYSTEM MODELS; TASK MODELS; TIMING CONSTRAINTS; TRACTABILITY; UNIPROCESSORS;

EID: 80053035836     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECRTS.2011.23     Document Type: Conference Paper
Times cited : (27)

References (8)
  • 1
    • 84974687699 scopus 로고
    • Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
    • C. L. Liu and J. W. Layland, "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment," J. ACM, vol. 20, no. 1, pp. 46-61, 1973.
    • (1973) J. ACM , vol.20 , Issue.1 , pp. 46-61
    • Liu, C.L.1    Layland, J.W.2
  • 4
    • 0037269099 scopus 로고    scopus 로고
    • Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks
    • S. K. Baruah, "Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks," Real-Time Syst., vol. 24, no. 1, pp. 93-128, 2003.
    • (2003) Real-Time Syst. , vol.24 , Issue.1 , pp. 93-128
    • Baruah, S.K.1
  • 5
    • 68249132870 scopus 로고    scopus 로고
    • Task automata: Schedulability, decidability and undecidability
    • E. Fersman, P. Krcal, P. Pettersson, and W. Yi, "Task automata: Schedulability, decidability and undecidability," Inf. Comput., vol. 205, no. 8, pp. 1149-1172, 2007.
    • (2007) Inf. Comput. , vol.205 , Issue.8 , pp. 1149-1172
    • Fersman, E.1    Krcal, P.2    Pettersson, P.3    Yi, W.4
  • 6
    • 49649106480 scopus 로고    scopus 로고
    • Compositional Feasibility Analysis of Conditional Real-Time Task Models
    • M. Anand, A. Easwaran, S. Fischmeister, and I. Lee, "Compositional Feasibility Analysis of Conditional Real-Time Task Models," in Proc. of ISORC 2008, pp. 391-398.
    • Proc. of ISORC 2008 , pp. 391-398
    • Anand, M.1    Easwaran, A.2    Fischmeister, S.3    Lee, I.4
  • 7
    • 77951682300 scopus 로고    scopus 로고
    • EDF-schedulability of synchronous periodic task systems is coNP-hard
    • F. Eisenbrand and T. Rothvoß, "EDF-schedulability of synchronous periodic task systems is coNP-hard," in Proc. of SODA 2010, pp. 1029-1034.
    • Proc. of SODA 2010 , pp. 1029-1034
    • Eisenbrand, F.1    Rothvoß, T.2
  • 8
    • 0003037529 scopus 로고
    • Reducibility among Combinatorial Problems
    • R. Miller and J. Thatcher, Eds. Plenum Press
    • R. Karp, "Reducibility Among Combinatorial Problems," in Complexity of Computer Computations, R. Miller and J. Thatcher, Eds. Plenum Press, 1972, pp. 85-103.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.1


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