CN110175073A - Dispatching method, sending method, device and the relevant device of data exchange operation - Google Patents
Dispatching method, sending method, device and the relevant device of data exchange operation Download PDFInfo
- Publication number
- CN110175073A CN110175073A CN201910471611.7A CN201910471611A CN110175073A CN 110175073 A CN110175073 A CN 110175073A CN 201910471611 A CN201910471611 A CN 201910471611A CN 110175073 A CN110175073 A CN 110175073A
- Authority
- CN
- China
- Prior art keywords
- data exchange
- queue
- job
- exchange operation
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
- G06F16/254—Extract, transform and load [ETL] procedures, e.g. ETL data flows in data warehouses
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/48—Indexing scheme relating to G06F9/48
- G06F2209/484—Precedence
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Computer And Data Communications (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the present invention provides dispatching method, sending method, device and the relevant device of a kind of data exchange operation.The embodiment of the present invention passes through when needing the operation of dispatching priority queue, according to the priority level and creation time of data exchange operation each in current queue, determine the current schedule information of each data exchange operation, the maximum data exchange operation of current schedule information is searched from current queue, as this schedule job, this schedule job is scheduled, reduce the waiting time of high priority grade operation in the queue, it has ensured that the operation of high priority grade can obtain preferentially rapidly dispatching, has improved business processing quality.
Description
Technical field
The present invention relates to technical field of data processing more particularly to a kind of dispatching methods of data exchange operation, sender
Method, device and relevant device.
Background technique
ETL (Extract-Transform-Load, extraction-interaction conversion-load) is used to describe data from source terminal
By the process of extraction (extract), interaction conversion (transform), load (load) to destination.
For the ability for improving ETL exchange, more data sources is supported to access, ETL tool can be carried out by the way of cluster
Deployment, is managed collectively multiple working nodes by control node, and exchanging operation is distributed to one or more working nodes and carries out data
Exchange.
In the related technology, all data exchange operations that working node is assigned to are all in a queue, and according to elder generation
The data exchange operation in queue is scheduled into the principle first gone out.This scheduling mode will lead to important data exchange and make
Industry waits in line the long period, therefore business processing quality is lower.
Summary of the invention
To overcome the problems in correlation technique, the present invention provides a kind of dispatching methods of data exchange operation, hair
Delivery method, device and relevant device.
According to a first aspect of the embodiments of the present invention, a kind of dispatching method of data exchange operation is provided, work is applied to
Node, the working node include multiple job queues, which comprises
If current queue is the job queue of corresponding assigned priority grade, when needing schedule job, according to current team
The priority level and creation time of each data exchange operation in column, determine the current schedule information of each data exchange operation；
The maximum data exchange operation of current schedule information is searched from current queue, as this schedule job；
This schedule job is scheduled, to use the corresponding exclusive process resource of current queue to this schedule job
It is handled.
According to a second aspect of the embodiments of the present invention, a kind of dispatching device of data exchange operation is provided, work is applied to
Node, the working node include multiple job queues, and described device includes:
First determining module is needing to dispatch if being the job queue for corresponding to assigned priority grade for current queue
When operation, according to the priority level and creation time of data exchange operation each in current queue, each data exchange operation is determined
Current schedule information；
First searching module, for searching the maximum data exchange operation of current schedule information from current queue, as
This schedule job；
First scheduler module, for being scheduled to this schedule job, to use the corresponding exclusive processing of current queue
Resource handles this schedule job.
According to a third aspect of the embodiments of the present invention, a kind of node device is provided, including processor and for storing
State the memory of the executable instruction of processor；
The processor is configured to:
If current queue is the job queue of corresponding assigned priority grade, when needing schedule job, according to current team
The priority level and creation time of each data exchange operation in column, determine the current schedule information of each data exchange operation；
The maximum data exchange operation of current schedule information is searched from current queue, as this schedule job；
This schedule job is scheduled, to use the corresponding exclusive process resource of current queue to this schedule job
It is handled.
According to a fourth aspect of the embodiments of the present invention, a kind of sending method of data exchange operation is provided, control is applied to
Node, which comprises
Obtain the priority level and creation time of data exchange operation to be sent；
Data exchange job information is sent to assigned work node, the data exchange job information includes described to be sent
Data exchange operation, the priority level and the creation time.
According to a fifth aspect of the embodiments of the present invention, a kind of sending device of data exchange operation is provided, control is applied to
Node, described device include:
Module is obtained, for obtaining the priority level and creation time of data exchange operation to be sent；
Sending module, for sending data exchange job information, the data exchange job information to assigned work node
Including the data exchange operation to be sent, the priority level and the creation time.
According to a sixth aspect of the embodiments of the present invention, a kind of node device is provided, including processor and for storing
State the memory of the executable instruction of processor；
The processor is configured to:
Obtain the priority level and creation time of data exchange operation to be sent；
Data exchange job information is sent to assigned work node, the data exchange job information includes described to be sent
Data exchange operation, the priority level and the creation time.
Technical solution provided in an embodiment of the present invention can include the following benefits:
The embodiment of the present invention, by being handed over according to data each in current queue when needing the operation of dispatching priority queue
The priority level and creation time for changing operation determine the current schedule information of each data exchange operation, look into from current queue
It looks for the maximum data exchange operation of current schedule information to be scheduled as this schedule job to this schedule job, reduces
The waiting time of high priority grade operation in the queue, ensured the operation of high priority grade can obtain it is preferential rapidly
Scheduling, improves business processing quality.
It should be understood that above general description and following detailed description be only it is exemplary and explanatory, not
This specification can be limited.
Detailed description of the invention
The drawings herein are incorporated into the specification and forms part of this specification, and shows the reality for meeting this specification
Example is applied, and is used to explain the principle of this specification together with specification.
Fig. 1 is a topology example figure of ETL cluster provided in an embodiment of the present invention.
Fig. 2 is a flow example figure of the dispatching method of data exchange operation provided in an embodiment of the present invention.
Fig. 3 is another flow example figure of the dispatching method of data exchange operation provided in an embodiment of the present invention.
Fig. 4 is the flow example figure of the sending method of data exchange operation provided in an embodiment of the present invention.
Fig. 5 is the functional block diagram of the dispatching device of data exchange operation provided in an embodiment of the present invention.
Fig. 6 is the functional block diagram of the sending device of data exchange operation provided in an embodiment of the present invention.
Fig. 7 is a hardware structure diagram of node device provided in an embodiment of the present invention.
Specific embodiment
Example embodiments are described in detail here, and the example is illustrated in the accompanying drawings.Following description is related to
When attached drawing, unless otherwise indicated, the same numbers in different drawings indicate the same or similar elements.Following exemplary embodiment
Described in embodiment do not represent all embodiments consistented with the present invention.On the contrary, they be only with it is such as appended
The example of the consistent device and method of some aspects be described in detail in claims, the embodiment of the present invention.
It in the term that the embodiment of the present invention uses and is not intended to merely for describing the purpose of the specific embodiment of the present invention
Limit the embodiment of the present invention.In the embodiment of the present invention and the "an" of singular used in the attached claims, " institute
State " and "the" be also intended to including most forms, unless the context clearly indicates other meaning.It is also understood that making herein
Term "and/or" refers to and may combine comprising one or more associated any or all of project listed.
It will be appreciated that though various letters may be described using term first, second, third, etc. in the embodiment of the present invention
Breath, but these information should not necessarily be limited by these terms.These terms are only used to for same type of information being distinguished from each other out.For example,
In the case where not departing from range of embodiment of the invention, the first information can also be referred to as the second information, similarly, the second information
The first information can also be referred to as.Depending on context, word as used in this " if " can be construed to " ...
When " or " when ... " or " in response to determination ".
Fig. 1 is a topology example figure of ETL cluster provided in an embodiment of the present invention.Referring to Figure 1, an ETL cluster
It may include a control node and at least one working node.Control node and each working node can be deployed in different
On server.Control node is handed down to working node for generating data exchange operation.Working node is for receiving control section
The data exchange operation that point issues, according to data exchange job execution data exchange.
In Fig. 1, database 1 is source database, and database 2 is purpose client database.Working node is according to data exchange
Operation, by the data Jiao Huanzhi database 2 in database 1.
Working node carries out the operation of data exchange operation, 1 core CPU corresponding one using multi-thread concurrent using multi-core CPU
A thread.The CPU quantity of working node determines the concurrent thread number and concurrent operation number of working node.Assuming that work section
Point has n (n is natural number) core CPU, then the working node can run n thread simultaneously, executes n data exchanging operation, i.e.,
The corresponding data exchanging operation of one thread.
Work as synchronization, when the data exchange operation quantity for needing to run is greater than the quantity of CPU, working node can be according to elder generation
Data exchanging operation is scheduled into the principle first gone out.
In this way, if important data exchange operation comes the middle part or rear portion of queue, it is necessary to wait the long period.And
And need the data volume that exchanges very big if coming the operation before the data exchange operation, the waiting time can be made longer.
In the present invention, multiple queues, the corresponding one group of exclusive process resource of each queue are set in working node.These teams
Column include the queue and the queue of corresponding all priority levels of corresponding assigned priority grade, for convenience of description, hereinafter
Middle that the former is known as priority query, the latter is known as competing queue.
Wherein, exclusive process resource refers to CPU.Why it is known as exclusive process resource, refers to the process resource of each queue
Only used in the queue, it cannot be used for other queues.
For example, working node A has 3 queues: queue 1, queue 2, queue 3.And working node A has 10 core CPU, i.e. CPU1
~10.Assuming that queue 1, queue 2, queue 3 exclusive process resource be respectively CPU1~3, CPU4~6, CPU7~10, then CPU1
The data exchange operation being only used in processing queue 1, it is impossible to be used in the data exchange operation in processing queue 2 or queue 3.
In embodiments of the present invention, the quantity of priority level, each priority query and priority level corresponding relationship,
It can be set according to actual needs.
For example, in one example, the quantity of priority level is 2: priority level 1, priority level 2, priority
Grade 2 is higher than priority level 1；Working node is provided with 3 queues: high-priority queue, Low Priority Queuing and competition team
Column.Wherein, high-priority queue corresponds to priority level 2, and Low Priority Queuing corresponds to priority level 1, and competition queue is corresponding
Priority level 2 and priority level 1.
When control node issues the data exchange operation of priority level 2 to the working node, if high priority team
Less than (the operation quantity i.e. in high-priority queue is not up to preset upper limit value) is arranged, then the data exchange operation is put into height
In priority query；If high-priority queue has been expired, (the operation quantity i.e. in high-priority queue has reached the preset upper limit
Value), then the data exchange operation is put into competition queue.
Equally, when control node issues the data exchange operation of priority level 1 to the working node, if low preferential
Grade queue is less than (the operation quantity i.e. in Low Priority Queuing is not up to preset upper limit value), then puts the data exchange operation
Enter in Low Priority Queuing；If Low Priority Queuing has been expired, (the operation quantity i.e. in Low Priority Queuing has reached preset
Upper limit value), then the data exchange operation is put into competition queue.
It should be noted that in other embodiments, the quantity of priority query can be one or more.
In other embodiments, a priority query can correspond to one or more priority levels.
It is described in detail below by dispatching method of the embodiment to data exchange operation provided by the invention.
Fig. 2 is a flow example figure of the dispatching method of data exchange operation provided in an embodiment of the present invention.The data
The dispatching method of exchanging operation is applied to working node, which includes multiple job queues.As shown in Fig. 2, data are handed over
The dispatching method for changing operation may include:
S201, if current queue is the job queue of corresponding assigned priority grade, when needing schedule job, according to working as
The priority level and creation time of each data exchange operation in preceding queue determine the current scheduling letter of each data exchange operation
Breath.
S202 searches the maximum data exchange operation of current schedule information, as this schedule job from current queue.
S203 is scheduled this schedule job, to use the corresponding exclusive process resource of current queue to this tune
Degree operation is handled.
The queue that the scheme of the present embodiment is directed to is priority query.
By the way that corresponding job queue is arranged for assigned priority grade, the exclusive process resource pair of the queue can be used
The data exchange operation of assigned priority grade is handled, and so as to reduce the waiting time of the data exchange operation, is mentioned
High business processing quality.
In the present embodiment, in the available free resource of the corresponding exclusive process resource of current queue, determination needs schedule job；
When the corresponding exclusive process resource of current queue is without idling-resource, determination does not need schedule job.
In each job queue, the information of each data exchange operation includes the priority level of the data exchange operation
And creation time.
Wherein, the priority level of data exchange operation can be control node when creating data exchange operation, according to
What the input information of user determined.
The creation time of data exchange operation is the time of control node creation data exchange operation.
In one example, the calculation of the scheduling information of data exchange operation may is that
Scheduling information=priority level * weight+(current time-creation time)
Wherein, the value of weight can rule of thumb be set.
Scheduling information is proportional to priority level, and is proportional to waiting time.Therefore, priority level is higher, when waiting
Longer, scheduling information is bigger.
Wherein, waiting time=current time-creation time.
By the way that weighted value appropriate is arranged, can make in priority level difference, the tune of the high operation of priority level
Spend the scheduling information that information is greater than the low operation of priority level.In this way, can realize in priority level difference, preferentially
The high operation of dispatching priority grade；When priority level is identical, the operation of priority scheduling waiting time length.In this way, passing through
Assign important operation high priority grade, so that it may so that important operation obtains priority scheduling, the waiting time of important operation is reduced,
Improve business processing quality.
Fig. 3 is another flow example figure of the dispatching method of data exchange operation provided in an embodiment of the present invention.The number
It is applied to working node according to the dispatching method of exchanging operation, which includes multiple job queues.As shown in figure 3, data
The dispatching method of exchanging operation may include:
S301, if current queue is the competition queue of corresponding all priority levels, preset batch of dispatching cycle then,
According to the priority level and creation time of data exchange operation each in current queue, the current tune of each data exchange operation is determined
Spend information.
S302 searches the maximum data exchange operation of current schedule information, as quasi- schedule job from current queue；
S303, if quasi- schedule job is batch schedule job, according to the current exchange line number in batches of quasi- schedule job and
Line number is exchanged, determines the target data rows of this scheduling.
S304 is scheduled target data rows, to use the corresponding exclusive process resource of current queue to the target
Data line is handled.
The queue that the scheme of the present embodiment is directed to is competition queue.It competes in queue, scheduling was carried out by batch dispatching cycle
's.I.e. every one batch of dispatching cycle, start primary scheduling.The total data of scheduling not instead of schedule job every time, scheduling
A part of data of operation.This processing mode is referred to as handled in batches herein.
Processing in batches can prevent the operation in competition queue because the activity duration is long, occupy active thread for a long time,
Leading to the operation of higher priority can not be dispatched in time.
One it is illustrative realize during, determine whether data exchange operation is that the mode of batch schedule job can be with
It is:
When data exchange operation is periodic scheduling operation, determine that data exchange operation is whole needed for each dispatching cycle
Body swap time；Calculate the time difference of the whole swap time and batch dispatching cycle；If the time difference is less than preset value, number is determined
It is batch schedule job according to exchanging operation；Otherwise, if the time difference is greater than or equal to preset value, determining data exchange operation not is batch tune
Spend operation；
When data exchange operation is disposable operation, determine that data exchange operation is batch schedule job.
The data exchange operation competed in queue may include disposable operation and periodic scheduling operation.In the present embodiment,
Disposable operation refers to the data exchange operation issued, and the subsequent corresponding data source data of data exchange operation does not update,
Or more new data is as new data exchange work data.For example, it is assumed that 1 data of table in source database do not need more
Newly, then when swapping operation to 1 data of table, the total data of table 1 can be completed to hand in a data exchanging operation
It changes, which is disposable operation.
In the present embodiment, periodic scheduling operation refers to the operation being updated according to the setting period.For example, it is assumed that source number
It was updated once according to the table 1 in library every 1 hour, then needs once to dispatch table 1 every 1 hour, i.e. the dispatching cycle of table 1
It is 1 hour.
If the time-consuming swapped to the newly-increased data of table 1 is about 50 minutes within each dispatching cycle, batch scheduling
Period is 1 hour.At this time if handled in batches table 1, when have in queue bigger than 1 scheduling information of table one or
When multiple operations, according to priority scheduling principle, the operation of table 1 can be by rear scheduling.In this way, next dispatching cycle when table 1 arrives
When, table 1 needs the data exchanged that will have the remaining data not exchanged in current dispatching cycle, causes data in table 1
Accumulation.Therefore, the present embodiment to swap time needed for dispatching cycle each in this way and criticizes the operation of dispatching cycle relatively,
It does not carry out and handles in batches, but disposably incessantly finish the data exchange for needing to exchange in this dispatching cycle.
If the time-consuming swapped to the newly-increased data of table 1 is about 6 minutes within each dispatching cycle.At this time by
The swap time needed for each dispatching cycle is very short, far smaller than criticizes dispatching cycle, and carrying out processing in batches to table 1 will not make
Not the case where data appearance does not exchange accumulation in table 1, therefore table 1 can be handled in batches.
In the present embodiment, data exchange operation whole swap time needed for each dispatching cycle can be handed over by data
The total data amount and message transmission rate that operation is changed in each dispatching cycle are calculated.That is:
Whole swap time=each dispatching cycle total data amount ÷ message transmission rate
During an illustrative realization, the acquisition modes for exchanging line number in batches be can be such that
According to each field type of data exchange operation and the corresponding Field Count of each field type, data exchange operation is calculated
The data volume of each row of data；
According to the data volume and message transmission rate, the time-consuming of data exchange operation each row of data is determined；
According to the time-consuming of batch dispatching cycle and each row of data determined, calculating exchanges line number in batches.
Wherein, field type such as integer type, type double precision, type real etc..
Each type of field all has the byte number of setting.It therefore, can be with the word of the type field according to field type
Joint number.The data volume of data exchange operation each row of data is equal to the sum of products of each field type corresponding byte number and Field Count.
For example, data exchange operation has field type in 2: field type 1, field type 2.The field word of field type 1
Joint number is m1, Field Count Q1；The field bytes of field type 2 are m2, Field Count Q2.The then every row of data exchange operation
Data volume=m1*Q1+m2*Q2 of data.
During an illustrative realization, the method also includes:
After completing to the data exchange of target data rows, the exchange line number of quasi- schedule job is updated, and record target
Swap time used in data line；
According to the data volume of target data rows and swap time, the exchange line number in batches of quasi- schedule job is updated.
Wherein, the line number that exchanged of quasi- schedule job is equal to the line number of exchange and target data for dispatching preceding operation after update
The sum of capable line number.After update has exchanged line number, it can be dispatched again in next time and know the initial row of data exchange when the operation.
Wherein, the determination mode for exchanging line number in batches of quasi- schedule job is as follows after update:
Firstly, calculating the message transmission rate of target data rows according to the data volume of target data rows and swap time:
The swap time of message transmission rate=target data rows data volume ÷ target data rows of target data rows
Then, every row time-consuming is recalculated according to the message transmission rate of target data rows and each row of data amount:
Updated every row time-consuming=each row of data amount ÷ target data rows message transmission rate
Finally, calculating the exchange in batches of quasi- schedule job after updating according to batch dispatching cycle and updated every row time-consuming
Line number:
It is time-consuming that the updated every row of line number=crowd ÷ dispatching cycle is exchanged after update in batches
Since communication conditions are in continuous variation, message transmission rate is also constantly changing.In this example,
After each batch splitting scheduling, message transmission rate is recalculated according to the data volume of this target data rows and swap time,
And every row time-consuming is corrected according to calculated message transmission rate dynamic, line number is exchanged simultaneously in batches to more precisely compute out
It updates.
When handling in batches the first time of each data exchange operation, the message transmission rate used is preset value.This
Afterwards, after exchange every time in batches, line number is exchanged according to the update of newest message transmission rate in batches, can be made so in batches
It is more accurate to exchange line number, avoids calculating inaccuracy very few, the waste that causes to exchange line number in batches due to exchanging line number in batches
Resource.
During an illustrative realization, the method also includes:
If quasi- schedule job is not batch schedule job, alignment schedule job is scheduled, to use current queue corresponding
Exclusive process resource is directed at schedule job incessantly and is handled in all data to be exchanged of current dispatching cycle.
The present embodiment can ensure the continual and steady of data exchange operation, and data exchange is completed within dispatching cycle.
During an illustrative realization, the method can also include:
The data exchange job information that control node is sent is received, data exchange job information includes that target data exchange is made
Industry and the corresponding target priority grade of target data exchanging operation and target creation time；
According to target priority grade, target data exchanging operation is distributed to object queue；
Record target priority grade and target creation time.
One it is illustrative realize during, according to target priority grade, by target data exchanging operation distribute to
Object queue may include；
The job queue with the target priority ratings match is searched, matching queue is denoted as；
If the operation quantity in current matching queue is not up to preset upper limit value, matching queue is determined as target team
Column；Otherwise, competition queue is determined as object queue；
Target data exchanging operation is distributed to determining object queue.
In the present embodiment, with target priority ratings match, may include:
Target priority grade priority level corresponding with queue is equal；Alternatively,
Target priority grade belongs to the corresponding priority level range of queue.
The dispatching method of data exchange operation provided in an embodiment of the present invention, by the work for needing dispatching priority queue
When industry, according to the priority level and creation time of data exchange operation each in current queue, each data exchange operation is determined
Current schedule information searches the maximum data exchange operation of current schedule information from current queue, as this schedule job,
This schedule job is scheduled, the waiting time of high priority grade operation in the queue is reduced, has ensured Gao Youxian
Grade grade operation can obtain preferentially rapidly dispatching, and improve business processing quality.
The embodiment of the invention also provides a kind of sending method of data exchange operation, this method is applied to control node.
Fig. 4 is the flow example figure of the sending method of data exchange operation provided in an embodiment of the present invention.As shown in figure 4,
In the present embodiment, the sending method of data exchange operation may include:
S401 obtains the priority level and creation time of data exchange operation to be sent.
S402 sends data exchange job information to assigned work node, and data exchange job information includes to be sent
Data exchange operation, priority level and creation time.
In the present embodiment, control node is when sending data exchange operation to working node, together with data exchange operation
Priority level and creation time are sent to working node together, establish to be based on schedule information schedules operation for working node
Basis.
Based on above-mentioned embodiment of the method, the embodiment of the present invention also provides corresponding devices, equipment and storage medium are real
Apply example.About the device of the embodiment of the present invention, the detailed implementation of equipment and storage medium embodiment, preceding method is referred to
The respective description of embodiment part.
Fig. 5 is the functional block diagram of the dispatching device of data exchange operation provided in an embodiment of the present invention.As shown in figure 5,
In the present embodiment, the dispatching device of data exchange operation is applied to working node, and the working node includes multiple job queues,
The apparatus may include:
First determining module 510 is needing to adjust if being the job queue for corresponding to assigned priority grade for current queue
When spending operation, according to the priority level and creation time of data exchange operation each in current queue, determine that each data exchange is made
The current schedule information of industry；
First searching module 520 is made for searching the maximum data exchange operation of current schedule information from current queue
For this schedule job；
First scheduler module 530, for being scheduled to this schedule job, to use the corresponding exclusive place of current queue
Reason resource handles this schedule job.
During an illustrative realization, described device can also include:
Second determining module, if being to correspond to the competition queue of all priority levels for current queue, at preset batch
Dispatching cycle then, according to the priority level and creation time of data exchange operation each in current queue, determines that each data are handed over
Change the current schedule information of operation；
Second searching module, for searching the maximum data exchange operation of current schedule information from current queue, as
Quasi- schedule job；
Row determining module, if being batch schedule job for the quasi- schedule job, according to quasi- schedule job it is current in batches
Secondary exchange line number and line number is exchanged, has determined the target data rows of this scheduling；
Second scheduler module, for being scheduled to the target data rows, to use the corresponding exclusive place of current queue
Reason resource handles the target data rows.
During an illustrative realization, described device can also include:
Third scheduler module carries out the quasi- schedule job if for the quasi- schedule job not being batch schedule job
Scheduling, to use the corresponding exclusive process resource of current queue incessantly to the quasi- schedule job in current dispatching cycle
All data to be exchanged are handled.
During an illustrative realization, the acquisition modes for exchanging line number in batches are as follows:
According to each field type of data exchange operation and the corresponding Field Count of each field type, data exchange operation is calculated
The data volume of each row of data；
According to the data volume and message transmission rate, the time-consuming of data exchange operation each row of data is determined；
According to the time-consuming of batch dispatching cycle and each row of data determined, calculating exchanges line number in batches.
During an illustrative realization, described device can also include:
Update and logging modle, for after completing to the data exchange of the target data rows, updating the quasi- scheduling
The exchange line number of operation, and record swap time used in the target data rows；
Line number update module, for according to the target data rows data volume and the swap time, update the standard
The exchange line number in batches of schedule job.
One it is illustrative realize during, determine data exchange operation whether be batch schedule job mode it is as follows:
When data exchange operation is periodic scheduling operation, determine that data exchange operation is whole needed for each dispatching cycle
Body swap time；Calculate the time difference of the whole swap time and described batch of dispatching cycle；If the time difference is less than default
Value determines that data exchange operation is batch schedule job；Otherwise, it determines data exchange operation is not batch schedule job；
When data exchange operation is disposable operation, determine that data exchange operation is batch schedule job.
During an illustrative realization, described device can also include:
Receiving module, for receiving the data exchange job information of control node transmission, the data exchange job information
Including target data exchanging operation and the corresponding target priority grade of target data exchanging operation and target creation time；
Distribution module, for according to the target priority grade, the target data exchanging operation to be distributed to target
Queue；
Time recording module, for recording the target priority grade and the target creation time.
It is described according to the target priority grade during an illustrative realization, the target data is handed over
Operation is changed to distribute to object queue, including；
The job queue with the target priority ratings match is searched, matching queue is denoted as；
If the operation quantity in presently described matching queue is not up to preset upper limit value, the matching queue is determined as
Object queue；Otherwise, competition queue is determined as object queue；
The target data exchanging operation is distributed to determining object queue.
During an illustrative realization, with the target priority ratings match, comprising:
Target priority grade priority level corresponding with queue is equal；Alternatively,
The target priority grade belongs to the corresponding priority level range of queue.
Fig. 6 is the functional block diagram of the sending device of data exchange operation provided in an embodiment of the present invention.As shown in fig. 6,
In the present embodiment, the dispatching device of data exchange operation is applied to working node, and the working node includes multiple job queues,
The apparatus may include:
Module 610 is obtained, for obtaining the priority level and creation time of data exchange operation to be sent；
Sending module 620, for sending data exchange job information, the data exchange operation letter to assigned work node
Breath includes the data exchange operation to be sent, the priority level and the creation time.
The embodiment of the invention also provides a kind of node devices.Fig. 7 is the one of node device provided in an embodiment of the present invention
A hardware structure diagram.As shown in fig. 7, node device includes: internal bus 701, and the memory connected by internal bus
702, processor 703 and external interface 704.
When node device is as working node, and the working node includes multiple job queues, the processor
703, for reading the machine readable instructions on memory 702, and described instruction is executed to realize following operation:
If current queue is the job queue of corresponding assigned priority grade, when needing schedule job, according to current team
The priority level and creation time of each data exchange operation in column, determine the current schedule information of each data exchange operation；
The maximum data exchange operation of current schedule information is searched from current queue, as this schedule job；
This schedule job is scheduled, to use the corresponding exclusive process resource of current queue to this schedule job
It is handled.
During an illustrative realization, the processor 703 executes described instruction also to realize following operation:
If current queue is the competition queue of corresponding all priority levels, preset batch of dispatching cycle then, according to
The priority level and creation time of each data exchange operation in current queue determine the current scheduling letter of each data exchange operation
Breath；
The maximum data exchange operation of current schedule information is searched from current queue, as quasi- schedule job；
If the quasi- schedule job is batch schedule job, according to the current exchange line number in batches of quasi- schedule job and hand over
Enter a new line number, determines the target data rows of this scheduling；
The target data rows are scheduled, to use the corresponding exclusive process resource of current queue to the number of targets
It is handled according to row.
During an illustrative realization, the processor 703 executes described instruction also to realize following operation:
If the quasi- schedule job is not batch schedule job, the quasi- schedule job is scheduled, to use current team
Arrange corresponding exclusive process resource incessantly to the quasi- schedule job current dispatching cycle all data to be exchanged into
Row processing.
During an illustrative realization, the acquisition modes for exchanging line number in batches are as follows:
According to each field type of data exchange operation and the corresponding Field Count of each field type, data exchange operation is calculated
The data volume of each row of data；
According to the data volume and message transmission rate, the time-consuming of data exchange operation each row of data is determined；
According to the time-consuming of batch dispatching cycle and each row of data determined, calculating exchanges line number in batches.
During an illustrative realization, the processor 703 executes described instruction also to realize following operation:
After completing to the data exchange of the target data rows, the exchange line number of the quasi- schedule job is updated, and
Record swap time used in the target data rows；
According to the data volume of the target data rows and the swap time, the friendship in batches of the quasi- schedule job is updated
Enter a new line number.
One it is illustrative realize during, determine data exchange operation whether be batch schedule job mode it is as follows:
When data exchange operation is periodic scheduling operation, determine that data exchange operation is whole needed for each dispatching cycle
Body swap time；Calculate the time difference of the whole swap time and described batch of dispatching cycle；If the time difference is less than default
Value determines that data exchange operation is batch schedule job；Otherwise, it determines data exchange operation is not batch schedule job；
When data exchange operation is disposable operation, determine that data exchange operation is batch schedule job.
During an illustrative realization, the processor 703 executes described instruction also to realize following operation:
The data exchange job information that control node is sent is received, the data exchange job information includes that target data is handed over
Change operation and the corresponding target priority grade of target data exchanging operation and target creation time；
According to the target priority grade, the target data exchanging operation is distributed to object queue；
Record the target priority grade and the target creation time.
It is described according to the target priority grade during an illustrative realization, the target data is handed over
Operation is changed to distribute to object queue, including；
The job queue with the target priority ratings match is searched, matching queue is denoted as；
If the operation quantity in presently described matching queue is not up to preset upper limit value, the matching queue is determined as
Object queue；Otherwise, competition queue is determined as object queue；
The target data exchanging operation is distributed to determining object queue.
During an illustrative realization, with the target priority ratings match, comprising:
Target priority grade priority level corresponding with queue is equal；Alternatively,
The target priority grade belongs to the corresponding priority level range of queue.
When node device is as control node, the processor 703 is machine readable on memory 702 for reading
Instruction, and described instruction is executed to realize following operation:
Obtain the priority level and creation time of data exchange operation to be sent；
Data exchange job information is sent to assigned work node, the data exchange job information includes described to be sent
Data exchange operation, the priority level and the creation time.
The embodiment of the present invention also provides a kind of computer readable storage medium, stores on the computer readable storage medium
There are several computer instructions, the computer instruction, which is performed, to be handled as follows:
If current queue is the job queue of corresponding assigned priority grade, when needing schedule job, according to current team
The priority level and creation time of each data exchange operation in column, determine the current schedule information of each data exchange operation；
The maximum data exchange operation of current schedule information is searched from current queue, as this schedule job；
This schedule job is scheduled, to use the corresponding exclusive process resource of current queue to this schedule job
It is handled.
During an illustrative realization, the computer instruction, which is performed, to be also handled as follows:
If current queue is the competition queue of corresponding all priority levels, preset batch of dispatching cycle then, according to
The priority level and creation time of each data exchange operation in current queue determine the current scheduling letter of each data exchange operation
Breath；
The maximum data exchange operation of current schedule information is searched from current queue, as quasi- schedule job；
If the quasi- schedule job is batch schedule job, according to the current exchange line number in batches of quasi- schedule job and hand over
Enter a new line number, determines the target data rows of this scheduling；
The target data rows are scheduled, to use the corresponding exclusive process resource of current queue to the number of targets
It is handled according to row.
During an illustrative realization, the computer instruction, which is performed, to be also handled as follows:
If the quasi- schedule job is not batch schedule job, the quasi- schedule job is scheduled, to use current team
Arrange corresponding exclusive process resource incessantly to the quasi- schedule job current dispatching cycle all data to be exchanged into
Row processing.
During an illustrative realization, the acquisition modes for exchanging line number in batches are as follows:
According to each field type of data exchange operation and the corresponding Field Count of each field type, data exchange operation is calculated
The data volume of each row of data；
According to the data volume and message transmission rate, the time-consuming of data exchange operation each row of data is determined；
According to the time-consuming of batch dispatching cycle and each row of data determined, calculating exchanges line number in batches.
During an illustrative realization, the computer instruction, which is performed, to be also handled as follows:
After completing to the data exchange of the target data rows, the exchange line number of the quasi- schedule job is updated, and
Record swap time used in the target data rows；
According to the data volume of the target data rows and the swap time, the friendship in batches of the quasi- schedule job is updated
Enter a new line number.
One it is illustrative realize during, determine data exchange operation whether be batch schedule job mode it is as follows:
When data exchange operation is periodic scheduling operation, determine that data exchange operation is whole needed for each dispatching cycle
Body swap time；Calculate the time difference of the whole swap time and described batch of dispatching cycle；If the time difference is less than default
Value determines that data exchange operation is batch schedule job；Otherwise, it determines data exchange operation is not batch schedule job；
When data exchange operation is disposable operation, determine that data exchange operation is batch schedule job.
During an illustrative realization, the computer instruction, which is performed, to be also handled as follows:
The data exchange job information that control node is sent is received, the data exchange job information includes that target data is handed over
Change operation and the corresponding target priority grade of target data exchanging operation and target creation time；
According to the target priority grade, the target data exchanging operation is distributed to object queue；
Record the target priority grade and the target creation time.
It is described according to the target priority grade during an illustrative realization, the target data is handed over
Operation is changed to distribute to object queue, including；
The job queue with the target priority ratings match is searched, matching queue is denoted as；
If the operation quantity in presently described matching queue is not up to preset upper limit value, the matching queue is determined as
Object queue；Otherwise, competition queue is determined as object queue；
The target data exchanging operation is distributed to determining object queue.
During an illustrative realization, with the target priority ratings match, comprising:
Target priority grade priority level corresponding with queue is equal；Alternatively,
The target priority grade belongs to the corresponding priority level range of queue.
The embodiment of the present invention also provides a kind of computer readable storage medium, stores on the computer readable storage medium
There are several computer instructions, the computer instruction, which is performed, to be handled as follows:
Obtain the priority level and creation time of data exchange operation to be sent；
Data exchange job information is sent to assigned work node, the data exchange job information includes described to be sent
Data exchange operation, the priority level and the creation time.
For device and apparatus embodiments, since it corresponds essentially to embodiment of the method, so related place referring to
The part of embodiment of the method illustrates.The apparatus embodiments described above are merely exemplary, wherein described be used as is divided
Module from part description may or may not be physically separated, the component shown as module can be or
It may not be physical module, it can it is in one place, or may be distributed on multiple network modules.It can basis
The actual purpose for needing to select some or all of the modules therein to realize this specification scheme.Ordinary skill people
Member can understand and implement without creative efforts.
It is above-mentioned that this specification specific embodiment is described.Other embodiments are in the scope of the appended claims
It is interior.In some cases, the movement recorded in detail in the claims or step can be come according to the sequence being different from embodiment
It executes and desired result still may be implemented.In addition, process depicted in the drawing not necessarily require show it is specific suitable
Sequence or consecutive order are just able to achieve desired result.In some embodiments, multitasking and parallel processing be also can
With or may be advantageous.
Those skilled in the art will readily occur to this specification after considering specification and practicing the invention applied here
Other embodiments.This specification is intended to cover any variations, uses, or adaptations of this specification, these modifications,
Purposes or adaptive change follow the general principle of this specification and do not apply in the art including this specification
Common knowledge or conventional techniques.The description and examples are only to be considered as illustrative, the true scope of this specification and
Spirit is indicated by the following claims.
It should be understood that this specification is not limited to the precise structure that has been described above and shown in the drawings,
And various modifications and changes may be made without departing from the scope thereof.The range of this specification is only limited by the attached claims
System.
The foregoing is merely the preferred embodiments of this specification, all in this explanation not to limit this specification
Within the spirit and principle of book, any modification, equivalent substitution, improvement and etc. done should be included in the model of this specification protection
Within enclosing.
Claims (14)
1. a kind of dispatching method of data exchange operation, which is characterized in that be applied to working node, the working node includes more
A job queue, which comprises
If current queue is the job queue of corresponding assigned priority grade, when needing schedule job, according in current queue
The priority level and creation time of each data exchange operation determine the current schedule information of each data exchange operation；
The maximum data exchange operation of current schedule information is searched from current queue, as this schedule job；
This schedule job is scheduled, to use the corresponding exclusive process resource of current queue to carry out this schedule job
Processing.
2. the method according to claim 1, wherein the method also includes:
If current queue is the competition queue of corresponding all priority levels, preset batch of dispatching cycle then, according to current
The priority level and creation time of each data exchange operation in queue, determine the current schedule information of each data exchange operation；
The maximum data exchange operation of current schedule information is searched from current queue, as quasi- schedule job；
If the quasi- schedule job is batch schedule job, current according to quasi- schedule job exchanges line number and swapping rows in batches
Number determines the target data rows of this scheduling；
The target data rows are scheduled, to use the corresponding exclusive process resource of current queue to the target data rows
It is handled.
3. according to the method described in claim 2, it is characterized in that, the method also includes:
If the quasi- schedule job is not batch schedule job, the quasi- schedule job is scheduled, to use current queue pair
The exclusive process resource answered is incessantly to the quasi- schedule job at all data to be exchanged of current dispatching cycle
Reason.
4. according to the method described in claim 2, it is characterized in that, the acquisition modes for exchanging line number in batches are as follows:
According to each field type of data exchange operation and the corresponding Field Count of each field type, the every row of data exchange operation is calculated
The data volume of data；
According to the data volume and message transmission rate, the time-consuming of data exchange operation each row of data is determined；
According to the time-consuming of batch dispatching cycle and each row of data determined, calculating exchanges line number in batches.
5. according to the method described in claim 2, it is characterized in that, the method also includes:
After completing to the data exchange of the target data rows, the exchange line number of the quasi- schedule job is updated, and is recorded
Swap time used in the target data rows；
According to the data volume of the target data rows and the swap time, the swapping rows in batches of the quasi- schedule job are updated
Number.
6. according to the method described in claim 2, it is characterized in that, determining whether data exchange operation is the side for criticizing schedule job
Formula is as follows:
When data exchange operation is periodic scheduling operation, determine that data exchange operation entirety needed for each dispatching cycle is handed over
Change the time；Calculate the time difference of the whole swap time and described batch of dispatching cycle；If the time difference is less than preset value, really
Fixed number is batch schedule job according to exchanging operation；Otherwise, it determines data exchange operation is not batch schedule job；
When data exchange operation is disposable operation, determine that data exchange operation is batch schedule job.
7. described in any item methods according to claim 1~6, which is characterized in that the method also includes:
The data exchange job information that control node is sent is received, the data exchange job information includes that target data exchange is made
Industry and the corresponding target priority grade of target data exchanging operation and target creation time；
According to the target priority grade, the target data exchanging operation is distributed to object queue；
Record the target priority grade and the target creation time.
8. the method according to the description of claim 7 is characterized in that described according to the target priority grade, by the mesh
Mark data exchange operation is distributed to object queue, including；
The job queue with the target priority ratings match is searched, matching queue is denoted as；
If the operation quantity in presently described matching queue is not up to preset upper limit value, the matching queue is determined as target
Queue；Otherwise, competition queue is determined as object queue；
The target data exchanging operation is distributed to determining object queue.
9. according to the method described in claim 8, it is characterized in that, with the target priority ratings match, comprising:
Target priority grade priority level corresponding with queue is equal；Alternatively,
The target priority grade belongs to the corresponding priority level range of queue.
10. a kind of dispatching device of data exchange operation, which is characterized in that be applied to working node, the working node includes
Multiple job queues, described device include:
First determining module is needing schedule job if being the job queue for corresponding to assigned priority grade for current queue
When, according to the priority level and creation time of data exchange operation each in current queue, determine working as each data exchange operation
Preceding scheduling information；
First searching module, for searching the maximum data exchange operation of current schedule information from current queue, as this
Schedule job；
First scheduler module, for being scheduled to this schedule job, to use the corresponding exclusive process resource of current queue
This schedule job is handled.
11. a kind of node device, which is characterized in that executable instruction including processor and for storing the processor
Memory；
The processor is configured to:
If current queue is the job queue of corresponding assigned priority grade, when needing schedule job, according in current queue
The priority level and creation time of each data exchange operation determine the current schedule information of each data exchange operation；
The maximum data exchange operation of current schedule information is searched from current queue, as this schedule job；
This schedule job is scheduled, to use the corresponding exclusive process resource of current queue to carry out this schedule job
Processing.
12. a kind of sending method of data exchange operation, which is characterized in that be applied to control node, which comprises
Obtain the priority level and creation time of data exchange operation to be sent；
Data exchange job information is sent to assigned work node, the data exchange job information includes the number to be sent
According to exchanging operation, the priority level and the creation time.
13. a kind of sending device of data exchange operation, which is characterized in that be applied to control node, described device includes:
Module is obtained, for obtaining the priority level and creation time of data exchange operation to be sent；
Sending module, for sending data exchange job information to assigned work node, the data exchange job information includes
The data exchange operation to be sent, the priority level and the creation time.
14. a kind of node device, which is characterized in that executable instruction including processor and for storing the processor
Memory；
The processor is configured to:
Obtain the priority level and creation time of data exchange operation to be sent；
Data exchange job information is sent to assigned work node, the data exchange job information includes the number to be sent
According to exchanging operation, the priority level and the creation time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910471611.7A CN110175073B (en) | 2019-05-31 | 2019-05-31 | Scheduling method, sending method, device and related equipment of data exchange job |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910471611.7A CN110175073B (en) | 2019-05-31 | 2019-05-31 | Scheduling method, sending method, device and related equipment of data exchange job |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110175073A true CN110175073A (en) | 2019-08-27 |
| CN110175073B CN110175073B (en) | 2022-05-31 |
Family
ID=67696907
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910471611.7A Active CN110175073B (en) | 2019-05-31 | 2019-05-31 | Scheduling method, sending method, device and related equipment of data exchange job |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110175073B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112181645A (en) * | 2020-09-21 | 2021-01-05 | 中国建设银行股份有限公司 | Resource scheduling method, device, equipment and storage medium |
| CN113835861A (en) * | 2021-09-24 | 2021-12-24 | 中汽创智科技有限公司 | Process scheduling method, device, equipment and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101446906A (en) * | 2008-12-31 | 2009-06-03 | 中国建设银行股份有限公司 | Dispatching method for multi-batch processing tasks and system thereof |
| CN104079502A (en) * | 2014-06-27 | 2014-10-01 | 国家计算机网络与信息安全管理中心 | Multi-user multi-queue scheduling method |
| CN105592110A (en) * | 2014-10-20 | 2016-05-18 | 中兴通讯股份有限公司 | Resource scheduling method and device |
| CN106126354A (en) * | 2016-06-21 | 2016-11-16 | 中国建设银行股份有限公司 | A kind of asynchronous batch processing method and system |
| US20170139745A1 (en) * | 2015-11-18 | 2017-05-18 | Sap Se | Scaling priority queue for task scheduling |
| CN108134851A (en) * | 2018-03-16 | 2018-06-08 | 浙江远算云计算有限公司 | The method for controlling quality of service and device of data transmission |
| CN109271236A (en) * | 2018-09-18 | 2019-01-25 | 郑州云海信息技术有限公司 | A kind of method, apparatus of traffic scheduling, computer storage medium and terminal |
-
2019
- 2019-05-31 CN CN201910471611.7A patent/CN110175073B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101446906A (en) * | 2008-12-31 | 2009-06-03 | 中国建设银行股份有限公司 | Dispatching method for multi-batch processing tasks and system thereof |
| CN104079502A (en) * | 2014-06-27 | 2014-10-01 | 国家计算机网络与信息安全管理中心 | Multi-user multi-queue scheduling method |
| CN105592110A (en) * | 2014-10-20 | 2016-05-18 | 中兴通讯股份有限公司 | Resource scheduling method and device |
| US20170139745A1 (en) * | 2015-11-18 | 2017-05-18 | Sap Se | Scaling priority queue for task scheduling |
| CN106126354A (en) * | 2016-06-21 | 2016-11-16 | 中国建设银行股份有限公司 | A kind of asynchronous batch processing method and system |
| CN108134851A (en) * | 2018-03-16 | 2018-06-08 | 浙江远算云计算有限公司 | The method for controlling quality of service and device of data transmission |
| CN109271236A (en) * | 2018-09-18 | 2019-01-25 | 郑州云海信息技术有限公司 | A kind of method, apparatus of traffic scheduling, computer storage medium and terminal |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112181645A (en) * | 2020-09-21 | 2021-01-05 | 中国建设银行股份有限公司 | Resource scheduling method, device, equipment and storage medium |
| CN113835861A (en) * | 2021-09-24 | 2021-12-24 | 中汽创智科技有限公司 | Process scheduling method, device, equipment and storage medium |
| CN113835861B (en) * | 2021-09-24 | 2024-05-24 | 中汽创智科技有限公司 | Process scheduling method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110175073B (en) | 2022-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bao et al. | Online job scheduling in distributed machine learning clusters | |
| JP4921727B2 (en) | Multiple planning session cooperation system using time constraint, method and product | |
| CN108694199A (en) | Data synchronization unit, method, storage medium and electronic equipment | |
| US8484061B2 (en) | Scheduling sessions of multi-speaker events | |
| CN104239956B (en) | On schedule preferential physical examination subscription services management method and system | |
| CN112508205A (en) | Method, device and system for scheduling federated learning | |
| US11475006B2 (en) | Query and change propagation scheduling for heterogeneous database systems | |
| US9218210B2 (en) | Distributed processing system | |
| CN109739890A (en) | Data processing method, device and equipment | |
| AU2016298207B2 (en) | Background job processing framework | |
| CN110175073A (en) | Dispatching method, sending method, device and the relevant device of data exchange operation | |
| CN110969362A (en) | Multi-target task scheduling method and system under cloud computing system | |
| CN107451853A (en) | Method, apparatus, system and the storage medium that a kind of red packet distributes in real time | |
| CN110377416A (en) | Distributed subregion method for scheduling task and device | |
| CN110764915A (en) | Optimization method for kubernetes main node selection | |
| CN110362391A (en) | Resource regulating method, device, electronic equipment and storage medium | |
| CN111179008B (en) | Information state updating method, device, system and storage medium | |
| CN113076186B (en) | Task processing method, device, electronic equipment and storage medium | |
| CN109871270A (en) | Scheduling scheme generation method and device | |
| Schaefers et al. | Distributed Monte Carlo Tree Search: A novel technique and its application to computer Go | |
| JP2012168756A (en) | Scheduling program, method and device | |
| US8108340B2 (en) | Search engine configured to minimize performance degradation under high load | |
| WO2012172588A1 (en) | Request allocation computer, request allocation method, and program | |
| CN110955524A (en) | Optimized scheduling method for server | |
| CN115660344A (en) | User scheduling method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |