CN109002342A - A kind of computing resource orientation dispatching method and system based on OpenStack - Google Patents

A kind of computing resource orientation dispatching method and system based on OpenStack Download PDF

Info

Publication number
CN109002342A
CN109002342A CN201710420946.7A CN201710420946A CN109002342A CN 109002342 A CN109002342 A CN 109002342A CN 201710420946 A CN201710420946 A CN 201710420946A CN 109002342 A CN109002342 A CN 109002342A
Authority
CN
China
Prior art keywords
virtual machine
calculate node
zoning
openstack
calculate
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.)
Granted
Application number
CN201710420946.7A
Other languages
Chinese (zh)
Other versions
CN109002342B (en
Inventor
刘炳宏
朴爱花
霍玮
孙丹丹
邹维
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Institute of Information Engineering of CAS
Original Assignee
Institute of Information Engineering of CAS
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Institute of Information Engineering of CAS filed Critical Institute of Information Engineering of CAS
Priority to CN201710420946.7A priority Critical patent/CN109002342B/en
Publication of CN109002342A publication Critical patent/CN109002342A/en
Application granted granted Critical
Publication of CN109002342B publication Critical patent/CN109002342B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1001Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1001Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004Server selection for load balancing
    • H04L67/1012Server selection for load balancing based on compliance of requirements or conditions with available server resources
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1001Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1029Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers using data related to the state of servers by a load balancer
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • G06F9/45558Hypervisor-specific management and integration aspects
    • G06F2009/4557Distribution of virtual machine instances; Migration and load balancing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • G06F9/45558Hypervisor-specific management and integration aspects
    • G06F2009/45587Isolation or security of virtual machine instances
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • G06F9/45558Hypervisor-specific management and integration aspects
    • G06F2009/45595Network integration; Enabling network access in virtual machine instances

Abstract

The present invention provides a kind of computing resource orientation dispatching method based on OpenStack, and step includes: OpenStack computing resource 1) to be divided into multiple zonings according to the relevant parameter of virtual machine, and be identified;2) all calculate nodes are divided into specified zoning, and input database;3) user selects zoning by mark, and whole calculate node information of the zoning are read from database;4) the whole calculate nodes read for step 3), filter out incongruent calculate node, remaining calculate node are ranked up, dispatch the forward calculate node that sorts and generate virtual machine.The present invention also provides a kind of, and the computing resource based on OpenStack orients scheduling system.

Description

