CN110688222A - Resource processing request ordering method, device, medium and electronic equipment - Google Patents

Resource processing request ordering method, device, medium and electronic equipment Download PDF

Info

Publication number
CN110688222A
CN110688222A CN201910853974.7A CN201910853974A CN110688222A CN 110688222 A CN110688222 A CN 110688222A CN 201910853974 A CN201910853974 A CN 201910853974A CN 110688222 A CN110688222 A CN 110688222A
Authority
CN
China
Prior art keywords
resource processing
processing request
score
resource
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.)
Granted
Application number
CN201910853974.7A
Other languages
Chinese (zh)
Other versions
CN110688222B (en
Inventor
尹业球
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ping An Securities Co Ltd
Original Assignee
Ping An Securities Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ping An Securities Co Ltd filed Critical Ping An Securities Co Ltd
Priority to CN201910853974.7A priority Critical patent/CN110688222B/en
Publication of CN110688222A publication Critical patent/CN110688222A/en
Application granted granted Critical
Publication of CN110688222B publication Critical patent/CN110688222B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/5038Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00Indexing scheme relating to G06F9/00
    • G06F2209/50Indexing scheme relating to G06F9/50
    • G06F2209/5021Priority

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The disclosure relates to the field of intelligent decision making, and discloses a resource processing request ordering method, a resource processing request ordering device, a resource processing request ordering medium and electronic equipment. The method comprises the following steps: when a resource processing request is received, determining a first score based on the type of the resource processing request and the corresponding relation between the type of the resource processing request and a predetermined score; determining a second score which is in negative correlation with the appointed processing deadline based on the appointed processing deadline of the resource processing request; determining a third score based on the amount of resources requested for the resource processing; calculating a fourth score of the resource processing request by using a formula according to the first score, the second score and the third score determined for the resource processing request; and adding the resource processing requests into a resource processing request queue, and sequencing the resource processing requests according to the fourth fraction of the resource processing requests. Under the method, the automatic sequencing of the resource processing requests is realized, the sequencing efficiency of the resource processing requests is improved, the sequencing cost of the resource processing requests is reduced, and the sequencing reasonability is improved.

Description

Resource processing request ordering method, device, medium and electronic equipment
Technical Field
The present disclosure relates to the field of intelligent decision making technologies, and in particular, to a method, an apparatus, a medium, and an electronic device for ordering resource processing requests.
Background
Currently, after receiving a plurality of resource processing requests, a server needs to sequence the plurality of resource processing requests to preferentially execute relatively important resource processing requests or resource processing requests that must be executed before a set time.
However, in the prior art, a plurality of resource processing requests are generally ordered manually by depending on personal experience, so that the ordering efficiency is low, and the labor cost is high.
Disclosure of Invention
In the technical field of intelligent decision-making, in order to solve the above technical problems, an object of the present disclosure is to provide a method, an apparatus, a medium, and an electronic device for ordering resource processing requests.
According to an aspect of the present application, there is provided a method for ordering resource processing requests, the method including:
when a resource processing request is received, determining a first score of the resource processing request based on the type of the resource processing request and a preset corresponding relation between the type of the resource processing request and a preset score;
determining a second fraction of the resource processing request which is in a negative correlation relation with the appointed processing deadline based on the appointed processing deadline of the resource processing request, wherein the second fraction is greater than or equal to 1;
determining a third score for the resource processing request based on the amount of resources of the resource processing request;
calculating a fourth fraction of the resource processing request according to the first fraction, the second fraction and the third fraction determined for the resource processing request by using the following formula:
D=(A+0.5*log10C)B
wherein A is the first score, B is the second score, C is the third score, and D is the fourth score;
and adding the resource processing request into a resource processing request queue, and sequencing the resource processing request according to the fourth fraction of the resource processing request.
According to another aspect of the present application, there is provided an apparatus for ordering resource processing requests, the apparatus including:
the first score determining module is configured to determine a first score of the resource processing request based on the type of the resource processing request and a preset corresponding relation between the type of the resource processing request and a preset score when the resource processing request is received;
a second score determining module configured to determine a second score of the resource processing request having a negative correlation with the agreed processing deadline based on the agreed processing deadline of the resource processing request, wherein the second score is greater than or equal to 1;
a third score determination module configured to determine a third score for the resource processing request based on the amount of resources of the resource processing request;
a fourth score determining module configured to calculate a fourth score of the resource processing request according to the first score, the second score and the third score determined for the resource processing request by using the following formula:
D=(A+0.5*log10C)B
wherein A is the first score, B is the second score, C is the third score, and D is the fourth score;
and the sequencing module is configured to add the resource processing request to a resource processing request queue and sequence the resource processing request according to the fourth fraction of the resource processing request.
According to another aspect of the present application, there is provided a computer readable program medium storing computer program instructions which, when executed by a computer, cause the computer to perform the method as previously described.
According to another aspect of the present application, there is provided an electronic device including:
a processor;
a memory having computer readable instructions stored thereon which, when executed by the processor, implement the method as previously described.
The technical scheme provided by the embodiment of the invention can have the following beneficial effects:
the resource processing request ordering method provided by the invention comprises the following steps: when a resource processing request is received, determining a first score of the resource processing request based on the type of the resource processing request and a preset corresponding relation between the type of the resource processing request and a preset score; determining a second fraction of the resource processing request which is in a negative correlation relation with the appointed processing deadline based on the appointed processing deadline of the resource processing request, wherein the second fraction is greater than or equal to 1; determining a third score for the resource processing request based on the amount of resources of the resource processing request; calculating a fourth fraction of the resource processing request according to the first fraction, the second fraction and the third fraction determined for the resource processing request by using the following formula:
D=(A+0.5*log10C)B
wherein A is the first score, B is the second score, C is the third score, and D is the fourth score; and adding the resource processing request into a resource processing request queue, and sequencing the resource processing request according to the fourth fraction of the resource processing request.
According to the method, the scores are calculated by obtaining the attributes of the three dimensions of the resource processing request to obtain the three scores, then the three scores are calculated by using a formula to obtain the scores for sorting and are sorted according to the scores, so that the automatic sorting of the resource processing request is realized, the sorting efficiency of the resource processing request is improved, the sorting cost of the resource processing request is reduced, and meanwhile, the final scores for sorting are calculated based on the attributes of the three dimensions of the resource processing request, so that the sorting result of the resource processing request finally reflects the attributes of the three dimensions of the resource processing request at the same time, and the sorting rationality is improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention.
FIG. 1 is a schematic diagram illustrating an application scenario of a method for ordering resource processing requests according to an example embodiment;
FIG. 2 is a flow diagram illustrating a method for ordering resource processing requests in accordance with an exemplary embodiment;
FIG. 3 is a flowchart illustrating steps subsequent to step 250 of one embodiment in accordance with the corresponding embodiment shown in FIG. 2;
FIG. 4 is a flowchart illustrating details of step 260 according to one embodiment illustrated in the corresponding embodiment of FIG. 3;
FIG. 5 is a flowchart illustrating steps subsequent to step 250 of another embodiment shown in accordance with the corresponding embodiment of FIG. 2;
FIG. 6 is a block diagram illustrating an apparatus for ordering resource processing requests in accordance with an exemplary embodiment;
FIG. 7 is a block diagram illustrating an example of an electronic device implementing the method for ordering resource processing requests described above, according to an example embodiment;
fig. 8 is a computer-readable storage medium illustrating an implementation of the above-described method for ordering resource processing requests according to an example embodiment.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present invention. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the invention, as detailed in the appended claims.
Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities.
The present disclosure first provides a method for ordering resource processing requests. The resource processing request ordering method provided by the disclosure can be applied to the field of cloud computing or the field of finance. The resource handling request may be a network request based on various internet protocols, such as a request based on the HTTP/HTTPs protocol. A resource may be any form of object to be processed. By using the resource processing request sequencing method provided by the disclosure, the resource processing requests sent by each terminal or equipment can be automatically sequenced, and a series of beneficial effects of reducing the sequencing cost of the resource processing requests, improving the sequencing efficiency of the resource processing requests, enabling the sequencing of the resource processing requests to be more reasonable and the like can be generated.
The implementation terminal of the present disclosure may be any device having an operation and processing function, which may be connected to an external device for receiving or sending data, and specifically may be a portable mobile device, such as a smart phone, a tablet computer, a notebook computer, a pda (personal Digital assistant), etc., or may be a fixed device, such as a computer device, a field terminal, a desktop computer, a server, a workstation, etc., or may be a set of multiple devices, such as a physical infrastructure of cloud computing.
Preferably, the ring terminal of the present disclosure may be a physical infrastructure of a server or cloud computing.
Fig. 1 is a schematic diagram illustrating an application scenario of a method for ordering resource processing requests according to an exemplary embodiment. As shown in fig. 1, the resource processing system includes a server 110, a plurality of terminals 130 that establish communication links with the server, and a resource processing request queue 120, in this embodiment, the server 110 is an implementation terminal of the present disclosure, each terminal 130 may send a resource processing request to the server 110 through a communication link established with the server 110, and the server 110 may send the resource processing request received by the terminal to the resource processing request queue for queuing, and then the server 110 may obtain resource processing requests to be processed from the resource processing request queue according to the sequence of queuing of the resource processing requests in the resource processing request queue for processing, where the resource processing request queue 120 may be fixed outside the server 110 or may exist inside the server 110. It should be noted that, although in the embodiment of fig. 1, the implementation terminal of the present disclosure is a server, in other embodiments or application scenarios, the implementation terminal of the present disclosure may be set as various devices or terminals as described above according to needs, and the present disclosure is not limited in any way, and the scope of the present disclosure should not be limited in any way.
FIG. 2 is a flow diagram illustrating a method for ordering resource processing requests in accordance with an exemplary embodiment. In this embodiment, the method for ordering resource processing requests provided by the present disclosure may be executed by a server, as shown in fig. 2, and may include the following steps:
step 210, when a resource processing request is received, determining a first score of the resource processing request based on the type of the resource processing request and a preset corresponding relation between the type of the resource processing request and a preset score.
As previously described, the resource handling request may be a network request based on various internet protocols.
In one embodiment, the determining the first score of the resource processing request based on the type of the resource processing request and the preset corresponding relationship between the type of the resource processing request and the predetermined score when the resource processing request is received includes:
acquiring a specific field of the resource processing request at a preset position;
acquiring the type of the resource processing request by using a preset corresponding relation table of the specific field and the type;
and acquiring a first score of the resource processing request by using a preset corresponding relation table between the first score and the type.
The specific field may be the type itself or a character string corresponding to the type. In this embodiment, the preset specific field and type correspondence table includes both the type of the resource processing request and a preset correspondence between the type of the resource processing request and a predetermined score.
In one embodiment, the determining, when a resource processing request is received, a first score of the resource processing request based on the type of the resource processing request and a preset correspondence relationship between the type of the resource processing request and a predetermined score includes:
acquiring a specific field representing the type of the resource processing request at a preset position through the resource processing request;
and acquiring a first score of the resource processing request by using a preset corresponding relation table between the first score and the type.
In one embodiment, in the cloud computing field, the resource processing request is a cloud computing request, where the resource is a cloud computing task corresponding to a specific entity, the specific entity may be a company, a department of the company, a server or a computer, and may also be an abstract processing object, and the type of the resource processing request is a category to which the specific entity belongs.
The implementation terminal is a server cluster for cloud computing.
In one embodiment, in the field of cloud computing, a header of a cloud computing request includes a specific character string, a preset position of the specific character string includes a category corresponding to a specific entity, the category corresponding to the specific entity is obtained at the preset position of the specific character string of the header of the cloud computing request as a type of the cloud computing request, and a first score corresponding to the type of the cloud computing request is obtained by querying a preset correspondence table between the type of the cloud computing request and the first score.
For example, the specific entity may be a company, the type of the cloud computing request may include catering industry, financial industry, manufacturing industry, medical industry, education industry, and the like, and the preset correspondence table between the type of the cloud computing request and the first score may include a score corresponding to each industry.
In an embodiment, the specific entity is a specific network task, such as a task of downloading, uploading, accessing a web page, browsing a video, and the like, and the preset correspondence table between the cloud computing request type and the first score may include a score corresponding to each task.
In one embodiment, the first score corresponding to each cloud computing request type included in the preset cloud computing request type and first score correspondence table is set by an expert according to experience.
In one embodiment, in the financial field, the resource processing request is a fund transfer instruction, the processing is a fund transfer operation, the processing request is a transfer instruction, a field for identifying the fund transfer type is carried in the fund transfer instruction, the field for identifying the fund transfer type is obtained in the fund transfer instruction and is used as the type of the fund transfer instruction, and then a preset transfer instruction type and first score corresponding relation table is used for obtaining a first score corresponding to the type.
In one embodiment, a specific field included in the preset position of the resource processing request is a priority of the resource processing request, the priority of the resource processing request is firstly obtained at the preset position of the resource processing request as a type of the resource processing request, and then a first score of the resource processing request is determined based on a positive correlation with the priority. That is, the higher the priority of the resource handling request, the larger the resulting first score. For example, the priority of the resource processing request is a, where a is a positive integer, and a is larger, which means that the priority of the resource processing request is higher, the first score may be obtained by a formula of a ═ λ a, where a is the first score and λ is a positive number, so that the first score and the priority may have a positive correlation.
In this embodiment, the type of the resource processing request is a priority of the resource processing request, and the preset correspondence between the type of the resource processing request and the predetermined score is a positive correlation with the priority.
Step 220, determining a second fraction of the resource processing request which is in negative correlation with the appointed processing deadline based on the appointed processing deadline of the resource processing request, wherein the second fraction is greater than or equal to 1.
The agreed processing deadline is an agreement between a sender of the resource processing request and a processor of the resource processing request, is an agreed time limit for the processor of the resource processing request to process the resource processing request, and may be a time period or a date, and a format of the date may be various, for example, a format of a timestamp.
In one embodiment, a specific field at a preset position of the resource processing request is an agreed processing deadline of the resource processing request, and the specific field is extracted from the preset position of the resource processing request and used as the agreed processing deadline of the resource processing request; then converting the appointed processing deadline into a numerical type according to the format of the appointed processing deadline; the second score of the resource processing request is determined based on an inverse relationship with the converted committed processing deadline, such that the closer the committed processing deadline is, the larger the determined second score of the resource processing request is, and the farther the committed processing deadline is, the smaller the determined second score of the resource processing request is.
In this embodiment, the second score is in inverse proportion to the converted contract processing deadline, that is, the second score and the contract processing deadline are in a negative correlation.
In one embodiment, the agreed processing deadlines of all the resource processing requests to be processed are sorted according to the chronological order, the second score of the resource processing request ranked at the last bit is set as 1, the second score of the resource processing request ranked at the last bit is set as a first item, and the second score of each resource processing request is calculated by using an arithmetic progression from the first item in a reverse order of the sorting, wherein the arithmetic progression has a tolerance d, and d is greater than 0. This allows the second score to be obtained as the contract processing deadline approaches. For example, in the cloud computing field, as described above, the resource processing request may be a cloud computing request, and if the agreed processing deadline of the first cloud computing request is before the agreed processing deadline of the second cloud computing request, the second score of the second cloud computing request may be set to 1, and the second score of the first cloud computing request may be greater than the second score of the second cloud computing request by 1, that is, the second score of the first cloud computing request may be set to 2.
In this embodiment, the closer the contract processing deadline is, the larger the corresponding second score is, that is, the smaller the contract processing deadline is, the larger the second score is, so that the second score and the contract processing deadline are in a negative correlation relationship.
Step 230, determining a third fraction of the resource handling request based on the amount of resources of the resource handling request.
The resource amount is an index-type value associated with the resource processing request.
In one embodiment, the field of the preset position of the resource processing request records the resource amount of the resource processing request, and the field of the preset position of the resource processing request is obtained as the resource amount of the resource processing request and directly used as the third fraction of the resource processing request.
In one embodiment, in the financial field, the resource amount of the resource processing request is the amount of the fund transfer instruction, and the amount of the fund transfer instruction is obtained at the preset position of the resource processing request and is used as the third score of the fund transfer instruction.
In one embodiment, a field of a preset position of the resource processing request records a resource amount of the resource processing request, and the field of the preset position of the resource processing request is obtained as the resource amount of the resource processing request; and determining a third score corresponding to the acquired resource amount by inquiring a preset corresponding relation table of the resource amount interval and the third score according to the acquired resource amount.
In one embodiment, a field of a preset position of the resource processing request records a resource amount of the resource processing request, and the field of the preset position of the resource processing request is obtained as the resource amount of the resource processing request; a third fraction of resource processing requests is determined based on a proportional relationship to the amount of resources. This makes it possible to make the third fraction for resource handling requests with larger resource amounts larger, and the third fraction for resource handling requests with smaller resource amounts smaller.
In one embodiment, in the cloud computing field, the resource amount of the resource processing request is a calculated amount of the cloud computing request, and a third fraction of the cloud computing request may be calculated by using a formula C ═ β C, where C is the calculated amount of the cloud computing request, C is the third fraction of the cloud computing request, β is a preset calculation coefficient, and β > 0.
Step 240, calculating a fourth fraction of the resource processing request according to the first fraction, the second fraction and the third fraction determined for the resource processing request by using the following formula:
D=(A+0.5*log10C)B
wherein A is the first score, B is the second score, C is the third score, and D is the fourth score.
The above formula can be applied to a plurality of actual business scenarios, such as cloud computing or financial domain.
For example, in the financial field, the amount of the resource requested by the resource processing request may be equal to the third fraction determined for the resource processing request, and if the amount of a resource receiving instruction is 10000 yuan, and the first fraction of the resource receiving instruction is 3 and the second fraction is 2, the fourth fraction of the resource receiving instruction may be calculated as follows:
D=(3+0.5*log1010000)2
this may calculate a fourth score of 25 for the funds transfer instruction.
The first score reflects the type of the resource processing request and the resource processing requests with different types, the first score is different, for example, the type of the resource processing request can be the priority of the resource processing request, and the higher the priority of one resource processing request is, the higher the first score of the resource processing request is, so that the higher the fourth score is, the more preferential the resource processing request can be processed; the second score is determined based on the agreed processing deadline of the resource processing request, and reflects the time for allowing delayed processing after the resource processing request is received, and the later the agreed processing deadline of one resource processing request is, the smaller the calculated second score is, and the smaller the fourth score is, the later the resource processing request is processed; the third score is determined based on the resource amount of the resource processing request, and the resource amount and the processing time of the resource processing request are often in a positive correlation relationship, so that the third score can reflect the time required for processing the resource processing request, and the larger the resource amount of a resource processing request is, the larger the processing time of the resource processing request is, the higher the third score is, so that the higher the fourth score is, the more preferential the resource processing request can be processed.
Through the formula, the fourth score is obtained by comprehensively calculating the attributes of the three dimensions based on the resource processing request, and finally, when the resource processing request is sequenced, the sequencing result objectively reflects the combined action of the attributes of the three dimensions, so that the reasonable sequencing of the resource processing request is realized.
Step 250, adding the resource processing request into a resource processing request queue, and sequencing the resource processing request according to the fourth fraction of the resource processing request.
The resource processing request queue is a component for temporarily accommodating resource processing requests, and it is easy to understand that the resource processing request queue may be located inside the implementation terminal of the present disclosure, or may be fixed to an external database or terminal of the implementation terminal of the present disclosure.
In one embodiment, each resource processing request added to the resource processing request queue calculates a corresponding fourth fraction, and the sorting the resource processing requests according to the fourth fraction of the resource processing requests includes:
and sequencing all the resource processing requests in the resource processing request queue from large to small according to the fourth fraction.
The method has the advantages that the result of the resource processing request ordering is completely related to the fourth fraction of the resource processing requests, and the objectivity and the reasonability of the resource processing request ordering are improved.
In one embodiment, the adding the resource processing request to the resource processing request queue and sorting the resource processing requests according to the fourth fraction of the resource processing requests includes:
adding the resource processing request to a resource processing request queue;
acquiring a preset fourth-score sequencing interval, wherein the preset fourth-score sequencing interval is a plurality of intervals into which the space where the fourth score is located is divided according to the sequence of the fourth score from large to small, and the fourth score of each resource processing request existing in the resource processing request queue belongs to one fourth-score sequencing interval;
sequencing the resource processing requests added into the resource processing request queue according to the sequence of the fourth scores from large to small;
and randomly sequencing the resource processing requests belonging to the same fourth numerical sequencing interval in the sequenced resource processing requests.
Because the order of the resource processing requests is not completely in a positive correlation with the fourth fraction, and if the resource processing requests with similar fourth fractions are strictly sorted according to the fourth fractions, the resource processing requests are not completely reasonable.
In summary, according to the resource processing request ordering method shown in the embodiment corresponding to fig. 2, automatic ordering of the resource processing requests is achieved, the ordering efficiency of the resource processing requests is improved, and the ordering cost of the resource processing requests is reduced.
Fig. 3 is a flowchart illustrating steps subsequent to step 250 according to one embodiment illustrated in a corresponding embodiment of fig. 2.
As shown in fig. 3, the method comprises the following steps:
step 260, in response to receiving the request for modifying the fourth score, returning the page for modifying the fourth score to the sender of the request, so that the sender of the request can process the fourth score of the request through the page modification resource.
The page includes each resource processing request being queued by the resource processing request queue and a fourth score corresponding to each resource processing request.
The pages may be various types of pages that can interact with each other, such as Web pages, HTML5 pages, and dialog boxes.
In one embodiment, the fourth score of each resource processing request in the page, which is returned to the sender of the request and modifies the fourth score, is located in one locked form entry box, each locked form entry box corresponds to one unlocking control, the sender of the request unlocks the corresponding locked form entry box by triggering the unlocking control, and the fourth score of the resource processing request is modified by editing the fourth score in the unlocked form entry box.
In one embodiment, as shown with reference to FIG. 4, step 260 may include the steps of:
step 261, in response to receiving the request for modifying the fourth score, obtaining the authority of the sender of the request.
The permissions are a division of the administrative scope of the resource handling request.
In an embodiment, the local terminal stores an authority table of each sender sending a request to the local terminal, the authority table records an identifier of each party and a corresponding relationship of authority, the received request for modifying the fourth score carries the identifier of the sender of the request, and when the identifier is obtained, the authority of the sender of the request is obtained by querying the authority table.
Step 262, returning the page which is used for modifying the fourth score and contains the resource processing request satisfying the authority in the resource processing request queue to the sender of the request, so that the sender of the request modifies the fourth score of the resource processing request satisfying the authority in the resource processing request queue through the page.
When a resource processing request satisfies the authority, it indicates that the resource management request is within the management range of the sender of the request, so that the sender of the request can be allowed to modify the fourth score of the resource management request.
Step 270, receiving an instruction for modifying the fourth score by modifying the page of the fourth score, where the instruction includes the modified fourth score and a resource processing request corresponding to the modified fourth score.
In one embodiment, the page for modifying the fourth score is a Web page, and the instruction for modifying the fourth score is received in a form mode.
Step 280, re-ordering the resource processing requests in the resource processing request queue according to the resource processing request corresponding to the modified fourth score and the modified fourth score.
According to the resource processing request corresponding to the modified fourth fraction and the modified fourth fraction, it can be clarified which fourth fractions of the resource processing requests in the resource processing request queue are modified, and the resource processing requests and the corresponding modified fourth fractions can be reordered together with other resource processing requests and the corresponding modified fourth fractions.
In one embodiment, the resource processing requests in the resource processing request queue are sorted in the order from the fourth fraction or the modified fourth fraction of the resource processing requests from large to small.
In an embodiment, the modifying the resource processing request corresponding to the fourth fraction is an impact resource processing request, and the reordering the resource processing requests in the resource processing request queue according to the modified resource processing request corresponding to the fourth fraction and the modified fourth fraction includes: pre-sequencing the resource processing requests in the resource processing request queue according to the resource processing requests corresponding to the modified fourth scores and the modified fourth scores; acquiring resource processing requests, of which the ordering is affected by the resource processing request corresponding to the modified fourth fraction, from other resource processing requests except the resource processing request corresponding to the modified fourth fraction in a resource processing request queue after pre-ordering, as affected resource processing requests, wherein for each affected resource processing request, the resource processing request, of which the ordering of the affected resource processing request is affected in the resource processing request corresponding to the modified fourth fraction, is an affected resource processing request corresponding to the affected resource processing request; sending a reminding message to a sender of each affected resource processing request, so that the sender of the affected resource processing request determines whether to allow the affected resource processing request corresponding to the affected resource processing request to influence the sequencing of the affected resource processing request by modifying the fourth fraction according to the reminding message; aiming at each affected resource processing request, acquiring a final fourth score of the affected resource processing request according to a determination result of the reminding information by a sender of each affected resource processing request corresponding to the affected resource processing request; and sequencing the resource processing requests in the resource processing request queue according to the various influence resource processing requests and the corresponding final fourth fraction.
In an embodiment, the obtaining, for each affected resource processing request, a final fourth score of the affected resource processing request according to a determination result of the reminder information by a sender of each affected resource processing request corresponding to the affected resource processing request includes:
in each affected resource processing request corresponding to the affected resource processing request, a sender obtaining the corresponding affected resource processing request determines that the ordering of the affected resource processing request is not allowed to be affected, and the affected resource processing request is ordered to be the last affected resource processing request after pre-ordering;
and taking the maximum integer smaller than the acquired fourth fraction of the affected resource processing request as the final fourth fraction of the affected resource processing request.
The embodiment shown in fig. 3 has the advantages that when the ranking according to the fourth scores is not reasonable enough, by allowing the user to modify the fourth scores, the intervention of manual elements in the resource processing request ranking is realized, the reasonability and robustness of the ranking can be improved, and the user experience is improved.
Fig. 5 is a flow chart illustrating steps subsequent to step 250 of another embodiment shown in accordance with the corresponding embodiment of fig. 2. As shown in fig. 5, the following steps may be included:
step 260', a resource processing request is selected from the resource processing request queue, and the difference between the appointed processing deadline of the resource processing request and the current time is obtained.
In one embodiment, the committed processing deadline is first converted to the same format as the current time and the difference between the two is calculated.
Step 270', the sum of the predicted processing time of all resource processing requests queued before the resource processing request is obtained in the resource processing request queue.
In one embodiment, the resource processing request corresponds to a type, and obtaining a sum of predicted processing times of all resource processing requests queued before the resource processing request in the resource processing request queue includes: acquiring the ratio of the historical processing time of each type of resource processing request to the resource amount; acquiring the type and the resource amount of each resource processing request arranged before the resource processing request in the resource processing request queue; multiplying the resource amount of each resource processing request by the ratio of the historical processing time of the corresponding type of resource processing request to the resource amount to obtain the predicted processing time of each resource processing request; the sum of the acquired expected processing times of the resource processing requests is determined.
Step 280', if the difference is smaller than the sum, adjusting the fourth fraction of the resource processing requests, and reordering all resource processing requests in the resource processing request queue so that the difference is greater than or equal to the sum.
When the difference is smaller than the sum, it indicates that the resource processing request cannot be completed in the appointed processing deadline, and at this time, the resource processing request can be guaranteed to be completed in a proper time by adjusting the fourth fraction of the resource processing request.
The present disclosure also provides a device for ordering resource processing requests, and the following is an embodiment of the device of the present disclosure.
Fig. 6 is a block diagram illustrating an apparatus for ordering resource processing requests in accordance with an example embodiment. As shown in fig. 6, the apparatus 600 includes:
a first score determining module 610 configured to determine, when a resource processing request is received, a first score of the resource processing request based on a type of the resource processing request and a preset correspondence between the type of the resource processing request and a predetermined score;
a second score determining module 620 configured to determine a second score of the resource processing request having a negative correlation with the agreed processing deadline based on the agreed processing deadline of the resource processing request;
a third score determination module 630 configured to determine a third score for the resource processing request based on the amount of resources of the resource processing request;
a fourth score determining module 640, configured to calculate a fourth score of the resource processing request according to the first score, the second score and the third score determined for the resource processing request by using the following formula:
D=(A+0.5*log10C)B
wherein A is the first score, B is the second score, C is the third score, and D is the fourth score;
a sorting module 650 configured to add the resource processing request to a resource processing request queue and sort the resource processing request according to the fourth fraction of the resource processing request.
According to a third aspect of the present disclosure, there is also provided an electronic device capable of implementing the above method.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or program product. Thus, various aspects of the invention may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
An electronic device 700 according to this embodiment of the invention is described below with reference to fig. 7. The electronic device 700 shown in fig. 7 is only an example and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 7, electronic device 700 is embodied in the form of a general purpose computing device. The components of the electronic device 700 may include, but are not limited to: the at least one processing unit 710, the at least one memory unit 720, and a bus 730 that couples various system components including the memory unit 720 and the processing unit 710.
Wherein the storage unit stores program code that can be executed by the processing unit 710 such that the processing unit 710 performs the steps according to various exemplary embodiments of the present invention described in the section "example methods" above in this specification.
The storage unit 720 may include readable media in the form of volatile memory units, such as a random access memory unit (RAM)721 and/or a cache memory unit 722, and may further include a read only memory unit (ROM) 723.
The memory unit 720 may also include programs/utilities 724 having a set (at least one) of program modules 725, such program modules 725 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
Bus 730 may be any representation of one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
The electronic device 700 may also communicate with one or more external devices 900 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 700, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 700 to communicate with one or more other computing devices. Such communication may occur via an input/output (I/O) interface 750. Also, the electronic device 700 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the internet) via the network adapter 760. As shown, the network adapter 760 communicates with the other modules of the electronic device 700 via the bus 730. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 700, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
According to a fourth aspect of the present disclosure, there is also provided a computer-readable storage medium having stored thereon a program product capable of implementing the above-mentioned method of the present specification. In some possible embodiments, aspects of the invention may also be implemented in the form of a program product comprising program code means for causing a terminal device to carry out the steps according to various exemplary embodiments of the invention described in the above section "exemplary methods" of the present description, when said program product is run on the terminal device.
Referring to fig. 8, a program product 800 for implementing the above method according to an embodiment of the present invention is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited in this regard and, in the present document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
A computer readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
Furthermore, the above-described figures are merely schematic illustrations of processes involved in methods according to exemplary embodiments of the invention, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
It will be understood that the invention is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the invention is limited only by the appended claims.

