메뉴 건너뛰기




Volumn , Issue , 2007, Pages

Dealing with execution-overruns to improve the temporal robustness of real-time systems scheduled FP and EDF

Author keywords

Allowance; EDF; Fault prevention; Feasibility analysis; FP HPF; Worst case response time

Indexed keywords

LIGHTING FIXTURES; MECHANISMS; PRODUCTION CONTROL; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING; SOLUTIONS; WEIGHT CONTROL;

EID: 46349108775     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICONS.2007.18     Document Type: Conference Paper
Times cited : (14)

References (18)
  • 1
    • 84974687699 scopus 로고
    • Scheduling Algorithms for multiprogramming in a Hard Real Time Environment
    • Journal of Association for Computing Machinery, No1, Janv
    • C.L Lui, and James W. Layland, "Scheduling Algorithms for multiprogramming in a Hard Real Time Environment", Journal of Association for Computing Machinery, Vol. 20, No1, Janv 1973
    • (1973) , vol.20
    • Lui, C.L.1    Layland, J.W.2
  • 2
    • 0031186994 scopus 로고    scopus 로고
    • Computing maximum task execution times - a graph based approach
    • Kluwer Academic Publishers
    • P. Puschner and A. V. Schedl, "Computing maximum task execution times - a graph based approach.,", In Proc. IEEE Real-Time Systems Symposium, volume 13, pp. 67-91. Kluwer Academic Publishers, 1997.
    • (1997) Proc. IEEE Real-Time Systems Symposium , vol.13 , pp. 67-91
    • Puschner, P.1    Schedl, A.V.2
  • 4
    • 0347116648 scopus 로고    scopus 로고
    • Fault Tolerance in Fixed-Priority Hard Real-Time Distributed Systems
    • PhD thesis, Department of Computer Science, YO10 5DD, UK, University of York
    • G. M. A. Lima, "Fault Tolerance in Fixed-Priority Hard Real-Time Distributed Systems", PhD thesis, Department of Computer Science, YO10 5DD, UK, University of York, 2003.
    • (2003)
    • Lima, G.M.A.1
  • 6
    • 0003744646 scopus 로고
    • Best effort decision making for real-time scheduling
    • PhD thesis, Computer science department, Carnegie-Mellon University
    • C.J. Locke, "Best effort decision making for real-time scheduling", PhD thesis, Computer science department, Carnegie-Mellon University, 1986.
    • (1986)
    • Locke, C.J.1
  • 8
    • 50149098045 scopus 로고
    • D-over: An Optimal On-line Scheduling Algorithm for over loaded real-time system
    • INRIA, Feb
    • G. Koren and D. Shasha, "D-over: An Optimal On-line Scheduling Algorithm for over loaded real-time system", Technique report 138, INRIA, Feb 1992.
    • (1992) Technique
    • Koren, G.1    Shasha, D.2
  • 9
    • 0024755194 scopus 로고
    • Some Results on the Earliest Deadline Scheduling Algorithm
    • October
    • H. Chetto and M. Chetto, "Some Results on the Earliest Deadline Scheduling Algorithm", IEEE Transactions on Software Engineering, 15(10):1261-1269, October 1989.
    • (1989) IEEE Transactions on Software Engineering , vol.15 , Issue.10 , pp. 1261-1269
    • Chetto, H.1    Chetto, M.2
  • 10
    • 0031163904 scopus 로고    scopus 로고
    • An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems
    • I. Ripoll, A. Crespo and A.G. Fornes, "An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems", IEEE Transac. on Software Engineering, 23(6):388-400, 1997.
    • (1997) IEEE Transac. on Software Engineering , vol.23 , Issue.6 , pp. 388-400
    • Ripoll, I.1    Crespo, A.2    Fornes, A.G.3
  • 11
    • 0030109034 scopus 로고    scopus 로고
    • Scheduling Aperiodic Tasks in Dynamic Priority Systems
    • March
    • M. Spuri and G. Butazzo. "Scheduling Aperiodic Tasks in Dynamic Priority Systems", Real-Time Systems, 10(2): 179-210, March 1996.
    • (1996) Real-Time Systems , vol.10 , Issue.2 , pp. 179-210
    • Spuri, M.1    Butazzo, G.2
  • 14
    • 0022796618 scopus 로고
    • Finding response times in a real-time system
    • BCS Comp. Jour
    • M. Joseph and P. Pandya, "Finding response times in a real-time system", BCS Comp. Jour., 29(5), pp. 390-395, 1986.
    • (1986) , vol.29 , Issue.5 , pp. 390-395
    • Joseph, M.1    Pandya, P.2
  • 15
    • 0028396945 scopus 로고
    • An extendible approach for analyzing fixed priority hard real-time tasks
    • K. Tindell, H. Burns and A. J. Wellings, "An extendible approach for analyzing fixed priority hard real-time tasks", Real-Time Systems., 6, p. 133-151,1994.
    • (1994) Real-Time Systems , vol.6 , pp. 133-151
    • Tindell, K.1    Burns, H.2    Wellings, A.J.3
  • 16
    • 84880911285 scopus 로고
    • Fixed priority scheduling of periodic task sets with arbitrary deadlines
    • Lake Buena Vista, FL, USA, pp, 5-7 Dec
    • J. P. Lehoczky, "Fixed priority scheduling of periodic task sets with arbitrary deadlines", Proceedings 11th IEEE Real-Time Systems Symposium, Lake Buena Vista, FL, USA, pp. 201-209, 5-7 Dec. 1990.
    • (1990) Proceedings 11th IEEE Real-Time Systems Symposium , pp. 201-209
    • Lehoczky, J.P.1


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