A kind of computing resource orientation dispatching method and system based on OpenStack
Technical field
The present invention relates to field of cloud computer technology, in particular to a kind of computing resource based on OpenStack orients scheduling Method and system.
Background technique
In recent years, cloud computing technology had become most popular one of IT technology, caused industrial circle, academia and political affairs The highest attention of mansion department.OpenStack is one of current most popular cloud computing technology, it can be by different physical resources It is integrally formed huge resource pool, is externally provided and is calculated, stores, net source service.OpenStack itself utilizes available domain Zone Physical resource is subjected to Classification Management, all control nodes are divided into same available domain Internal, by all calculate nodes It is divided into same available domain Nova.Currently, OpenStack is first to filter each calculate node that its computing resource is added respectively With weighting sequence processing, then it is scheduled.
However disadvantage is that: available domain Zone is (different by geographical (different computer rooms or different cabinets) or physics Device configuration) resource is divided, granularity is larger, cannot be filtered during the filtration process according to the different business purposes of calculate node Processing, can not orient and be dispatched to specified region;When computing resource is larger, requires a high expenditure of energy and adjusted with the time Degree and operation and maintenance, cost are excessively high.
Summary of the invention
In order to overcome the deficiencies of the prior art, the present invention provides a kind of computing resource orientation dispatching party based on OpenStack The computing resource of OpenStack can be divided into different zonings by method and system, and zoning range ratio Zone is smaller, Nova available domain can be divided into multiple zonings, to meet different demands;User can select to calculate according to self-demand Region, orientation scheduler module can improve dispatching efficiency by scheduling virtual machine to specified zoning;And it can be to not same district The computing resource in domain distinguishes O&M, and save the cost is more efficient to utilize resource.
In order to solve the above technical problem, the present invention provides technical solution it is as follows:
A kind of computing resource orientation dispatching method based on OpenStack, step include:
1) OpenStack computing resource is divided by multiple zonings according to the relevant parameter of virtual machine, rower of going forward side by side Know;
2) all calculate nodes (server) are divided into specified zoning, and input database;
3) user selects zoning by mark, and whole calculate nodes letter of the zoning is read from database Breath;
4) the whole calculate nodes read for step 3), filter out incongruent calculate node, and remaining calculating is saved Point is ranked up, and is dispatched the forward calculate node that sorts and is generated virtual machine.
Further, the relevant parameter of virtual machine includes the importance of virtual machine business, to the consumption journey of CPU and memory Degree, the data volume and virtual machine security generated.
Further, the judge index of the importance of virtual machine business is: if the service disconnection on virtual machine can be to it His system or business impact, then otherwise inessential to be important.
Further, all calculate nodes are first logged in the database table for orienting scheduling registration in step 2), then Calculate node is divided into corresponding zoning according to the relevant parameter of virtual machine.
Further, in step 3) user according to the relevant parameter of virtual machine to the virtual machine to be applied plus label, lead to It crosses label and finds the zoning containing corresponding mark.
Further, available resources are filtered out and are not met according to the CPU of calculate node, memory, disk parameter in step 4) The calculate node that virtual machine requires, available resources refer to the available CPU of calculate node, memory, disk size.
Further, the weighting for carrying out available resources to remaining calculate node in step 4) is sorted, according to weight from big To small sequence.
A kind of computing resource orientation scheduling system based on OpenStack, comprising:
Cloud computing platform based on OpenStack, it is multiple containing mark including that can be divided as needed to computing resource Zoning, multiple calculate nodes for being divided into specified zoning, the number for storing calculate node and zoning relationship According to the cloud computing of library and each calculate node of realization;
Scheduler module, the zoning mark of identification user's selection are oriented, and is realized by filtering, sequence to calculate node Orientation scheduling.
Compared with prior art, the present invention has an advantage that
The computing resource of OpenStack can be divided into different zonings, zoning range ratio Zone is smaller, can Nova available domain is divided into multiple zonings, to meet different demands;Extend OpenStack own schedule strategy, energy Calculate node orientation is dispatched to specified zoning by enough relevant parameters according to virtual machine, and optimal calculate node is selected to be used for Virtual machine is generated, supports the configuration of more fine-grained policy;Cluster is supported to distinguish physics zoning on demand, it is differential convenient for supporting O&M reduces maintenance cost;Orientation scheduling reduces scheduling range, improves dispatching efficiency.
Detailed description of the invention
Fig. 1 is the schematic diagram that OpenStack computing resource is divided into different zonings.
Fig. 2 is that calculate node orients scheduling flow schematic diagram.
Fig. 3 is the schematic diagram that virtual machine selects zoning and calculate node.
Specific embodiment
To enable features described above and advantage of the invention to be clearer and more comprehensible, special embodiment below, and institute's attached drawing is cooperated to make Detailed description are as follows.
The computing resource based on OpenStack that the present embodiment provides a kind of orients dispatching method and system, the system are based on The cloud computing platform of OpenStack, including the multiple zonings containing mark, multiple that can be divided as needed to computing resource The calculate node of specified zoning, the database of storage calculate node and zoning relationship can be divided into and realized each The cloud computing of calculate node;It further include orientation scheduler module, the zoning of identification user's selection identifies, and passes through filtering, row Sequence is realized to orient calculate node and be dispatched.In conjunction with the system, the dispatching method is as shown in Figure 2, comprising the following steps:
Step 1: OpenStack computing resource T being divided into different zonings by the relevant parameter of virtual machine, is used in combination T1, T2 are identified, as shown in Figure 1.The relevant parameter of the virtual machine includes the importance of virtual machine business, to CPU and memory Consumption degree, generation data volume and virtual machine security, wherein the importance judge index of business is: if virtual Service disconnection on machine can impact other systems or business, then otherwise inessential to be important.
Step 2: all calculate nodes are divided into specified zoning, and input database.Such as by calculate node C1, C2, C3 are divided into zoning T1, and calculate node C4, C5, C6 are divided into zoning T2.
Specifically, OpenStack cloud is added as six calculate nodes C1, C2, C3, C4, C5, C6 in six servers to put down Platform.Firstly, it is necessary to by database table of this six calculate node typings dedicated for orientation scheduling registration, if this six clothes Business device has three latest services devices and three, and than older server, new demand servicing device performance is higher more stable, is suitble to storage important Virtual machine (being judged according to the relevant parameter of virtual machine), and it is higher than older server failure probability, be suitble to storage non- Important virtual machine does not also influence even if breaking down.If zoning T1 is calculated for storing important virtual machine Region T2 is for storing insignificant virtual machine, then three new demand servicing devices are just divided into zoning T1 (such as C1, C2, C3), three Platform is just divided into zoning T2 (such as C4, C5, C6) than older server, in the table of database of record.
Step 3: selecting zoning according to demand when user's application virtual machine, such as can be according to the important journey of virtual machine Degree, selects zoning T1 for important virtual machine, and unessential virtual machine is selected zoning T2.Because virtual machine is to use Family application, user can be according to the relevant parameter of virtual machine, such as business importance, resource (CPU, memory) Expenditure Levels, safety Property etc. determines that virtual machine is suitble to which zoning be stored in.For example the virtual machine of user's application needs CPU to be configured to 4 cores, Residue can be excluded with CPU core number less than the calculate node of 4 cores.
To further clarify this step technique content, it is illustrated by Fig. 3.According to relevant parameter (such as industry of virtual machine Business importance) computing resource T is divided into important computations region S-T1, insignificant zoning F-T2 and interim zoning R- Tri- zonings T3, wherein S, F, R are mark.User A, B, C are when applying for virtual machine (being indicated with vm), according to the need of oneself Will (importance of such as business) which kind of virtual machine selected, if the user thinks that business is important, need to select important virtual machine, then It, will be according to label only in important computations when scheduling to the virtual machine to be applied plus label S (such as S-vm1, S-vm4, S-vm7) Region S-T1 carries out the selection of host, is reduced significantly scheduling range, while ensure that virtual machine scheduling on demand.Similarly, if Select insignificant virtual machine or with jury virtual machine, flag F (such as F-vm2, F- are added on the virtual machine to be applied Vm5, F-vm8) or R (such as R-vm3, R-vm6, R-vm9), when scheduling can dispatch corresponding zoning F-T2 according to flag F or R Or the host of R-T3 generates required virtual machine.It is noted that when user applies for virtual machine, to the virtual machine to be applied In addition label, actually belongs to a kind of orientation request for containing condition, such as the virtual machine of user's A application storage important service When label S, the S-vm1 in Fig. 3 under user A belong to the orientation request of virtual machine, be not the virtual machine applied, should Orientation request can be directed to (Far Left arrow in figure) zoning S-T1, further find calculate node C1, just give birth in C1 At virtual machine S-vm1.
Step 4: the whole calculate nodes read to above-mentioned steps are filtered, according to the CPU, memory, magnetic of calculate node Disk parameter filters out the calculate node for not meeting virtual machine available resources (i.e. available CPU, memory, disk size) requirement; The weighting sequence that the remaining calculate node met is carried out to available resources, successively sorts from big to small according to weight, dispatches out Forward calculate node sort to generate virtual machine.
When being scheduled, Background scheduling orients scheduler module, and the effect of the orientation scheduler module is identification user's selection Zoning mark.Such as identify that user selects zoning T1, scheduling range be just limited to calculate node C1 in T1, C2,C3;Then, it from the whole calculate node information read in database in the T1 of zoning, is filtered according to itself filter method Fall incongruent calculate node, such as C3;It is weighted sort method, remaining calculate node C1, C2 is ranked up, the row of selecting The forward calculate node of sequence, to just dispatch out most suitable calculate node in T1, as shown in Figure 2.This orientation dispatching method Scheduling range is greatly reduced, dispatching efficiency is improved.
For verification technique effect, 80 servers are divided into multiple zonings as calculate node and are tested, surveyed Examination data are as follows:
As seen from the above table, when 80 calculate nodes are without dividing, i.e. 1 zoning, that is, without using we Method, dispatching elapsed time at this time is 824 milliseconds;When 80 calculate nodes are divided at least two zoning, this method is just risen Effect, scheduling time shorten to 30 milliseconds, significant effect;It can also be seen that working as the more (spaces of zoning number from table It is smaller) when, scheduling elapsed time is shorter, so this method can significantly improve dispatching efficiency.In addition, due to having divided multiple calculating Region can carry out difference O&M for the calculate node of different zonings, can reduce O&M cost.

