CN104537045A - Service distribution method and device based on distributive system - Google Patents

Service distribution method and device based on distributive system Download PDF

Info

Publication number
CN104537045A
CN104537045A CN201410817889.2A CN201410817889A CN104537045A CN 104537045 A CN104537045 A CN 104537045A CN 201410817889 A CN201410817889 A CN 201410817889A CN 104537045 A CN104537045 A CN 104537045A
Authority
CN
China
Prior art keywords
service request
service
resource
resource constraint
constraint
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
Application number
CN201410817889.2A
Other languages
Chinese (zh)
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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201410817889.2A priority Critical patent/CN104537045A/en
Publication of CN104537045A publication Critical patent/CN104537045A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L29/00Arrangements, apparatus, circuits or systems, not covered by a single one of groups H04L1/00 - H04L27/00
    • H04L29/02Communication control; Communication processing
    • H04L29/06Communication control; Communication processing characterised by a protocol
    • H04L29/08Transmission control procedure, e.g. data link level control procedure
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING; 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/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5083Techniques for rebalancing the load in a distributed system
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network

Abstract

The invention discloses a service distribution method and device based on a distributive system. The service distribution method and device based on the distributive system are used for distributing processing nodes for services according to individualized needs of the services. The distributive system comprises a control mode and at least two service nodes. The service distribution method includes the steps that the control node receives a service request and obtains a resource restraint condition needing to be satisfied for processing the service request; the control node determines the service node which can satisfy the resource restraint condition according to resource information of each service node in the at least two service nodes and the resource restraint condition; the control node sends the service request to the determined service node to be processed.

Description