Claims (10)

1. A method for ordering resource processing requests, the method comprising:
when a resource processing request is received, determining a first score of the resource processing request based on the type of the resource processing request and a preset corresponding relation between the type of the resource processing request and a preset score;
determining a second fraction of the resource processing request which is in a negative correlation relation with the appointed processing deadline based on the appointed processing deadline of the resource processing request, wherein the second fraction is greater than or equal to 1;
determining a third score for the resource processing request based on the amount of resources of the resource processing request;
calculating a fourth fraction of the resource processing request according to the first fraction, the second fraction and the third fraction determined for the resource processing request by using the following formula:
D=(A+0.5*log10C)B
wherein A is the first score, B is the second score, C is the third score, and D is the fourth score;
and adding the resource processing request into a resource processing request queue, and sequencing the resource processing request according to the fourth fraction of the resource processing request.
2. The method of claim 1, wherein after adding the resource processing request to a resource processing request queue and sorting the resource processing requests according to a fourth fraction of the resource processing requests, the method further comprises:
in response to receiving a request for modifying the fourth score, returning a page for modifying the fourth score to a sender of the request, so that the sender of the request modifies the fourth score of the resource processing request through the page, wherein the page comprises each resource processing request queued by the resource processing request queue and the fourth score corresponding to each resource processing request;
receiving an instruction for modifying the fourth score through modifying the page of the fourth score, wherein the instruction comprises the modified fourth score and a resource processing request corresponding to the modified fourth score;
and reordering the resource processing requests in the resource processing request queue according to the resource processing request corresponding to the modified fourth fraction and the modified fourth fraction.
3. The method of claim 2, wherein in response to receiving the request to modify the fourth score, returning the page that modifies the fourth score to the sender of the request so that the sender of the request processes the fourth score of the request through the page modification resource, comprises:
in response to receiving a request to modify the fourth score, obtaining permission of a sender of the request;
and returning a page which is used for modifying the fourth score and contains the resource processing request meeting the authority in the resource processing request queue to the sender of the request, so that the sender of the request modifies the fourth score of the resource processing request meeting the authority in the resource processing request queue through the page.
4. The method according to claim 2, wherein the modified resource processing request corresponding to the fourth fraction is an impact resource processing request, and the reordering the resource processing requests in the resource processing request queue according to the modified resource processing request corresponding to the fourth fraction and the modified fourth fraction comprises:
pre-sequencing the resource processing requests in the resource processing request queue according to the resource processing requests corresponding to the modified fourth scores and the modified fourth scores;
acquiring resource processing requests, of which the ordering is affected by the resource processing request corresponding to the modified fourth fraction, from other resource processing requests except the resource processing request corresponding to the modified fourth fraction in a resource processing request queue after pre-ordering, as affected resource processing requests, wherein for each affected resource processing request, the resource processing request, of which the ordering of the affected resource processing request is affected in the resource processing request corresponding to the modified fourth fraction, is an affected resource processing request corresponding to the affected resource processing request;
sending a reminding message to a sender of each affected resource processing request, so that the sender of the affected resource processing request determines whether to allow the affected resource processing request corresponding to the affected resource processing request to influence the sequencing of the affected resource processing request by modifying the fourth fraction according to the reminding message;
aiming at each affected resource processing request, acquiring a final fourth score of the affected resource processing request according to a determination result of the reminding information by a sender of each affected resource processing request corresponding to the affected resource processing request;
and sequencing the resource processing requests in the resource processing request queue according to the various influence resource processing requests and the corresponding final fourth fraction.
5. The method of claim 1, wherein each resource processing request added to the resource processing request queue calculates a corresponding fourth fraction, and wherein adding the resource processing request to the resource processing request queue and sorting the resource processing requests according to the fourth fraction of the resource processing request comprises:
adding the resource processing request to a resource processing request queue;
acquiring a preset fourth-score sequencing interval, wherein the preset fourth-score sequencing interval is a plurality of intervals into which the space where the fourth score is located is divided according to the sequence of the fourth score from large to small, and the fourth score of each resource processing request existing in the resource processing request queue belongs to one fourth-score sequencing interval;
sequencing the resource processing requests added into the resource processing request queue according to the sequence of the fourth scores from large to small;
and randomly sequencing the resource processing requests belonging to the same fourth numerical sequencing interval in the sequenced resource processing requests.
6. The method of claim 1, wherein after adding the resource processing request to a resource processing request queue and sorting the resource processing requests according to a fourth fraction of the resource processing requests, the method further comprises:
selecting a resource processing request from the resource processing request queue, and obtaining the difference value between the appointed processing time limit of the resource processing request and the current time;
acquiring the sum of the predicted processing time of all resource processing requests arranged before the resource processing request in the resource processing request queue;
if the difference is smaller than the sum, adjusting the fourth fraction of the resource processing requests, and reordering all the resource processing requests in the resource processing request queue so that the difference is larger than or equal to the sum.
7. The method of claim 6, wherein the resource processing request corresponds to a type, and wherein obtaining a sum of predicted processing times of all resource processing requests queued before the resource processing request in the resource processing request queue comprises:
acquiring the ratio of the historical processing time of each type of resource processing request to the resource amount;
acquiring the type and the resource amount of each resource processing request arranged before the resource processing request in the resource processing request queue;
multiplying the resource amount of each resource processing request by the ratio of the historical processing time of the corresponding type of resource processing request to the resource amount to obtain the predicted processing time of each resource processing request;
the sum of the acquired expected processing times of the resource processing requests is determined.
8. An apparatus for ordering resource processing requests, the apparatus comprising:
the first score determining module is configured to determine a first score of the resource processing request based on the type of the resource processing request and a preset corresponding relation between the type of the resource processing request and a preset score when the resource processing request is received;
a second score determining module configured to determine a second score of the resource processing request having a negative correlation with the agreed processing deadline based on the agreed processing deadline of the resource processing request, wherein the second score is greater than or equal to 1;
a third score determination module configured to determine a third score for the resource processing request based on the amount of resources of the resource processing request;
a fourth score determining module configured to calculate a fourth score of the resource processing request according to the first score, the second score and the third score determined for the resource processing request by using the following formula:
D=(A+0.5*log10C)B
wherein A is the first score, B is the second score, C is the third score, and D is the fourth score;
and the sequencing module is configured to add the resource processing request to a resource processing request queue and sequence the resource processing request according to the fourth fraction of the resource processing request.
9. A computer-readable program medium, characterized in that it stores computer program instructions which, when executed by a computer, cause the computer to perform the method according to any one of claims 1 to 7.
10. An electronic device, characterized in that the electronic device comprises:
a processor;
a memory having stored thereon computer readable instructions which, when executed by the processor, implement the method of any of claims 1 to 7.
CN201910853974.7A 2019-09-10 2019-09-10 Sequencing method, device, medium and electronic equipment for resource processing requests Active CN110688222B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910853974.7A CN110688222B (en) 2019-09-10 2019-09-10 Sequencing method, device, medium and electronic equipment for resource processing requests

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910853974.7A CN110688222B (en) 2019-09-10 2019-09-10 Sequencing method, device, medium and electronic equipment for resource processing requests

