메뉴 건너뛰기




Volumn , Issue , 1996, Pages 244-251

An engineering approach to decomposing end-to-end delays on a distributed real-time system

Author keywords

[No Author keywords available]

Indexed keywords

DECOMPOSITION; INTERACTIVE COMPUTER SYSTEMS; ITERATIVE METHODS; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING; SYSTEMS ANALYSIS;

EID: 0003022830     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WPDRTS.1996.557688     Document Type: Conference Paper
Times cited : (21)

References (7)
  • 1
    • 0004070775 scopus 로고
    • Optimal priority assignment and feasibility of static priority tasks with arbitrary start times
    • University of York, England, December
    • N. Audsley. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Technical Report YCS 164, Department of Computer Science, University of York, England, December 1991.
    • (1991) Technical Report YCS 164, Department of Computer Science
    • Audsley, N.1
  • 2
    • 84882657879 scopus 로고
    • Guaranteeing end-to-end timing constraints by calibrating intermediate processes
    • IEEE Computer Society Press, December
    • R. Gerber, S. Hong, and M. Saksena. Guaranteeing end-to-end timing constraints by calibrating intermediate processes. In Proceedings of IEEE Real- Time Systems Symposium, pages 192-203. IEEE Computer Society Press, December 1994.
    • (1994) Proceedings of IEEE Real- Time Systems Symposium , pp. 192-203
    • Gerber, R.1    Hong, S.2    Saksena, M.3
  • 3
    • 0029346629 scopus 로고
    • Guaranteeing real-time requirements with resource-based calibration of periodic processes
    • July
    • R. Gerber, S. Hong, and M. Saksena. Guaranteeing real-time requirements with resource-based calibration of periodic processes. IEEE Transactions on Software Engineering, 21(7), July 1995.
    • (1995) IEEE Transactions on Software Engineering , vol.21 , Issue.7
    • Gerber, R.1    Hong, S.2    Saksena, M.3
  • 4
    • 0024915921 scopus 로고
    • The rate monotonic scheduling algorithm: Exact characterization and average case behavior
    • IEEE Computer Society Press, December
    • J. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Proceedings of IEEE Real-Time Systems Symposium, pages 166-171. IEEE Computer Society Press, December 1989.
    • (1989) Proceedings of IEEE Real-Time Systems Symposium , pp. 166-171
    • Lehoczky, J.1    Sha, L.2    Ding, Y.3
  • 5
    • 0042256950 scopus 로고
    • Resource conscious design of real-time systems: An end-to-end approach
    • Technical Report ASRI-TR-95-01, Seoul National University, Korea, November
    • M. Saksena and S. Hong. Resource conscious design of real-time systems: An end-to-end approach. Technical Report ASRI-TR-95-01, Automation and Systems Research Institute, Seoul National University, Korea, November 1995.
    • (1995) Automation and Systems Research Institute
    • Saksena, M.1    Hong, S.2
  • 6
    • 0029327786 scopus 로고
    • Implications of classical scheduling results for real-time systems
    • June
    • J. Stankovic, M. Spuri, M. Di Natale, and G. Buttazzo. Implications of classical scheduling results for real-time systems. IEEE Computer, pages 16- 25, June 1995.
    • (1995) IEEE Computer , pp. 16-25
    • Stankovic, J.1    Spuri, M.2    Natale, M.D.3    Buttazzo, G.4
  • 7
    • 0028396945 scopus 로고
    • An extendible approach for analysing fixed priority hard real-time tasks
    • March
    • K. Tindell, A. Burns, and A. Wellings. An extendible approach for analysing fixed priority hard real-time tasks. The Journal of Real-Time Systems, 6(2):133-152, March 1994.
    • (1994) The Journal of Real-Time Systems , vol.6 , Issue.2 , pp. 133-152
    • Tindell, K.1    Burns, A.2    Wellings, A.3


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