Claims (8)

1. a kind of computing resource based on OpenStack orients dispatching method, step includes:
1) OpenStack computing resource is divided by multiple zonings according to the relevant parameter of virtual machine, and be identified;
2) all calculate nodes are divided into specified zoning, and input database;
3) user selects zoning by mark, and whole calculate node information of the zoning are read from database;
4) for step 3) read whole calculate nodes, filter out incongruent calculate node, by remaining calculate node into Row sequence, dispatches the forward calculate node that sorts and generates virtual machine.
2. the method according to claim 1, wherein the relevant parameter of virtual machine includes the important of virtual machine business Property, to the consumption degree of CPU and memory, the data volume of generation and virtual machine security.
3. the method according to claim 1, wherein the judge index of the importance of virtual machine business is: if Service disconnection on virtual machine can impact other systems or business, then otherwise inessential to be important.
4. the method according to claim 1, wherein all calculate nodes are first logged for orienting in step 2) In the database table for dispatching registration, calculate node is divided into corresponding zoning further according to the relevant parameter of virtual machine.
5. the method according to claim 1, wherein user is wanted according to the relevant parameter of virtual machine in step 3) The virtual machine of application finds the zoning containing corresponding mark plus label, by marking.
6. the method according to claim 1, wherein according to the CPU of calculate node, memory, disk in step 4) Parameter filters out the calculate node that available resources do not meet virtual machine requirement, and available resources refer to the available CPU of calculate node, interior It deposits, disk size.
7. according to the method described in claim 6, it is characterized in that, carrying out available resources to remaining calculate node in step 4) Weighting sequence, sorted from large to small according to weight.
8. a kind of computing resource based on OpenStack orients scheduling system, comprising:
Cloud computing platform based on OpenStack, including the multiple calculating containing mark that can be divided as needed to computing resource Region, multiple calculate nodes for being divided into specified zoning, the database for storing calculate node and zoning relationship And realize the cloud computing of each calculate node;
Scheduler module, the zoning mark of identification user's selection are oriented, and is realized by filtering, sequence and calculate node is oriented Scheduling.
CN201710420946.7A 2017-06-07 2017-06-07 OpenStack-based method and system for directionally scheduling computing resources Active CN109002342B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710420946.7A CN109002342B (en) 2017-06-07 2017-06-07 OpenStack-based method and system for directionally scheduling computing resources

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710420946.7A CN109002342B (en) 2017-06-07 2017-06-07 OpenStack-based method and system for directionally scheduling computing resources

