CN109271251A - A method of by constraining come scheduling node machine - Google Patents
A method of by constraining come scheduling node machine Download PDFInfo
- Publication number
- CN109271251A CN109271251A CN201810905149.2A CN201810905149A CN109271251A CN 109271251 A CN109271251 A CN 109271251A CN 201810905149 A CN201810905149 A CN 201810905149A CN 109271251 A CN109271251 A CN 109271251A
- Authority
- CN
- China
- Prior art keywords
- task
- node station
- binding occurrence
- node
- user
- 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
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/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- 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/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
- G06F9/5066—Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention discloses a kind of by constraining come the method for scheduling node machine, including to Node station the first binding occurrence is arranged, to the second binding occurrence of user setting, when task meets less than the first binding occurrence and the second binding occurrence simultaneously, Node station runs task.The present invention avoids Node station from overloading, to avoid the system failure or collapse of Cloud Server by the way that the first binding occurrence is arranged to Node station.By giving the second binding occurrence of user setting, the operation task quantity of user is limited, avoids sole user from occupying the excessive resource of Cloud Server, promotes user experience.
Description
Technical field
The present invention relates to field of cloud computer technology more particularly to a kind of by constraining come the method for scheduling node machine.
Background technique
In current cloud, cloud service, field of cloud calculation, to the control of computer room machine always be one it is important
How link carries out control effectively freely to the machine of computer room and deploys, be a great problem in field of cloud calculation.If no
It can control well, it is easy to cause the system failure or collapse of Cloud Server, system stability is poor.Meanwhile cloud service is crowd
More users provides service, if some user largely occupies Cloud Server resource, will lead to other users and uses cloud service
The experience of device is deteriorated.
Therefore, the prior art is defective, needs to improve.
Summary of the invention
The technical problem to be solved by the present invention is providing a kind of by constraining come the method for scheduling node machine, cloud is avoided to take
The system failure or collapse of business device, while sole user being avoided to occupy too many Cloud Server resource.
Technical scheme is as follows: provide it is a kind of by constraining come the method for scheduling node machine, Cloud Server be packet
Machine pond containing several Node stations, includes the following steps.
S1: its first binding occurrence is arranged to each Node station, to user setting second in the management server of Cloud Server
Binding occurrence, first binding occurrence be Node station in can occupied maximum resource value, second binding occurrence be maximum fortune
Row task quantity.
S2: user submits task to Cloud Server, and management server receives task and distributes task, Node station to Node station
It receives the task and estimating and runs the task and need the resource value that occupies, Node station calculates total occupied after running the task
Resource value.
S3: if the occupied resource value of Node station always in step S2 is greater than the first binding occurrence, Node station wouldn't be run
Distributing in step S2 for task, distributing in step S2 for task wait until the total occupied resource value of Node station about less than first
Beam value；If the occupied resource value of Node station always in step S2 is transferred to step S4 less than the first binding occurrence.Limit Node station
Occupied resource value, avoids Node station from overloading, to avoid the system failure or collapse of Cloud Server.
S4: if the task quantity of user's operation is greater than the second binding occurrence, what Node station wouldn't distribute in operating procedure S2 appoints
It is engaged in, distributing in step S2 for task waits until the task quantity of user's operation less than the second binding occurrence；If the task of user's operation
Quantity is less than the second binding occurrence, the distributing in Node station operating procedure S2 of the task.The operation task quantity for limiting user, avoids list
The excessive resource of one user occupancy Cloud Server promotes user experience.
Further, the management server uses Python script.
Using the above scheme, the present invention provides a kind of by constraining come the method for scheduling node machine, by setting to Node station
The first binding occurrence is set, Node station is avoided to overload, to avoid the system failure or collapse of Cloud Server.By to user setting the
Two binding occurrences limit the operation task quantity of user, avoid sole user from occupying the excessive resource of Cloud Server, promote user's body
It tests.
Detailed description of the invention
Fig. 1 is flow chart of the invention.
Specific embodiment
Below in conjunction with the drawings and specific embodiments, the present invention is described in detail.
Referring to Fig. 1, the present invention provide it is a kind of by constraining come the method for scheduling node machine, if Cloud Server is to include
The machine pond of dry Node station, includes the following steps.
S1: its first binding occurrence is arranged to each Node station, to user setting second in the management server of Cloud Server
Binding occurrence, first binding occurrence be Node station in can occupied maximum resource value, second binding occurrence be maximum fortune
Row task quantity.
S2: user submits task to Cloud Server, and management server receives task and distributes task, Node station to Node station
It receives the task and estimating and runs the task and need the resource value that occupies, Node station calculates total occupied after running the task
Resource value.
S3: if the occupied resource value of Node station always in step S2 is greater than the first binding occurrence, Node station wouldn't be run
Distributing in step S2 for task, distributing in step S2 for task wait until the total occupied resource value of Node station about less than first
Beam value；If the occupied resource value of Node station always in step S is transferred to step S4 less than the first binding occurrence.Limit Node station
Occupied resource value, avoids Node station from overloading, to avoid the system failure or collapse of Cloud Server.
S4: if the task quantity of user's operation is greater than the second binding occurrence, what Node station wouldn't distribute in operating procedure S2 appoints
It is engaged in, distributing in step S2 for task waits until the task quantity of user's operation less than the second binding occurrence；If the task of user's operation
Quantity is less than the second binding occurrence, the distributing in Node station operating procedure S2 of the task.The operation task quantity for limiting user, avoids list
The excessive resource of one user occupancy Cloud Server promotes user experience.
In the present embodiment, the management server uses Python script.
In conclusion the present invention provide it is a kind of by constraining come the method for scheduling node machine, by Node station setting the
One binding occurrence, avoids Node station from overloading, to avoid the system failure or collapse of Cloud Server.By giving user setting second about
Beam value limits the operation task quantity of user, avoids sole user from occupying the excessive resource of Cloud Server, promotes user experience.
The above is merely preferred embodiments of the present invention, be not intended to restrict the invention, it is all in spirit of the invention and
Made any modifications, equivalent replacements, and improvements etc., should all be included in the protection scope of the present invention within principle.
Claims (2)
1. a kind of by constraining come the method for scheduling node machine, Cloud Server is the machine pond for including several Node stations,
It is characterized in that, comprising the following steps:
S1: the management server of Cloud Server is arranged its first binding occurrence to each Node station, constrains user setting second
Value, first binding occurrence be Node station in can occupied maximum resource value, second binding occurrence be it is maximum operation appoint
Business quantity；
S2: user submits task to Cloud Server, and management server receives task and distributes task to Node station, and Node station receives
The task simultaneously estimates the resource value that the task needs of operation occupy, and Node station calculates total occupied resource after running the task
Value；
S3: if the occupied resource value of Node station always in step S2 is greater than the first binding occurrence, Node station wouldn't operating procedure
Distributing in S2 for task, distributing in step S2 for task wait until the total occupied resource value of Node station less than the first constraint
Value；If the occupied resource value of Node station always in step S2 is transferred to step S4 less than the first binding occurrence；
S4: if the task quantity of user's operation is greater than the second binding occurrence, the task that Node station wouldn't distribute in operating procedure S2, step
Distributing in rapid S2 for task waits until the task quantity of user's operation less than the second binding occurrence；If the task quantity of user's operation is small
Being distributed in the second binding occurrence, Node station operating procedure S2 for task.
2. according to claim 1 a kind of by constraining come the method for scheduling node machine, which is characterized in that the management clothes
Device be engaged in using Python script.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810905149.2A CN109271251A (en) | 2018-08-09 | 2018-08-09 | A method of by constraining come scheduling node machine |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810905149.2A CN109271251A (en) | 2018-08-09 | 2018-08-09 | A method of by constraining come scheduling node machine |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109271251A true CN109271251A (en) | 2019-01-25 |
Family
ID=65153517
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810905149.2A Pending CN109271251A (en) | 2018-08-09 | 2018-08-09 | A method of by constraining come scheduling node machine |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109271251A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113347111A (en) * | 2021-05-12 | 2021-09-03 | 金茂数字科技有限公司 | Flow adjusting method and management system based on user experience |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1670706A (en) * | 2004-03-17 | 2005-09-21 | 联想(北京)有限公司 | A method for allocating computation nodes in cluster job management system |
| CN102117225A (en) * | 2009-12-31 | 2011-07-06 | 上海可鲁系统软件有限公司 | Industrial automatic multi-point cluster system and task management method thereof |
| CN102567106A (en) * | 2010-12-30 | 2012-07-11 | 中国移动通信集团云南有限公司 | Task scheduling method, system and device |
| CN102917014A (en) * | 2012-09-10 | 2013-02-06 | 中国联合网络通信集团有限公司 | Resource scheduling method and device |
| CN103729246A (en) * | 2013-12-31 | 2014-04-16 | 浪潮(北京)电子信息产业有限公司 | Method and device for dispatching tasks |
| CN106557363A (en) * | 2016-12-05 | 2017-04-05 | 广发证券股份有限公司 | A kind of system and method for big data task scheduling |
| CN106790636A (en) * | 2017-01-09 | 2017-05-31 | 上海承蓝科技股份有限公司 | A kind of equally loaded system and method for cloud computing server cluster |
| CN107291545A (en) * | 2017-08-07 | 2017-10-24 | 星环信息科技（上海）有限公司 | The method for scheduling task and equipment of multi-user in computing cluster |
-
2018
- 2018-08-09 CN CN201810905149.2A patent/CN109271251A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1670706A (en) * | 2004-03-17 | 2005-09-21 | 联想(北京)有限公司 | A method for allocating computation nodes in cluster job management system |
| CN102117225A (en) * | 2009-12-31 | 2011-07-06 | 上海可鲁系统软件有限公司 | Industrial automatic multi-point cluster system and task management method thereof |
| CN102567106A (en) * | 2010-12-30 | 2012-07-11 | 中国移动通信集团云南有限公司 | Task scheduling method, system and device |
| CN102917014A (en) * | 2012-09-10 | 2013-02-06 | 中国联合网络通信集团有限公司 | Resource scheduling method and device |
| CN103729246A (en) * | 2013-12-31 | 2014-04-16 | 浪潮(北京)电子信息产业有限公司 | Method and device for dispatching tasks |
| CN106557363A (en) * | 2016-12-05 | 2017-04-05 | 广发证券股份有限公司 | A kind of system and method for big data task scheduling |
| CN106790636A (en) * | 2017-01-09 | 2017-05-31 | 上海承蓝科技股份有限公司 | A kind of equally loaded system and method for cloud computing server cluster |
| CN107291545A (en) * | 2017-08-07 | 2017-10-24 | 星环信息科技（上海）有限公司 | The method for scheduling task and equipment of multi-user in computing cluster |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113347111A (en) * | 2021-05-12 | 2021-09-03 | 金茂数字科技有限公司 | Flow adjusting method and management system based on user experience |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3530037B1 (en) | System and method for network slice management in a management plane | |
| CN109417572B (en) | System and method for policy configuration of control plane functions by management plane functions | |
| US10791040B2 (en) | Systems and methods for network slice management | |
| CN104468407B (en) | Realize the method and apparatus of business platform resource elasticity distribution | |
| CN109560952B (en) | Network slice management method and equipment | |
| CN110832827A (en) | Network slicing method and system | |
| KR101781339B1 (en) | Method and device for updating client | |
| US20160321112A1 (en) | Management system, virtual communication-function management node, and management method | |
| CN111278016B (en) | Network slice processing method, system and storage medium | |
| JPWO2015141337A1 (en) | Received packet distribution method, queue selector, packet processing device, program, and network interface card | |
| CN105791254B (en) | Network request processing method and device and terminal | |
| US20160147548A1 (en) | Virtual machine arrangement design apparatus and method , system, and program | |
| KR20150000160A (en) | Method for deploying network using distributed virtual switch, apparatus for perfoming the same and network system based on distributed virtual switch | |
| CN110881199A (en) | Dynamic allocation method, device and system for network slice resources | |
| CN112703774A (en) | Network slice management | |
| JP2016086225A (en) | Network system, program for gateway device, and program for management device | |
| CN106063201A (en) | Server, control device, management device, communication system, communication method, control method, management method, and program | |
| CN105718299A (en) | Virtual machine configuration method, device and system | |
| CN104572179B (en) | A kind of infrastructure is service software upgrade method and apparatus | |
| CN104158732B (en) | A kind of intelligent cloud service dynamic routing strategy | |
| CN107770296B (en) | Method and device for allocating addresses | |
| CN109271251A (en) | A method of by constraining come scheduling node machine | |
| US10637748B2 (en) | Method and apparatus for establishing interface between VNFMS, and system | |
| JP6619708B2 (en) | Data separation evaluation apparatus, data separation evaluation method, and data separation evaluation program | |
| CN106793093B (en) | Service processing method and device |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190125 |
|
| RJ01 | Rejection of invention patent application after publication |