메뉴 건너뛰기




Volumn 58, Issue 5, 2009, Pages 634-647

A safe stochastic analysis with relaxed limitations on the periodic task model

Author keywords

Periodic task model; Real time and embedded systems; Scheduling; Stochastic analysis; Worst case analysis

Indexed keywords

A-PRIORI; EXECUTION TIME; PERIODIC TASK MODEL; PHASE COMBINATIONS; PRACTICAL USE; PRIORITY SCHEDULING; REAL-TIME AND EMBEDDED SYSTEMS; RELATIVE PHASIS; RELEASE TIME; RUN-TIME; STOCHASTIC ANALYSIS; TASK INSTANCES; UTILIZATION FACTORS; WORST CASE; WORST CASE ANALYSIS;

EID: 65449149432     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2008.208     Document Type: Article
Times cited : (4)

References (23)
  • 3
    • 84869593060 scopus 로고    scopus 로고
    • New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
    • Dec
    • A. Burchard, J. Liebeherr, Y. Oh, and S.H. Son, "New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems," IEEE Trans. Computers, vol. 44, no. 12, pp. 1429-1442, Dec. 1996.
    • (1996) IEEE Trans. Computers , vol.44 , Issue.12 , pp. 1429-1442
    • Burchard, A.1    Liebeherr, J.2    Oh, Y.3    Son, S.H.4
  • 4
    • 0344794029 scopus 로고    scopus 로고
    • Integrated Control and Real-Time Scheduling,
    • PhD thesis, Lund Inst. of Technology
    • A. Cervin, "Integrated Control and Real-Time Scheduling," PhD thesis, Lund Inst. of Technology, 2003.
    • (2003)
    • Cervin, A.1
  • 6
    • 4243470646 scopus 로고    scopus 로고
    • Probabilistic Analysis and Scheduling of Critical Soft Real-Time Systems,
    • PhD thesis, School of Computer Science, Univ. of Illinois
    • M.K. Gardner, "Probabilistic Analysis and Scheduling of Critical Soft Real-Time Systems," PhD thesis, School of Computer Science, Univ. of Illinois, 1999.
    • (1999)
    • Gardner, M.K.1
  • 7
    • 0002769866 scopus 로고    scopus 로고
    • A Better Polynomial-Time Schedulability Test for Real-Time Fixed-Priority Scheduling Algorithms
    • 97, Dec
    • C.-C. Han and H.-Y. Tyan, "A Better Polynomial-Time Schedulability Test for Real-Time Fixed-Priority Scheduling Algorithms," Proc. 18th IEEE Real-Time Systems Symp. (RTSS '97), Dec. 1997.
    • (1997) Proc. 18th IEEE Real-Time Systems Symp. (RTSS
    • Han, C.-C.1    Tyan, H.-Y.2
  • 8
    • 28244469648 scopus 로고    scopus 로고
    • An Exact Stochastic Analysis of Priority-Driven Periodic Real-Time Systems and Its Approximations
    • Nov
    • K. Kim, J.L. Díaz, L. LoBello, J.M. López, C.-G. Lee, and S.L. Min, "An Exact Stochastic Analysis of Priority-Driven Periodic Real-Time Systems and Its Approximations," IEEE Trans. Computers, vol. 54, no. 11, pp. 1460-1466, Nov. 2005.
    • (2005) IEEE Trans. Computers , vol.54 , Issue.11 , pp. 1460-1466
    • Kim, K.1    Díaz, J.L.2    LoBello, L.3    López, J.M.4    Lee, C.-G.5    Min, S.L.6
  • 10
    • 1342323877 scopus 로고    scopus 로고
    • Enhanced Utilization Bounds for QoS Management
    • Feb
    • C.-G. Lee, L. Sha, and A. Peddi, "Enhanced Utilization Bounds for QoS Management," IEEE Trans. Computers, vol. 53, no. 2, pp. 187-200, Feb. 2004.
    • (2004) IEEE Trans. Computers , vol.53 , Issue.2 , pp. 187-200
    • Lee, C.-G.1    Sha, L.2    Peddi, A.3
  • 11
    • 84880911285 scopus 로고
    • Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines
    • 90, pp, Dec
    • J.P. Lehoczky, "Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines," Proc. 11th IEEE Real-Time Systems Symp. (RTSS '90), pp. 201-209, Dec. 1990.
    • (1990) Proc. 11th IEEE Real-Time Systems Symp. (RTSS , pp. 201-209
    • Lehoczky, J.P.1
  • 14
    • 0024915921 scopus 로고
    • The Rate-Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior
    • 89, Dec
    • J.P. Lehoczky, L. Sha, and Y. Ding, "The Rate-Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior," Proc. 10th IEEE Real-Time Systems Symp. (RTSS '89), Dec. 1989.
    • (1989) Proc. 10th IEEE Real-Time Systems Symp. (RTSS
    • Lehoczky, J.P.1    Sha, L.2    Ding, Y.3
  • 16
    • 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, vol. 2, no. 4, pp. 237-250, 1982.
    • (1982) Performance Evaluation , vol.2 , Issue.4 , pp. 237-250
    • Leung, J.1    Whitehead, J.2
  • 17
    • 84974687699 scopus 로고
    • Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment
    • L. Liu and J. 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, L.1    Layland, J.2
  • 18
    • 84884686656 scopus 로고    scopus 로고
    • Memory and Time-Efficient Schedulability Analysis of Task Sets with Stochastic Execution Times
    • June
    • S. Manolache, P. Eles, and Z. Peng, "Memory and Time-Efficient Schedulability Analysis of Task Sets with Stochastic Execution Times," Proc. 13th Euromicro Conf. Real-Time Systems (ECRTS '01), pp. 19-26, June 2001.
    • (2001) Proc. 13th Euromicro Conf. Real-Time Systems (ECRTS '01) , pp. 19-26
    • Manolache, S.1    Eles, P.2    Peng, Z.3


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