메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Multi-criteria evaluation of partitioning schemes for real-time systems

Author keywords

[No Author keywords available]

Indexed keywords

FIXED-PRIORITY SCHEDULERS; MULTI-CRITERIA EVALUATION; PARTITIONING ALGORITHMS; POLYNOMIAL SOLUTION; REAL TIME SCHEDULING; SCHEDULABILITY; SCHEDULABILITY TEST; SPECIFIC TASKS; UNIPROCESSORS;

EID: 78650552148     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ETFA.2010.5641218     Document Type: Conference Paper
Times cited : (17)

References (18)
  • 5
    • 34548715858 scopus 로고    scopus 로고
    • A comparison of global and partitioned EDF schedulability tests for multiprocessors
    • T. P. Baker. A comparison of global and partitioned EDF schedulability tests for multiprocessors. In International Conf. on Real-Time and Network Systems, pages 119-127, 2006.
    • (2006) International Conf. on Real-Time and Network Systems , pp. 119-127
    • Baker, T.P.1
  • 6
    • 39149095147 scopus 로고    scopus 로고
    • Schedulability Analysis of Multiprocessor Sporadic Task Systems
    • chapter Chapman
    • T. P. Baker and S. Baruah. Handbook of Real-Time and Embedded Systems, chapter Schedulability Analysis of Multiprocessor Sporadic Task Systems, pages 3.1-3.15. Chapman, 2008.
    • (2008) Handbook of Real-Time and Embedded Systems
    • Baker, T.P.1    Baruah, S.2
  • 8
    • 33744818212 scopus 로고    scopus 로고
    • The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems
    • S. Baruah and N. Fisher. The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems. IEEE Trans. on Computers, 55(7):918-923, 2006.
    • (2006) IEEE Trans. on Computers , vol.55 , Issue.7 , pp. 918-923
    • Baruah, S.1    Fisher, N.2
  • 9
    • 34249956267 scopus 로고
    • Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor
    • S. Baruah, R. Howell, and L. Rosier. Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor. Real-Time Systems, 2:301-324, 1990.
    • (1990) Real-Time Systems , vol.2 , pp. 301-324
    • Baruah, S.1    Howell, R.2    Rosier, L.3
  • 11
    • 70349675648 scopus 로고    scopus 로고
    • Exact quantification of the sub-optimality of uniprocessor fixed-priority pre-emptive scheduling
    • R. Davis and A. Burns. Exact quantification of the sub-optimality of uniprocessor fixed-priority pre-emptive scheduling. Real-Time Systems, (3):211-258, 2009.
    • (2009) Real-Time Systems , Issue.3 , pp. 211-258
    • Davis, R.1    Burns, A.2
  • 12
    • 0033890026 scopus 로고    scopus 로고
    • Liu and Layland's schedulability test revisited
    • R. Devillers and J. Goossens. Liu and Layland's schedulability test revisited. Information Processing Letters, 73(5-6):157-161, 2000.
    • (2000) Information Processing Letters , vol.73 , Issue.5-6 , pp. 157-161
    • Devillers, R.1    Goossens, J.2
  • 14
    • 33749040662 scopus 로고    scopus 로고
    • A fully polynomial-time approximation scheme for feasibility analysis in staticpriority systems with arbitrary relative deadlines
    • N. Fisher and S. K. Baruah. A fully polynomial-time approximation scheme for feasibility analysis in staticpriority systems with arbitrary relative deadlines. In Proceedings of the 17th Euromicro Conference on Real-Time Systems, pages 117-126, 2005.
    • (2005) Proceedings of the 17th Euromicro Conference on Real-Time Systems , pp. 117-126
    • Fisher, N.1    Baruah, S.K.2
  • 17
    • 84974687699 scopus 로고
    • Scheduling algorithms for multi-programming in a hard real time environment
    • January
    • L. C. Liu and W. Layland. Scheduling algorithms for multi-programming in a hard real time environment. Journal of ACM, 20(1):46-61, January 1973.
    • (1973) Journal of ACM , vol.20 , Issue.1 , pp. 46-61
    • Liu, L.C.1    Layland, W.2
  • 18
    • 3142722173 scopus 로고    scopus 로고
    • Limits to binary logic switch scaling-a Gedanken model
    • V. Zhirnov, R. Cavin, J. Hutchby, and G. Bourianoff. Limits to binary logic switch scaling-a Gedanken model. In IEEE, volume 9, pages 1934-1939, 2003.
    • (2003) IEEE , vol.9 , pp. 1934-1939
    • Zhirnov, V.1    Cavin, R.2    Hutchby, J.3    Bourianoff, G.4


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