Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A method for computer multi-process fair scheduling

A multi-process and computer technology, applied in multi-program devices, resource allocation, etc., can solve the problems of state space explosion, unfavorable multi-process real-time scheduling, and reducing the ability of the operating system to manage process scheduling.

Active Publication Date: 2019-03-29
SHANGHAI DEV CENT OF COMP SOFTWARE TECH +2
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, this method will cause a sharp increase in the state in the Petri net model, leading to the problem of state space explosion, which is not conducive to the real-time scheduling of multiple processes by computer processors.
[0004] In the operating system, the number of concurrent processes changes dynamically, and the resource requirements of each process also change dynamically. It is difficult for the multi-process scheduling algorithm in the prior art to ensure the fairness of process scheduling when solving such problems, which reduces the operating cost. The system's ability to manage process scheduling

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
  • A method for computer multi-process fair scheduling
  • A method for computer multi-process fair scheduling
  • A method for computer multi-process fair scheduling

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0053] Figure 4 It is a 5-time concurrent scheduling simulation diagram for 5 processes and 2 shared resources using the computer multi-process fair scheduling method of the present invention, wherein the processes are 1, 2, 3, 4 and 5, and there is an influencing factor function f(1) ={5,2}, f(2)={1,3}, f(3)={2,4}, f(4)={3,5} and f(5)={1,4} .

[0054] According to the generation algorithm of the scheduling set D, process 1 is randomly selected, the available scheduling set D={1, 3}, and the unscheduled processes 2, 4, and 5 are put into the backup scheduling queue L( Figure 4 (referred to as the queue in the middle), and the five schedules are as follows:

[0055] The first scheduling: schedule processes 1 and 3 in the scheduling set D={1, 3}, and then the backup scheduling queue L regains the scheduling set D={2, 4}, and deletes them from the backup scheduling queue L Processes 2 and 4 insert the scheduled processes 1 and 3 into the tail of the backup scheduling queue L...

Embodiment 2

[0063] Figure 5 It is a 7-time process scheduling simulation diagram of 6 processes and 2 shared resources using the method of computer multi-process fair scheduling in the present invention, wherein the processes are 1, 2, 3, 4, 5 and 6, and there is an impact factor function f(1)={2, 3, 4}, f(2)={3, 5}, f(3)={1, 2, 4}, f(4)={2, 3, 6}, f(5)={4, 6} and f(6)={1, 5}.

[0064] According to the generation algorithm of scheduling set D, if process 1 is randomly selected, the available scheduling set D={1, 5}, unscheduled processes 2, 3, 4 and 6 are put into the backup scheduling queue L( Figure 5 (referred to as queue in the middle), and the 7 schedules are as follows:

[0065] The first scheduling: schedule processes 1 and 5 in the scheduling set D={1, 5}, then obtain the scheduling set D={2, 6} from the backup scheduling queue L, and delete the process from the backup scheduling queue L 2 and 6, the scheduled processes 1 and 5 are inserted into the tail of the backup schedul...

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 discloses a fair-share scheduling method for multiple processes of computer. The method comprises the following steps: 1, selecting processes from a process set to form a scheduling set, and a reserved scheduling queue is formed by the unselected processes; 2, determining whether the requirement of a process scheduling is over or not, if the requirement of the process scheduling is not over, the next step is conducted, or the scheduling is over; 3, scheduling the scheduling set; 4, conversionring the scheduled processes in the scheduling set to the tail of the reserved scheduling queue; 5, emptying the scheduling set; 6, selecting processes from the reserved scheduling queue to form a scheduling set and jumping to step 2. According to the fair-share scheduling method for multiple processes of computer, the scheduling set of the processes and the reserved scheduling queue are formed by the operation of set computation, so that the fair-share scheduling on computer multi process is achieved, the occurrence of deadlock during the concurrent scheduling of the processes is avoided, and the scheduling ability on concurrent processes of the computer processor is improved.

Description

technical field [0001] The invention relates to the technical field of multi-process resource allocation in parallel computer architecture, in particular to a method for computer multi-process fair scheduling. Background technique [0002] The multi-process scheduling problem in the operating system is an important research content in the field of computer science. The quality of the process scheduling algorithm directly affects the utilization of computer resources and the operating speed of the operating system. The core problem solved by the multi-process scheduling algorithm is the process synchronization (Synchronization) problem. This problem refers to the mismatch between the number of processes and the number of available resources. To solve this problem, three aspects of concurrency, deadlock and fairness need to be considered. At present, the solutions to this problem mainly focus on: 1) a method to avoid process deadlock when processes are scheduled concurrently;...

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 Patents(China)
IPC IPC(8): G06F9/50G06F9/46
Inventor 刘攀蔡立志刘振宇胡芸傅志仁廖文昭杨卉周伟郑阳
Owner SHANGHAI DEV CENT OF COMP SOFTWARE TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com