메뉴 건너뛰기




Volumn , Issue , 2009, Pages 111-120

The hybrid scheduling framework for virtual machine systems

Author keywords

Hybrid scheduling; Scheduling strategy; Virtualization

Indexed keywords

CPU SCHEDULING; CPU TIME; HIGH-THROUGHPUT; HYBRID SCHEDULING; MULTI CORE; MULTI-THREADED PROGRAMS; OPERATING SYSTEMS; PARALLEL PROGRAM; SCHEDULING FRAMEWORKS; SCHEDULING STRATEGIES; SCHEDULING STRATEGY; SYSTEM WORKLOADS; VIRTUAL MACHINE MONITORS; VIRTUAL MACHINE SYSTEMS; VIRTUAL MACHINES; VIRTUALIZATION;

EID: 67650046424     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1508293.1508309     Document Type: Conference Paper
Times cited : (72)

References (42)
  • 1
    • 0020847118 scopus 로고
    • SYSTEM/370 EXTENDED ARCHITECTURE: FACILITIES FOR VIRTUAL MACHINES.
    • P. Gum. System/370 extended architecture: Facilities for virtual machines. IBM Journal of Research and Development, 27(6):530-544, 1983. (Pubitemid 14490910)
    • (1983) IBM Journal of Research and Development , vol.27 , Issue.6 , pp. 530-544
    • Gum, P.H.1
  • 5
    • 28844461561 scopus 로고    scopus 로고
    • Microsoft Corporation. Microsoft virtual server 2005. http://www.microsoft.com/windowsserversystem/virtualserver/default.mspx.
    • (2005) Microsoft Virtual Server
  • 10
    • 0042352254 scopus 로고    scopus 로고
    • Borrowed-virtual-time (BVT) scheduling: Supporting latency-sensitive threads in a general-purpose scheduler
    • K. Duda and D. Cheriton. Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a generalpurpose scheduler. In Proceedings of the 17th ACM SOSP, 1999. (Pubitemid 129548361)
    • (1999) Operating Systems Review (ACM) , vol.33 , Issue.5 , pp. 261-276
    • Duda, K.J.1    Cheriton, D.R.2
  • 12
    • 84870483444 scopus 로고    scopus 로고
    • Credit Scheduler. http://wiki.xensource.com/xenwiki/creditscheduler.
    • Credit Scheduler
  • 15
    • 67650077742 scopus 로고    scopus 로고
    • httperf. http://www.hpl.hp.com/research/linux/httperf/.
    • httperf
  • 16
    • 0027647547 scopus 로고
    • Achieving service rate objectives with decay usage scheduling
    • J. L. Hellerstein. Achieving service rate objectives with decay usage scheduling. IEEE Transactions on Software Engineering, 19(8):813-825, 1993.
    • (1993) IEEE Transactions on Software Engineering , vol.19 , Issue.8 , pp. 813-825
    • Hellerstein, J.L.1
  • 18
    • 0023861126 scopus 로고
    • FAIR SHARE SCHEDULER.
    • DOI 10.1145/35043.35047
    • J. Kay and P. Lauder. A fair share scheduler. Communications of the ACM, 31(1):44-55, 1988. (Pubitemid 18559807)
    • (1988) Communications of the ACM , vol.31 , Issue.1 , pp. 44-55
    • Kay, J.1    Lauder, P.2
  • 19
    • 0021515318 scopus 로고
    • The fair share scheduler. AT&T
    • G. Henry. The fair share scheduler. AT&T Bell Labs Technical Journal, 63(8):1945-1957, 1984.
    • (1984) Bell Labs Technical Journal , vol.63 , Issue.8 , pp. 1945-1957
    • Henry, G.1
  • 24
    • 0242656067 scopus 로고    scopus 로고
    • Backfilling with Lookahead to Optimize the Performance of Parallel Job Scheduling
    • Job Scheduling Strategies for Parallel Processing
    • E. Shmueli and D. Feitelson. Backfilling with lookahead to optimize the performance of parallel job scheduling. In Proceedings of the 9thWorkshop on Job Scheduling Strategies for Parallel Processing, pages 228-251, 2003. (Pubitemid 37387634)
    • (2003) LECTURE NOTES IN COMPUTER SCIENCE , Issue.2862 , pp. 228-251
    • Shmueli, E.1    Feitelson, D.G.2
  • 26
    • 0001439212 scopus 로고
    • Gang scheduling performance benefits for fine-grain synchronization
    • D. Feitelson and L. Rudolph. Gang scheduling performance benefits for fine-grain synchronization. Journal of Parallel and Distributed Computing, 16(4):306-318, 1992.
    • (1992) Journal of Parallel and Distributed Computing , vol.16 , Issue.4 , pp. 306-318
    • Feitelson, D.1    Rudolph, L.2
  • 35
  • 38


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