کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
425065 685679 2013 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Scheduling para-virtualized virtual machines based on events
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Scheduling para-virtualized virtual machines based on events
چکیده انگلیسی

Para-virtualization features little performance degradation by presenting each virtual machine with an abstraction of hardware instead of fully emulating the hardware environment. A guest running atop Xen can achieve near-native performances. A critical part of Xen is its CPU scheduler which slices and dispatches physical CPU time to virtual machines. Xen’s credit scheduler utilizes blocked-to-boosted mechanism to improve latency and throughput of I/O tasks. It boosts the scheduling priority of a blocked VCPU that receives an event. The boosted VCPU then pre-empts the current VCPU and gets executed straightaway. However, virtual CPUs that receive events while processing CPU-intensive tasks seldom block. Thus, the mechanism does not favor these VCPUs which process mixed workloads. Moreover, VCPUs that constantly send request events are not properly prioritized either. The two problems above can result in poor application performance to guest domains. We propose a novel approach to improve the credit scheduler, making it appropriately prioritize such domains. Our solution includes two aspects: 1) to schedule the VCPU that receives I/O events as soon as possible; 2) to switch in frequent event senders to let them initiate more I/O requests from time to time. The experimental evaluation demonstrates that our approach not only improves the responsiveness of domains doing mixed workloads, but also minimizes the possibly caused scheduling unfairness.


► We improved I/O performances of busy para-virtualized virtual machines.
► The scheduler monitors receiving events and anticipates sending events.
► As a result, I/O latency is kept at minimum and I/O throughput is greatly improved.
► Scheduling fairness is always maintained.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Future Generation Computer Systems - Volume 29, Issue 5, July 2013, Pages 1130–1139
نویسندگان
, ,