Publications (2)

Publication Number Publication Date
CN110688222A true CN110688222A (en) 2020-01-14
CN110688222B CN110688222B (en) 2024-06-21

Family

ID=69107880

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910853974.7A Active CN110688222B (en) 2019-09-10 2019-09-10 Sequencing method, device, medium and electronic equipment for resource processing requests

Country Status (1)

Country Link
CN (1) CN110688222B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6658485B1 (en) * 1998-10-19 2003-12-02 International Business Machines Corporation Dynamic priority-based scheduling in a message queuing system
CN1941945A (en) * 2005-09-26 2007-04-04 华为技术有限公司 Method for informing column variant information to users
CN105868420A (en) * 2016-06-08 2016-08-17 腾讯科技(深圳)有限公司 Network resource loading mode configuration method and device
CN107291548A (en) * 2016-03-31 2017-10-24 阿里巴巴集团控股有限公司 The resource regulating method and device of task
CN109491801A (en) * 2018-09-27 2019-03-19 平安科技(深圳)有限公司 Micro services access scheduling method, apparatus, medium and electronic equipment
CN109947532A (en) * 2019-03-01 2019-06-28 中山大学 A kind of big data method for scheduling task in education cloud platform
CN110109752A (en) * 2019-04-12 2019-08-09 平安普惠企业管理有限公司 A kind of method for allocating tasks, device, electronic equipment and storage medium

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6658485B1 (en) * 1998-10-19 2003-12-02 International Business Machines Corporation Dynamic priority-based scheduling in a message queuing system
CN1941945A (en) * 2005-09-26 2007-04-04 华为技术有限公司 Method for informing column variant information to users
CN107291548A (en) * 2016-03-31 2017-10-24 阿里巴巴集团控股有限公司 The resource regulating method and device of task
CN105868420A (en) * 2016-06-08 2016-08-17 腾讯科技(深圳)有限公司 Network resource loading mode configuration method and device
CN109491801A (en) * 2018-09-27 2019-03-19 平安科技(深圳)有限公司 Micro services access scheduling method, apparatus, medium and electronic equipment
CN109947532A (en) * 2019-03-01 2019-06-28 中山大学 A kind of big data method for scheduling task in education cloud platform
CN110109752A (en) * 2019-04-12 2019-08-09 平安普惠企业管理有限公司 A kind of method for allocating tasks, device, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN110688222B (en) 2024-06-21

