CN110196774A - To the dispatching method and relevant apparatus of the test of different data server - Google Patents
To the dispatching method and relevant apparatus of the test of different data server Download PDFInfo
- Publication number
- CN110196774A CN110196774A CN201910371988.5A CN201910371988A CN110196774A CN 110196774 A CN110196774 A CN 110196774A CN 201910371988 A CN201910371988 A CN 201910371988A CN 110196774 A CN110196774 A CN 110196774A
- Authority
- CN
- China
- Prior art keywords
- node
- processing
- test
- qualified
- processor
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5022—Workload threshold
-
- 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/508—Monitor
Abstract
The disclosure discloses method, apparatus, computer equipment and the storage medium of the scheduling of a kind of pair of different data server test, belong to the field of test technology, the described method includes: testing the performance of all nodes of the data analysis system every some cycles, judge whether the performance of the node is qualified；If the test result of the node is unqualified, the data analysis task of the underproof node of the test result is transferred to other nodes, the underproof node of the test result is safeguarded with facilitating；In response to the call request of data server, the processing load that all test results of data analysis system current period are qualified node is inquired；All test results are selected to receive the processing node as processing node for the smallest node of processing load in qualified node and handle the data server data analysis task.To carry out unified test to different data unit, guarantee the stabilization of the system task treatment process.
Description
Technical field
This disclosure relates to the field of test technology, method, dress more particularly to the scheduling tested different data server
It sets, computer equipment and storage medium.
Background technique
In the prior art, since the data structure of different data server, format are different, a kind of data analysis system is only capable of
Calculate a kind of data of data server, calculates a variety of data servers if necessary and just need multiple mutually incoherent data point
Analysis system, and if the different data server set is combined together unified calculation, it is often easy during measuring and calculating
Occur partially calculating pressure excessive the problem of leading to system crash of node in calculating system.
Summary of the invention
Based on this, partial test node pressure is excessive when to solve in the related technology to test different data server
The technical issues of, present disclose provides the method, apparatus of scheduling of a kind of pair of different data server test, computer equipment and
Storage medium.
In a first aspect, the method for the scheduling of a kind of pair of different data server test is provided, for including multiple places
Manage the scheduling of the test of the data analysis system of node, comprising:
The performance of all processing nodes of the data analysis system is tested every predetermined period, judges all processing sections
Whether the performance of point is qualified；
If the test result of the processing node is unqualified, by the data point of the underproof processing node of the test result
It is qualified processing node that analysis task, which is transferred to test result, to tie up to the underproof processing node of the test result
Shield；
Request is handled in response to the task of data server, inquires all test knots of the data analysis system current period
Fruit is the processing load of qualified processing node；
Selecting all test results is the processing the smallest processing node of load in qualified processing node as target
Node is handled, data server data analysis task described in the target processing node processing is made.
The processing load is used to indicate the memory capacity of the node, the selection institute in one of the embodiments,
Stating all test results is to handle the smallest node of load in qualified node as target to handle node, comprising:
Select all test results in qualified node, the most node of the remaining utilization rate of processor is as institute
State target processing node.
The processing load includes the memory capacity of the node, the selection institute in one of the embodiments,
Have and handles the smallest node of load in node as processing node and include:
It selects in node of all test results for qualification, described in the maximum node conduct of residual storage capacity size
Target handles node.
The processing load of the node includes the remaining utilization rate of the processor of the node in one of the embodiments,
And residual storage capacity, it is described select in all nodes handle the smallest node of load as handle node include:
Judge that all test results of data analysis system current period are deposited for the residue of qualified processing node respectively
Whether capacity is less than predetermined volumes threshold value, whether the remaining utilization rate of processor is less than predetermined utilization rate threshold value for storage；
If the remaining utilization rate of the processor is less than predetermined utilization rate threshold value, the remaining utilization rate of the processor is set
Weight be 1, if the remaining utilization rate of the processor is not less than predetermined utilization rate threshold value, the residue for setting the processor makes
It is the remaining utilization rate of the processor and the absolute value of the difference of residual storage capacity percentage with the weight of rate；
If the residual storage capacity of the node is less than predetermined memory capacity threshold value, the remaining storage for setting the node is held
The weight of amount is 1, if the residual storage capacity of the node is not less than predetermined memory capacity threshold value, sets the residue of the node
The weight of memory capacity is the remaining utilization rate of the processor and the absolute value of the difference of residual storage capacity percentage；
Calculate the node processing load include the node processor remaining utilization rate and residual storage capacity
Weighted sum, choose the maximum node of weighted sum as the target handle node.
It is if unqualified in the test result of the node in one of the embodiments, the test result is unqualified
Node data analysis task be transferred to other processing node, the underproof node of the test result is tieed up with facilitating
After shield, the method also includes:
If the underproof node maintenance of test result is completed, the performance for the node that the maintenance is completed, judgement are tested
Whether the performance for the node that the maintenance is completed is qualified；
If test result is qualified, the processing node of the test result qualification such as is directly entered at the load inquiry to be processed
Stage.
The data analysis task by the underproof node of the test result is transferred in one of the embodiments,
The target processing node is handled, comprising:
Task occupied memory capacity in processing in the task processing request of the data server is inquired, if described
Memory capacity is greater than preset threshold, then is split to task in the task processing request of the data server, and record and divide
Cut sequence, wherein the memory capacity of every part of data analysis task after the segmentation is both less than the threshold value；
According to the sequencing of segmentation, successively by every part of data analysis task be transferred to the target handle node into
Row processing.
Second aspect provides the device of the scheduling of a kind of pair of different data server test, comprising:
Performance test unit, for testing the performance of all processing nodes of the data analysis system every predetermined period,
Judge whether the performance of all processing nodes is qualified；
Node maintenance unit, it is if the test result for the processing node is unqualified, the test result is unqualified
The data analysis task of processing node to be transferred to test result be qualified processing node, not conform to the test result
The processing node of lattice is safeguarded；
Querying node unit handles request for the task in response to data server, inquires the data analysis system
All test results of current period are the processing load of qualified processing node；
Node selecting unit, for selecting all test results the smallest for processing load in qualified processing node
Node is handled as target and handles node, makes data server data analysis task described in the target processing node processing.
The third aspect provides a kind of computer equipment, including memory and processor, is stored with meter in the memory
Calculation machine readable instruction, when the computer-readable instruction is executed by the processor, so that processor execution is described above
To different data server test scheduling method the step of.
Fourth aspect provides a kind of storage medium for being stored with computer-readable instruction, the computer-readable instruction
When being executed by one or more processors, different data server is tested so that one or more processors execution is described above
Scheduling method the step of.
The technical scheme provided by this disclosed embodiment can include the following benefits:
Method, apparatus, computer equipment and the storage medium of the above-mentioned scheduling to the test of different data server, by every
The performance of all nodes of the data analysis system is tested every some cycles, judges whether the performance of all nodes is qualified,
If the test result of the node is unqualified, the data analysis task of the underproof node of the test result is transferred to other
Node is handled, the underproof node of the test result is safeguarded with facilitating.Then in response to the calling of data server
Request inquires all test results of data analysis system current period for the processing load of qualified node, described in selection
All test results are that the smallest node of processing load receives the processing node simultaneously as processing node in qualified node
Handle the data server data analysis task.Unified test can be thus carried out to different data unit, ensure that institute
The stable operation for stating system task treatment process is not in chain rupture and delay.
It should be understood that the above general description and the following detailed description are merely exemplary, this can not be limited
It is open.
Detailed description of the invention
Fig. 1 is the implementation environment figure of the method for the scheduling to the test of different data server provided in one embodiment.
Fig. 2 is the stream of the method for the scheduling of a kind of pair of different data server test shown according to an exemplary embodiment
Cheng Tu.
Fig. 3 is the method for another scheduling to the test of different data server shown in corresponding embodiment according to fig. 2
Flow chart.
Fig. 4 be according to fig. 2 shown in corresponding embodiment to different data server test scheduling method in step
A kind of specific implementation flow chart of S160.
The electronics that Fig. 5 schematically shows a kind of method for realizing the above-mentioned scheduling to the test of different data server is set
Standby example block diagram.
Fig. 6 schematically shows a kind of computer of method for realizing the above-mentioned scheduling to the test of different data server
Readable storage medium storing program for executing.
Fig. 7 is the frame of the device of the scheduling of a kind of pair of different data server test shown according to an exemplary embodiment
Figure.
Specific embodiment
It is with reference to the accompanying drawings and embodiments, right in order to which the objects, technical solutions and advantages of the disclosure are more clearly understood
The disclosure is further elaborated.It should be appreciated that specific embodiment described herein is only used to explain the disclosure, and
It is not used in the restriction disclosure.
Fig. 1 is the implementation environment figure of the method for the scheduling to the test of different data server provided in one embodiment,
As shown in Figure 1, in the implementation environment, including test macro 100 and data analysis system 200 and data server 300.
Test macro 100 is the system tested data analysis system 200, for example, to data analysis system 200
The systems such as computer, server, work station, software that the tester tested uses.Data analysis system 200 is to difference
The system of the scheduling of data server test, includes at least two nodes.Firstly, test macro 100 needs periodically to described
All nodes of data analysis system 200 are tested for the property, and filter out the satisfactory node of performance, to carry out data point
Analysis task, and undesirable node, so that it may go to be safeguarded, to guarantee that it is able to satisfy requirement, guarantee that task is processed
The stabilization of journey.When have data server 300 to the data analysis of test system 200 sending need using the analysis system into
When the call request of row data analysis task, the test macro 100 first tests the satisfactory node of current period performance
Load is handled, then a most light node of selection processing load carries out the processing of task, to guarantee the steady of task processes
It is fixed, there is not chain rupture and delay.
It should be noted that test macro 100 and data analysis system 200 can be smart phone, tablet computer, notes
This computer, desktop computer and software systems suitable for above equipment etc., however, it is not limited to this.Data server 300
It can be work station, server cluster, Cloud Server etc., however, it is not limited to this.Test macro 100 and data analysis system
200 and data server 300 can by bluetooth, USB (Universal Serial Bus, universal serial bus) or its
He is attached communication connection mode, and the disclosure is herein with no restrictions.
As shown in Fig. 2, in one embodiment it is proposed that the method for the scheduling of a kind of pair of different data server test,
For the test to the data analysis system for including at least two nodes, the scheduling to the test of different data server
Method can be applied in above-mentioned test macro 100, can specifically include following steps:
Step S110 tests the performances of all processing nodes of the data analysis system every predetermined period, described in judgement
Whether the performance of all processing nodes is qualified.
Every some cycles e.g. every 5 minutes, 10 minutes, 15 minutes etc. described in wherein, processing is received with per minute
The amount and number of nodes of task are related, and the disclosure is it is not limited here.
The disclosure in one embodiment, firstly, every 10 minutes to all nodes of the data analysis system
Performance once tested, to judge whether the performance of all nodes meets the requirement of processing task.The performance is surveyed
Examination includes load testing and pressure test, and performance indicator mainly includes the load capacity and memory of the processor of the node
Ultimate load proves that the performance of node cannot reach wanting for processing task if scheduled performance indicator is not achieved in its ability
It asks.
Step S120 saves the underproof processing of the test result if the test result of the processing node is unqualified
It is qualified processing node that the data analysis task of point, which is transferred to test result, so as to the underproof processing of the test result
Node is safeguarded.
If the test result of the node is unqualified, prove that the underproof node of the test result is tieed up
Shield, at this moment, it is necessary to the data analysis task of the underproof node of the test result is transferred to other processing nodes, by it
Task in the task processing request of data server described in the processing node processing of his performance qualification.
Wherein, the migration pattern can be to send to call from the underproof node of test result to test macro 100 and ask
It asks, the task of the data server is handled task in request in response to the call request of data server by test macro 100
It is transferred to the processing node processing of other performances qualification.
Step S150 handles request in response to the task of data server, inquires the data analysis system current period
All test results are the processing load of qualified processing node；
After the performance for monitoring each processing node at every predetermined time, asked if having received data server and sending to call
It asks, so that it may the processing load that all test results of data analysis system current period are qualified node is first inquired, with
Just according to the processing sharing of load task of the processing node.The processing load is, for example, the utilization rate of modal processor, section
Point free memory or the size etc. of committed memory.
Step S160 selects all test results to handle the smallest processing node of load in qualified processing node
Node is handled as target, makes data server data analysis task described in the target processing node processing.
In one embodiment of the present disclosure, the processing load is modal processor utilization rate, is in the present embodiment
Selecting all test results is the small node of qualified node interior joint processor utilization rate as processing node, is made described
Processing node receives and handles the data server data analysis task.It can guarantee the stabilization of task processes in this way,
There is not chain rupture and delay.
The disclosure includes the data analysis system and test macro and more data servers of a centralization, is answered with facilitating
The call request of analysis system processes task described in the use of more data servers.Its specific works situation is as follows, firstly,
It needs periodically to be tested for the property all nodes of the data analysis system, filters out the satisfactory node of performance, use
To carry out data analysis task, and undesirable node, so that it may it goes to be safeguarded, to guarantee that it is able to satisfy requirement, protect
Demonstrate,prove the stabilization of task processes.It needs when there is data server to issue the data analysis of test system using the analysis
When system carries out the call request of data analysis task, the test macro first tests the satisfactory node of current period performance
Processing load, then the most light node of selection processing load carries out the processing of task, to guarantee task processes
Stablize, chain rupture and delay does not occur.
Optionally, the processing load is the remaining utilization rate of the processor of the node, is selected in all nodes
It handles the smallest node of load and is used as processing node, that is, the section for selecting the remaining utilization rate of processor in all nodes most
Point is as processing node.
Optionally, the processing load is the memory capacity of the node, selects to handle load most in all nodes
Small node selects the node that residual storage capacity percentage is most in all nodes as processing as processing node
Node.
It is a kind of simple and reliable method that residual storage capacity, which is selected, as the judgment criteria of processing load, the node
Residual storage capacity percentage is bigger, it was demonstrated that the ability of its file that can also be stored is stronger, and processing load is smaller, more suitable
Close the node for being selected as processing task.
Optionally, the processing load is the memory capacity of the node, selects to handle load most in all nodes
Small node is used as processing node that the maximum node of residual storage capacity size in all nodes is selected to save as processing
Point.
The the memory capacity percentage of the node the big not necessarily more suitable as processing task in certain special cases
Node because if the storage total capacity size of each node differs greatly, the memory capacity percentage of node is biggish surplus
Remaining memory capacity is not necessarily very much, so this programme directly selects the maximum node of memory capacity size as processing node, makes
It is more stable to obtain task processes.
Optionally, the processing load of the node is the remaining utilization rate and residual storage capacity of the processor of the node
Weighted sum, select to handle the smallest node of load in all nodes as processing node and select weighted sum maximum
Node.
When the node carries out task processing, it can show that the index of node processing load not only only stores and hold
Amount, the utilization rate of processor is also an important index, and this programme comprehensively considers the two indexs, using weighted sum by this two
A index is combined together, and as an overall performane, optimal node is selected to carry out task processing.The mode of weighted sum is will be described
After the residual storage capacity of node and the remaining utilization rate of the modal processor multiply a weight respectively, then it is added summation.Most
After to acquire the maximum node of weighted sum be exactly optimal node.Such as processor and 512 terabytes for 16 core, 32 thread
The processor of (Terabyte, TB) memory capacity, we can be set, and the weight of processor is 0.6, the weight of memory capacity is
0.4, wherein each weight of the weighted sum can be according to specific environment flexible setting, and this example is not subject to the limits fixed.
In another embodiment, the specific steps of the method include:
Judge that all test results of data analysis system current period are deposited for the residue of qualified processing node respectively
Whether capacity is less than predetermined volumes threshold value, whether the remaining utilization rate of processor is less than predetermined utilization rate threshold value for storage；
If the remaining utilization rate of the processor is less than predetermined utilization rate threshold value, the remaining utilization rate of the processor is set
Weight be 1；
If the residual storage capacity of the node is less than predetermined memory capacity threshold value, the remaining storage for setting the node is held
The weight of amount is 1；
Calculate the node processing load include the node processor remaining utilization rate and residual storage capacity
Weighted sum, choose the maximum node of weighted sum as the target handle node.
In the present embodiment, the remaining utilization rate of the processor and the weight of residual storage capacity are that dynamic changes,
If the remaining utilization rate of the processor is less than predetermined utilization rate threshold value and the residual storage capacity of the node is less than predetermined deposit
Capacity threshold is stored up, the weight for setting the residual storage capacity of the node and the remaining utilization rate of the processor is 1.
If the residual storage capacity of the node is less than predetermined memory capacity threshold value, and the remaining utilization rate of the processor
Not less than predetermined utilization rate threshold value, the weight of the residual storage capacity of the node is set as 1, the remaining of the processor uses
The weight of rate is the remaining utilization rate of the processor and the absolute value of the difference of residual storage capacity percentage.
If the remaining utilization rate of the processor is less than predetermined utilization rate threshold value, and the residual storage capacity is not less than pre-
Determine memory capacity threshold value, sets the weight of the remaining utilization rate of the processor of the node as 1, the power of the residual storage capacity
Weight is the remaining utilization rate of the processor and the absolute value of the difference of residual storage capacity percentage.
If the remaining utilization rate of the processor is not less than predetermined utilization rate threshold value and the residual storage capacity of the node
Not less than predetermined memory capacity threshold value, the power of the residual storage capacity of the node and the remaining utilization rate of the processor is set
It is again the remaining utilization rate of the processor and the absolute value of the difference of residual storage capacity percentage.
Wherein, the predetermined memory capacity threshold value is, for example, 256 bytes, 512 kilobytes (Kilobyte, KB) etc., can be with
It is arranged according to concrete application scene, it is not limited here, the predetermined utilization rate threshold value is, for example, 7%, 11%, 19% to the disclosure
Deng can be arranged according to concrete application scene, the disclosure is it is not limited here.
The present embodiment can be sieved by the way that the remaining utilization rate of the processor and the weight of residual storage capacity is set dynamically
Power when selecting the excessive processing node of processing pressure, the especially excessive node of individual event pressure, and they being calculated weighted sum
Reset it is high, thus will not the priority scheduling node excessive to the processing pressure, ensure that the stationarity of scheduling, prevent part
Node collapses.
Fig. 3 is shown in one embodiment, and after the step S120 in Fig. 2 corresponding embodiment, this takes different data
Be engaged in device test scheduling method can with the following steps are included:
Step S130 tests the node that the maintenance is completed if the underproof node maintenance of the test result is completed
Performance judges whether the performance for the node that the maintenance is completed is qualified；
The processing node of the test result qualification is directly entered etc. to be processed by step S140 if test result is qualified
The stage of load inquiry.
It for the undesirable node of performance that test result is shown, needs to be maintained, after the completion of maintenance, first
Determine whether the performance of the node is qualified, needs to continue with if still below standard, if qualified, the node
It can rejoin and wait for data analysis task.
Optionally, Fig. 4 be according to fig. 2 shown in corresponding embodiment to different data server test scheduling method in
The datail description of step S160, in the method for the scheduling to the test of different data server, the selection all tests
As a result it may comprise steps of for the smallest node of processing load in qualified node as processing node, step S160:
Step S161 inquires the task occupied memory capacity in processing, if the memory capacity is greater than one
Threshold value divides the task, and the memory capacity of every part of task after segmentation is both less than the threshold value；
It is the smallest to be followed successively by every part of task choosing present processing load according to the sequencing of segmentation by step S162
Node receives the processing node and handles the data server data analysis task as processing node.
If the treating capacity of a data analysis task is excessive, this task should be divided into more parts, and selected corresponding
The node of quantity handles the task simultaneously, guarantees the stabilization of the treatment process of the task, when preventing from only selecting a node
The node Caton is set even to crash.The efficiency of task processing is also improved simultaneously.
As shown in fig. 7, in one embodiment, the device of the scheduling of a kind of pair of different data server test is provided,
The device of the scheduling to the test of different data server can integrate in above-mentioned test macro 100, specifically can wrap
Include performance test unit 110, node maintenance unit 120, querying node unit 130, node selecting unit 140.
Performance test unit 110, for testing the property of all processing nodes of the data analysis system every predetermined period
Can, judge whether the performance of all processing nodes is qualified；
Node maintenance unit 120 does not conform to the test result if the test result for the processing node is unqualified
It is qualified processing node that the data analysis task of the processing node of lattice, which is transferred to test result, so as to the test result not
Qualified processing node is safeguarded；
Querying node unit 130 handles request for the task in response to data server, inquires data analysis system
All test results of current period of uniting are the processing load of qualified processing node；
Node selecting unit 140 handles load most in qualified processing node for selecting all test results
Small processing node handles node as target, appoints data server data analysis described in the target processing node processing
Business.
The detail of each module has carried out in corresponding distribution method of attending a banquet in detail in above-mentioned distributor of attending a banquet
Thin description, therefore details are not described herein again.
It should be noted that although being referred to several modules or list for acting the equipment executed in the above detailed description
Member, but this division is not enforceable.In fact, according to embodiment of the present disclosure, it is above-described two or more
Module or the feature and function of unit can embody in a module or unit.Conversely, an above-described mould
The feature and function of block or unit can be to be embodied by multiple modules or unit with further division.
In addition, although describing each step of method in the disclosure in the accompanying drawings with particular order, this does not really want
These steps must be executed in this particular order by asking or implying, or having to carry out step shown in whole could realize
Desired result.Additional or alternative, it is convenient to omit multiple steps are merged into a step and executed by certain steps, and/
Or a step is decomposed into execution of multiple steps etc..
Through the above description of the embodiments, those skilled in the art is it can be readily appreciated that example described herein is implemented
Mode can also be realized by software realization in such a way that software is in conjunction with necessary hardware.Therefore, according to the disclosure
The technical solution of embodiment can be embodied in the form of software products, which can store non-volatile at one
Property storage medium (can be CD-ROM, USB flash disk, mobile hard disk etc.) in or network on, including some instructions are so that a calculating
Equipment (can be personal computer, server, mobile terminal or network equipment etc.) is executed according to disclosure embodiment
Method.
In an exemplary embodiment of the disclosure, a kind of electronic equipment that can be realized the above method is additionally provided.
Person of ordinary skill in the field it is understood that various aspects of the disclosure can be implemented as system, method or
Program product.Therefore, various aspects of the disclosure can be with specific implementation is as follows, it may be assumed that complete hardware embodiment, complete
The embodiment combined in terms of full Software Implementation (including firmware, microcode etc.) or hardware and software, can unite here
Referred to as circuit, " module " or " system ".
The electronic equipment 500 of this embodiment according to the disclosure is described referring to Fig. 5.The electronics that Fig. 5 is shown
Equipment 500 is only an example, should not function to the embodiment of the present disclosure and use scope bring any restrictions.
As shown in figure 5, electronic equipment 500 is showed in the form of universal computing device.The component of electronic equipment 500 can wrap
It includes but is not limited to: at least one above-mentioned processing unit 510, at least one above-mentioned storage unit 520, the different system components of connection
The bus 530 of (including storage unit 520 and processing unit 510).
Wherein, the storage unit is stored with program code, and said program code can be held by the processing unit 510
Row, so that various according to the disclosure described in the execution of the processing unit 510 above-mentioned " illustrative methods " part of this specification
The step of illustrative embodiments.For example, the processing unit 510 can execute step S110, Mei Geyi as shown in Figure 2
Fixed cycle tests the performance of all nodes of the data analysis system, judges whether the performance of all nodes is qualified；Step
If the test result of the S120 node is unqualified, the data analysis task of the underproof node of the test result is transferred to
Other processing nodes, safeguard the underproof node of the test result with facilitating；Step S150, in response to data service
The processing load that all test results of data analysis system current period are qualified node is inquired in the call request of device；
Step S160 selects all test results to make for the smallest node of processing load in qualified node as processing node
The processing node receives and handles the data server data analysis task.
Storage unit 520 may include the readable medium of volatile memory cell form, such as Random Access Storage Unit
(RAM) 5201 and/or cache memory unit 5202, it can further include read-only memory unit (ROM) 5203.
Storage unit 520 can also include program/utility with one group of (at least one) program module 5205
5204, such program module 5205 includes but is not limited to: operating system, one or more application program, other program moulds
It may include the realization of network environment in block and program data, each of these examples or certain combination.
Bus 530 can be to indicate one of a few class bus structures or a variety of, including storage unit bus or storage
Cell controller, peripheral bus, graphics acceleration port, processing unit use any bus structures in a variety of bus structures
Local bus.
Electronic equipment 500 can also be with one or more external equipments 700 (such as keyboard, sensing equipment, bluetooth equipment
Deng) communication, can also be enabled a user to one or more equipment interact with the electronic equipment 500 communicate, and/or with make
Any equipment (such as the router, modulation /demodulation that the electronic equipment 500 can be communicated with one or more of the other calculating equipment
Device etc.) communication.This communication can be carried out by input/output (I/O) interface 550.Also, electronic equipment 500 can be with
By network adapter 560 and one or more network (such as local area network (LAN), wide area network (WAN) and/or public network,
Such as internet) communication.As shown, network adapter 560 is communicated by bus 530 with other modules of electronic equipment 500.
It should be understood that although not shown in the drawings, other hardware and/or software module can not used in conjunction with electronic equipment 500, including but not
Be limited to: microcode, device driver, redundant processing unit, external disk drive array, RAID system, tape drive and
Data backup storage system etc..
Through the above description of the embodiments, those skilled in the art is it can be readily appreciated that example described herein is implemented
Mode can also be realized by software realization in such a way that software is in conjunction with necessary hardware.Therefore, according to the disclosure
The technical solution of embodiment can be embodied in the form of software products, which can store non-volatile at one
Property storage medium (can be CD-ROM, USB flash disk, mobile hard disk etc.) in or network on, including some instructions are so that a calculating
Equipment (can be personal computer, server, terminal installation or network equipment etc.) is executed according to disclosure embodiment
Method.
In an exemplary embodiment of the disclosure, a kind of computer readable storage medium is additionally provided, energy is stored thereon with
Enough realize the program product of this specification above method.In some possible embodiments, various aspects of the disclosure may be used also
In the form of being embodied as a kind of program product comprising program code, when described program product is run on the terminal device, institute
Program code is stated for executing the terminal device described in above-mentioned " illustrative methods " part of this specification according to this public affairs
The step of opening various illustrative embodiments.
Refering to what is shown in Fig. 6, describing the program product for realizing the above method according to embodiment of the present disclosure
600, can using portable compact disc read only memory (CD-ROM) and including program code, and can in terminal device,
Such as it is run on PC.However, the program product of the disclosure is without being limited thereto, in this document, readable storage medium storing program for executing can be with
To be any include or the tangible medium of storage program, the program can be commanded execution system, device or device use or
It is in connection.
Described program product can be using any combination of one or more readable mediums.Readable medium can be readable letter
Number medium or readable storage medium storing program for executing.Readable storage medium storing program for executing for example can be but be not limited to electricity, magnetic, optical, electromagnetic, infrared ray or
System, device or the device of semiconductor, or any above combination.The more specific example of readable storage medium storing program for executing is (non exhaustive
List) include: electrical connection with one or more conducting wires, portable disc, hard disk, random access memory (RAM), read-only
Memory (ROM), erasable programmable read only memory (EPROM or flash memory), optical fiber, portable compact disc read only memory
(CD-ROM), light storage device, magnetic memory device or above-mentioned any appropriate combination.
Computer-readable signal media may include in a base band or as carrier wave a part propagate data-signal,
In carry readable program code.The data-signal of this propagation can take various forms, including but not limited to electromagnetic signal,
Optical signal or above-mentioned any appropriate combination.Readable signal medium can also be any readable Jie other than readable storage medium storing program for executing
Matter, the readable medium can send, propagate or transmit for by instruction execution system, device or device use or and its
The program of combined use.
The program code for including on readable medium can transmit with any suitable medium, including but not limited to wirelessly, have
Line, optical cable, RF etc. or above-mentioned any appropriate combination.
Can with any combination of one or more programming languages come write for execute the disclosure operation program
Code, described program design language include object oriented program language-Java, C++ etc., further include conventional
Procedural programming language-such as " C " language or similar programming language.Program code can be fully in user
It calculates and executes in equipment, partly executes on a user device, being executed as an independent software package, partially in user's calculating
Upper side point is executed on a remote computing or is executed in remote computing device or server completely.It is being related to far
Journey calculates in the situation of equipment, and remote computing device can pass through the network of any kind, including local area network (LAN) or wide area network
(WAN), it is connected to user calculating equipment, or, it may be connected to external computing device (such as utilize ISP
To be connected by internet).
In addition, above-mentioned attached drawing is only the schematic theory of the processing according to included by the method for disclosure exemplary embodiment
It is bright, rather than limit purpose.It can be readily appreciated that the time that above-mentioned processing shown in the drawings did not indicated or limited these processing is suitable
Sequence.In addition, be also easy to understand, these processing, which can be, for example either synchronously or asynchronously to be executed in multiple modules.
Those skilled in the art after considering the specification and implementing the invention disclosed here, will readily occur to its of the disclosure
His embodiment.The disclosure is intended to cover any variations, uses, or adaptations of the disclosure, these modifications, purposes or
Adaptive change follow the general principles of this disclosure and including the undocumented common knowledge in the art of the disclosure or
Conventional techniques.The description and examples are only to be considered as illustrative, and the true scope and spirit of the disclosure are by claim
It points out.
Claims (9)
1. the method for the scheduling of a kind of pair of different data server test, for analyzing system to the data comprising multiple processing nodes
The scheduling of the test of system, which is characterized in that the described method includes:
The performance of all processing nodes of the data analysis system is tested every predetermined period, judges all processing nodes
Whether performance is qualified；
If the test result of the processing node is unqualified, the data analysis of the underproof processing node of the test result is appointed
It is qualified processing node that business, which is transferred to test result, to safeguard to the underproof processing node of the test result；
Request is handled in response to the task of data server, inquiring all test results of data analysis system current period is
The processing load of qualified processing node；
Selecting all test results is the processing the smallest processing node of load in qualified processing node as target processing
Node makes data server data analysis task described in the target processing node processing.
2. the method as described in claim 1, which is characterized in that the processing load is used to indicate the processor of the node
Remaining utilization rate, it is described select all test results for the processing the smallest node of load in qualified node as target at
Manage node, comprising:
Select all test results in qualified node, the most node of the remaining utilization rate of processor is as the mesh
Mark processing node.
3. the method as described in claim 1, which is characterized in that the processing load includes the memory capacity of the node, institute
State select in all nodes handle the smallest node of load as handle node include:
Select all test results in qualified node, the maximum node of residual storage capacity size is as the target
Handle node.
4. the method as described in claim 1, which is characterized in that the processing load of the node includes the processor of the node
Remaining utilization rate and residual storage capacity, it is described select in all nodes handle the smallest node of load as processing section
It puts and includes:
Judge that all test results of data analysis system current period are held for the remaining storage of qualified processing node respectively
Whether amount is less than predetermined volumes threshold value, whether the remaining utilization rate of processor is less than predetermined utilization rate threshold value；
If the remaining utilization rate of the processor is less than predetermined utilization rate threshold value, the power of the remaining utilization rate of the processor is set
Weight is 1, if the remaining utilization rate of the processor is not less than predetermined utilization rate threshold value, sets the remaining utilization rate of the processor
Weight be the processor remaining utilization rate and residual storage capacity percentage absolute value of the difference；
If the residual storage capacity of the node is less than predetermined memory capacity threshold value, the residual storage capacity of the node is set
Weight is 1, if the residual storage capacity of the node is not less than predetermined memory capacity threshold value, sets the remaining storage of the node
The weight of capacity is the remaining utilization rate of the processor and the absolute value of the difference of residual storage capacity percentage；
The processing load for calculating the node includes the remaining utilization rate of processor and adding for residual storage capacity of the node
Quan He chooses the maximum node of weighted sum as the target and handles node.
5. the method as described in claim 1, which is characterized in that if the test result in the node is unqualified, by the survey
The data analysis task of the underproof node of test result is transferred to other processing nodes, unqualified to the test result to facilitate
Node safeguarded after, the method also includes:
If the underproof node maintenance of the test result is completed, the performance for the node that the maintenance is completed is tested, described in judgement
Safeguard whether the performance for the node completed is qualified；
If test result is qualified, the processing node of the test result qualification is directly entered etc. to the rank of load inquiry to be processed
Section.
6. the method as described in claim 1, which is characterized in that the data by the underproof node of the test result point
Analysis task is transferred to the target processing node and is handled, comprising:
Task occupied memory capacity in processing in the task processing request of the data server is inquired, if the storage
Capacity is greater than preset threshold, then is split to task in the task processing request of the data server, and it is suitable to record segmentation
Sequence, wherein the memory capacity of every part of data analysis task after the segmentation is both less than the threshold value；
According to the sequencing of segmentation, successively every part of data analysis task is transferred at the target processing node
Reason.
7. the device of the scheduling of a kind of pair of different data server test, which is characterized in that described device includes:
Performance test unit, for testing the performance of all processing nodes of the data analysis system, judgement every predetermined period
Whether the performance of all processing nodes is qualified；
Node maintenance unit, if the test result for the processing node is unqualified, by the underproof place of the test result
It is qualified processing node that the data analysis task of reason node, which is transferred to test result, so as to underproof to the test result
Processing node is safeguarded；
Querying node unit handles request for the task in response to data server, it is current to inquire the data analysis system
Period all test results are the processing load of qualified processing node；
Node selecting unit handles the smallest processing of load in qualified processing node for selecting all test results
Node handles node as target, makes data server data analysis task described in the target processing node processing.
8. a kind of computer equipment, including memory and processor, it is stored with computer-readable instruction in the memory, it is described
When computer-readable instruction is executed by the processor, so that the processor is executed as described in any one of claims 1 to 6
Method.
9. a kind of storage medium for being stored with computer-readable instruction, the computer-readable instruction is by one or more processors
When execution, so that one or more processors execute such as method described in any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910371988.5A CN110196774A (en) | 2019-05-06 | 2019-05-06 | To the dispatching method and relevant apparatus of the test of different data server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910371988.5A CN110196774A (en) | 2019-05-06 | 2019-05-06 | To the dispatching method and relevant apparatus of the test of different data server |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110196774A true CN110196774A (en) | 2019-09-03 |
Family
ID=67752340
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910371988.5A Pending CN110196774A (en) | 2019-05-06 | 2019-05-06 | To the dispatching method and relevant apparatus of the test of different data server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110196774A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050027862A1 (en) * | 2003-07-18 | 2005-02-03 | Nguyen Tien Le | System and methods of cooperatively load-balancing clustered servers |
| US6891802B1 (en) * | 2000-03-30 | 2005-05-10 | United Devices, Inc. | Network site testing method and associated system |
| CN108509256A (en) * | 2017-02-28 | 2018-09-07 | 华为技术有限公司 | Method, equipment and the running equipment of management and running equipment |
| CN108810115A (en) * | 2018-05-29 | 2018-11-13 | 电子科技大学 | A kind of load-balancing method, device and server suitable for distributed data base |
| CN109669856A (en) * | 2018-11-14 | 2019-04-23 | 平安科技（深圳）有限公司 | The test result consultation of doctors method and device of data analysis system |
-
2019
- 2019-05-06 CN CN201910371988.5A patent/CN110196774A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6891802B1 (en) * | 2000-03-30 | 2005-05-10 | United Devices, Inc. | Network site testing method and associated system |
| US20050027862A1 (en) * | 2003-07-18 | 2005-02-03 | Nguyen Tien Le | System and methods of cooperatively load-balancing clustered servers |
| CN108509256A (en) * | 2017-02-28 | 2018-09-07 | 华为技术有限公司 | Method, equipment and the running equipment of management and running equipment |
| CN108810115A (en) * | 2018-05-29 | 2018-11-13 | 电子科技大学 | A kind of load-balancing method, device and server suitable for distributed data base |
| CN109669856A (en) * | 2018-11-14 | 2019-04-23 | 平安科技（深圳）有限公司 | The test result consultation of doctors method and device of data analysis system |
Non-Patent Citations (1)
| Title |
|---|
| 刘瑞扬等著: "《铁路车号自动识别***原理及应用》", 31 December 2003 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10587681B2 (en) | Deployment of multi-task analytics applications in multi-clouds | |
| US7631034B1 (en) | Optimizing node selection when handling client requests for a distributed file system (DFS) based on a dynamically determined performance index | |
| CN109582234A (en) | Storage resources distribution method, device, electronic equipment and computer-readable medium | |
| CN109408205B (en) | Task scheduling method and device based on hadoop cluster | |
| CN108304250A (en) | Method and apparatus for the node for determining operation machine learning task | |
| CN109324977A (en) | Detection method, device and the electronic equipment of application program Caton | |
| CN109783472A (en) | Moving method, device, computer equipment and the storage medium of table data | |
| CN109426593A (en) | The method and apparatus of automatic evaluation system performance | |
| US9160700B2 (en) | Managing conversations, awareness and availability on multi-device messaging systems based on modeling device usage over time | |
| CN109831524A (en) | A kind of load balance process method and device | |
| CN109902446B (en) | Method and apparatus for generating information prediction model | |
| CN109408214A (en) | A kind of method for parallel processing of data, device, electronic equipment and readable medium | |
| CN109933405A (en) | Virtual machine creation method and device, electronic equipment, storage medium | |
| CN109460003A (en) | Vehicle trouble predicts modeling method and system | |
| CN111383100A (en) | Risk model-based full life cycle management and control method and device | |
| CN107291621A (en) | Processing method, processing unit, medium and the electronic equipment of test case | |
| CN109684172A (en) | Log method for pushing, system, equipment and storage medium based on access frequency | |
| CN109240802A (en) | request processing method and device | |
| CN109828859A (en) | Mobile terminal memory analysis method, apparatus, storage medium and electronic equipment | |
| CN109976919A (en) | A kind of transmission method and device of message request | |
| CN110765752A (en) | Test question generation method and device, electronic equipment and computer readable storage medium | |
| CN108667872A (en) | Archiving method and device for dispatch server | |
| US20220308927A1 (en) | Composed compute system with energy aware orchestration | |
| US10600037B2 (en) | Efficient scheduling of maintenance for power distribution systems | |
| CN112148458A (en) | Task scheduling method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190903 |