CN105677476A - Computer network energy auxiliary scheduling method - Google Patents
Computer network energy auxiliary scheduling method Download PDFInfo
- Publication number
- CN105677476A CN105677476A CN201511004028.3A CN201511004028A CN105677476A CN 105677476 A CN105677476 A CN 105677476A CN 201511004028 A CN201511004028 A CN 201511004028A CN 105677476 A CN105677476 A CN 105677476A
- Authority
- CN
- China
- Prior art keywords
- node
- priority
- information
- energy
- concurrent program
- 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/5083—Techniques for rebalancing the load in a distributed system
- G06F9/5088—Techniques for rebalancing the load in a distributed system involving task migration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/503—Resource availability
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The present invention relates to a computer network energy auxiliary scheduling method which comprises the following steps of collecting node information of nodes in a super computer; obtaining priority information of the nodes according to the node information; obtaining conformities between the nodes and parallel program capability requirements, and calculating scheduling priorities of the nodes according to priorities corresponding to a priority mode and the conformities; generating a node list according to the scheduling priorities of the nodes, and scheduling parallel program to the corresponding node according to the node list; selecting the node having the maximum scheduling priority, and adding the node address of the node, and the corresponding processor address and core address of the node to the node list; and determining whether the node information can satisfy capability requirements of the parallel program on the nodes according to the node information of the node having the maximum scheduling priority. Energy balance of supply and demand of a distributed energy network can be fully achieved, energy waste can be effectively avoided, and energy utilization efficiency can be improved.
Description
Technical field
The present invention relates to field of computer technology, be specifically related to a kind of computer network energy auxiliary dispatching method.
Background technology
Distributed energy resource system refers to and with (the thousands of watts of small modules formulas to 50MW), low capacity, modularity, distributed mode on a small scale, energy resource system is arranged in user side, come that transmitted in both directions is hot and cold, the system of electric energy, it can improve comprehensive utilization of energy rate and Supply Security, realize energy-on-demand and provide the user more more options, distributed energy resource system becomes the important development direction of global power industry and energy industry, is one of important channel solving global energy problem in short supply. Along with various energy resources comprehensive utilization usefulness is more and more higher, energy kind is more and more abundanter, and distributed energy resource system technical solution on engineer applied is also more and more ripe, and the difficulty on promoting is also more and more less. Relevant expert predicts, at following 20 years, by the golden age in of being development distributed energy resource system. Therefore numerous company is had to carry out the research of distributed energy resource system, promotion and application both at home and abroad, wherein how to improve the overall efficiency of distributed energy resource system, on-demand power supply, heat supply and cooling, two-way choice, and realize remotely controlling, be one of current Main way studied.
Summary of the invention
It is an object of the invention to provide a kind of computer network energy auxiliary dispatching method, solve the technical problem of information linking road fracture in distributed energy network scheduling process, the Optimized Operation data making distributed energy network arrive the control unit of energy transition equipment smoothly, reach to optimize the purpose of efficiency, energy-conserving and environment-protective.
For achieving the above object, present invention employs techniques below scheme:
A kind of computer network energy auxiliary dispatching method, comprises the following steps:
(1) nodal information of each node in supercomputer is collected;
(2) obtain the priority level information of node, the mode of priority according to described concurrent program according to described nodal information, from the priority level information of described node, select the relative importance value corresponding with described mode of priority;
(3) Capability Requirement of node is contrasted by described concurrent program with described nodal information, obtain the node goodness of fit to concurrent program Capability Requirement, and according to the described relative importance value corresponding with mode of priority and described goodness of fit, calculate the dispatching priority degree obtaining node;
(4) generate node listing according to the dispatching priority degree of described node, and according to described node listing, concurrent program is dispatched to respective nodes;
(5) node that selection scheduling relative importance value is maximum, adds in described node listing by the processor address of the node address of described node and its correspondence and kernel address;
(6) nodal information according to the maximum node of described dispatching priority degree, judge whether described nodal information can reach the concurrent program Capability Requirement to node, if so, then described concurrent program is dispatched to this node, otherwise, the dispatching priority degree of each node is recalculated.
As shown from the above technical solution, the present invention has data and the information exchanging channel of smoothness, the traffic control process making distributed energy network achieves automatization, and ensure that distributed energy network the actual running results meets the optimized dispatching criterion of efficiency, can fully realize the distributed energy network energy equilibrium of supply and demand, it is prevented effectively from energy waste, improves efficiency of energy utilization, reach energy-saving and emission-reduction purpose. This system not only have rational in infrastructure, automatization level is high, is also equipped with device reliability and the high feature of utilizability, for distributed energy network energy efficiency Optimized Operation, it is provided that practical automatic technology means.
Accompanying drawing explanation
Fig. 1 is the module map of Computer-aided Intelligent dispatching patcher of the present invention.
Detailed description of the invention
Below in conjunction with accompanying drawing, the present invention will be further described:
As it is shown in figure 1, the computer network energy aid system of the present embodiment, including program setting module 2, information acquisition module 3, computing module 1, List Generating Module 4, scheduler module 5 and data recordin module 6;
This computing module 1, is connected with information collection module, for the mode of priority of the information gathered according to information acquisition module 3 and computer concurrent program and the Capability Requirement to the information of collection, calculates the dispatching priority degree obtaining collection information; List Generating Module 4, is connected with computing module 1, generates dispatch list for the dispatching priority degree according to the information of collection; Scheduler module 5, is connected with List Generating Module 4, for concurrent program being dispatched to corresponding node according to list; Program setting module 2, is connected with computing module 1, for the mode of priority of setting computer concurrent program and the Capability Requirement to the information of collection; Data recordin module 6, for log history data and status information of equipment, provides data and information source for Optimized Operation.
A kind of computer network energy auxiliary dispatching method, specifically includes following steps:
S1: collect the nodal information of each node in supercomputer;
S2: obtain the priority level information of node, the mode of priority according to described concurrent program according to described nodal information, select the relative importance value corresponding with described mode of priority from the priority level information of described node;
S3: the Capability Requirement of node is contrasted by described concurrent program with described nodal information, obtain the node goodness of fit to concurrent program Capability Requirement, and according to the described relative importance value corresponding with mode of priority and described goodness of fit, calculate the dispatching priority degree obtaining node;
S4: generate node listing according to the dispatching priority degree of described node, and according to described node listing, concurrent program is dispatched to respective nodes;
S5: the node that selection scheduling relative importance value is maximum, adds in described node listing by the processor address of the node address of described node and its correspondence and kernel address;
S6: the nodal information according to the maximum node of described dispatching priority degree, judge whether described nodal information can reach the concurrent program Capability Requirement to node, if so, then described concurrent program is dispatched to this node, otherwise, the dispatching priority degree of each node is recalculated.
Embodiment described above is only that the preferred embodiment of the present invention is described; not the scope of the present invention is defined; under the premise designing spirit without departing from the present invention; various deformation that technical scheme is made by those of ordinary skill in the art and improvement, all should fall in the protection domain that claims of the present invention is determined.
Claims (1)
1. a computer network energy auxiliary dispatching method, it is characterised in that comprise the following steps:
(1) nodal information of each node in supercomputer is collected;
(2) obtain the priority level information of node, the mode of priority according to described concurrent program according to described nodal information, from the priority level information of described node, select the relative importance value corresponding with described mode of priority;
(3) Capability Requirement of node is contrasted by described concurrent program with described nodal information, obtain the node goodness of fit to concurrent program Capability Requirement, and according to the described relative importance value corresponding with mode of priority and described goodness of fit, calculate the dispatching priority degree obtaining node;
(4) generate node listing according to the dispatching priority degree of described node, and according to described node listing, concurrent program is dispatched to respective nodes;
(5) node that selection scheduling relative importance value is maximum, adds in described node listing by the processor address of the node address of described node and its correspondence and kernel address;
(6) nodal information according to the maximum node of described dispatching priority degree, judge whether described nodal information can reach the concurrent program Capability Requirement to node, if so, then described concurrent program is dispatched to this node, otherwise, the dispatching priority degree of each node is recalculated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511004028.3A CN105677476A (en) | 2015-12-29 | 2015-12-29 | Computer network energy auxiliary scheduling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511004028.3A CN105677476A (en) | 2015-12-29 | 2015-12-29 | Computer network energy auxiliary scheduling method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105677476A true CN105677476A (en) | 2016-06-15 |
Family
ID=56297868
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201511004028.3A Pending CN105677476A (en) | 2015-12-29 | 2015-12-29 | Computer network energy auxiliary scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105677476A (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102208834A (en) * | 2011-05-24 | 2011-10-05 | 中国科学院深圳先进技术研究院 | Scheduling system and method of intelligent power grid |
-
2015
- 2015-12-29 CN CN201511004028.3A patent/CN105677476A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102208834A (en) * | 2011-05-24 | 2011-10-05 | 中国科学院深圳先进技术研究院 | Scheduling system and method of intelligent power grid |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP5276294B2 (en) | Load reduction planning system and demand control system | |
| CN101813941B (en) | Energy efficiency optimizing and dispatching system for cold, heat and electricity triple supply equipment | |
| Xu et al. | A self-adaptive approach for managing applications and harnessing renewable energy for sustainable cloud computing | |
| US9728976B2 (en) | Method and system for allocating energy | |
| Sivaneasan et al. | A new demand response algorithm for solar PV intermittency management | |
| CN101982917B (en) | Calculation method of available transmission capacity for power grid scheduling | |
| Cheng et al. | Consumer-centered energy system for electric vehicles and the smart grid | |
| CN103384272A (en) | Cloud service distributed data center system and load dispatching method thereof | |
| CN103823541A (en) | Equipment and method for energy-saving dispatching of virtual data center | |
| CN104035542A (en) | Virtual machine migration method and system for balancing calculation energy consumption and refrigeration energy consumption | |
| CN109005223A (en) | Internet of Things resource regulating method and system, computer readable storage medium and terminal | |
| CN115347569B (en) | Power allocation system based on intelligent prediction | |
| CN104794532A (en) | Automatic demand response system and automatic demand response method based on cloud computing PaaS platform | |
| CN102695190A (en) | Data acquisition method in wireless sensor network | |
| CN104102532B (en) | Research-on-research stream scheduling method based on low energy consumption in a kind of isomeric group | |
| CN106201658A (en) | A kind of migration virtual machine destination host multiple-objection optimization system of selection | |
| CN104537505B (en) | A kind of data center's real-time task scheduling method based on market guidance | |
| CN101231523B (en) | Control system and method for sensibility charge | |
| CN104536939A (en) | Method for configurable energy-saving dispatching of multi-core embedded cache | |
| CN105677476A (en) | Computer network energy auxiliary scheduling method | |
| CN102902878B (en) | A kind of energy cost perception dispatching method | |
| CN102437643B (en) | Method for determining available power transmission capacity of each power transmission section in multiple sections | |
| CN102521715B (en) | A kind of method and system controlling application system Resourse Distribute | |
| Caux et al. | Smart datacenter electrical load model for renewable sources management | |
| CN104331326A (en) | Scheduling method and system for cloud computing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160615 |
|
| RJ01 | Rejection of invention patent application after publication |