CFS dispatcher

A scheduler and process technology, applied in the direction of program startup/switching, multi-program installation, etc., can solve the problems of unresponsiveness and process waiting, and achieve the effect of reducing virtual time and improving speed

Active Publication Date: 2015-02-25
LANGCHAO ELECTRONIC INFORMATION IND CO LTD
View PDF1 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

But the seemingly perfect algorithm also has its shortcomings. Although it perfectly solves the problem of process waiting, it introduces some new problems.
For example, high-speed storag

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • CFS dispatcher
  • CFS dispatcher

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0022] Referring to the accompanying drawings, the content of the algorithm design, as well as the implementation method and process of the algorithm will be introduced in detail below.

[0023] As described in the summary of the invention, this algorithm design includes: weight conversion module (1), time slice allocation module (2), virtual time module (3), red-black tree maintenance module (4), selection process module (5 ) of these five modules.

[0024] The weight conversion module (1) performs corresponding weight conversion on the priority of each process running in the system, so that different priorities correspond to different weights, and performs the following series of operations with the weights;

[0025] The time slice allocation module (2) allocates corresponding time slices to each process running in the system according to the weight obtained in the above (1) module, so that each process can run the length of this time slice in an ideal state;

[0026] Virtu...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a CFS dispatcher and belongs to the field of linux kernel process scheduling algorithm design. The CFS dispatcher comprises a weight conversion module (1), a time slice distributing module (2), a virtual time module (3), a red-black tree maintaining module (4) and a process selecting module (5). When IO operation is conducted, an IO special dispatching function is called each time the operation is over; when the IO dispatching function is called, the virtual operation time of the process is modified; when the function is called the first time, the virtual operation time is set to be an initial state, and a main dispatcher is called; in next two times of calling, the main dispatcher is normally called; back-and-forth switching is conducted; a next program for operating is selected through the main dispatcher. The CPU time distributed for the IO process by the CFS algorithm can be effectively prolonged, and therefore the IO speed is increased.

Description

technical field [0001] The invention relates to the design field of linux kernel process scheduling algorithm, in particular to a CFS scheduler. Background technique [0002] The CFS process scheduling algorithm is a product that appeared after linux2.6.23, and its appearance completely replaced the previous O(n) and O(1) scheduling algorithms; in the previous scheduling algorithm, no matter how optimized, there are always some low priorities The process cannot be scheduled by the CPU. In this case, CFS comes into being with a completely fair scheduling strategy. [0003] The CFS algorithm is the most used process scheduling algorithm in the current Linux system. Because its idea is simple, easy to implement, and effectively solves the problem of process starvation, it effectively takes O(1) and O(n) scheduling algorithm. But the seemingly perfect algorithm also has its shortcomings. Although it perfectly solves the problem of process waiting, it introduces some new probl...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F9/46G06F9/48
Inventor 武毅
Owner LANGCHAO ELECTRONIC INFORMATION IND CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products