Publications (2)

Publication Number Publication Date
CN109002342A true CN109002342A (en) 2018-12-14
CN109002342B CN109002342B (en) 2022-09-23

Family

ID=64573059

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710420946.7A Active CN109002342B (en) 2017-06-07 2017-06-07 OpenStack-based method and system for directionally scheduling computing resources

Country Status (1)

Country Link
CN (1) CN109002342B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110380894A (en) * 2019-06-27 2019-10-25 苏州浪潮智能科技有限公司 The management method and device of cloud platform medium cloud host
CN111966494A (en) * 2020-08-18 2020-11-20 江苏安超云软件有限公司 Resource scheduling method and device, storage medium and electronic equipment
CN112465359A (en) * 2020-12-01 2021-03-09 中国联合网络通信集团有限公司 Calculation power calling method and device
CN116405391A (en) * 2023-04-10 2023-07-07 长扬科技(北京)股份有限公司 OpenStack-based virtual machine node screening method, system and storage medium

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130042123A1 (en) * 2009-04-17 2013-02-14 Citrix Systems, Inc. Methods and Systems for Evaluating Historical Metrics in Selecting a Physical Host for Execution of a Virtual Machine
US20130185436A1 (en) * 2012-01-18 2013-07-18 Erik V. Carlin Optimizing Allocation Of On-Demand Resources Using Performance Zones
CN103248659A (en) * 2012-02-13 2013-08-14 北京华胜天成科技股份有限公司 Method and system for dispatching cloud computed resources
WO2014073949A1 (en) * 2012-11-12 2014-05-15 Mimos Berhad A system and method for virtual machine reservation for delay sensitive service applications
CN104683408A (en) * 2013-11-29 2015-06-03 中国科学院深圳先进技术研究院 Method and system for OpenStack cloud computing management platform to build virtual machine instance
CN104717251A (en) * 2013-12-12 2015-06-17 中国科学院深圳先进技术研究院 Scheduling method and system for Cell nodes through OpenStack cloud computing management platform
CN105653372A (en) * 2015-12-30 2016-06-08 中电科华云信息技术有限公司 Cloud platform-based method for realizing multi-virtualization hybrid management and scheduling
US20170149880A1 (en) * 2015-11-24 2017-05-25 Vmware, Inc. Methods and apparatus to deploy workload domains in virtual server racks

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130042123A1 (en) * 2009-04-17 2013-02-14 Citrix Systems, Inc. Methods and Systems for Evaluating Historical Metrics in Selecting a Physical Host for Execution of a Virtual Machine
US20130185436A1 (en) * 2012-01-18 2013-07-18 Erik V. Carlin Optimizing Allocation Of On-Demand Resources Using Performance Zones
CN103248659A (en) * 2012-02-13 2013-08-14 北京华胜天成科技股份有限公司 Method and system for dispatching cloud computed resources
WO2014073949A1 (en) * 2012-11-12 2014-05-15 Mimos Berhad A system and method for virtual machine reservation for delay sensitive service applications
CN104683408A (en) * 2013-11-29 2015-06-03 中国科学院深圳先进技术研究院 Method and system for OpenStack cloud computing management platform to build virtual machine instance
CN104717251A (en) * 2013-12-12 2015-06-17 中国科学院深圳先进技术研究院 Scheduling method and system for Cell nodes through OpenStack cloud computing management platform
US20170149880A1 (en) * 2015-11-24 2017-05-25 Vmware, Inc. Methods and apparatus to deploy workload domains in virtual server racks
CN105653372A (en) * 2015-12-30 2016-06-08 中电科华云信息技术有限公司 Cloud platform-based method for realizing multi-virtualization hybrid management and scheduling

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
刘炳宏: "基于OpenStack的资源服务信息监控系统的设计与实现", 《万方学位论文数据库》 *
邓志龙等: "OpenStack环境下的资源动态调度研究", 《西北工业大学学报》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110380894A (en) * 2019-06-27 2019-10-25 苏州浪潮智能科技有限公司 The management method and device of cloud platform medium cloud host
CN111966494A (en) * 2020-08-18 2020-11-20 江苏安超云软件有限公司 Resource scheduling method and device, storage medium and electronic equipment
CN112465359A (en) * 2020-12-01 2021-03-09 中国联合网络通信集团有限公司 Calculation power calling method and device
CN112465359B (en) * 2020-12-01 2024-03-15 中国联合网络通信集团有限公司 Calculation force calling method and device
CN116405391A (en) * 2023-04-10 2023-07-07 长扬科技(北京)股份有限公司 OpenStack-based virtual machine node screening method, system and storage medium

