CN109814987A - Task processing method, system, electronic equipment and computer-readable medium - Google Patents
Task processing method, system, electronic equipment and computer-readable medium Download PDFInfo
- Publication number
- CN109814987A CN109814987A CN201711163248.XA CN201711163248A CN109814987A CN 109814987 A CN109814987 A CN 109814987A CN 201711163248 A CN201711163248 A CN 201711163248A CN 109814987 A CN109814987 A CN 109814987A
- Authority
- CN
- China
- Prior art keywords
- task
- calculating
- queue
- user
- request
- 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
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Present disclose provides a kind of task processing methods, applied to distributed system, the method includes, obtain user's request, handle user's request, at least one task is obtained, and based on the user about multiple authority informations for calculating queue, determines the calculating queue for executing at least one task.In addition, the disclosure additionally provides a kind of distributed task scheduling processing system, electronic equipment and computer-readable medium.
Description
Technical field
This disclosure relates to Internet technical field, more particularly, to a kind of task processing method, system, electronic equipment
And computer-readable medium.
Background technique
The enterprise-level big data of mainstream is all building in distributed system at present, because of traditional database, minicomputer
TB, PB grades of data high speed storings, read-write, calculating are not accommodated.Distributed system controls computing resource using queue is calculated, each
Calculating queue has relevant resource allocation information.When handling user's request, each user is requested to decompose by distributed system
At several calculating tasks, each calculating task is assigned to different calculating queues and executes data calculating, it will be in different calculating
The calculated result of queue is summarized, and final result is obtained.
During realizing present inventive concept, at least there are the following problems in the prior art for inventor's discovery: when facing
When data pressure is big, concurrent tasks are more, often occur computing resource fight for, computing relay situations such as.How calculating money is ensured
Source priority processing important computations task is always to perplex one of the problem of big data enterprise.
Summary of the invention
In view of this, present disclose provides a kind of task processing method, system and electronic equipments.
An aspect of this disclosure provides a kind of task processing method, is applied to distributed system, the method includes,
User's request is obtained, user's request is handled, obtains at least one task, and based on the user about multiple calculating teams
The authority information of column determines the calculating queue for executing at least one task.
According to the embodiment of the present disclosure, the method also includes being obtained in distributed system starting or after starting
The user is loaded into the memory of the distributed system about multiple authority informations for calculating queue.
According to the embodiment of the present disclosure, user's request includes calculating queue request, executes described at least one for requesting
The calculating queue of a task, the authority informations based on the user about multiple calculating queues, determines described for executing
The calculating queue of at least one task includes, based on the user about multiple authority informations for calculating queue, judging the meter
Can queue request be calculated be satisfied, and in the case where the calculating queue request can be at least partly satisfied, be based on
The calculating queue request determines the calculating queue for executing at least one task.
According to the embodiment of the present disclosure, the method also includes in the calculating queue for executing at least one task
Quantity when being more than two, based on the weighted value for calculating queue, determine for executing at least one described task
The calculating queue of each task.
Another aspect of the disclosure provides a kind of distributed task scheduling processing system, including first obtains module, processing
Module and the first determining module.First obtains module, for obtaining user's request.Processing module, for handling the user
Request, obtains at least one task.First determining module, for being believed based on the user about multiple permissions for calculating queue
Breath determines the calculating queue for executing at least one task.
According to the embodiment of the present disclosure, the system also includes second to obtain module, for starting in the distributed system
When or starting after, obtain the user about multiple authority informations for calculating queues, and be loaded into the distributed system
In memory.
According to the embodiment of the present disclosure, user's request includes calculating queue request, executes described at least one for requesting
The calculating queue of a task, first determining module include judging submodule and determining submodule.Judging submodule is used for base
In the user about multiple authority informations for calculating queue, judge that can the calculating queue request be satisfied.Determine submodule
Block, for being based on the calculating queue request, really in the case where the calculating queue request can be at least partly satisfied
Determine the calculating queue for executing at least one task.
According to the embodiment of the present disclosure, the system also includes the second determining modules, for for executing described at least one
When the quantity of the calculating queue of a task is more than two, based on the weighted value for calculating queue, determine described for executing
The calculating queue of each task at least one task.
Another aspect of the present disclosure provides a kind of electronic equipment, including, one or more processors；And storage dress
It sets, for storing one or more programs, wherein when one or more of programs are executed by one or more of processors
When, so that the method that one or more of processors execute above-mentioned any one.
Another aspect of the present disclosure provides a kind of computer-readable medium, is stored thereon with executable instruction, the finger
Processor is set to execute above-mentioned any one method when order is executed by processor.
Another aspect of the present disclosure provides a kind of computer program, and the computer program, which includes that computer is executable, to be referred to
It enables, described instruction is when executed for realizing method as described above.
In accordance with an embodiment of the present disclosure, it can at least partly alleviate facing that data pressure is big, the feelings more than concurrent tasks
Under condition, occur computing resource fight for, computing relay situations such as, can ensure computing resource priority processing important computations task.
Detailed description of the invention
By referring to the drawings to the description of the embodiment of the present disclosure, the above-mentioned and other purposes of the disclosure, feature and
Advantage will be apparent from, in the accompanying drawings:
Fig. 1 diagrammatically illustrates the system tray according to the task processing method of the embodiment of the present disclosure, system and electronic equipment
Structure；
Fig. 2 diagrammatically illustrates the flow chart of the task processing method according to the embodiment of the present disclosure；
Fig. 3 diagrammatically illustrates the flow chart of the task processing method according to another embodiment of the disclosure；
Fig. 4 is diagrammatically illustrated according to the embodiment of the present disclosure based on the user about multiple permission letters for calculating queue
Breath determines the flow chart of the calculating queue for executing at least one task；
Fig. 5 diagrammatically illustrates the flow chart of the task processing method according to another embodiment of the disclosure；
Fig. 6 diagrammatically illustrates the block diagram of the distributed task scheduling processing system according to the embodiment of the present disclosure；
Fig. 7 diagrammatically illustrates the block diagram of the distributed task scheduling processing system according to another embodiment of the disclosure；
Fig. 8 diagrammatically illustrates the block diagram of the first determining module according to the embodiment of the present disclosure；
Fig. 9 diagrammatically illustrates the block diagram of the distributed task scheduling processing system according to another embodiment of the disclosure；And
Figure 10 diagrammatically illustrates the block diagram of the electronic equipment according to the embodiment of the present disclosure.
Specific embodiment
Hereinafter, will be described with reference to the accompanying drawings embodiment of the disclosure.However, it should be understood that these descriptions are only exemplary
, and it is not intended to limit the scope of the present disclosure.In addition, in the following description, descriptions of well-known structures and technologies are omitted, with
Avoid unnecessarily obscuring the concept of the disclosure.
Term as used herein is not intended to limit the disclosure just for the sake of description specific embodiment.It uses herein
The terms "include", "comprise" etc. show the presence of the feature, step, operation and/or component, but it is not excluded that in the presence of
Or add other one or more features, step, operation or component.
There are all terms (including technical and scientific term) as used herein those skilled in the art to be generally understood
Meaning, unless otherwise defined.It should be noted that term used herein should be interpreted that with consistent with the context of this specification
Meaning, without that should be explained with idealization or excessively mechanical mode.
It, in general should be according to this using statement as " at least one in A, B and C etc. " is similar to
Field technical staff is generally understood the meaning of the statement to make an explanation (for example, " system at least one in A, B and C "
Should include but is not limited to individually with A, individually with B, individually with C, with A and B, with A and C, have B and C, and/or
System etc. with A, B, C).Using statement as " at least one in A, B or C etc. " is similar to, generally come
Saying be generally understood the meaning of the statement according to those skilled in the art to make an explanation (for example, " having in A, B or C at least
One system " should include but is not limited to individually with A, individually with B, individually with C, with A and B, have A and C, have
B and C, and/or the system with A, B, C etc.).It should also be understood by those skilled in the art that substantially arbitrarily indicating two or more
The adversative conjunction and/or phrase of optional project shall be construed as either in specification, claims or attached drawing
A possibility that giving including one of these projects, either one or two projects of these projects.For example, phrase " A or B " should
A possibility that being understood to include " A " or " B " or " A and B ".
Embodiment of the disclosure provides a kind of task processing method, is believed by user about multiple permissions for calculating queue
Breath management computing resource, can ensure that important computations task can prioritize processing.
Fig. 1 diagrammatically illustrate according to the embodiment of the present disclosure can be with application task processing method, system and electronic equipment
Distributed system 100.It should be noted that be only the example that can apply the system architecture of the embodiment of the present disclosure shown in Fig. 1,
To help skilled in the art to understand the technology contents of the disclosure, but it is not meant to that the embodiment of the present disclosure may not be usable for it
His equipment, system, environment or scene.
As shown in Figure 1, distributed system 100 may include multiple nodes 110 and network according to this embodiment.Network is used
To provide the medium of communication link between multiple nodes 110.Network may include various connection types, such as wired, wireless
Communication link or fiber optic cables etc..
User can be used node 110 and be interacted by network with other nodes in distributed system 100, such as sending makes
Distributed system 100 handles user's request of various tasks.The resource shape that distributed system 100 passes through each calculate node of integration
At distributed Installed System Memory 120, distributed system 100 can obtain slow in the task of processing directly from distributed memory 120
The data deposited.Distributed system 100 also safeguards that multiple calculating queues 130, each calculating queue 130 have relevant resource distribution
Information, such as distribution least resource number, distribution maximum resource number, the maximum quantity for the application program that can be run etc..Distribution system
System 100 controls computing resource by multiple calculating queues 130, so that each task works in an orderly manner.According to the embodiment of the present disclosure,
Each user be can store in distributed system memory 120 about multiple authority informations for calculating queue 130.The disclosure is implemented
The method of example ensures that important computations task can prioritize processing by the managing authority information computing resource.
It should be noted that task processing method provided by the embodiment of the present disclosure generally can be by distributed system 100
It executes.Correspondingly, task processing system provided by the embodiment of the present disclosure generally can be set in distributed system 100.
It should be understood that the number of node, network and calculating queue in Fig. 1 is only schematical.According to realize needs,
It can have any number of node, network and calculate queue.
Fig. 2 diagrammatically illustrates the flow chart of the task processing method according to the embodiment of the present disclosure.
As shown in Fig. 2, this method includes operation S210~S230.
In operation S210, user's request is obtained.
In operation S220, user's request is handled, at least one task is obtained.
In operation S230, based on the user about multiple authority informations for calculating queues, determine for execute it is described extremely
The calculating queue of a few task.
For example, administrator is that different user is assigned with about multiple authority informations for calculating queue.It is proposed in a user
When request, which will be broken down into multiple tasks in a distributed system, and the method that the embodiment of the present disclosure provides can pass through
Authority information determines the calculating queue for executing those tasks.It calculates queue 1 for example, Zhang San possesses and calculates making for queue 2
With permission, when Zhang San proposes user's request, the calculating task decomposited will be executed by calculating queue 1 and calculating queue 2.
This method, about multiple managing authority information computing resources for calculating queue, can ensure important computations by user
Task can prioritize processing.
Traditional authorization administration information is stored in relevant database, such as MYSQL.The access request of all users, it is necessary to
Distributed system can be accessed by first passing through relevant database, for the big data system of enterprise's fairground mass data,
Efficiency is poor.Below with reference to Fig. 3, the task processing method of another embodiment of the disclosure is illustrated.
Fig. 3 diagrammatically illustrates the flow chart of the task processing method according to another embodiment of the disclosure.
As shown in figure 3, this method on the basis of previous embodiment, further includes operation S310.
The user is obtained about multiple calculating in distributed system starting or after starting in operation S310
The authority information of queue, and be loaded into the memory of the distributed system.
The distributed system of the embodiment of the present disclosure is by user and to calculate queue relationship, i.e. authority information, is loaded directly into
In the memory of distributed system.
For example, a container can be created in the memory of distributed system, such as Map container, using key (key), it is worth
(value) mode storing data allows to be worth by key lookup.Map structure of container is simple, extension is easy, and search efficiency
It is very high.It is the optimal selection for storing user and calculating queue authority relation.The calculating queue permission that user is possessed, with Map
Key (key) is worth in the mode storage container of (value), wherein can will for example calculate queue name and save as key, as looking into
The user of the calculating queue permission possessed is saved as value corresponding with key by the keyword of inquiry.
It can be emptied due to the characteristic of memory in system closedown according to the embodiment of the present disclosure, therefore, in every subsystem
When starting or after starting, the user is obtained about multiple authority informations for calculating queue, and is loaded into the distributed system
In the memory of system.In addition, since authority information may change, need to guarantee the authority information in memory be it is newest, because
This, background server needs to send newest authority information to distributed system, distributed system when changing the authority information
The user is obtained about multiple authority informations for calculating queue, and is loaded into the memory of the distributed system.
This method avoids the visit to relevant database by the way that authority information to be loaded into the memory of distributed system
It asks, improves search efficiency.
According to the embodiment of the present disclosure, user's request includes calculating queue request, executes described at least one for requesting
The calculating queue of a task.It is further illustrated below with reference to method of the Fig. 4 to the embodiment of the present disclosure.
Fig. 4 is diagrammatically illustrated according to the embodiment of the present disclosure based on the user about multiple permission letters for calculating queue
Breath determines the flow chart of the calculating queue for executing at least one task.
As shown in figure 4, this method includes operation S410 and S420.
Judge that the calculating queue is asked based on the user about multiple authority informations for calculating queue in operation S410
Can ask be satisfied.
In operation S420, in the case where the calculating queue request can be at least partly satisfied, based on described
Queue request is calculated, determines the calculating queue for executing at least one task.
For example, determining that Zhang San possesses by user about multiple authority informations for calculating queue and calculating queue 1 and calculating team
The access right of column 2.When Zhang San submits user to request, while requesting to execute by specific calculation queue and requesting to produce by the user
Raw task divides three kinds of situations to be illustrated below.
The first, can the calculating queue request be satisfied.For example, Zhang San's request is executed by calculating queue 1, that
, based on authority information, the calculating queue request can be satisfied, and can be held according to queue request is calculated using queue 1 is calculated
Row is requested generating for task by the user.It similarly, can if Zhang San requests to execute using calculating queue 1 and calculating queue 2
To request generating for task by the user using calculating queue 1 and calculating queue 2 to execute jointly according to queue request is calculated.
Second, can the calculating queue request partially be met.For example, Zhang San's request is by calculating queue 1 and meter
Queue 3 is calculated to execute, and Zhang San only possesses the access right for calculating queue 1, does not calculate the access right of queue 3, the calculating team
Column request is merely able to partially be met, and can be executed using calculating queue 1 based on queue request is calculated and request to generate by the user
Task.
The third, the calculating queue request cannot be satisfied.For example, Zhang San's request is executed by calculating queue 3, and open
Three do not calculate the access right of queue 3, and therefore, which cannot be satisfied.In such a case, it is possible to issue
Prompt information, alternatively, directly selecting based on the permission that Zhang San possesses and calculating queue 1 and calculating queue 2 execution jointly.
According to the embodiment of the present disclosure, such as wherein calculating queue 1 is the calculating queue that owner shares, and calculating queue 2 is
The dedicated calculating queue of Zhang San, Zhang San, which can specify, calculates the vital task that the processing of queue 2 needs priority processing.
This method allows a user to specify the calculating queue used, the case where user possesses permission to specified calculating queue
Under, the calculating queue specified according to user is handled, and improves the flexibility of system, and it is uniform to avoid all calculating queues
It takes or takes at random, and can not preferentially perform important duties.
Fig. 5 diagrammatically illustrates the flow chart of the task processing method according to another embodiment of the disclosure.
As shown in figure 5, further including operation S510 on the basis of the embodiment of this method meaning shown in Fig. 2.
In operation S510, when the quantity of the calculating queue for executing at least one task is more than two, base
In the weighted value for calculating queue, the calculating queue for executing each task at least one described task is determined.
According to the embodiment of the present disclosure calculating queue weighted value, for when calculate queue in have task dispatching when, according to
Weight distribution task.For example, existing simultaneously 2 calculating queues, calculating queue 1 and calculating queue 2, wherein calculate the power of queue 1
Weight values are 1, and the weighted value for calculating queue 2 is 2, when there is the task to be processed such as 30, can be allocated in the ratio of 1:2,
Amount to 10 tasks the result is that giving and calculating queue 1, give total 20 tasks of calculating queue 2.This method is based on calculating queue
Weighted value distribute task, improve the controllability of system.
Fig. 6 diagrammatically illustrates the block diagram of the distributed task scheduling processing system 600 according to the embodiment of the present disclosure.
As shown in fig. 6, distributed task scheduling processing system 600 includes first obtaining module 610, processing module 620 and the
One determining module 630.
First obtains module 610, such as executes the operation S210 described above with reference to Fig. 2, for obtaining user's request.
Processing module 620, such as the operation S220 described above with reference to Fig. 2 is executed, for handling user's request, obtain
Obtain at least one task.
First determining module 630, such as the operation S230 described above with reference to Fig. 2 is executed, for being closed based on the user
In multiple authority informations for calculating queue, the calculating queue for executing at least one task is determined.
Fig. 7 diagrammatically illustrates the block diagram of the distributed task scheduling processing system 700 according to another embodiment of the disclosure.
As shown in fig. 7, distributed task scheduling processing system 700 on the basis of previous embodiment, further includes the second acquisition mould
Block 710.
Second obtains module 710, such as executes the operation S310 described above with reference to Fig. 3, in the distributed system
When system starting or after starting, the user is obtained about multiple authority informations for calculating queue, and be loaded into the distribution
In the memory of system
Fig. 8 diagrammatically illustrates the block diagram of the first determining module 630 according to the embodiment of the present disclosure.
User's request includes calculating queue request, for requesting the calculating queue of execution at least one task.
As shown in figure 8, the first determining module 630 includes judging submodule 810 and determining submodule 820.
Judging submodule 810, such as execute the operation S410 that describe above with reference to Fig. 4, for be based on the user about
Multiple authority informations for calculating queue, judge that can the calculating queue request be satisfied.
It determines submodule 820, such as executes the operation S420 described above with reference to Fig. 4, for being asked in the calculating queue
Ask in the case where capable of being at least partly satisfied, be based on the calculating queue request, determine for execute it is described at least one
The calculating queue of task.
Fig. 9 diagrammatically illustrates the block diagram of the distributed task scheduling processing system 900 according to another embodiment of the disclosure.
As shown in figure 9, distributed task scheduling processing system 900 further includes on the basis of distributed task scheduling processing system 600
Second determining module 910.
Second determining module 910, such as the operation S510 described above with reference to Fig. 5 is executed, for described for executing
When the quantity of the calculating queue of at least one task is more than two, based on the weighted value for calculating queue, determine for holding
The calculating queue of each task at least one described task of row.
It is understood that above-mentioned module may be incorporated in a module and realize or any one module therein
Multiple modules can be split into.Alternatively, at least partly function of one or more modules in these modules can be with other
At least partly function of module combines, and realizes in a module.According to an embodiment of the invention, in above-mentioned module extremely
Few one can at least be implemented partly as hardware circuit, such as field programmable gate array (FPGA), programmable logic battle array
(PLA), system on chip, the system on substrate, the system in encapsulation, specific integrated circuit (ASIC) are arranged, or can be to circuit
The hardware such as any other rational method that is integrated or encapsulating or firmware are carried out to realize, or with software, hardware and firmware three
The appropriately combined of kind of implementation is realized.Alternatively, at least one of above-mentioned module can at least be implemented partly as counting
Calculation machine program module can execute the function of corresponding module when the program is run by computer.
Figure 10 diagrammatically illustrates the block diagram of the electronic equipment according to the embodiment of the present disclosure.Department of computer science shown in Figure 10
System is only an example, should not function to the embodiment of the present disclosure and use scope bring any restrictions.
It as shown in Figure 10, include processor 1001 according to the computer system of the embodiment of the present disclosure 1000, it can basis
The program that is stored in read-only memory (ROM) 1002 is loaded into random access storage device (RAM) from storage section 1008
Program in 1003 and execute various movements appropriate and processing.Processor 1001 for example may include general purpose microprocessor (example
Such as CPU), instruction set processor and/or related chip group and/or special microprocessor (for example, specific integrated circuit (ASIC)),
Etc..Processor 1001 can also include the onboard storage device for caching purposes.Processor 1001 may include for executing
Single treatment unit with reference to the different movements of Fig. 2~Fig. 5 method flow according to the embodiment of the present disclosure described is either more
A processing unit.
In RAM 1003, it is stored with system 1000 and operates required various programs and data.Processor 1001,
ROM1002 and RAM 1003 is connected with each other by bus 1004.Processor 1001 is by executing ROM 1002 and/or RAM
Program in 1003 executes the various operations above with reference to Fig. 2~Fig. 5 method according to the embodiment of the present disclosure described.It needs
Note that described program also can store in one or more memories in addition to ROM 1002 and RAM 1003.Processor
1001 can also be retouched to execute above with reference to Fig. 2~Fig. 5 by executing the program being stored in one or more of memories
The various operations for the method according to the embodiment of the present disclosure stated.
In accordance with an embodiment of the present disclosure, system 1000 can also include input/output (I/O) interface 1005, input/output
(I/O) interface 1005 is also connected to bus 1004.System 1000 can also include being connected in lower component of I/O interface 1005
It is one or more: the importation 1006 including keyboard, mouse etc.；Including such as cathode-ray tube (CRT), liquid crystal display
And the output par, c 1007 of loudspeaker etc. (LCD) etc.；Storage section 1008 including hard disk etc.；And including such as LAN card,
The communications portion 1009 of the network interface card of modem etc..Communications portion 1009 executes logical via the network of such as internet
Letter processing.Driver 1010 is also connected to I/O interface 1005 as needed.Detachable media 1011, such as disk, CD, magnetic
CD, semiconductor memory etc. are mounted on as needed on driver 1010, in order to from the computer program read thereon
It is mounted into storage section 1008 as needed.
In accordance with an embodiment of the present disclosure, it may be implemented as computer software journey above with reference to the method for flow chart description
Sequence.For example, embodiment of the disclosure includes a kind of computer program product comprising carry meter on a computer-readable medium
Calculation machine program, the computer program include the program code for method shown in execution flow chart.In such embodiments,
The computer program can be downloaded and installed from network by communications portion 1009, and/or from 1011 quilt of detachable media
Installation.When the computer program is executed by processor 1001, the above-mentioned function of limiting in the system of the embodiment of the present disclosure is executed.
In accordance with an embodiment of the present disclosure, system as described above, unit, module, unit etc. can pass through computer program module
To realize.
It should be noted that computer-readable medium shown in the disclosure can be computer-readable signal media or meter
Calculation machine readable storage medium storing program for executing either the two any combination.Computer readable storage medium for example can be --- but not
Be limited to --- electricity, magnetic, optical, electromagnetic, infrared ray or semiconductor system, device or device, or any above combination.Meter
The more specific example of calculation machine readable storage medium storing program for executing can include but is not limited to: have the electrical connection, just of one or more conducting wires
Taking formula computer disk, hard disk, random access storage device (RAM), read-only memory (ROM), erasable type may be programmed read-only storage
Device (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.In the disclosure, computer readable storage medium can be it is any include or storage journey
The tangible medium of sequence, the program can be commanded execution system, device or device use or in connection.And at this
In open, computer-readable signal media may include in a base band or as the data-signal that carrier wave a part is propagated,
Wherein carry computer-readable program code.The data-signal of this propagation can take various forms, including but unlimited
In electromagnetic signal, optical signal or above-mentioned any appropriate combination.Computer-readable signal media can also be that computer can
Any computer-readable medium other than storage medium is read, which can send, propagates or transmit and be used for
By the use of instruction execution system, device or device or program in connection.Include on computer-readable medium
Program code can transmit with any suitable medium, including but not limited to: wireless, electric wire, optical cable, RF etc. are above-mentioned
Any appropriate combination.In accordance with an embodiment of the present disclosure, computer-readable medium may include above-described ROM 1002
And/or one or more memories other than RAM 1003 and/or ROM 1002 and RAM 1003.
Flow chart and block diagram in attached drawing are illustrated according to the system of the various embodiments of the disclosure, method and computer journey
The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation
A part of one module, program segment or code of table, a part of above-mentioned module, program segment or code include one or more
Executable instruction for implementing the specified logical function.It should also be noted that in some implementations as replacements, institute in box
The function of mark can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are practical
On can be basically executed in parallel, they can also be executed in the opposite order sometimes, and this depends on the function involved.Also it wants
It is noted that the combination of each box in block diagram or flow chart and the box in block diagram or flow chart, can use and execute rule
The dedicated hardware based systems of fixed functions or operations is realized, or can use the group of specialized hardware and computer instruction
It closes to realize.
As on the other hand, the disclosure additionally provides a kind of computer-readable medium, which can be
Included in equipment described in above-described embodiment；It is also possible to individualism, and without in the supplying equipment.Above-mentioned calculating
Machine readable medium carries one or more program, when said one or multiple programs are executed by the equipment, makes
Obtain the various operations for the method according to the embodiment of the present disclosure that the equipment is executed with reference to Fig. 2~Fig. 5 description.
Embodiment of the disclosure is described above.But the purpose that these embodiments are merely to illustrate that, and
It is not intended to limit the scope of the present disclosure.Although respectively describing each embodiment above, but it is not intended that each reality
Use cannot be advantageously combined by applying the measure in example.The scope of the present disclosure is defined by the appended claims and the equivalents thereof.It does not take off
From the scope of the present disclosure, those skilled in the art can make a variety of alternatives and modifications, these alternatives and modifications should all fall in this
Within scope of disclosure.
Claims (10)
1. a kind of task processing method is applied to distributed system, which comprises
Obtain user's request；
User's request is handled, at least one task is obtained；And
Based on the user about multiple authority informations for calculating queue, the calculating for executing at least one task is determined
Queue.
2. according to the method described in claim 1, further include:
In distributed system starting or after starting, authority informations of the user about multiple calculating queues are obtained,
And it is loaded into the memory of the distributed system.
3. being executed according to the method described in claim 1, wherein, user's request includes calculating queue request for requesting
The calculating queue of at least one task, the authority informations based on the user about multiple calculating queues, determines and uses
Include: in the calculating queue for executing at least one task
Based on the user about multiple authority informations for calculating queue, judge that can the calculating queue request be satisfied；
In the case where the calculating queue request can be at least partly satisfied, it is based on the calculating queue request, is determined
For executing the calculating queue of at least one task.
4. according to the method described in claim 1, further include:
When the quantity of the calculating queue for executing at least one task is more than two, based on the calculating queue
Weighted value determines the calculating queue for executing each task at least one described task.
5. a kind of distributed task scheduling processing system, comprising:
First obtains module, for obtaining user's request；
Processing module obtains at least one task for handling user's request；And
First determining module, it is described for executing for, about multiple authority informations for calculating queue, being determined based on the user
The calculating queue of at least one task.
6. system according to claim 5, further includes:
Second obtains module, for obtaining the user about multiple meters in distributed system starting or after starting
The authority information of queue is calculated, and is loaded into the memory of the distributed system.
7. system according to claim 5, wherein user's request includes calculating queue request, is executed for requesting
The calculating queue of at least one task, first determining module include:
Judging submodule, for, about multiple authority informations for calculating queue, judging that the calculating queue is asked based on the user
Can ask be satisfied；
Submodule is determined, in the case where the calculating queue request can be at least partly satisfied, based on described
Queue request is calculated, determines the calculating queue for executing at least one task.
8. system according to claim 5, further includes:
Second determining module, for when the quantity of the calculating queue for executing at least one task is more than two,
Based on the weighted value for calculating queue, the calculating queue for executing each task at least one described task is determined.
9. a kind of electronic equipment, comprising:
One or more processors；And
Storage device, for storing one or more programs, wherein when one or more of programs are one or more of
When processor executes, so that one or more of processors execute any one method as described in Claims 1 to 4.
10. a kind of computer-readable medium is stored thereon with executable instruction, processor is made when described instruction is executed by processor
Execute any one method as described in Claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711163248.XA CN109814987A (en) | 2017-11-20 | 2017-11-20 | Task processing method, system, electronic equipment and computer-readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711163248.XA CN109814987A (en) | 2017-11-20 | 2017-11-20 | Task processing method, system, electronic equipment and computer-readable medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109814987A true CN109814987A (en) | 2019-05-28 |
Family
ID=66598863
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711163248.XA Pending CN109814987A (en) | 2017-11-20 | 2017-11-20 | Task processing method, system, electronic equipment and computer-readable medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109814987A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110347602A (en) * | 2019-07-11 | 2019-10-18 | 中国工商银行股份有限公司 | Multitask script execution and device, electronic equipment and readable storage medium storing program for executing |
| CN111507257A (en) * | 2020-04-16 | 2020-08-07 | 奇安信科技集团股份有限公司 | Picture processing method, apparatus, system, medium, and program |
| CN111586165A (en) * | 2020-05-06 | 2020-08-25 | 珠海格力智能装备有限公司 | Control method of mobile device, control terminal, storage medium and processor |
| CN111782626A (en) * | 2020-08-14 | 2020-10-16 | 工银科技有限公司 | Task allocation method and device, distributed system, electronic device and medium |
| CN112764892A (en) * | 2019-10-21 | 2021-05-07 | 伊姆西Ip控股有限责任公司 | Method, apparatus and computer program product for managing processes |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101860024A (en) * | 2010-05-13 | 2010-10-13 | 云南电力调度中心 | Implementation method for integrating provincial dispatch organization PAS system and local-level dispatch organization PAS systems in electric power system |
| CN102222213A (en) * | 2010-07-29 | 2011-10-19 | 郑文明 | Distributed vision computing method based on open type Web Service framework |
| CN102307233A (en) * | 2011-08-24 | 2012-01-04 | 无锡中科方德软件有限公司 | Cloud computing method for cloud computing server |
| CN103617062A (en) * | 2013-12-05 | 2014-03-05 | 山东大学 | Flexible dynamic deployment system and method for render cluster |
| CN103701801A (en) * | 2013-12-26 | 2014-04-02 | 四川九洲电器集团有限责任公司 | Resource access control method |
| CN106445675A (en) * | 2016-10-20 | 2017-02-22 | 焦点科技股份有限公司 | B2B platform distributed application scheduling and resource allocation method |
-
2017
- 2017-11-20 CN CN201711163248.XA patent/CN109814987A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101860024A (en) * | 2010-05-13 | 2010-10-13 | 云南电力调度中心 | Implementation method for integrating provincial dispatch organization PAS system and local-level dispatch organization PAS systems in electric power system |
| CN102222213A (en) * | 2010-07-29 | 2011-10-19 | 郑文明 | Distributed vision computing method based on open type Web Service framework |
| CN102307233A (en) * | 2011-08-24 | 2012-01-04 | 无锡中科方德软件有限公司 | Cloud computing method for cloud computing server |
| CN103617062A (en) * | 2013-12-05 | 2014-03-05 | 山东大学 | Flexible dynamic deployment system and method for render cluster |
| CN103701801A (en) * | 2013-12-26 | 2014-04-02 | 四川九洲电器集团有限责任公司 | Resource access control method |
| CN106445675A (en) * | 2016-10-20 | 2017-02-22 | 焦点科技股份有限公司 | B2B platform distributed application scheduling and resource allocation method |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110347602A (en) * | 2019-07-11 | 2019-10-18 | 中国工商银行股份有限公司 | Multitask script execution and device, electronic equipment and readable storage medium storing program for executing |
| CN112764892A (en) * | 2019-10-21 | 2021-05-07 | 伊姆西Ip控股有限责任公司 | Method, apparatus and computer program product for managing processes |
| CN111507257A (en) * | 2020-04-16 | 2020-08-07 | 奇安信科技集团股份有限公司 | Picture processing method, apparatus, system, medium, and program |
| CN111507257B (en) * | 2020-04-16 | 2023-09-08 | 奇安信科技集团股份有限公司 | Picture processing method, device, system, medium and program |
| CN111586165A (en) * | 2020-05-06 | 2020-08-25 | 珠海格力智能装备有限公司 | Control method of mobile device, control terminal, storage medium and processor |
| CN111782626A (en) * | 2020-08-14 | 2020-10-16 | 工银科技有限公司 | Task allocation method and device, distributed system, electronic device and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109814987A (en) | Task processing method, system, electronic equipment and computer-readable medium | |
| US20220084085A1 (en) | Parcelled Quantum Resources | |
| CN110096344A (en) | Task management method, system, server cluster and computer-readable medium | |
| US9277003B2 (en) | Automated cloud workload management in a map-reduce environment | |
| US9886306B2 (en) | Cross-platform scheduling with long-term fairness and platform-specific optimization | |
| US9417903B2 (en) | Storage management for a cluster of integrated computing systems comprising integrated resource infrastructure using storage resource agents and synchronized inter-system storage priority map | |
| US20170256017A1 (en) | Graphics processing unit resource sharing | |
| CN109075988B (en) | Task scheduling and resource issuing system and method | |
| US9875139B2 (en) | Graphics processing unit controller, host system, and methods | |
| US10320701B1 (en) | Aggregating resource requests | |
| CN110442608A (en) | Information processing method, device, electronic equipment, medium and system | |
| CN109766708A (en) | Access method, system, computer system and the storage medium of data resource | |
| EP3867829A1 (en) | Parcelled quantum resources | |
| US20210311798A1 (en) | Dynamic microservices allocation mechanism | |
| Ruiz-Alvarez et al. | Toward optimal resource provisioning for cloud mapreduce and hybrid cloud applications | |
| Yang et al. | PK-OMLP: An OMLP based k-exclusion real-time locking protocol for multi-GPU sharing under partitioned scheduling | |
| CN107003947A (en) | Produce for sharing the approximate using measurement of cache memory system | |
| CN109947861A (en) | The method, apparatus and computer-readable medium of object table are generated for data warehouse | |
| US10303631B2 (en) | Self-moderating bus arbitration architecture | |
| CN110716809A (en) | Method and device for scheduling cloud resources | |
| CN109684059A (en) | Method and device for monitoring data | |
| CN113703945B (en) | Micro service cluster scheduling method, device, equipment and storage medium | |
| CN109685472A (en) | A kind of electronic signature method, device, electronic equipment and medium | |
| Heinz et al. | On-chip and distributed dynamic parallelism for task-based hardware accelerators | |
| US20220035816A1 (en) | Prioritization and optimization of database workloads |
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: 20190528 |