A kind of method for distributing business based on distributed system and device
Technical field
The present invention relates to technical field of data processing, particularly relate to a kind of method for distributing business based on distributed system and device.
Background technology
Existing Hadoop distributed file system (Hadoop Distributed File System, HDFS) and mapping in reduction (MapReduce) parallel computation, all adopts centralized resource management mode.The data of HDFS store and read by NameNode node control, and under MapReduce Computational frame, Resourse Distribute is controlled by TaskTracker (MR1.0) or ResourceManager (MR2.0).
When user or application application resource, the own resource service condition that Controlling vertex reports according to each service node is this user or allocated resources, such as, ResourceManager determines the computational resource that user or application need, according to the own resource service condition that each service node reports, determine that the surplus resources of certain service node meets the computational resource of this user or application needs, by the traffic assignments of this user or application to this service node.The control of resource and point pairing user or application completely transparent, user or application cannot the nodes of designated treatment own service, cannot meet the individual demand of user or application.
Such as, carry out in the distributed file system of centralized resource management, the hardware configuration of each service node is different, that suppose the hard disk employing of partial service node is Serial Advanced Technology Attachment (Serial AdvancedTechnology Attachment, SATA) interface, data reading speed is 60 mbit, what suppose the hard disk employing of partial service node is solid state hard disc (SSD) interface, data reading speed is 500 mbit, if the service needed of user or application processes in real time, then need the hard disk selecting SSD interface, to improve processing speed, the service node of SATA interface hard disk is adopted if Controlling vertex has been this user or application choice, then can affect the real-time of this user or business.
Summary of the invention
The embodiment of the present invention provides a kind of method for distributing business based on distributed system and device, is traffic assignments processing node in order to realize according to the individual demand of business.
The concrete technical scheme that the embodiment of the present invention provides is as follows:
First aspect, provides a kind of method for distributing business based on distributed system, and described distributed system comprises Controlling vertex and at least two service nodes, and described method for distributing business comprises:
Described Controlling vertex receives service request, and obtains the required resource constraint met of the described service request of process;
Described Controlling vertex, according to the resource information of each service node in described at least two service nodes and described resource constraint, determines the service node meeting described resource constraint;
Described service request sends to the described service node determined to process by described Controlling vertex.
In conjunction with first aspect, in the implementation that the first is possible, in described service request, carry the mark of described service request;
Described Controlling vertex obtains the required resource constraint met of the described service request of process, comprising:
Described Controlling vertex obtains the mark of described service request from described service request;
Described Controlling vertex is according to the mark of service request preset and the corresponding relation of resource constraint, obtain the resource constraint of the mark correspondence of described service request, using the described resource constraint that obtains as the resource constraint met needed for described service request.
In conjunction with first aspect, in the implementation that the second is possible, in described service request, carry the required resource constraint met of the described service request of process;
Described Controlling vertex obtains the required resource constraint met of the described service request of process, comprising:
Described Controlling vertex obtains described resource constraint from described service request.
In conjunction with first aspect, in the implementation that the third is possible, described Controlling vertex obtains the required resource constraint met of the described service request of process, comprising:
Described Controlling vertex judges whether carry the required resource constraint met of the described service request of process in described service request;
If so, from described service request, described resource constraint is obtained;
Otherwise, according to the mark of service request preset and the corresponding relation of resource constraint, obtain the resource constraint of the mark correspondence of described service request.
In conjunction with first aspect to any one in the third possible implementation, in the 4th kind of possible implementation, described Controlling vertex is according to the resource information of each service node in described at least two service nodes and described resource constraint, before determining to meet the service node of described resource constraint, described method also comprises:
The resource information of self that at least two service nodes described in described Controlling vertex receives, each service node sends, described resource information comprises any one or combination in hard disk type, access speed, the network bandwidth, residue central processor CPU resource, free memory resource and remanence disk space.
Second aspect, provides a kind of traffic assignments device, and described traffic assignments plant running is in distributed system, and described distributed system comprises Controlling vertex and at least two service nodes, and described traffic assignments device comprises:
Acquisition module, for receiving service request, and obtains the required resource constraint met of the described service request of process;
Determination module, for according to the resource information of each service node in described at least two service nodes and described resource constraint, determines the service node meeting described resource constraint;
Sending module, processes for described service request being sent to the described service node determined.
In conjunction with second aspect, in the implementation that the first is possible, in described service request, carry the mark of described service request;
Described acquisition module specifically for:
The mark of described service request is obtained from described service request;
According to the mark of service request and the corresponding relation of resource constraint preset, obtain the resource constraint of the mark correspondence of described service request, using the described resource constraint that obtains as resource constraint satisfied needed for described service request.
In conjunction with second aspect, in the implementation that the second is possible, in described service request, carry the required resource constraint met of the described service request of process;
Described acquisition module specifically for:
Described resource constraint is obtained from described service request.
In conjunction with second aspect, in the implementation that the third is possible, described acquisition module specifically for:
Judge in described service request, whether to carry the required resource constraint met of the described service request of process;
If so, from described service request, described resource constraint is obtained;
Otherwise, according to the mark of service request preset and the corresponding relation of resource constraint, obtain the resource constraint of the mark correspondence of described service request.
In conjunction with second aspect to any one in the third possible implementation, in the 4th kind of possible implementation, described acquisition module also for:
Described determination module is according to the resource information of each service node in described at least two service nodes and described resource constraint, before determining to meet the service node of described resource constraint, the resource information of self that at least two service nodes described in reception, each service node sends, described resource information comprises any one or combination in hard disk type, access speed, the network bandwidth, residue central processor CPU resource, free memory resource and remanence disk space.
Based on technique scheme, in the embodiment of the present invention, Controlling vertex is after obtaining the resource constraint met needed for process service request, the service node meeting this resource constraint is determined according to the resource information of each service node at least two service nodes, this service node determined this service request is sent to process, thus making the service node processing this service request can meet the resource constraint of this service request, this resource constraint defines the individual demand of this service request to process resource.
Accompanying drawing explanation
The structural representation of the distributed system that Fig. 1 applies for the embodiment of the present invention;
Fig. 2 is the method detailed schematic flow sheet that in the embodiment of the present invention, Controlling vertex carries out traffic assignments;
Fig. 3 is the structural representation of traffic assignments device in distributed system in the embodiment of the present invention;
Fig. 4 is device structure schematic diagram in the embodiment of the present invention.
Embodiment
In order to make the object, technical solutions and advantages of the present invention clearly, below in conjunction with accompanying drawing, the present invention is described in further detail, and obviously, described embodiment is only the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making other embodiments all obtained under creative work prerequisite, belong to the scope of protection of the invention.
As shown in Figure 1, this distributed system comprises Controlling vertex 101 and at least two service nodes to the framework of the distributed system that the embodiment of the present invention is applied, i.e. service node 102 and service node 103, wherein,
Controlling vertex 101, for managing the resource of each service node in this distributed system concentratedly, and receiving and the service request of each business of centralized control or application, service request being dispensed to and meeting the service node of business to the demand of resource;
Each service node in distributed system, for reporting the resource information of self to Controlling vertex, and receives the service request of Controlling vertex distribution and processes.
In the embodiment of the present invention, as shown in Figure 2, in the distributed system described in Fig. 1 Controlling vertex to carry out the method detailed flow process of traffic assignments as follows:
Step 201: receive service request, and obtain the required resource constraint met of this service request of process.
Wherein, the required resource constraint met of service request, for limiting the individual demand of this service request to process resource, comprises the hard disk type of the service node needed for it, the network bandwidth etc.
In first preferably embodiment, preset configuration information in Controlling vertex, preserves the business of each user or application and the corresponding relation of resource constraint in this configuration information.
This, preferably in embodiment, carries the mark of this service request in service request;
Controlling vertex obtains the mark of this service request from service request, according to the mark of service request preset and the corresponding relation of resource constraint, obtain the resource constraint of the mark correspondence of this service request, using the resource constraint obtained as processing the resource constraint met needed for this service request.
In second preferably embodiment, in service request, carry the resource constraint met needed for this service request of process.
This is preferably in embodiment, and Controlling vertex, after reception service request, obtains the resource constraint met needed for this service request of process from this service request.
Step 202: according to the resource information of each service node at least two service nodes and resource constraint corresponding to the service request of acquisition, determine the service node meeting this resource constraint.
In concrete enforcement, according to the resource information of each service node at least two service nodes and resource constraint corresponding to the service request of acquisition, before determining to meet the service node of this resource constraint, receive the resource information of self that in distributed system, in these at least two service nodes, each service node sends.
Wherein, the resource information of self that each service node sends comprises any one or combination in hard disk type, access speed, the network bandwidth, residue central processing unit (CPU) resource, free memory resource and remanence disk space.
Preferably, each service node in distributed system take preset duration as the resource information of periodic report self.
In concrete enforcement, according to the resource information of each service node at least two service nodes and resource constraint corresponding to the service request of acquisition, determine there is not the service node meeting this resource constraint in each service node in distributed system, then return miscue information.
Step 203: service request sent to the service node determined to process.
In the 3rd preferably embodiment, can the preferably embodiment of first and second in compatible step 201 in Controlling vertex.
Particularly, 3rd preferably in embodiment, after Controlling vertex receives service request, if carry the required resource constraint met of this service request of process in this service request, then obtain this resource constraint carried in this service request, determine according to this resource constraint the service node meeting this resource constraint;
If do not carry the required resource constraint met of this service request of process in this service request, then search default configuration information, judge whether there is the resource constraint corresponding with the mark of this service request in the default mark of service request and the corresponding relation of resource constraint, if exist, then obtain resource constraint corresponding with the mark of this service request in this corresponding relation, determine according to this resource constraint the service node meeting this resource constraint.
Based on same inventive concept, as shown in Figure 3, based on the distributed system shown in Fig. 1, a kind of traffic assignments device is additionally provided in the embodiment of the present invention, the concrete enforcement of this traffic assignments device can see the description of said method part, repetition part repeats no more, and this traffic assignments device mainly comprises:
Acquisition module 301, for receiving service request, and obtains the required resource constraint met of the described service request of process;
Determination module 302, for resource information and the described resource constraint of each service node at least described two service nodes of basis, determines the service node meeting described resource constraint;
Sending module 303, processes for described service request being sent to the described service node determined.
Wherein, the required resource constraint met of service request is for limiting the individual demand of this service request to process resource.
First, preferably in embodiment, carries the mark of described service request in described service request;
Described acquisition module specifically for:
The mark of described service request is obtained from described service request;
According to the mark of service request and the corresponding relation of resource constraint preset, obtain the resource constraint of the mark correspondence of described service request, using the described resource constraint that obtains as resource constraint satisfied needed for described service request.
Second preferably in embodiment, carries the required resource constraint met of the described service request of process in described service request;
Described acquisition module specifically for:
Described resource constraint is obtained from described service request.
Preferably, described acquisition module also for:
At described determination module according to the resource information of each service node in described at least two service nodes and described resource constraint, before determining to meet the service node of described resource constraint, the resource information of self that at least two service nodes described in reception, each service node sends.
Preferably, the described resource information of self that each service node reports comprises any one or combination in hard disk type, access speed, the network bandwidth, residue central processor CPU resource, free memory resource and remanence disk space.
Preferably, described acquisition module receives service node described in each at least two service nodes take preset duration as the resource information of self of periodic report.
In concrete enforcement, determination module 302 is according to the resource information of each service node and resource constraint corresponding to the service request of acquisition, determine there is not the service node meeting this resource constraint in each service node in distributed system, then return miscue information.
3rd preferably in embodiment, and acquisition module 301 can the compatible above-mentioned first and second preferably embodiments.
Particularly, 3rd preferably in embodiment, after acquisition module 301 receives service request, the required resource constraint met of this service request of process is carried in this service request if determine, then obtain this resource constraint carried in this service request, this resource constraint that determination module 302 obtains according to acquisition module 301 determines the service node meeting this resource constraint;
If acquisition module 301 is determined not carry the required resource constraint met of this service request of process in this service request, then search default configuration information, judge whether there is the resource constraint corresponding with the mark of this service request in the default mark of service request and the corresponding relation of resource constraint, if exist, then obtain resource constraint corresponding with the mark of this service request in this corresponding relation, this resource constraint that determination module 302 obtains according to acquisition module 301 determines the service node meeting this resource constraint.
Based on same inventive concept, as shown in Figure 4, a kind of equipment is additionally provided in the embodiment of the present invention, the concrete enforcement of this equipment can see the description of said method part, repetition part repeats no more, and in reality, this equipment can be the Controlling vertex in distributed system, and this equipment mainly comprises:
Transceiver 401, for receiving described service request;
Processor 402, for obtaining the resource constraint met needed for the service request of transceiver 401 reception, according to resource information and the described resource constraint of each service node at least two service nodes, determine the service node meeting described resource constraint, described service request sends to the described service node determined to process by instruction transceiver 401.
Wherein, the required resource constraint met of service request is for limiting the individual demand to process resource of this service request.
First, preferably in embodiment, carries the mark of described service request in described service request;
Processor 402 obtains the mark of described service request from described service request;
According to the mark of service request and the corresponding relation of resource constraint preset, obtain the resource constraint of the mark correspondence of described service request, using the described resource constraint that obtains as resource constraint satisfied needed for described service request.
Second preferably in embodiment, carries the required resource constraint met of the described service request of process in described service request;
Processor 402 obtains described resource constraint from described service request.
Preferably, processor 402 at described determination module according to the resource information of each service node of each service node in described at least two service nodes and described resource constraint, before determining to meet the service node of described resource constraint, the resource information of self of the transmission of each service node at least two service nodes described in instruction transceiver 401 receives.
Preferably, the described resource information of self that each service node reports comprises any one or combination in hard disk type, access speed, the network bandwidth, residue central processor CPU resource, free memory resource and remanence disk space.
Preferably, transceiver 401 receives the resource information of self that each described service node take preset duration as periodic report.
In concrete enforcement, processor 402 is according to the resource information of each service node and resource constraint corresponding to the service request of acquisition, determine there is not the service node meeting this resource constraint in each service node in distributed system, then return miscue information.
3rd preferably in embodiment, and processor 402 can the compatible above-mentioned first and second preferably embodiments.
Particularly, 3rd preferably in embodiment, after processor 402 receives service request, the required resource constraint met of this service request of process is carried in this service request if determine, then obtain this resource constraint carried in this service request, processor 402 determines according to this resource constraint obtained the service node meeting this resource constraint;
If processor 402 is determined not carry the required resource constraint met of this service request of process in this service request, then search default configuration information, judge whether there is the resource constraint corresponding with the mark of this service request in the default mark of service request and the corresponding relation of resource constraint, if exist, then obtain resource constraint corresponding with the mark of this service request in this corresponding relation, processor 402 determines according to this resource constraint obtained the service node meeting this resource constraint.
Based on technique scheme, in the embodiment of the present invention, after obtaining the resource constraint met needed for process service request, the service node meeting this resource constraint is determined according to the resource information of each service node, this service node determined this service request is sent to process, thus making the service node processing this service request can meet requested resource constraint condition, this resource constraint defines the individual demand of this service request to process resource.
Those skilled in the art should understand, embodiments of the invention can be provided as method, system or computer program.Therefore, the present invention can adopt the form of complete hardware embodiment, completely software implementation or the embodiment in conjunction with software and hardware aspect.And the present invention can adopt in one or more form wherein including the upper computer program implemented of computer-usable storage medium (including but not limited to magnetic disk memory and optical memory etc.) of computer usable program code.
The present invention describes with reference to according to the process flow diagram of the method for the embodiment of the present invention, equipment (system) and computer program and/or block scheme.Should understand can by the combination of the flow process in each flow process in computer program instructions realization flow figure and/or block scheme and/or square frame and process flow diagram and/or block scheme and/or square frame.These computer program instructions can being provided to the processor of multi-purpose computer, special purpose computer, Embedded Processor or other programmable data processing device to produce a machine, making the instruction performed by the processor of computing machine or other programmable data processing device produce device for realizing the function of specifying in process flow diagram flow process or multiple flow process and/or block scheme square frame or multiple square frame.
These computer program instructions also can be stored in can in the computer-readable memory that works in a specific way of vectoring computer or other programmable data processing device, the instruction making to be stored in this computer-readable memory produces the manufacture comprising command device, and this command device realizes the function of specifying in process flow diagram flow process or multiple flow process and/or block scheme square frame or multiple square frame.
These computer program instructions also can be loaded in computing machine or other programmable data processing device, make on computing machine or other programmable devices, to perform sequence of operations step to produce computer implemented process, thus the instruction performed on computing machine or other programmable devices is provided for the step realizing the function of specifying in process flow diagram flow process or multiple flow process and/or block scheme square frame or multiple square frame.
Obviously, those skilled in the art can carry out various change and modification to the present invention and not depart from the spirit and scope of the present invention.Like this, if these amendments of the present invention and modification belong within the scope of the claims in the present invention and equivalent technologies thereof, then the present invention is also intended to comprise these change and modification.

