CPU task immigration method and system based on bandwidth scheduling

A technology for migrating systems and tasks, applied in program startup/switching, program control design, instruments, etc., can solve problems such as large system overhead and frequent operating systems

Active Publication Date: 2016-02-24
INSPUR BEIJING ELECTRONICS INFORMATION IND
View PDF5 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, when the deadline is very small, the operating system will frequently switch CPU tasks, which will bring a huge system overhead

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
  • CPU task immigration method and system based on bandwidth scheduling
  • CPU task immigration method and system based on bandwidth scheduling
  • CPU task immigration method and system based on bandwidth scheduling

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0040]The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

[0041] The embodiment of the present invention discloses a CPU task migration method based on bandwidth scheduling, see figure 1 As shown, the method includes:

[0042] Step S11: Select N CPUs from all the CPUs of the computer, where N is a positive integer not less than 2;

[0043] Step S12: According to the preset migration cycle, perform an overall CPU task migration on the above N CPUs on a regular basis;

[0044] see figure 2 As shown, in step S12, an ...

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 application discloses a CPU task immigration method and system based on bandwidth scheduling. The method comprises: selecting N CPUs from all CPUs of a computer; and according to a preset immigration period, performing overall CPU task immigration on the N CPUs periodically. According to the application, N sorted CPU tasks are immigrated to N sorted CPUs one to one according to corresponding positions after sorting; immigration of busy CPU tasks to idle CPUs and immigration of idle CPU tasks to busy CPUs are implemented so as to ensure integral optimization on the operation system scheduling process; and moreover, according to the application, the overall CPU task immigration is performed periodically according to the preset immigration period so as to avoid a phenomenon of switching the CPU tasks frequently, also reduce frequency of CPU task switching and reduce system cost.

Description

technical field [0001] The invention relates to the field of operating system scheduling, in particular to a CPU task migration method and system based on bandwidth scheduling. Background technique [0002] In a multi-task real-time operating system, it usually occurs that multiple CPUs need to process multiple CPU tasks respectively. In order to reduce the burden on the busy CPU, it is necessary to perform corresponding task scheduling processing. [0003] At present, the more common CPU task scheduling process is based on the EDF (EDF, Earliest Deadline First, earliest deadline priority algorithm) algorithm. This scheduling method can realize the current busiest CPU task (that is, the CPU task with the smallest deadline) ) to the currently idlest CPU (that is, the CPU with the largest deadline). However, when the deadline is very small, the operating system will frequently switch CPU tasks, which brings a huge system overhead. [0004] From the above, it can be seen tha...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F9/48
CPCG06F9/4875
Inventor 闫晓峰吴楠
Owner INSPUR BEIJING ELECTRONICS INFORMATION IND
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap