메뉴 건너뛰기




Volumn , Issue , 2010, Pages 301-310

Scheduling dependent periodic tasks without synchronization mechanisms

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATING TASKS; DEPENDENT TASKS; FIXED PRIORITY SCHEDULING; PERIODIC TASKS; PRECEDENCE CONSTRAINTS; RELEASE TIME; SCHEDULING POLICIES; SYNCHRONIZATION MECHANISMS;

EID: 77953859582     PISSN: 10801812     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTAS.2010.26     Document Type: Conference Paper
Times cited : (65)

References (18)
  • 2
    • 77953819354 scopus 로고    scopus 로고
    • RTEMS, Edition 4.9.2, for RTEMS 4.9.2, OAR Corporation
    • RTEMS, RTEMS C user's guide, Edition 4.9.2, for RTEMS 4.9.2, OAR Corporation, 2009.
    • (2009) RTEMS C User's Guide
  • 5
    • 34547453769 scopus 로고    scopus 로고
    • A memory-optimal buffering protocol for preservation of synchronous semantics under preemptive scheduling
    • Seoul, South Korea, Oct.
    • C. Sofronis, S. Tripakis, and P. Caspi, "A memory-optimal buffering protocol for preservation of synchronous semantics under preemptive scheduling," in Sixth International Conference on Embedded Software (EMSOFT'06), Seoul, South Korea, Oct. 2006.
    • (2006) Sixth International Conference on Embedded Software (EMSOFT'06)
    • Sofronis, C.1    Tripakis, S.2    Caspi, P.3
  • 8
    • 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," Journal of the ACM, vol. 20, no. 1, 1973.
    • (1973) Journal of the ACM , vol.20 , Issue.1
    • Liu, C.L.1    Layland, J.W.2
  • 11
    • 0001552016 scopus 로고
    • Dynamic scheduling of real-time tasks under precedence constraints
    • H. Chetto, M. Silly, and T. Bouchentouf, "Dynamic scheduling of real-time tasks under precedence constraints," Real-Time Systems, vol. 2, 1990.
    • (1990) Real-time Systems , vol.2
    • Chetto, H.1    Silly, M.2    Bouchentouf, T.3
  • 12
    • 77953868964 scopus 로고    scopus 로고
    • Validation temporelle d'un logiciel temps réel : Application un laminoir industriel
    • P. Richard, F. Cottet, and C. Kaiser, "Validation temporelle d'un logiciel temps réel : application un laminoir industriel," Journal Européen des Systèmes Automatisés, vol. 35, no. 9, 2001.
    • (2001) Journal Européen des Systèmes Automatisés , vol.35 , Issue.9
    • Richard, P.1    Cottet, F.2    Kaiser, C.3
  • 13
    • 0014477093 scopus 로고
    • Bounds on multiprocessing timing anomalies
    • Mar.
    • R. L. Graham, "Bounds on multiprocessing timing anomalies," SIAM Journal on Applied Mathematics, vol. 17, no. 2, Mar. 1969.
    • (1969) SIAM Journal on Applied Mathematics , vol.17 , Issue.2
    • Graham, R.L.1
  • 15
    • 0020271514 scopus 로고
    • On the complexity of fixedpriority scheduling of periodic, real-time tasks
    • J. Y. T. Leung and J. Whitehead, "On the complexity of fixedpriority scheduling of periodic, real-time tasks," Performance Evaluation, vol. 2, no. 4, 1982.
    • (1982) Performance Evaluation , vol.2 , Issue.4
    • Leung, J.Y.T.1    Whitehead, J.2
  • 16
    • 0022796618 scopus 로고
    • Finding response times in real-time system
    • M. Joseph and P. Pandya, "Finding response times in real-time system," The Computer Journal, vol. 29(5), pp. 390-395, 1986.
    • (1986) The Computer Journal , vol.29 , Issue.5 , pp. 390-395
    • Joseph, M.1    Pandya, P.2
  • 17
    • 74549180659 scopus 로고    scopus 로고
    • Cheddar: A flexible real time scheduling framework
    • F. Singhoff, J. Legrand, L. Nana, and L. Marcé, "Cheddar: a flexible real time scheduling framework," Ada Lett., vol. XXIV, no. 4, 2004.
    • (2004) Ada Lett. , vol.XXIV , Issue.4
    • Singhoff, F.1    Legrand, J.2    Nana, L.3    Marcé, L.4
  • 18
    • 0004070775 scopus 로고
    • Optimal priority assignment and feasibility of static priority tasks with arbitrary start times
    • N. C. Audsley, Dept. Computer Science, Dec.
    • N. C. Audsley, "Optimal priority assignment and feasibility of static priority tasks with arbitrary start times," Dept. Computer Science, University of York, Tech. Rep. YCS 164, Dec. 1991.
    • (1991) Tech. Rep. YCS 164, University of York


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