Claims (10)

1. based on a method for distributing business for distributed system, it is characterized in that, described distributed system comprises Controlling vertex and at least two service nodes, and described method for distributing business comprises:
Described Controlling vertex receives service request, and obtains the required resource constraint met of the described service request of process;
Described Controlling vertex, according to the resource information of each service node in described at least two service nodes and described resource constraint, determines the service node meeting described resource constraint;
Described service request sends to the described service node determined to process by described Controlling vertex.
2. the method for claim 1, is characterized in that, carries the mark of described service request in described service request;
Described Controlling vertex obtains the required resource constraint met of the described service request of process, comprising:
Described Controlling vertex obtains the mark of described service request from described service request;
Described Controlling vertex is according to the mark of service request preset and the corresponding relation of resource constraint, obtain the resource constraint of the mark correspondence of described service request, using the described resource constraint that obtains as the resource constraint met needed for described service request.
3. the method for claim 1, is characterized in that, carries the required resource constraint met of the described service request of process in described service request;
Described Controlling vertex obtains the required resource constraint met of the described service request of process, comprising:
Described Controlling vertex obtains described resource constraint from described service request.
4. the method for claim 1, is characterized in that, described Controlling vertex obtains the required resource constraint met of the described service request of process, comprising:
Described Controlling vertex judges whether carry the required resource constraint met of the described service request of process in described service request;
If so, from described service request, described resource constraint is obtained;
Otherwise, according to the mark of service request preset and the corresponding relation of resource constraint, obtain the resource constraint of the mark correspondence of described service request.
5. the method as described in any one of claim 1-4, it is characterized in that, described Controlling vertex is according to the resource information of each service node in described at least two service nodes and described resource constraint, and before determining to meet the service node of described resource constraint, described method also comprises:
The resource information of self that at least two service nodes described in described Controlling vertex receives, each service node sends, described resource information comprises any one or combination in hard disk type, access speed, the network bandwidth, residue central processor CPU resource, free memory resource and remanence disk space.
6. a traffic assignments device, is characterized in that, described traffic assignments plant running is in distributed system, and described distributed system comprises Controlling vertex and at least two service nodes, and described traffic assignments device comprises:
Acquisition module, for receiving service request, and obtains the required resource constraint met of the described service request of process;
Determination module, for according to the resource information of each service node in described at least two service nodes and described resource constraint, determines the service node meeting described resource constraint;
Sending module, processes for described service request being sent to the described service node determined.
7. traffic assignments device as claimed in claim 6, is characterized in that, carry the mark of described service request in described service request;
Described acquisition module specifically for:
The mark of described service request is obtained from described service request;
According to the mark of service request and the corresponding relation of resource constraint preset, obtain the resource constraint of the mark correspondence of described service request, using the described resource constraint that obtains as resource constraint satisfied needed for described service request.
8. traffic assignments device as claimed in claim 6, is characterized in that, carries the required resource constraint met of the described service request of process in described service request;
Described acquisition module specifically for:
Described resource constraint is obtained from described service request.
9. traffic assignments device as claimed in claim 6, is characterized in that, described acquisition module specifically for:
Judge in described service request, whether to carry the required resource constraint met of the described service request of process;
If so, from described service request, described resource constraint is obtained;
Otherwise, according to the mark of service request preset and the corresponding relation of resource constraint, obtain the resource constraint of the mark correspondence of described service request.
10. the traffic assignments device as described in any one of claim 6-9, is characterized in that, described acquisition module also for:
Described determination module is according to the resource information of each service node in described at least two service nodes and described resource constraint, before determining to meet the service node of described resource constraint, the resource information of self that at least two service nodes described in reception, each service node sends, described resource information comprises any one or combination in hard disk type, access speed, the network bandwidth, residue central processor CPU resource, free memory resource and remanence disk space.
CN201410817889.2A 2014-12-24 2014-12-24 Service distribution method and device based on distributive system Pending CN104537045A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410817889.2A CN104537045A (en) 2014-12-24 2014-12-24 Service distribution method and device based on distributive system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410817889.2A CN104537045A (en) 2014-12-24 2014-12-24 Service distribution method and device based on distributive system
PCT/CN2015/097180 WO2016101799A1 (en) 2014-12-24 2015-12-11 Service allocation method and device based on distributed system

