CN102693156A - Process scheduling method based on configurable strategy - Google Patents
Process scheduling method based on configurable strategy Download PDFInfo
- Publication number
- CN102693156A CN102693156A CN2012101501198A CN201210150119A CN102693156A CN 102693156 A CN102693156 A CN 102693156A CN 2012101501198 A CN2012101501198 A CN 2012101501198A CN 201210150119 A CN201210150119 A CN 201210150119A CN 102693156 A CN102693156 A CN 102693156A
- Authority
- CN
- China
- Prior art keywords
- strategy
- scheduling
- method based
- takies
- scheduling method
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a process scheduling method based on a configurable strategy, which comprises the following steps of: 1) reading a strategy file when a system is initialized, wherein the strategy file records a process with a high occupancy level and a process with a low occupancy level; 2) scheduling the process with a high occupancy level according to a sequence recorded in the strategy file; 3) scheduling a common process; 4) scheduling the process with a low occupancy level in the sequence recorded in the strategy file; 5) scheduling an idle process; and 6) after a current process time slice is used up or is actively suspended, returning to step 2). The process scheduling method based on the configurable strategy, which is disclosed by the invention, is characterized in that the process is set into different occupancy levels by the strategy file, a more flexible process scheduling configuration is provided for different hardware environments and target computer systems, and indexes, such as user response time, a network throughput rate and the like can be improved.
Description
Technical field
The present invention relates to the Computer Science and Technology field, particularly a kind of process scheduling method based on configurable strategy.
Background technology
The processor time resource is an important resource in the computer system, and process scheduling promptly is the assigning process to the processor time resource.The correlation technique of process scheduling and the existing history for many years of research, wherein, the timesharing scheduling mode that generally uses has at present used and has updated more than 30 years.Scheduling has proposed new problem to the polycaryon processor technology that occurs in recent years to process, various improvement algorithms also occurred, but their cardinal rule does not change.
Traditional process scheduling mode is starting point with the fairness, takies the proportionate relationship of processor time between the priority adjusting process through the adjustment process.Data transfer relation between each process is left in the basket, and only carries out the distribution of processor time according to priority.Although this mode can adapt to the most of situation under the varying environment, can there be extreme case usually.For example; Windows operating system is used the polling dispatching mode that has priority; Task manager provides under the abnormal conditions function that finishes no response process for the user, and this abnormal conditions normally do not have the response process and are absorbed in endless loop and no longer respond the user and import, and at this moment do not have the response process and can take a large amount of processor resources; For making task manager still can respond user's end process requested faster; Windows operating system can the task manager process priority be set to " height ", even but like this, when having taken other resources such as a large amount of internal memories when no response process; Still can cause the task manager response slowly, even be difficult to activate through shortcut Ctrl+Alt+Del.
In computer system, make high priority process preferentially carry out unjust phenomenons such as to cause hunger utterly, but, absolute preferential execution mechanism need be set then, with indexs such as raising subscriber response times for service processes.Therefore, how to carry out the process scheduling configuration more flexibly, improving subscriber response time, improving network throughput is an important topic.
Summary of the invention
The present invention is intended to solve at least the technical matters that exists in the prior art, has proposed to special innovation a kind of process scheduling method based on configurable strategy.
In order to realize above-mentioned purpose of the present invention, the invention provides a kind of process scheduling method based on configurable strategy, it comprises the steps:
S1: fetch policy file when system initialization records height and takies a grade process and the low grade process that takies in the said strategy file;
S2: the sequential scheduling height according to writing down in the said strategy file takies a grade process;
S3: dispatch common process;
S4: according to the low grade process that takies of the sequential scheduling that writes down in the said strategy file;
S5: the idle process of scheduling;
S6: the current process timeslice is returned step S2 after using up or initiatively hanging up.
Process scheduling method based on configurable strategy of the present invention is set to different occupancy levels through the strategy file process; For the computer system of different hardware environment and target provides the configuration of process scheduling more flexibly, can improve indexs such as subscriber response time and network throughput.
Additional aspect of the present invention and advantage part in the following description provide, and part will become obviously from the following description, or recognize through practice of the present invention.
Description of drawings
Above-mentioned and/or additional aspect of the present invention and advantage obviously with are easily understood becoming the description of embodiment from combining figs, wherein:
Fig. 1 the present invention is based on the process flow diagram of the process scheduling method of configurable strategy;
Fig. 2 is the strategy file content of first preferred implementation that the present invention is based on the process scheduling method of configurable strategy;
Fig. 3 is the strategy file content of second preferred implementation that the present invention is based on the process scheduling method of configurable strategy;
Fig. 4 is the strategy file content of the 3rd preferred implementation that the present invention is based on the process scheduling method of configurable strategy.
Embodiment
Describe embodiments of the invention below in detail, the example of said embodiment is shown in the drawings, and wherein identical from start to finish or similar label is represented identical or similar elements or the element with identical or similar functions.Be exemplary through the embodiment that is described with reference to the drawings below, only be used to explain the present invention, and can not be interpreted as limitation of the present invention.
In description of the invention; It will be appreciated that; Term " vertically ", " laterally ", " on ", the orientation of indications such as D score, " preceding ", " back ", " left side ", " right side ", " vertically ", " level ", " top ", " end " " interior ", " outward " or position relation be for based on orientation shown in the drawings or position relation; Only be to describe with simplifying for the ease of describing the present invention; Rather than the device or the element of indication or hint indication must have specific orientation, with specific azimuth configuration and operation, therefore can not be interpreted as limitation of the present invention.
The invention provides a kind of process scheduling method based on configurable strategy, as shown in Figure 1, this process scheduling method comprises the steps:
S1: fetch policy file when system initialization records height and takies a grade process and the low grade process that takies in the said strategy file;
S2: the sequential scheduling height according to writing down in the said strategy file takies a grade process;
S3: dispatch common process;
S4: according to the low grade process that takies of the sequential scheduling that writes down in the said strategy file;
S5: the idle process of scheduling;
S6: the current process timeslice is returned step S2 after using up or initiatively hanging up.
In the present invention, the content of strategy file customizes according to different targeted environment, in this embodiment, can omit step S2 or step S4 through changing the strategy file content.In other embodiment of the present invention, strategy file is empty, and then this process scheduling method deteriorates to traditional process scheduling mode.
In this embodiment, step S2 adopts polling algorithm that process is dispatched to step S5.Take in the process that grade process dispatches with low height being taken grade process, the identical process that takies level sorts through strategy file.In a kind of preferred implementation of the present invention; The identical process that takies level sorts through designated parameters in the strategy file; This parameter can be a time parameter; In other a kind of preferred implementation of the present invention, the identical process that takies level sorts through the earliest finish time priority algorithm.
Fig. 2 is the strategy file content of first preferred implementation that the present invention is based on the process scheduling method of configurable strategy; This embodiment is the process scheduling method under the desktop system environment; For the desktop system environment; The subscriber response time index more comes into one's own, i.e. user's operation should meet with a response as early as possible.In this desktop system, there is a window management process gui.exe, user's operation is at first judged through this process, is transmitted to the affiliated process of different windows and handles.For shortening subscriber response time, should make the window management process obtain scheduling as early as possible.In addition, this desktop system user's request thinks that frequent network operation will prolong subscriber response time, and planned network packet managing process net_admin.exe for this reason, hopes that this process only handles network data at one's leisure.For reaching this target, can strategy file be configured to shown in Figure 2.Wherein, the content behind the symbol " # " is merely note, can not produce any influence to process scheduling.In strategy file, every row represents one to take level, is divided into height and takies level and low two kinds of the levels that take, and is distinguished by < high>and < low>respectively.Second portion is other dispatching algorithm at the corresponding levels in the angle brackets; In this embodiment, adopt polling algorithm, represent with RR; Dispatch first other process of this level when promptly for the first time being dispatched to this rank; For the second time dispatch second, be recycled to when exceeding this rank process number and dispatch first, by that analogy.According to Fig. 2 configured strategy, process gui.exe is set to height and takies a grade process, and process net_admin.exe is set to hang down and takies a grade process, and dispatching algorithm is with checking earlier whether process gui.exe can dispatch, as dispatching then dispatching process gui.exe; Otherwise dispatch other common processes according to normal algorithm; As do not have other common processes to need scheduling, check then whether process net_admin.exe can dispatch, as dispatching then dispatching process net_admin.exe; Otherwise the idle process of scheduling takies the processor timeslice.
Fig. 3 is the strategy file content of second preferred implementation that the present invention is based on the process scheduling method of configurable strategy, and this embodiment is the process scheduling method under the webserver environment, and for webserver environment, the network throughput index is more paid attention to.In network server system,, hope through process firewall.exe network packet to be differentiated interception as early as possible for avoiding network attack to a certain extent.Therefore simultaneously, the keeper hopes through remote access process telnet.exe mode server to be configured management, and the possibility of result of this management causes significant impact to the long-range efficient of customer network request, hopes that remote access carries out as early as possible.For reaching this target, can strategy file be configured to shown in Figure 3.According to Fig. 3 configured strategy; Process firewall.exe and process telnet.exe are set to height simultaneously take a grade process; But the rank of process telnet.exe is lower than the rank of process firewall.exe; Dispatching algorithm is then dispatched firewall.exe with checking earlier whether firewall.exe can dispatch as dispatching; Otherwise check whether telnet.exe can dispatch, then dispatch telnet.exe as dispatching; Otherwise dispatch other common processes according to normal algorithm; As do not have other common processes to need scheduling, then the idle process of scheduling takies the processor timeslice.
Fig. 4 is the strategy file content of the 3rd preferred implementation that the present invention is based on the process scheduling method of configurable strategy; This embodiment is the process scheduling method under the automotive control system environment; Automotive control system is a kind of real time embedded system, requires corresponding actions is accomplished in the control operation of user's input in preset time.In this control system; Hope to make the process bumper.exe override of control air bag to carry out, the process brake.exe of control brake and the process turning.exe that control turns to take second place, and the process accelerator.exe of control throttle once more; Other processes are normally carried out; Wherein braking and turning to has equal rank, in this embodiment, uses earliest finish time priority algorithm commonly used in the real time operating system to dispatch.
In this embodiment, can strategy file be configured to shown in Figure 4.According to Fig. 4 configured strategy, dispatching algorithm is with checking earlier whether process bumper.exe can dispatch, if can dispatch then dispatching process bumper.exe; Otherwise according to the earliest finish time scheduling strategy, check the concluding time of brake.exe and two processes of turning.exe, finishing scheduling time process early; If two processes all can not be dispatched, check then whether process accelerator.exe can dispatch, can dispatch as crossing, then dispatching process accelerator.exe; Otherwise dispatch other common processes according to normal algorithm; As do not have other common processes to need scheduling, then the idle process of scheduling takies the processor timeslice.
Process scheduling method based on configurable strategy of the present invention; Be set to different occupancy levels through the strategy file process; For the computer system of different hardware environment and target provides the configuration of process scheduling more flexibly, can improve indexs such as subscriber response time and network throughput.
In the description of this instructions, the description of reference term " embodiment ", " some embodiment ", " example ", " concrete example " or " some examples " etc. means the concrete characteristic, structure, material or the characteristics that combine this embodiment or example to describe and is contained at least one embodiment of the present invention or the example.In this manual, the schematic statement to above-mentioned term not necessarily refers to identical embodiment or example.And concrete characteristic, structure, material or the characteristics of description can combine with suitable manner in any one or more embodiment or example.
Although illustrated and described embodiments of the invention; Those having ordinary skill in the art will appreciate that: under the situation that does not break away from principle of the present invention and aim, can carry out multiple variation, modification, replacement and modification to these embodiment, scope of the present invention is limited claim and equivalent thereof.
Claims (5)
1. the process scheduling method based on configurable strategy is characterized in that, comprises the steps:
S1: fetch policy file when system initialization records height and takies a grade process and the low grade process that takies in the said strategy file;
S2: the sequential scheduling height according to writing down in the said strategy file takies a grade process;
S3: dispatch common process;
S4: according to the low grade process that takies of the sequential scheduling that writes down in the said strategy file;
S5: the idle process of scheduling;
S6: the current process timeslice is returned step S2 after using up or initiatively hanging up.
2. the process scheduling method based on configurable strategy as claimed in claim 1 is characterized in that, in said step S2 and step S4, the identical process that takies level sorts through strategy file.
3. the process scheduling method based on configurable strategy as claimed in claim 2 is characterized in that, in strategy file, the identical process that takies level sorts through the earliest finish time priority algorithm.
4. the process scheduling method based on configurable strategy as claimed in claim 1 is characterized in that, to step S5, adopts polling algorithm that process is dispatched at said step S2.
5. the process scheduling method based on configurable strategy as claimed in claim 1 is characterized in that, in the process scheduling process, through changing the content of strategy file, omits step S2 or step S4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012101501198A CN102693156A (en) | 2012-05-07 | 2012-05-07 | Process scheduling method based on configurable strategy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012101501198A CN102693156A (en) | 2012-05-07 | 2012-05-07 | Process scheduling method based on configurable strategy |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102693156A true CN102693156A (en) | 2012-09-26 |
Family
ID=46858632
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012101501198A Pending CN102693156A (en) | 2012-05-07 | 2012-05-07 | Process scheduling method based on configurable strategy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102693156A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105279019A (en) * | 2014-06-10 | 2016-01-27 | 中国移动通信集团公司 | Application scheduling method, application scheduling device and terminal equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1851651A (en) * | 2006-05-23 | 2006-10-25 | 浙江大学 | Method for realizing process priority scheduling for embedded SRAM operating system |
| CN101576829A (en) * | 2009-06-12 | 2009-11-11 | 宋志飞 | Trusteeship method and system for application process in embedded linux system |
| US20090300637A1 (en) * | 2008-06-02 | 2009-12-03 | Microsoft Corporation | Scheduler instances in a process |
| CN101887383A (en) * | 2010-06-30 | 2010-11-17 | 中山大学 | Process real-time scheduling method |
-
2012
- 2012-05-07 CN CN2012101501198A patent/CN102693156A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1851651A (en) * | 2006-05-23 | 2006-10-25 | 浙江大学 | Method for realizing process priority scheduling for embedded SRAM operating system |
| US20090300637A1 (en) * | 2008-06-02 | 2009-12-03 | Microsoft Corporation | Scheduler instances in a process |
| CN101576829A (en) * | 2009-06-12 | 2009-11-11 | 宋志飞 | Trusteeship method and system for application process in embedded linux system |
| CN101887383A (en) * | 2010-06-30 | 2010-11-17 | 中山大学 | Process real-time scheduling method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105279019A (en) * | 2014-06-10 | 2016-01-27 | 中国移动通信集团公司 | Application scheduling method, application scheduling device and terminal equipment |
| CN105279019B (en) * | 2014-06-10 | 2018-11-23 | 中国移动通信集团公司 | A kind of dispatching method of application program, device and terminal device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11509596B2 (en) | Throttling queue for a request scheduling and processing system | |
| CN103853610B (en) | Method for optimizing resources and device | |
| US20170201574A1 (en) | Method, system, and device for allocating resources in a server | |
| CN102156665B (en) | Differential serving method for virtual system competition resources | |
| CN101694631A (en) | Real-time operation dispatching system and method thereof | |
| US8510747B2 (en) | Method and device for implementing load balance of data center resources | |
| CN104572307B (en) | The method that a kind of pair of virtual resource carries out flexible scheduling | |
| EP3534255A1 (en) | I/o request scheduling method and device | |
| US8539498B2 (en) | Interprocess resource-based dynamic scheduling system and method | |
| CN110058932A (en) | A kind of storage method and storage system calculated for data flow driven | |
| CN102253857B (en) | Xen virtual machine scheduling control method in multi-core environment | |
| US20070174768A1 (en) | Adaptive alert management | |
| CN101414269A (en) | Priority based throttling for power/performance quality of service | |
| CN109005130B (en) | Network resource allocation scheduling method and device | |
| CN103294548A (en) | Distributed file system based IO (input output) request dispatching method and system | |
| CN108429783A (en) | Electronic device, configuration file method for pushing and storage medium | |
| US20220195434A1 (en) | Oversubscription scheduling | |
| US9934147B1 (en) | Content-aware storage tiering techniques within a job scheduling system | |
| US10216441B2 (en) | Dynamic quality of service for storage I/O port allocation | |
| US10884781B2 (en) | Method and apparatus for a virtual machine | |
| US20180205665A1 (en) | Storage Device Access Mediation | |
| US8024738B2 (en) | Method and system for distributing unused processor cycles within a dispatch window | |
| CN102693156A (en) | Process scheduling method based on configurable strategy | |
| Jang et al. | An efficient virtual CPU scheduling in cloud computing | |
| US10430233B1 (en) | Scheduling computational tasks among multiple classes of storage resources based on job classification |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20120926 |