Invention Grant
- Patent Title: Comprehensive scheduling method and device for problem of interruptability holder preemption
-
Application No.: US16467933Application Date: 2018-06-25
-
Publication No.: US11269675B2Publication Date: 2022-03-08
- Inventor: Jian Li , Haibing Guan , Xiaokang Hu , Wang Zhang
- Applicant: SHANGHAI JIAO TONG UNIVERSITY
- Applicant Address: CN Shanghai
- Assignee: SHANGHAI JIAO TONG UNIVERSITY
- Current Assignee: SHANGHAI JIAO TONG UNIVERSITY
- Current Assignee Address: CN Shanghai
- Agency: Blank Rome LLP
- International Application: PCT/CN2018/092618 WO 20180625
- International Announcement: WO2019/128158 WO 20190704
- Main IPC: G06F9/455
- IPC: G06F9/455 ; G06F9/48 ; G06F9/50

Abstract:
The present invention finds and defines a problem which possibly exists in an interrupt remapping mechanism under a virtual symmetric multiprocessing environment, i.e., a problem of Interruptability Holder Preemption (IHP). This problem causes the interrupt remapping mechanism to fail and reduces I/O performance of virtual machines. In order to solve the IHP problem, the present invention provides a proactive VCPU comprehensive scheduling method based on interruptability holder information. This method is based on Kernel-Based Virtual Machines (KVMs) which are widely used at present and paravirtualization network models thereof. By globally controlling and analyzing a running state of an interruptability holder and simultaneously considering global scheduling fairness of a system, a VCPU comprehensive scheduling method is established, which can effectively eliminate the IHP problem and obviously improve the I/O performance of the virtual machines.
Public/Granted literature
- US20210149698A1 COMPREHENSIVE SCHEDULING METHOD AND DEVICE FOR PROBLEM OF INTERRUPTABILITY HOLDER PREEMPTION Public/Granted day:2021-05-20
Information query