Also Published As

Publication number Publication date
CN109002342B (en) 2022-09-23

Similar Documents

Publication Publication Date Title
CN109002342A (en) A kind of computing resource orientation dispatching method and system based on OpenStack
US20100223618A1 (en) Scheduling jobs in a cluster
JP2020507135A (en) Exclusive agent pool distribution method, electronic device, and computer-readable storage medium
CN107291539B (en) Cluster program scheduler method based on resource significance level
CN109976989B (en) Cross-node application performance monitoring method and device and high-performance computing system
CN106027328A (en) Cluster monitoring method and system based on application container deployment
CN110175152A (en) A kind of log inquiring method, transfer server cluster and log query system
CN106201676A (en) Task allocation method and device
CN105824686A (en) Selecting method and selecting system of host machine of virtual machine
CN112184005A (en) Operation task classification method, device, equipment and storage medium
CN110138688A (en) Dynamic adjusts method, apparatus, equipment and the readable storage medium storing program for executing of business interface
CN110347888A (en) Processing method, device and the storage medium of order data
CN110223164A (en) Air control method and system based on transfer learning, computer installation, storage medium
CN114091941A (en) Task allocation method and device, electronic equipment and storage medium
CN108805054A (en) A kind of facial image sorting technique, system, equipment and computer storage media
Fu et al. Parallel machine scheduling with dynamic resource allocation via a master–slave genetic algorithm
Chang A study of factors affecting due-date predictability in a simulated dynamic job shop
CN110780991A (en) Deep learning task scheduling method and device based on priority
CN107203256A (en) Energy-conservation distribution method and device under a kind of network function virtualization scene
CN117271100A (en) Algorithm chip cluster scheduling method, device, computer equipment and storage medium
Liaskos et al. On the analytical performance optimization of wireless data broadcasting
CN111917885A (en) System for managing cloud computing service
Ahn et al. A binary partition-based matching algorithm for data distribution management
CN107704320B (en) A kind of method for allocating tasks and system of distributed system
CN109657950A (en) Hierarchy Analysis Method, device, equipment and computer readable storage 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
GR01 Patent grant
GR01 Patent grant