메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 127-136

Fast and tight response-times for tasks with offsets

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; ESTIMATION; SIGNAL INTERFERENCE;

EID: 33749043658     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECRTS.2005.15     Document Type: Conference Paper
Times cited : (22)

References (11)
  • 1
    • 0029267687 scopus 로고
    • Fixed priority pre-emptive scheduling: An historical perspective
    • N. Audsley, A. Burns, R. Davis, K. Tindell, and A. Wellings. Fixed Priority Pre-Emptive Scheduling: An Historical Perspective. Real-Time Systems, 8(2/3): 173-198, 1995.
    • (1995) Real-time Systems , vol.8 , Issue.2-3 , pp. 173-198
    • Audsley, N.1    Burns, A.2    Davis, R.3    Tindell, K.4    Wellings, A.5
  • 2
    • 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, 29(5):390-395, 1986.
    • (1986) The Computer Journal , vol.29 , Issue.5 , pp. 390-395
    • Joseph, M.1    Pandya, P.2
  • 3
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a hard-real-time environment
    • C. Liu and J. Layland. Scheduling Algorithms for Multiprogramming in a Hard-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.1    Layland, J.2
  • 6
    • 33749078168 scopus 로고    scopus 로고
    • Fast and tight response-times for tasks with offsets - Extended version
    • Mälardalen Real-Time Research Centre (MRTC), March
    • J. Mäki-Turja and M. Nolin. Fast and Tight Response-Times for Tasks with Offsets - Extended version. Technical Report MRTC no. 173, Mälardalen Real-Time Research Centre (MRTC), March 2005.
    • (2005) Technical Report MRTC No. 173 , vol.173
    • Mäki-Turja, J.1    Nolin, M.2
  • 9
    • 5644297201 scopus 로고    scopus 로고
    • Accounting for precedence constraints in the analysis of tree-shaped transactions in distributed real-time systems
    • Dept. of Machine Design, KTH
    • O. Redell. Accounting for Precedence Constraints in the Analysis of Tree-Shaped Transactions in Distributed Real-Time Systems. Technical Report TRITA-MMK 2003:4, Dept. of Machine Design, KTH, 2003.
    • (2003) Technical Report TRITA-MMK 2003:4
    • Redell, O.1
  • 11
    • 7744235975 scopus 로고
    • Using offset information to analyse static priority pre-emptively scheduled task sets
    • Dept. of Computer Science, University of York, England
    • K. Tindell. Using Offset Information to Analyse Static Priority Pre-emptively Scheduled Task Sets. Technical Report YCS-182, Dept. of Computer Science, University of York, England, 1992.
    • (1992) Technical Report , vol.YCS-182
    • Tindell, K.1


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