메뉴 건너뛰기




Volumn , Issue , 2007, Pages

Capacity sharing and stealing in dynamic server-based real-time systems

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTATION THEORY; COMPUTER SIMULATION; SERVERS;

EID: 34548767579     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2007.370349     Document Type: Conference Paper
Times cited : (9)

References (22)
  • 1
    • 0032293318 scopus 로고    scopus 로고
    • Integrating multimedia applications in hard real-time systems
    • Madrid, Spain, December
    • L. Abeni and G. Buttazzo. Integrating multimedia applications in hard real-time systems. In Proceedings of the 19th IEEE RTSS, page 4, Madrid, Spain, December 1998.
    • (1998) Proceedings of the 19th IEEE RTSS , pp. 4
    • Abeni, L.1    Buttazzo, G.2
  • 3
    • 0036155399 scopus 로고    scopus 로고
    • Multiple servers and capacity sharing for implementing flexible scheduling
    • G. Bernat and A. Burns. Multiple servers and capacity sharing for implementing flexible scheduling. Real-Time Systems, 22(1-2):49-75, 2002.
    • (2002) Real-Time Systems , vol.22 , Issue.1-2 , pp. 49-75
    • Bernat, G.1    Burns, A.2
  • 5
    • 14844365663 scopus 로고    scopus 로고
    • Efficient reclaiming in reservation-based real-time systems with variable execution times
    • February
    • M. Caccamo, G. C. Buttazzo, and D. C. Thomas. Efficient reclaiming in reservation-based real-time systems with variable execution times. IEEE Transactions on Computers, 54(2):198-213, February 2005.
    • (2005) IEEE Transactions on Computers , vol.54 , Issue.2 , pp. 198-213
    • Caccamo, M.1    Buttazzo, G.C.2    Thomas, D.C.3
  • 6
    • 0346935125 scopus 로고    scopus 로고
    • Experimental evaluation of code properties for wcet analysis
    • December
    • A. Colin and S. M. Petters. Experimental evaluation of code properties for wcet analysis. In Proceedings of the 24th IEEE RTSS, pages 190-199, December 2003.
    • (2003) Proceedings of the 24th IEEE RTSS , pp. 190-199
    • Colin, A.1    Petters, S.M.2
  • 7
    • 4243505159 scopus 로고
    • Approximate slack stealing algorithms for fixed priority preemptive systems
    • Technical report, Department of Computer Science, University of York, November
    • R. I. Davis. Approximate slack stealing algorithms for fixed priority preemptive systems. Technical report, Department of Computer Science, University of York, November 1993.
    • (1993)
    • Davis, R.I.1
  • 8
    • 0027847579 scopus 로고
    • Scheduling slack time in fixed priority preemptive systems
    • R. I. Davis, K. W. Tindell, and A. Burns. Scheduling slack time in fixed priority preemptive systems. In Proceedings of the 14th RTSS, pages 222-231, 1993.
    • (1993) Proceedings of the 14th RTSS , pp. 222-231
    • Davis, R.I.1    Tindell, K.W.2    Burns, A.3
  • 9
    • 0031373951 scopus 로고    scopus 로고
    • Scheduling real-time applications in an open environment
    • Washington, DC, USA
    • Z. Deng and J. W.-S. Liu. Scheduling real-time applications in an open environment. In Proceedings of the 18th IEEE RTSS, page 308, Washington, DC, USA, 1997.
    • (1997) Proceedings of the 18th IEEE RTSS , pp. 308
    • Deng, Z.1    Liu, J.W.-S.2
  • 10
    • 0029345475 scopus 로고
    • Aperiodic servers in a dead-line scheduling environment
    • T. M. Ghazalie and T. P. Baker. Aperiodic servers in a dead-line scheduling environment. Real-Time Systems, 9(1):31-67, 1995.
    • (1995) Real-Time Systems , vol.9 , Issue.1 , pp. 31-67
    • Ghazalie, T.M.1    Baker, T.P.2
  • 13
    • 84880912464 scopus 로고
    • An optimal algorithm for scheduling soft-aperiodic tasks fixed-priority preemptive systems
    • December
    • J. P. Lehoczky and S. Ramos-Thuel. An optimal algorithm for scheduling soft-aperiodic tasks fixed-priority preemptive systems. In Proceedings of the 13th RTSS, pages 110-123, December 1992.
    • (1992) Proceedings of the 13th RTSS , pp. 110-123
    • Lehoczky, J.P.1    Ramos-Thuel, S.2
  • 14
    • 62449329425 scopus 로고    scopus 로고
    • Improving soft real-time performance through better slack reclaiming
    • C. Lin and S. A. Brandt. Improving soft real-time performance through better slack reclaiming. In Proceedings of the 26th IEEE RTSS, pages 410-421, 2005.
    • (2005) Proceedings of the 26th IEEE RTSS , pp. 410-421
    • Lin, C.1    Brandt, S.A.2
  • 15
    • 0000395452 scopus 로고    scopus 로고
    • Greedy reclamation of unused bandwidth in constant-bandwidth servers
    • Stockholm, Sweden
    • G. Lipari and S. Baruah. Greedy reclamation of unused bandwidth in constant-bandwidth servers. In Proceedings of the 12th ECRTS, pages 193-200, Stockholm, Sweden, 2000.
    • (2000) Proceedings of the 12th ECRTS , pp. 193-200
    • Lipari, G.1    Baruah, S.2
  • 17
    • 34548742874 scopus 로고    scopus 로고
    • Capacity sharing and stealing in server-based real-time systems
    • Technical report, HURRAY-TR-051205. Available at, December
    • L. Nogueira and L. M. Pinho. Capacity sharing and stealing in server-based real-time systems. Technical report, HURRAY-TR-051205. Available at http://hurray.isep.ipp.pt/, December 2005.
    • (2005)
    • Nogueira, L.1    Pinho, L.M.2
  • 22
    • 84882623849 scopus 로고
    • Efficient aperiodic service under earliest deadline scheduling
    • San Juan, Puerto Rico
    • M. Spuri and G. Buttazzo. Efficient aperiodic service under earliest deadline scheduling. In Proceedings of the 15th IEEE RTSS, pages 2-11, San Juan, Puerto Rico, 1994.
    • (1994) Proceedings of the 15th IEEE RTSS , pp. 2-11
    • Spuri, M.1    Buttazzo, G.2


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