메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 157-166

Uniprocessor scheduling under precedence constraints

Author keywords

[No Author keywords available]

Indexed keywords

DATA-FLOW/EVENT-DRIVEN REAL-TIME SYSTEMS; DEADLINE ASSIGNMENTS; OPTIMUM PRIORITY; REAL-TIME EMBEDDED CONTROLLERS;

EID: 33749630767     PISSN: 15453421     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTAS.2006.44     Document Type: Conference Paper
Times cited : (6)

References (13)
  • 1
    • 84884373193 scopus 로고    scopus 로고
    • An analysis of fixed-priority scheduling
    • Florida State University, jun
    • T. Baker. An analysis of fixed-priority scheduling, TR-050201, Florida State University, jun 2005.
    • (2005) TR-050201
    • Baker, T.1
  • 3
    • 0042850516 scopus 로고    scopus 로고
    • Rate monotonic analysis: The hyperbolic bound
    • jul
    • E. Bini and G. Buttazzo. Rate monotonic analysis: The hyperbolic bound. IEEE Transactions on Computers, 52(7):933-942, jul 2003.
    • (2003) IEEE Transactions on Computers , vol.52 , Issue.7 , pp. 933-942
    • Bini, E.1    Buttazzo, G.2
  • 4
    • 8744284409 scopus 로고    scopus 로고
    • Schedulability analysis of periodic fixed priority systems
    • nov
    • E. Bini and G. Buttazzo. Schedulability analysis of periodic fixed priority systems. IEEE Transactions on Computers, 53(11): 1462-1473, nov 2004.
    • (2004) IEEE Transactions on Computers , vol.53 , Issue.11 , pp. 1462-1473
    • Bini, E.1    Buttazzo, G.2
  • 5
    • 10444267328 scopus 로고    scopus 로고
    • Rate monotonic vs. edf: Judgement day
    • jan
    • G. Buttazzo. Rate monotonic vs. edf: Judgement day. Real Time Systems, 29(1):5-26, jan 2005.
    • (2005) Real Time Systems , vol.29 , Issue.1 , pp. 5-26
    • Buttazzo, G.1
  • 6
    • 33749585328 scopus 로고    scopus 로고
    • Multiprocessor scheduling under precedence constraints: Polyhedral results
    • oct
    • P. Coll, C. Ribeiro, and C. Souza. Multiprocessor scheduling under precedence constraints: Polyhedral results. In Optimization Online Digest, oct 2003.
    • (2003) Optimization Online Digest
    • Coll, P.1    Ribeiro, C.2    Souza, C.3
  • 8
    • 0020271514 scopus 로고
    • On the complexity of fixed-priority scheduling of periodic, real-time tasks
    • J. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation (Netherlands), 2(4):237-250, 1982.
    • (1982) Performance Evaluation (Netherlands) , vol.2 , Issue.4 , pp. 237-250
    • Leung, J.1    Whitehead, J.2
  • 10
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a hard real-time environment
    • Jan.
    • C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):44-61, Jan. 1973.
    • (1973) Journal of the ACM , vol.20 , Issue.1 , pp. 44-61
    • Liu, C.1    Layland, J.2
  • 11
    • 84926398107 scopus 로고    scopus 로고
    • Approximation bounds for a general class of precedence constrained parallel machine scheduling problems
    • A. Munier, M. Queyranne, and A. Schulz. Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. In IPCO, 1998.
    • (1998) IPCO
    • Munier, A.1    Queyranne, M.2    Schulz, A.3
  • 13
    • 0028732297 scopus 로고
    • How to integrate precedence constraints and shared resources in real-time scheduling
    • dec
    • M. Spuri and J. Stankovic. How to integrate precedence constraints and shared resources in real-time scheduling. IEEE Transactions on Computers, 43(12): 1407-1412, dec 1994.
    • (1994) IEEE Transactions on Computers , vol.43 , Issue.12 , pp. 1407-1412
    • Spuri, M.1    Stankovic, J.2


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