Publications (1)

Publication Number Publication Date
CN104537045A true CN104537045A (en) 2015-04-22

Family

ID=52852573

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410817889.2A Pending CN104537045A (en) 2014-12-24 2014-12-24 Service distribution method and device based on distributive system

Country Status (2)

Country Link
CN (1) CN104537045A (en)
WO (1) WO2016101799A1 (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105187555A (en) * 2015-09-29 2015-12-23 北京奇艺世纪科技有限公司 Method, device and system for message processing
WO2016101799A1 (en) * 2014-12-24 2016-06-30 华为技术有限公司 Service allocation method and device based on distributed system
CN106375382A (en) * 2016-08-26 2017-02-01 苏州蓝海彤翔系统科技有限公司 Data distribution method and system, control server and node client
CN106502769A (en) * 2016-09-30 2017-03-15 华为技术有限公司 Distributed transaction processing method, apparatus and system
CN106919435A (en) * 2015-12-25 2017-07-04 华为技术有限公司 The creation method of virtual machine, the management method of resource and device
CN107678927A (en) * 2017-10-31 2018-02-09 郑州云海信息技术有限公司 Distribute hard disk I O method, device, equipment and computer-readable recording medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101149691A (en) * 2006-09-20 2008-03-26 富士通株式会社 Method and apparatus for determining resource node, method of controlling resource node, resource node and computer product
CN102917077A (en) * 2012-11-20 2013-02-06 无锡城市云计算中心有限公司 Resource allocation method in cloud computing system
CN102958166A (en) * 2011-08-29 2013-03-06 华为技术有限公司 Resource allocation method and resource management platform
CN103092698A (en) * 2012-12-24 2013-05-08 中国科学院深圳先进技术研究院 System and method of cloud computing application automatic deployment
CN103218233A (en) * 2013-05-09 2013-07-24 福州大学 Data allocation strategy in hadoop heterogeneous cluster

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003067480A1 (en) * 2002-02-07 2003-08-14 Thinkdynamics Inc. Method and system for managing resources in a data center
CN104537045A (en) * 2014-12-24 2015-04-22 华为技术有限公司 Service distribution method and device based on distributive system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101149691A (en) * 2006-09-20 2008-03-26 富士通株式会社 Method and apparatus for determining resource node, method of controlling resource node, resource node and computer product
CN102958166A (en) * 2011-08-29 2013-03-06 华为技术有限公司 Resource allocation method and resource management platform
CN102917077A (en) * 2012-11-20 2013-02-06 无锡城市云计算中心有限公司 Resource allocation method in cloud computing system
CN103092698A (en) * 2012-12-24 2013-05-08 中国科学院深圳先进技术研究院 System and method of cloud computing application automatic deployment
CN103218233A (en) * 2013-05-09 2013-07-24 福州大学 Data allocation strategy in hadoop heterogeneous cluster

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016101799A1 (en) * 2014-12-24 2016-06-30 华为技术有限公司 Service allocation method and device based on distributed system
CN105187555A (en) * 2015-09-29 2015-12-23 北京奇艺世纪科技有限公司 Method, device and system for message processing
CN106919435A (en) * 2015-12-25 2017-07-04 华为技术有限公司 The creation method of virtual machine, the management method of resource and device
CN106375382A (en) * 2016-08-26 2017-02-01 苏州蓝海彤翔系统科技有限公司 Data distribution method and system, control server and node client
CN106502769A (en) * 2016-09-30 2017-03-15 华为技术有限公司 Distributed transaction processing method, apparatus and system
CN107678927A (en) * 2017-10-31 2018-02-09 郑州云海信息技术有限公司 Distribute hard disk I O method, device, equipment and computer-readable recording medium
CN107678927B (en) * 2017-10-31 2021-01-29 苏州浪潮智能科技有限公司 Method, device and equipment for allocating hard disk IO and computer readable storage medium

Also Published As

Publication number Publication date
WO2016101799A1 (en) 2016-06-30

Similar Documents

Publication Publication Date Title
CN104537045A (en) Service distribution method and device based on distributive system
US20200081731A1 (en) Method, system and apparatus for creating virtual machine
US10230591B2 (en) Network resource governance in multi-tenant datacenters
US10394475B2 (en) Method and system for memory allocation in a disaggregated memory architecture
CN105049268A (en) Distributed computing resource allocation system and task processing method
US10572285B2 (en) Method and apparatus for elastically scaling virtual machine cluster
US20190342391A1 (en) Requesting storage performance models for a configuration pattern of storage resources to deploy at a client computing environment
CN106712981B (en) Node change notification method and device
US20170257429A1 (en) Optimization of integration flows in cloud environments
CN105183561B (en) A kind of resource allocation methods and system
US20180018197A1 (en) Virtual Machine Resource Allocation Method and Apparatus
CN103237037A (en) Media format conversion method and system based on cloud computing architecture
CN106134141A (en) A kind of method and device updating network service describer NSD
CN105227489A (en) A kind of bandwidth management method and electronic equipment
CN103997523A (en) Smart city service system based on cloud services and implementation method thereof
CN103414657A (en) Cross-data-center resource scheduling method, super scheduling center and system
CN102508717B (en) Memory scheduling method and memory scheduling device for multi-core processor
US10042676B1 (en) Capacity pool health index
CN105007311A (en) System and method for resource management based on cloud platform and cloud computing
CN103929441A (en) Task allocation method and device
WO2016095524A1 (en) Resource allocation method and apparatus
CN104734983A (en) Scheduling system, method and device for service data request
Pandya et al. Dynamic resource allocation techniques in cloud computing
US10228855B2 (en) Tuning memory across database clusters for distributed query stability
CN105653370A (en) System and method for obtaining virtual machine resources on PaaS platform

Legal Events

Date Code Title Description
PB01 Publication
C06 Publication
SE01 Entry into force of request for substantive examination
C10 Entry into substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20150422

RJ01 Rejection of invention patent application after publication