Similar Documents

Publication Publication Date Title
CN110555640B (en) Route planning method and device
CN109491801B (en) Micro-service access scheduling method, micro-service access scheduling device, medium and electronic equipment
CN101183379A (en) Attribute level federation from multiple data sources
CN109508326B (en) Method, device and system for processing data
KR102555607B1 (en) Method and apparatus for annotating data, device, storage medium and computer program
CN111383100A (en) Risk model-based full life cycle management and control method and device
CN111813804A (en) Data query method and device, electronic equipment and storage medium
CN115335821B (en) Offloading statistics collection
CN110674117A (en) Data modeling method and device, computer readable medium and electronic equipment
CN111858586B (en) Data processing method and device
CN116502877A (en) Project progress monitoring method and device, electronic equipment and readable storage medium
CN111044062B (en) Path planning and recommending method and device
US20090138510A1 (en) Method and apparatus for associating help desk ticket with affected data processing system
CN109375910A (en) Class file generation method, device, electronic equipment and storage medium
CN110866031A (en) Database access path optimization method and device, computing equipment and medium
CN110852701A (en) Product demand management method, device and system
CN110688222B (en) Sequencing method, device, medium and electronic equipment for resource processing requests
US20230153300A1 (en) Building cross table index in relational database
CN114257521A (en) Flow prediction method, device, electronic equipment and storage medium
CN111522840B (en) Label configuration method, device, equipment and computer readable storage medium
US20220035816A1 (en) Prioritization and optimization of database workloads
CN109325198B (en) Resource display method and device and storage medium
US11393050B2 (en) Resource accommodation device, schedule management device, and resource accommodation system
CN115550259B (en) Flow distribution method based on white list and related equipment
US11841857B2 (en) Query efficiency using merged columns

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