CN109460290A - A kind of course control method for use - Google Patents
A kind of course control method for use Download PDFInfo
- Publication number
- CN109460290A CN109460290A CN201811153673.5A CN201811153673A CN109460290A CN 109460290 A CN109460290 A CN 109460290A CN 201811153673 A CN201811153673 A CN 201811153673A CN 109460290 A CN109460290 A CN 109460290A
- Authority
- CN
- China
- Prior art keywords
- user task
- control method
- course control
- use according
- process control
- 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
- 238000000034 method Methods 0.000 title claims abstract description 89
- 238000004886 process control Methods 0.000 claims abstract description 26
- 238000009826 distribution Methods 0.000 claims abstract description 4
- 238000012545 processing Methods 0.000 claims description 13
- 238000012544 monitoring process Methods 0.000 abstract description 2
- 238000004590 computer program Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000003860 storage Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 3
- 238000006243 chemical reaction Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/50—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems
- G06F21/51—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems at application loading time, e.g. accepting, rejecting, starting or inhibiting executable software based on integrity or source reliability
Abstract
The present invention relates to a kind of course control method for use, which comprises S1: obtaining user task, is distributed for the first time user task and create task requests；S2: general distribution is carried out for unallocated user task；S3: process control is carried out to the implementation procedure.The present invention can carry out process control to the execution of user task, by monitoring in real time to implementation procedure, improve the safety of task execution and the safety of system entirety, the method for the process control is simple and overhead is small, and execution efficiency is high.
Description
[technical field]
The invention belongs to process control field more particularly to a kind of course control method for use.
[background technique]
Extensive concern of the technology by industry since Google in 2007 proposes cloud computing, about cloud computing.Currently, industry
Cloud computing is divided into IAAS (basis services) by boundary, PASS (platform services), three levels of SASS (software services).Position
It in hardware resources such as the IAAS of bottom, including calculating, storage, network, while also including the cloud meter that these resources are managed
Calculate operating system software level.Resource allocation task is dispatched, the outstanding solution of many of legacy operating system,
In cloud computing operating system, solution is also needed.In recent years, with the high speed development of internet area, internet institute according to
Bad task engine (server) scale is also more and more huger.And with the continuous extension of application field, multiple applications of user
Often executed in different task engines.Therefore how these service relations across machine application are managed, safeguard and
Scheduling just becomes a urgent problem to be solved.The above-mentioned problems of base need a kind of new course control method for use now, this
Invention can carry out process control to the execution of user task, and by monitoring in real time to implementation procedure, the task of improving is held
The safety of capable safety and system entirety, the method for the process control is simple and overhead is small, and execution efficiency is high.
[summary of the invention]
In order to solve the above problem in the prior art, the invention proposes a kind of course control method for use, this method includes
Following steps:
S1: user task is obtained, user task is distributed for the first time and creates task requests；
S2: general distribution is carried out for unallocated user task；
S3: process control is carried out to the implementation procedure.
Further, the step S3 specifically: available processes node receives user task request and/or child user task
Request, and the user task is requested and/or child user task requests are placed at the tail of the queue of pending queue, it dispatches and executes
The user task request and/or child user task requests, start-up course control process carries out implementation procedure before execution
Process control.
Further, the process control includes controlling the implementation procedure to prevent extraneous attack, and executing
The non-permissible access exception instruction being likely to occur in the process.
Further, the implementation procedure of the process control is that backstage executes, and does not influence the execution of the user task.
Further, all process control processes execute in independent physical processing unit.
Further, it after user task request/child user task requests are finished, is held to central processing unit transmission
Row completion notice is to receive implementing result；Implementing result is fed back into user.
Further, the user receives the implementing result of feedback by client computer.
Further, process control is realized by way of separate threads are set and are monitored.
The beneficial effect comprise that process control can be carried out to the execution of user task, by implementation procedure
It is monitored in real time, improves the safety of task execution and the safety of system entirety, the method for the process control is simple
And overhead is small, execution efficiency is high.
[Detailed description of the invention]
Described herein the drawings are intended to provide a further understanding of the invention, constitutes part of this application, but
It does not constitute improper limitations of the present invention, in the accompanying drawings:
Fig. 1 is the flow chart of course control method for use of the invention.
[specific embodiment]
Come that the present invention will be described in detail below in conjunction with attached drawing and specific embodiment, illustrative examples therein and says
It is bright to be only used to explain the present invention but not as a limitation of the invention.
A kind of course control method for use applied by the present invention is described in detail, the method includes following step:
S1: user task is obtained, user task is distributed for the first time and creates task requests；It is specific: to determine whether
There is available dedicated processes node, if it is, creating task requests based on the user task, and the task requests is sent out
Give the dedicated processes node；
It is described to determine whether available dedicated processes node, specifically: it determines whether there is and the user task class
The matched dedicated processes node of type；
It is described that task requests are created based on the user task, the user task is converted into the dedicated processes node
Recognizable format and obtain user task content after conversion, create task requests, and comprising described in the task requests
User task content by conversion；
S2: general distribution is carried out for unallocated user task, and creates task requests；It is specific: the user is appointed
Business divides one or more child user task, is requested based on one or more of child user task creations subtask；
It is described that the user task is divided into one or more child user task, specifically: obtain the user task
In all instructions type quantity, M instruction types before quantity ranking are obtained, if M instruction class before the ranking
The percentage that type accounts for all instructions quantity is more than the first percentage threshold, then selects 2 can be used from all available processes nodes
Node is handled, the user task is divided by 2 sub- user tasks based on 2 available processes nodes, by 2 sons
User task distributes to 2 available processes nodes, and creation subtask request accordingly；Otherwise, directly from existing available
Handle and select the shortest available processes node of waiting list in node, and by the user task be distributed directly to it is described can use
Node is managed, and creates task requests accordingly；
It is described that 2 available processes nodes are selected from all available processes nodes, specifically: calculate all available processes sections
The priority level of point therefrom selects the highest 1 available processes node of priority level, calculates the master control etc. of all available processes nodes
Grade, and the highest 1 available processes node of master control grade is selected, by 1 available processes node and 1 available processes
Node is as selected 2 available processes nodes；
The priority level for calculating all available processes nodes, specifically: it obtains all available processes node types and holds
Row ability M tuple (OPT1,j…OPTi,j…OPTM,j), wherein OPTi, j are j-th of available processes node for i-th kind of instruction
The instruction capabilities of type；Obtain queue queue the length QL and comprehensive treatment capability CPB of all available processes nodes；QLj is jth
Queue queue's length of a available processes node；CPBj is the comprehensive treatment capability of j-th of available processes node；User is obtained to appoint
M tuple (the OPN that M instruction types are constituted before quantity ranking in business1…OPNi…OPNM), OPNi is i-th kind of instruction type
Quantity；The priority level AVF of j-th of available processes node is calculated based on following formula (1) and (2)j；
The master control grade for calculating all available processes nodes, specifically: calculating described j-th based on following formula (3) can
With the master control grade DLFj of processing node；
DFFj=W1 × CPCPj+W2×STCPj+W3×CMCPj(3)；
Wherein: W1, W2, W3 are weight；CPCPj, STCPj, CMCPjThe calculating energy of respectively j-th available processes node
Power, storage capacity and communication capacity；
It is preferred: W3 > W2 > W1；W3=8, W2=4, W1=1；
Preferred: the comprehensive treatment capability has comprehensively considered the computing capability of available processes node, storage capacity and logical
Letter ability；
It is described that the user task is divided by 2 sub- user tasks based on 2 available processes nodes, by described 2
A sub- user task distributes to 2 available processes nodes, specifically: user task is divided into comprising M before quantity ranking
First child user task of the instruction of the instruction type of position, and the second child user task of the instruction comprising other instruction types,
The first child user task is distributed into the highest available processes node of priority level, the second user task is distributed to
The highest available processes node of master control grade；
S3: available processes node executes user task, and central processing unit carries out process control to the implementation procedure；Tool
Body: available processes node receive user task request and/or child user task requests, and by the user task request and/
Or child user task requests are placed at the tail of the queue of pending queue, are dispatched and are executed the user task request and/or child user
Task requests, start-up course control process carries out process control to implementation procedure before execution；
The process control includes controlling the implementation procedure to prevent extraneous attack, and in the process of implementation may
The exceptional instructions such as the non-permissible access occurred；
Preferred: the implementation procedure of the process control is that backstage executes, and does not influence the execution of the user task；
It is preferred: to distribute dedicated process control for the request of each user task and/or the execution of child user task requests
Process；All process control processes execute in independent physical processing unit；
It is preferred: after user task request/child user task requests are finished, to send and execute to central processing unit
Completion notice is to receive implementing result；Implementing result is fed back into user；
Preferred: the user receives the result by client computer and feeds back；
Obviously, described embodiments are some of the embodiments of the present invention, instead of all the embodiments.Based on the present invention
In embodiment, all other implementation obtained by those of ordinary skill in the art without making creative efforts
Example, shall fall within the protection scope of the present invention.
It should be understood by those skilled in the art that, embodiments herein can provide as method, system or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the application
Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the application, which can be used in one or more,
The computer program implemented in usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) produces
The form of product.
The application is referring to method, the process of equipment (system) and computer program product according to the embodiment of the present application
Figure and/or block diagram describe.It should be understood that every one stream in flowchart and/or the block diagram can be realized by computer program instructions
The combination of process and/or box in journey and/or box and flowchart and/or the block diagram.It can provide these computer programs
Instruct the processor of general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to produce
A raw machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for real
The device for the function of being specified in present one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
The above is only the embodiment of the present invention, are not intended to restrict the invention, all in the spirit and principles in the present invention
Within, any modification, equivalent substitution, improvement and etc. done, be all contained in apply pending scope of the presently claimed invention it
It is interior.
Claims (8)
1. a kind of course control method for use, which is characterized in that this method comprises the following steps:
S1: user task is obtained, user task is distributed for the first time and creates task requests；
S2: general distribution is carried out for unallocated user task；
S3: process control is carried out to the implementation procedure.
2. course control method for use according to claim 1, which is characterized in that the step S3 specifically: available processes section
Point receives user task request and/or child user task requests, and the user task is requested and/or child user task requests
It is placed at the tail of the queue of pending queue, dispatches and executes the user task request and/or child user task requests, in execution
Preceding start-up course control process carries out process control to implementation procedure.
3. course control method for use according to claim 2, which is characterized in that the process control includes controlling the execution
Process is to prevent extraneous attack, and the non-permissible access exception instruction being likely to occur in the process of implementation.
4. course control method for use according to claim 3, which is characterized in that the implementation procedure of the process control is backstage
It executes, does not influence the execution of the user task.
5. course control method for use according to claim 4, which is characterized in that all process control processes are independent
It is executed in physical processing unit.
6. course control method for use according to claim 5, which is characterized in that asked in user task request/child user task
It asks after being finished, is sent to central processing unit and execute completion notice to receive implementing result；Implementing result is fed back into use
Family.
7. course control method for use according to claim 6, which is characterized in that the user is received by client computer
The implementing result of feedback.
8. course control method for use according to claim 7, which is characterized in that the side being monitored by the way that separate threads are arranged
Formula realizes process control.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811153673.5A CN109460290A (en) | 2018-09-30 | 2018-09-30 | A kind of course control method for use |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811153673.5A CN109460290A (en) | 2018-09-30 | 2018-09-30 | A kind of course control method for use |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109460290A true CN109460290A (en) | 2019-03-12 |
Family
ID=65607185
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811153673.5A Pending CN109460290A (en) | 2018-09-30 | 2018-09-30 | A kind of course control method for use |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109460290A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102104628A (en) * | 2010-12-29 | 2011-06-22 | 北京新媒传信科技有限公司 | Server cluster system and management method thereof |
| CN102591765A (en) * | 2011-12-31 | 2012-07-18 | 珠海市君天电子科技有限公司 | Progress automatic management system |
| US20140181828A1 (en) * | 2012-12-21 | 2014-06-26 | International Business Machines Corporation | Processor provisioning by a middleware processing system |
| CN105808342A (en) * | 2014-12-30 | 2016-07-27 | 中国电信股份有限公司 | Method used for allocating client requests and judgment apparatus and system |
| US20160321104A1 (en) * | 2014-04-03 | 2016-11-03 | Tencent Technology (Shenzhen) Company Limited | Method and apparatus for scheduling concurrent task |
-
2018
- 2018-09-30 CN CN201811153673.5A patent/CN109460290A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102104628A (en) * | 2010-12-29 | 2011-06-22 | 北京新媒传信科技有限公司 | Server cluster system and management method thereof |
| CN102591765A (en) * | 2011-12-31 | 2012-07-18 | 珠海市君天电子科技有限公司 | Progress automatic management system |
| US20140181828A1 (en) * | 2012-12-21 | 2014-06-26 | International Business Machines Corporation | Processor provisioning by a middleware processing system |
| US20160321104A1 (en) * | 2014-04-03 | 2016-11-03 | Tencent Technology (Shenzhen) Company Limited | Method and apparatus for scheduling concurrent task |
| CN105808342A (en) * | 2014-12-30 | 2016-07-27 | 中国电信股份有限公司 | Method used for allocating client requests and judgment apparatus and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9916183B2 (en) | Scheduling mapreduce jobs in a cluster of dynamically available servers | |
| CN107239336B (en) | Method and device for realizing task scheduling | |
| Singh et al. | Task scheduling in cloud computing | |
| KR101471749B1 (en) | Virtual machine allcoation of cloud service for fuzzy logic driven virtual machine resource evaluation apparatus and method | |
| CN107992359A (en) | The task scheduling algorithm that cost perceives under a kind of cloud environment | |
| CN110661842B (en) | Resource scheduling management method, electronic equipment and storage medium | |
| CN109257399B (en) | Cloud platform application program management method, management platform and storage medium | |
| CN114138486A (en) | Containerized micro-service arranging method, system and medium for cloud edge heterogeneous environment | |
| CN108170517A (en) | A kind of container allocation method, apparatus, server and medium | |
| Delavar et al. | A synthetic heuristic algorithm for independent task scheduling in cloud systems | |
| CN105210324B (en) | Strategy and charging rule functions virtual method, apparatus and system | |
| CN104917839A (en) | Load balancing method for use in cloud computing environment | |
| US8819239B2 (en) | Distributed resource management systems and methods for resource management thereof | |
| CN113626173B (en) | Scheduling method, scheduling device and storage medium | |
| CN103442087B (en) | A kind of Web service system visit capacity based on response time trend analysis controls apparatus and method | |
| CN113986534A (en) | Task scheduling method and device, computer equipment and computer readable storage medium | |
| CN109739634A (en) | A kind of atomic task execution method and device | |
| CN105550025A (en) | Distributed IaaS (Infrastructure as a Service) scheduling method and system | |
| CN110716809B (en) | Method and device for scheduling cloud resources | |
| Hamzeh et al. | A new approach to calculate resource limits with fairness in kubernetes | |
| CN105933136B (en) | A kind of resource regulating method and system | |
| CN107454137B (en) | Method, device and equipment for on-line business on-demand service | |
| Sahu et al. | Efficient load balancing algorithm analysis in cloud computing | |
| CN109460290A (en) | A kind of course control method for use | |
| CN115952054A (en) | Simulation task resource management method, device, equipment and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |