CN109144726A - A method of by group come scheduling node machine - Google Patents
A method of by group come scheduling node machine Download PDFInfo
- Publication number
- CN109144726A CN109144726A CN201810905035.8A CN201810905035A CN109144726A CN 109144726 A CN109144726 A CN 109144726A CN 201810905035 A CN201810905035 A CN 201810905035A CN 109144726 A CN109144726 A CN 109144726A
- Authority
- CN
- China
- Prior art keywords
- group
- node station
- task
- user
- belonging
- 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
- G06F9/5038—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 considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- 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
Abstract
The present invention disclose it is a kind of by group come the method for scheduling node machine, management server first gives user and Node station that group is arranged, then matched Node station is preferentially assigned the task to, when maximum operation number of two amount of task of distribution beyond Node station, the partial task exceeded distributes to Node station idle in other groups.The present invention is by being arranged group to user and Node station, the task that user submits preferentially is distributed to matched Node station by management server, when the task amount for distributing to matched Node station is greater than maximum operation number of the Node station beyond Node station, the partial task exceeded can be assigned on the idle machine in other groups and run, to make full use of Node station resource, resources idle is avoided.
Description
Technical field
The present invention relates to field of cloud computer technology more particularly to it is a kind of by group 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.
Therefore, the prior art is defective, needs to improve.
Summary of the invention
The technical problem to be solved by the present invention is provide it is a kind of by group come the method for scheduling node machine, optimize to cloud
The scheduling of Node station in server promotes the utilization efficiency of Node station.
Technical scheme is as follows: provide it is a kind of by group come the method for scheduling node machine, Cloud Server be packet
Machine pond containing several Node stations, includes the following steps；
S1: the management server of Cloud Server divides group to Node station, to tenant group group, and a Node station group is corresponding
One groups of users.
S2: user submits task to Cloud Server, belonging to management server group according to belonging to Node station and user
The principle of group matches assigns the task to corresponding Node station, receives task with the Node station of group matches belonging to user；
If be more than its maximum operation number with the number of tasks of the Node station of group matches belonging to user, portion that management server will be more than
Distribute to the unmatched Node station of group belonging to user, receive and appoint with group belonging to user unmatched Node station
Business.
S3: if group matches belonging to the user of group belonging to Node station and the submission task, Node station operating procedure
The task of S2 distribution；If group belonging to the user of group belonging to Node station and the submission task mismatches, S4 is entered step.
S4: if not running the task of other groups with group belonging to user unmatched Node station, and belonging to user
Group's unmatched Node station then the distributing in operating procedure S2 of the task；If with the unmatched Node station of group belonging to user
Operation has the tasks of other groups, transports again after the task of other groups has been run with group belonging to user unmatched Node station
Being distributed in row step S2 for task.
The user of a certain group to Cloud Server submit task, task can be assigned to by the management server of Cloud Server with
On the Node station of the group matches, run with the task amount of the Node station of the group matches beyond the maximum of Node station if distributing to
Number, the partial task exceeded can be assigned on the idle machine in other groups and run, until the corresponding group of idle machine
Come in task, then after waiting Node stations to complete being currently running for task, the task of this group of priority processing.
Further, the management server uses Python script.
Using the above scheme, the present invention provide it is a kind of by group come the method for scheduling node machine, by giving user and Jie
Group is arranged in point machine, and the task that user submits preferentially is distributed to matched Node station by management server, matched when distributing to
When the task amount of Node station is greater than maximum operation number of the Node station beyond Node station, the partial task exceeded can be assigned to other groups
It is run on idle machine in group, to make full use of Node station resource, avoids resources idle.
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 group 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: the management server of Cloud Server divides group to Node station, to tenant group group, and a Node station group is corresponding
One groups of users.
S2: user submits task to Cloud Server, belonging to management server group according to belonging to Node station and user
The principle of group matches assigns the task to corresponding Node station, receives task with the Node station of group matches belonging to user；
If be more than its maximum operation number with the number of tasks of the Node station of group matches belonging to user, portion that management server will be more than
Distribute to the unmatched Node station of group belonging to user, receive and appoint with group belonging to user unmatched Node station
Business.
S3: if group matches belonging to the user of group belonging to Node station and the submission task, Node station operating procedure
The task of S2 distribution；If group belonging to the user of group belonging to Node station and the submission task mismatches, S4 is entered step.
S4: if not running the task of other groups with group belonging to user unmatched Node station, and belonging to user
Group's unmatched Node station then the distributing in operating procedure S2 of the task；If with the unmatched Node station of group belonging to user
Operation has the tasks of other groups, transports again after the task of other groups has been run with group belonging to user unmatched Node station
Being distributed in row step S2 for task.
The user of a certain group to Cloud Server submit task, task can be assigned to by the management server of Cloud Server with
On the Node station of the group matches, run with the task amount of the Node station of the group matches beyond the maximum of Node station if distributing to
Number, the partial task exceeded can be assigned on the idle machine in other groups and run, until the corresponding group of idle machine
Come in task, then after waiting Node stations to complete being currently running for task, the task of this group of priority processing.
In the present embodiment, the management server uses Python script.
In conclusion the present invention provide it is a kind of by group come the method for scheduling node machine, by giving user and Node station
Group is set, and the task that user submits preferentially is distributed to matched Node station by management server, when distributing to matched node
When the task amount of machine is greater than maximum operation number of the Node station beyond Node station, the partial task exceeded can be assigned in other groups
Idle machine on run, to make full use of Node station resource, avoid resources idle.
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. it is a kind of by group 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 divides group to Node station, to tenant group group, and a Node station group is one corresponding
Groups of users；
S2: user submits task, group belonging to management server group according to belonging to Node station and user to Cloud Server
Matched principle assigns the task to corresponding Node station, receives task with the Node station of group matches belonging to user；If with
When the number of tasks of the Node station of group matches belonging to user is more than its maximum operation number, management server divides the part for being more than
With the unmatched Node station of group belonging to user is given, with the unmatched Node station reception task of group belonging to user；
S3: if group matches belonging to the user of group belonging to Node station and the submission task, Node station operating procedure S2 points
Matching for task；If group belonging to the user of group belonging to Node station and the submission task mismatches, S4 is entered step；
S4: if the task of other groups is not run with group belonging to user unmatched Node station, with group belonging to user
The task that the unmatched Node station of group then distributes in operating procedure S2；If with the unmatched Node station operation of group belonging to user
There is the task of other groups, step of reruning after the task of other groups has been run with group belonging to user unmatched Node station
Being distributed in rapid S2 for task.
2. it is according to claim 1 it is a kind of by group come the method for scheduling node machine, which is characterized in that management clothes
Device be engaged in using Python script.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810905035.8A CN109144726A (en) | 2018-08-09 | 2018-08-09 | A method of by group come scheduling node machine |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810905035.8A CN109144726A (en) | 2018-08-09 | 2018-08-09 | A method of by group come scheduling node machine |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109144726A true CN109144726A (en) | 2019-01-04 |
Family
ID=64792491
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810905035.8A Pending CN109144726A (en) | 2018-08-09 | 2018-08-09 | A method of by group come scheduling node machine |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109144726A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102622265A (en) * | 2011-01-28 | 2012-08-01 | 天脉聚源(北京)传媒科技有限公司 | Method and system for task distribution |
| CN106453146A (en) * | 2016-11-17 | 2017-02-22 | 华胜信泰信息产业发展有限公司 | Private cloud computing resource distribution method and system |
| CN106445683A (en) * | 2016-09-12 | 2017-02-22 | 北京中电普华信息技术有限公司 | Method and device for distributing server resource |
| CN107659433A (en) * | 2017-09-08 | 2018-02-02 | 中国联合网络通信集团有限公司 | A kind of cloud resource dispatching method and equipment |
| CN107807854A (en) * | 2017-10-25 | 2018-03-16 | 深圳市瑞云科技有限公司 | The method and rendering task processing method of a kind of Automatic dispatching Node station |
-
2018
- 2018-08-09 CN CN201810905035.8A patent/CN109144726A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102622265A (en) * | 2011-01-28 | 2012-08-01 | 天脉聚源(北京)传媒科技有限公司 | Method and system for task distribution |
| CN106445683A (en) * | 2016-09-12 | 2017-02-22 | 北京中电普华信息技术有限公司 | Method and device for distributing server resource |
| CN106453146A (en) * | 2016-11-17 | 2017-02-22 | 华胜信泰信息产业发展有限公司 | Private cloud computing resource distribution method and system |
| CN107659433A (en) * | 2017-09-08 | 2018-02-02 | 中国联合网络通信集团有限公司 | A kind of cloud resource dispatching method and equipment |
| CN107807854A (en) * | 2017-10-25 | 2018-03-16 | 深圳市瑞云科技有限公司 | The method and rendering task processing method of a kind of Automatic dispatching Node station |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang et al. | Dynamic resource scheduling in mobile edge cloud with cloud radio access network | |
| CN104391918B (en) | The implementation method of distributed networks database query priority management based on equity deployment | |
| US9722877B2 (en) | Method and apparatus for managing virtual networks via cloud hosted application | |
| CN101951411A (en) | Cloud scheduling system and method and multistage cloud scheduling system | |
| CN104253850A (en) | Distributed task scheduling method and system | |
| CN103150213B (en) | Balancing method of loads and device | |
| CN110071965B (en) | Data center management system based on cloud platform | |
| TWI786527B (en) | User code operation method of programming platform, electronic equipment and computer-readable storage medium | |
| WO2017054650A1 (en) | Task distribution method, device and system | |
| CN103780686A (en) | Method and system for customizing application approval procedure in cloud organization | |
| CN101179553A (en) | Efficient order-preserving delivery method and device for concurrent messages | |
| CN103078940A (en) | Method and system for conducting resource application approval in cloud computing operating system | |
| CN109766172A (en) | A kind of asynchronous task scheduling method and device | |
| CN107807854A (en) | The method and rendering task processing method of a kind of Automatic dispatching Node station | |
| CN111240822B (en) | Task scheduling method, device, system and storage medium | |
| CN110300188A (en) | Data transmission system, method and apparatus | |
| CN102811141A (en) | Method and system for monitoring running of virtual machines | |
| CN103149839A (en) | Operational control method for electrical equipment based on Kuhn-Munkres algorithm | |
| CN104268007A (en) | Distributed event request scheduling method and system | |
| Imdoukh et al. | Optimizing scheduling decisions of container management tool using many‐objective genetic algorithm | |
| CN110868435A (en) | Bare metal server scheduling method and device and storage medium | |
| CN105205735A (en) | Power dispatching data cloud service system and implementation method | |
| CN109144726A (en) | A method of by group come scheduling node machine | |
| Mishra et al. | H3CSA: A makespan aware task scheduling technique for cloud environments | |
| CN103067450B (en) | Application control method and system for cloud environment |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190104 |