메뉴 건너뛰기




Volumn , Issue , 2003, Pages 13-22

Initial values for online response time calculations

Author keywords

best case response times; fixed priority preemptive schedule; initial value; iterative procedure; periodic tasks; real time systems; worst case response times

Indexed keywords

BEST-CASE RESPONSE TIMES; FIXED PRIORITY PREEMPTIVE; INITIAL VALUE; PERIODIC TASKS; WORST-CASE RESPONSE TIMES;

EID: 33751054767     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMRTS.2003.1212722     Document Type: Conference Paper
Times cited : (21)

References (26)
  • 3
    • 34249956267 scopus 로고
    • Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
    • S.K. Baruah, L.E. Rosier, and R.R. Howell, "Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor," Real-Time Systems, Vol. 2, pp. 301-324, 1990.
    • (1990) Real-Time Systems , vol.2 , pp. 301-324
    • Baruah, S.K.1    Rosier, L.E.2    Howell, R.R.3
  • 8
    • 84884684705 scopus 로고    scopus 로고
    • Best-case response times and jitter analysis of real-time tasks
    • Accepted by Special Issue of Selected Papers for the 2001 Philips Workshop on Scheduling and Resource Management, August
    • R.J. Bril, E.F.M. Steffens, and W.F.J. Verhaegh, "Best-case response times and jitter analysis of real-time tasks," Accepted by Journal of Scheduling- Special Issue of Selected Papers for the 2001 Philips Workshop on Scheduling and Resource Management, August 2001.
    • (2001) Journal of Scheduling
    • Bril, R.J.1    Steffens, E.F.M.2    Verhaegh, W.F.J.3
  • 12
    • 0022796618 scopus 로고
    • FINDING RESPONSE TIMES IN A REAL-TIME SYSTEM
    • M. Joseph and P. Pandya, "Finding response times in a real-time system," The Computer Journal, 27(5): 390-395, 1986. (Pubitemid 17463568)
    • (1986) Computer Journal , vol.29 , Issue.5 , pp. 390-395
    • Joseph, M.1    Pandya, P.2
  • 18
    • 0020271514 scopus 로고
    • ON THE COMPLEXITY OF FIXED-PRIORITY SCHEDULING OF PERIODIC, REAL-TIME TASKS
    • DOI 10.1016/0166-5316(82)90024-4
    • J.Y.T. Leung and J. Whitehead, "On the complexity of fixed-priority scheduling of periodic, real-time tasks," Performance Evaluation, 2(4): 237-250, December 1982. (Pubitemid 13487696)
    • (1982) Performance Evaluation , vol.2 , Issue.4 , pp. 237-250
    • Leung, J.Y.T.1    Whitehead, J.2
  • 19
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a real-time environment
    • C.L. Liu and J.W. Layland, "Scheduling algorithms for multiprogramming in a real-time environment," Journal of the ACM, 20(1): 46-61, 1973.
    • (1973) Journal of the ACM , vol.20 , Issue.1 , pp. 46-61
    • Liu, C.L.1    Layland, J.W.2
  • 24
    • 0025488794 scopus 로고
    • Priority inheritance protocols: An approach to real-time synchronisation
    • September
    • L. Sha, R. Rajkumar, and J.P. Lehoczky, "Priority inheritance protocols: an approach to real-time synchronisation," IEEE Transactions on Computers, 39(9): 1175-1185, September 1990.
    • (1990) IEEE Transactions on Computers , vol.39 , Issue.9 , pp. 1175-1185
    • Sha, L.1    Rajkumar, R.2    Lehoczky, J.P.3
  • 26
    • 0028396945 scopus 로고
    • An extendible approach for analyzing fixed priority hard real-time tasks
    • K.W. Tindell, A. Burns, and A.J. Wellings, "An extendible approach for analyzing fixed priority hard real-time tasks," Real-Time Systems, 6(2): 133-151, 1994.
    • (1994) Real-Time Systems , vol.6 , Issue.2 , pp. 133-151
    • Tindell, K.W.1    Burns, A.2    Wellings, A.J.3


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