메뉴 건너뛰기




Volumn , Issue , 2010, Pages 167-189

Reconfiguration of uniprocessor sporadic real-time systems: The sensitivity approach

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84898178570     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-60960-086-0.ch007     Document Type: Chapter
Times cited : (4)

References (41)
  • 6
    • 34249956267 scopus 로고
    • Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor
    • doi:10.1007/BF01995675
    • Baruah, S., Howell, R., & Rosier, L. (1990). Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor. Real-Time Systems, 2, 301-324. doi:10.1007/BF01995675
    • (1990) Real-Time Systems , vol.2 , pp. 301-324
    • Baruah, S.1    Howell, R.2    Rosier, L.3
  • 7
    • 0035308899 scopus 로고    scopus 로고
    • Weakly hard real-time systems
    • A., L., doi:10.1109/12.919277
    • Bernat, G., & Burns, A. & A., L. (2001). Weakly Hard Real-Time Systems. IEEE Transactions on Computers, 50(4), 308-321. doi:10.1109/12.919277
    • (2001) IEEE Transactions on Computers , vol.50 , Issue.4 , pp. 308-321
    • Bernat, G.1    Burns, A.2
  • 9
    • 0042850516 scopus 로고    scopus 로고
    • Rate monotonic analysis: The hyperbolic bound
    • doi:10.1109/TC.2003.1214341
    • Bini, E., & Buttazzo, G. (2003). Rate monotonic analysis: the hyperbolic bound. IEEE Transactions on Computers, 52(7). doi:10.1109/TC.2003.1214341
    • (2003) IEEE Transactions on Computers , vol.52 , Issue.7
    • Bini, E.1    Buttazzo, G.2
  • 10
    • 8744284409 scopus 로고    scopus 로고
    • Schedulability analysis of periodic fixed priority systems
    • doi:10.1109/TC.2004.103
    • Bini, E., & Buttazzo, G. (2004). Schedulability Analysis of Periodic Fixed Priority Systems. IEEE Transactions on Computers, 53(11). doi:10.1109/TC.2004.103
    • (2004) IEEE Transactions on Computers , vol.53 , Issue.11
    • Bini, E.1    Buttazzo, G.2
  • 16
    • 46349108775 scopus 로고    scopus 로고
    • Dealing withexecution-overruns to improve the temporal robustness of real-time systems scheduled FP and EDF
    • In, Sainte-Luce, Martinique, France, April 22-28
    • Bougueroua, L., George, L., & Midonnet, M. (2007). Dealing withexecution-overruns to improve the temporal robustness of real-time systems scheduled FP and EDF. In The Second International Conference on Systems (ICONS'07), Sainte-Luce, Martinique, France, April 22-28.
    • (2007) The Second International Conference on Systems (ICONS'07)
    • Bougueroua, L.1    George, L.2    Midonnet, M.3
  • 18
    • 33646891063 scopus 로고    scopus 로고
    • Achieving scalability in real-time systems
    • In
    • Buttazzo, G. (2006). Achieving scalability in real-time systems. In IEEE Computer.
    • (2006) IEEE Computer
    • Buttazzo, G.1
  • 20
  • 25
    • 84938157299 scopus 로고
    • A dynamic priority assignment technique for streams with (m,k)-firm deadlines
    • December, doi:10.1109/12.477249
    • Hamdaoui, M., & Ramanathan, P.(1995, December)A dynamic priority assignment technique for streams with (m,k)-firm deadlines. IEEE Transactions on Computers, 44, 1443-1451. doi:10.1109/12.477249
    • (1995) IEEE Transactions on Computers , vol.44 , pp. 1443-1451
    • Hamdaoui, M.1    Ramanathan, P.2
  • 28
    • 0022796618 scopus 로고
    • Finding response times in a real-time system
    • doi:10.1093/comjnl/29.5.390
    • Joseph, M., & Pandya, P. (1986). Finding response times in a real-time system. BCS Comp. Jour., 29(5), 390-395. doi:10.1093/comjnl/29.5.390
    • (1986) BCS Comp. Jour , vol.29 , Issue.5 , pp. 390-395
    • Joseph, M.1    Pandya, P.2
  • 29
    • 50149098045 scopus 로고
    • D-over: An optimal on-line scheduling algorithm for over loaded real-time system
    • Feb. 1992
    • Koren, G. & Shasha, D. (1992). D-over: An Optimal On-line Scheduling Algorithm for over loaded real-time system. Research report Num. 138, Feb. 1992.
    • (1992) Research Report Num. 138
    • Koren, G.1    Shasha, D.2
  • 30
    • 84958968074 scopus 로고    scopus 로고
    • A methodology for designing and dimensioning critical complex computing systems
    • March, Friedrichshafen, Germany
    • Le Lann, G. (1996, March). A methodology for designing and dimensioning critical complex computing systems. IEEE Intl. symposium on the Engineering of Computer Based Systems, (pp. 332-339), Friedrichshafen, Germany.
    • (1996) IEEE Intl. Symposium on the Engineering of Computer Based Systems , pp. 332-339
    • Le Lann, G.1
  • 31
    • 84880911285 scopus 로고
    • Fixed priority scheduling of periodic task sets with arbitrary deadlines
    • In, Lake Buena Vista, FL
    • Lehoczky, J. (1990). Fixed priority scheduling of periodic task sets with arbitrary deadlines. In Proceedings 11th IEEE Real-Time Systems Symposium, (pp. 201-209), Lake Buena Vista, FL.
    • (1990) Proceedings 11th IEEE Real-Time Systems Symposium , pp. 201-209
    • Lehoczky, J.1
  • 32
    • 0024915921 scopus 로고
    • The rate-monotonic scheduling algorithm: Exact characterization and average case behavior
    • In
    • Lehoczky, J., Sha, L., & Ding, Y. (1989). The Rate-Monotonic scheduling algorithm: exact characterization and average case behavior. In Proceedings of 10th IEEE Real-Time Systems Symposium, (pp. 166-172).
    • (1989) Proceedings of 10th IEEE Real-Time Systems Symposium , pp. 166-172
    • Lehoczky, J.1    Sha, L.2    Ding, Y.3
  • 33
    • 84976788276 scopus 로고
    • A note on premptive scheduling of periodic real-time tasks
    • doi:10.1016/0020-0190(80)90123-4
    • Leung, J. Y. T., & Merril, M. (1980). A note on premptive scheduling of periodic real-time tasks. Information Processing Letters, 11(3). doi:10.1016/0020-0190(80)90123-4
    • (1980) Information Processing Letters , vol.11 , Issue.3
    • Leung, J.Y.T.1    Merril, M.2
  • 34
    • 84974687699 scopus 로고
    • Scheduling algorithms for multi-programming in a hard real time environment
    • doi:10.1145/321738.321743
    • Liu, L. C., & Layland, W. (1973). Scheduling algorithms for multi-programming in a hard real time environment. Journal of the ACM, 20(1), 46-61. doi:10.1145/321738.321743
    • (1973) Journal of the ACM , vol.20 , Issue.1 , pp. 46-61
    • Liu, L.C.1    Layland, W.2
  • 35
    • 0003744646 scopus 로고
    • PhD thesis, Computer science department, Carnegie-Mellon University, Pittsburgh, PA
    • Lock, C. (1986). Best effort decision making for real-time scheduling. PhD thesis, Computer science department, Carnegie-Mellon University, Pittsburgh, PA.
    • (1986) Best Effort Decision Making for Real-time Scheduling
    • Lock, C.1
  • 36
    • 0032028512 scopus 로고    scopus 로고
    • A feasibility decision algorithm for rate monotonic and deadline monotonic scheduling
    • doi:10.1023/A:1007964900035
    • Manabe, Y., & Aoyagi, S. (1998). A feasibility decision algorithm for rate monotonic and deadline monotonic scheduling. Real-Time Systems, 14(2), 171-181. doi:10.1023/A:1007964900035
    • (1998) Real-Time Systems , vol.14 , Issue.2 , pp. 171-181
    • Manabe, Y.1    Aoyagi, S.2
  • 40
    • 0029378832 scopus 로고
    • Analysis of hard real-time communications
    • doi:10.1007/BF01088855
    • Tindell, K., Burns, A., & Wellings, A. J. (1995). Analysis of hard real-time communications. Real-Time Systems, 9, 147-171. doi:10.1007/BF01088855
    • (1995) Real-Time Systems , vol.9 , pp. 147-171
    • Tindell, K.1    Burns, A.2    Wellings, A.J.3
  • 41
    • 0028413120 scopus 로고
    • Fixed-priority sensitivity analysis for linear compute time models
    • doi:10.1109/32.277577
    • Vestal, S. (1994). Fixed-Priority Sensitivity Analysis for Linear Compute Time Models. IEEE Transactions on Software Engineering, 20(4). doi:10.1109/32.277577
    • (1994) IEEE Transactions on Software Engineering , vol.20 , Issue.4
    • Vestal, S.1


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