CN110705884B - List processing method, device, equipment and storage medium - Google Patents

List processing method, device, equipment and storage medium Download PDF

Info

Publication number
CN110705884B
CN110705884B CN201910951312.3A CN201910951312A CN110705884B CN 110705884 B CN110705884 B CN 110705884B CN 201910951312 A CN201910951312 A CN 201910951312A CN 110705884 B CN110705884 B CN 110705884B
Authority
CN
China
Prior art keywords
processed
distribution
list
stage
allocation
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.)
Active
Application number
CN201910951312.3A
Other languages
Chinese (zh)
Other versions
CN110705884A (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.)
CCB Finetech Co Ltd
Original Assignee
China Construction Bank Corp
CCB Finetech 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 China Construction Bank Corp, CCB Finetech Co Ltd filed Critical China Construction Bank Corp
Priority to CN201910951312.3A priority Critical patent/CN110705884B/en
Publication of CN110705884A publication Critical patent/CN110705884A/en
Application granted granted Critical
Publication of CN110705884B publication Critical patent/CN110705884B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Theoretical Computer Science (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Educational Administration (AREA)
  • Finance (AREA)
  • Accounting & Taxation (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Technology Law (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The embodiment of the invention discloses a list processing method, a list processing device, list processing equipment and a storage medium. The method comprises the following steps: determining a to-be-processed list, an allocation task group to which the allocation stage belongs and a corresponding processing node according to an allocation proportion corresponding to the data allocation stage in the to-be-processed list; judging whether the current distribution stage has a related previous distribution stage or not according to the distribution stage related information of the list to be processed, and determining the data to be distributed corresponding to the current distribution stage to be processed according to a judgment result; and controlling the processing nodes corresponding to the current distribution task group, and distributing the data to be distributed corresponding to the current distribution stage in the current distribution task group according to the distribution proportion corresponding to the current distribution stage to be processed. The embodiment of the invention realizes the task grouping of the list to be processed according to the distribution proportion of the data processing flow stage, thereby processing the list to be processed by a plurality of task groups and improving the processing efficiency.

Description

List processing method, device, equipment and storage medium
Technical Field
The embodiment of the invention relates to the technical field of data processing, in particular to a list processing method, a list processing device, list processing equipment and a storage medium.
Background
Currently, for a large number of lists, multiple stages of processing are required to be performed on data therein to distribute the data therein, and the distributed data is sent to corresponding users. However, with the rapid development of the market, the number of generated lists is greatly increased, and it is difficult for a single list processing module to accurately and quickly classify a large number of lists under the condition that the requirements on equipment resources and time are limited.
At present, when the list is processed and distributed and the list is synchronously stored, the personalized adjustment of the storage mode cannot be realized only by storing through a database or a partition of hardware, the distribution processing has dependency relationship, the personalized distribution processing of batch data is difficult to realize, and the timeliness of the processing cannot be ensured.
Disclosure of Invention
Embodiments of the present invention provide a method, an apparatus, a device, and a storage medium for processing a list, so as to quickly and efficiently process data in the list.
In a first aspect, an embodiment of the present invention provides a list processing method, where the method includes:
determining a to-be-processed list and an allocation task group to which the allocation stage belongs according to an allocation proportion corresponding to the data allocation stage in the to-be-processed list, and determining a processing node corresponding to the allocation task group, wherein the allocation task group comprises a request for allocating data corresponding to the allocation stage according to the allocation proportion;
Judging whether the current distribution stage has a related previous distribution stage according to the distribution stage related information of the list to be processed, and determining the data to be distributed corresponding to the current distribution stage to be processed according to a judgment result;
and controlling the processing nodes corresponding to the current distribution task group, and distributing the data to be distributed corresponding to the current distribution stage in the current distribution task group according to the distribution proportion corresponding to the current distribution stage to be processed.
In a second aspect, an embodiment of the present invention provides a manifest handling detection apparatus, where the apparatus includes:
the task group distribution module is used for determining the list to be processed and a distribution task group to which the distribution stage belongs according to the distribution proportion corresponding to the data distribution stage in the list to be processed, and determining a processing node corresponding to the distribution task group, wherein the distribution task group comprises a request for distributing the data corresponding to the distribution stage according to the distribution proportion;
the judging module is used for judging whether the current distribution stage has a related previous distribution stage or not according to the distribution stage related information of the list to be processed and determining the data to be distributed corresponding to the current distribution stage to be processed according to a judgment result;
And the data distribution module is used for controlling the processing nodes corresponding to the current distribution task group and distributing the data to be distributed corresponding to the current distribution stage in the current distribution task group according to the distribution proportion corresponding to the current distribution stage to be processed.
In a third aspect, an embodiment of the present invention further provides an apparatus, where the apparatus includes:
one or more processors;
a memory for storing one or more programs;
when executed by the one or more processors, cause the one or more processors to implement a manifest processing method as in any one of the embodiments of the invention.
In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the manifest handling method according to any one of the embodiments of the present invention.
In the embodiment of the invention, the list to be processed and the distribution task group to which the distribution stage belongs are determined according to the distribution proportion corresponding to the data distribution stage in the list to be processed, the processing node corresponding to the distribution task group is determined, so that the distribution stages with the same processing process are distributed in the same distribution task group, the same distribution task group distributes the data in the same process, so that the processing efficiency is improved, whether the current distribution stage has a related previous distribution stage or not is judged according to the distribution stage related information of the list to be processed, the data to be distributed corresponding to the current distribution stage to be processed is determined according to the judgment result, so that the related relation among the distribution task groups is determined, and when the distribution stages are more than two, the processing sequence among the distribution task groups can be determined according to the related relation among the distribution stages, and determining the data to be distributed corresponding to each distribution stage, and distributing the data to be distributed corresponding to the current distribution stage in the current distribution task group according to the distribution proportion corresponding to the current distribution stage to be processed by controlling the processing nodes corresponding to the current distribution task group, thereby realizing the high-efficiency processing of the tasks in the list to be processed.
Drawings
FIG. 1 is a flowchart of a method for processing a manifest according to one embodiment of the present invention;
FIG. 2 is a flowchart of a manifest handling method in a second embodiment of the present invention;
fig. 3 is a diagram of a detailed implementation structure of a list processing method in the second embodiment of the present invention;
FIG. 4 is a schematic structural diagram of a list processing apparatus according to a third embodiment of the present invention;
fig. 5 is a schematic structural diagram of an apparatus according to a fourth embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be further noted that, for the convenience of description, only some of the structures associated with the present invention are shown in the drawings, not all of them.
Example one
Fig. 1 is a flowchart of a list processing method according to an embodiment of the present invention. The method for processing a manifest provided by this embodiment may be applicable to a case of processing data in a manifest, and the method may be specifically executed by a manifest processing apparatus, which may be implemented by software and/or hardware, and may be integrated in a device. Referring to fig. 1, the method of the embodiment of the present invention specifically includes:
S110, according to the distribution proportion corresponding to the data distribution stage in the list to be processed, determining the list to be processed and the distribution task group to which the distribution stage belongs, and determining the processing node corresponding to the distribution task group, wherein the distribution task group comprises a request for distributing the data corresponding to the distribution stage according to the distribution proportion.
The to-be-processed list can be a list containing goods data, and can also be a list of merchant transactions, including transaction receipts and transaction data. For different types of lists to be processed, different processing flows and stages are corresponded, for example, for a type of list to be processed, the processing flow includes: the first distribution phase distributes the data therein in proportions of 20% and 80%, and the second distribution phase distributes 80% of the data in proportions of 70% and 30%. For another processing flow of the list to be processed, the method comprises the following steps: the data therein was distributed in a ratio of 60% to 40%. The distribution stage of each to-be-processed list can be at least one, and each distribution stage comprises a task for distributing the data corresponding to the stage. The allocation task group includes tasks for allocating data in a plurality of allocation stages, that is, requests for allocating data corresponding to the allocation stages according to an allocation ratio. The processing node is a node that processes each request in the assigned task group.
Specifically, the to-be-processed list and the task group to which the distribution stage belongs are determined according to the distribution proportion corresponding to the data distribution stage in the to-be-processed list, so that the distribution tasks are grouped according to the distribution proportion, the batch synchronous processing of the distribution tasks is realized, and the processing efficiency is improved.
Optionally, determining the to-be-processed list and the allocation task group to which the allocation stage belongs according to the allocation proportion corresponding to the data allocation stage in the to-be-processed list includes: if the distribution proportion corresponding to the data distribution stage in the at least two lists to be processed is the same, classifying the at least two lists to be processed and the distribution stage into the same distribution task group; or if the corresponding distribution proportions of at least two distribution stages in the list to be processed are the same, classifying the list to be processed and the at least two distribution stages into the same distribution task group.
For example, if there are at least two pending lists, the allocation task of a certain stage is to allocate the corresponding data according to the proportion of 20% to 80%, so that the allocation stages of the at least two pending lists may be classified into the same allocation task group. Or, if any one to-be-processed list exists, the distribution tasks of at least two distribution stages are all used for distributing the data according to the proportion of 20% to 80%, so that the at least two distribution stages can be classified into the same distribution task group, the tasks in the distribution task group are processed by the same code logic, and the processing efficiency is improved.
Optionally, the embodiment of the present invention may be applied to a process of clearing funds of a merchant. And receiving the to-be-processed list of the merchant, and determining the to-be-processed list and the distribution task group to which the distribution stage belongs according to the fund clearing process of the merchant. The tasks in the distribution stage of the list to be processed can be divided into eight types, including a public processing type, an accounting entry type, a bedding processing type, a fund collection type, a middle-income classification and lubrication type, a total classification and check type, a reconciliation error type and a report voucher type, and the tasks of the various types can be divided in a fine granularity manner, for example, the tasks are classified according to task numbers, task names, task classifications, task levels, whether a multi-process processing task is supported, the upper limit of the number of the multi-process, whether the re-run is supported, the re-run times, the re-run interval threshold value and other operation information. Therefore, the specific process and the distribution proportion of the tasks in each distribution stage are determined according to the classification of each task, and the list to be processed and the distribution task group to which the distribution stage belongs are conveniently determined.
S120, judging whether the current distribution stage has a related previous distribution stage according to the distribution stage related information of the list to be processed, and determining data to be distributed corresponding to the current distribution stage to be processed according to a judgment result.
The distribution stage association information is determined according to the processing flow of the list to be processed, and may include information such as the number of distribution stages included in the processing flow of the list to be processed, the sequence of each distribution stage, and a source of data to be processed corresponding to each distribution stage. And after receiving the list to be processed, acquiring a processing flow of the list to be processed, and determining the associated information of the distribution stage according to the processing flow. Whether the current distribution stage to be processed in the distribution task group has a previous distribution stage related to the current distribution stage can be determined according to the distribution stage related information, so that the data to be distributed corresponding to the current distribution stage is determined according to the judgment result, and the data to be distributed corresponding to the current distribution stage is distributed.
Optionally, determining to-be-allocated data corresponding to the current allocation stage to be processed according to the determination result includes: if the current distribution stage does not exist, the initial data in the list to be processed is used as the data to be distributed corresponding to the current distribution stage; if the data to be distributed exists in the current distribution stage, determining the data to be distributed corresponding to the current distribution stage after the data distribution corresponding to the previous distribution stage is finished.
Specifically, if it is determined that there is no related previous allocation stage in the current allocation stage, it means that the to-be-processed list only needs to be subjected to allocation processing in one stage, and the initial data in the to-be-processed list is directly used as the to-be-allocated data corresponding to the current allocation stage. If it is determined that the current distribution stage has a related previous distribution stage, it indicates that the list to be processed needs to be subjected to distribution processing of multiple stages, so that the previous distribution stage corresponding to the current distribution stage is determined according to the distribution stage related information, and after the distribution task corresponding to the previous distribution stage is completed, the data to be distributed corresponding to the current distribution stage is determined according to the distribution result of the previous distribution stage.
Optionally, after the data allocation corresponding to the previous allocation stage is completed, determining the data to be allocated corresponding to the current allocation stage includes: acquiring an allocation result obtained by allocating the data corresponding to the previous allocation stage by the processing node corresponding to the previous allocation task group; and determining the data to be distributed corresponding to the current distribution stage in the current distribution task group from the distribution result according to the distribution stage correlation information.
Specifically, the processing node of the to-be-processed list may configure information such as a processing order, a processing node number, a previous processing node number, a processing node level, and a processing node parameter of each allocation stage according to the allocation stage relation, and execute the allocation task of each allocation stage according to the processing order. And obtaining an allocation result after the processing node corresponding to the current allocation task completes the data allocation corresponding to the previous allocation stage. And determining data to be distributed which needs to be continuously distributed to the distribution result according to the distribution stage correlation information, and taking the data to be distributed as the data to be distributed corresponding to the current distribution stage in the current distribution task group.
And S130, controlling the processing nodes corresponding to the current distribution task group, and distributing the data to be distributed corresponding to the current distribution stage in the current distribution task group according to the distribution proportion corresponding to the current distribution stage to be processed.
Specifically, after the data to be distributed corresponding to the current distribution stage is determined, the processing nodes corresponding to the current distribution task group are controlled, and the data to be distributed are distributed according to the distribution proportion corresponding to the current distribution stage, so that the distribution tasks in the same distribution task group call the same code logic to be processed, the code logic does not need to be called again to be executed each time the distribution task corresponding to each distribution stage is executed, the processing speed and the processing efficiency are improved,
the technical scheme of the embodiment of the invention determines the list to be processed and the distribution task group to which the distribution stage belongs according to the distribution proportion corresponding to the data distribution stage in the list to be processed, determines the processing node corresponding to the distribution task group, so as to distribute the same stage of the processing process in the same distribution task group, distributes the same process to the data by the same distribution task group, thereby improving the processing efficiency, judges whether the current distribution stage has the related previous distribution stage according to the distribution stage related information of the list to be processed, determines the data to be distributed corresponding to the current distribution stage to be processed according to the judgment result, so as to clarify the association relation among the distribution task groups, and can determine the processing sequence among the distribution task groups according to the association relation among the distribution stages when the distribution stages are more than two, and determining the data to be distributed corresponding to each distribution stage, and distributing the data to be distributed corresponding to the current distribution stage in the current distribution task group according to the distribution proportion corresponding to the current distribution stage to be processed by controlling the processing nodes corresponding to the current distribution task group, thereby realizing the high-efficiency processing of the tasks in the list to be processed.
Example two
Fig. 2 is a flowchart of a list processing method according to a second embodiment of the present invention. The embodiment of the invention is optimized on the basis of the above embodiment, and details which are not described in detail in the embodiment are referred to the above embodiment. Referring to fig. 2, the list processing method provided in this embodiment may include:
s210, determining the list to be processed to which the list to be processed belongs.
Specifically, as shown in fig. 3, the to-be-processed list received by the to-be-processed list receiving layer needs to be split and classified, and parameter configuration and management of corresponding sub-base sub-table partitions are performed, and then split into different task groups for processing. And determining the number of databases for storing the list to be processed, the number of database partitions and the number of list tables to be processed according to the number of the received lists to be processed. For example, if the number of the pending lists is 1000 and each table can hold 100 pending lists, 10 pending list tables are established. If the data in the current data is only reserved for 7 days, the database is divided into 7 areas. If the number of the list tables to be processed is 100, and the number of the list tables to be processed which can be accommodated by each database is 20, 5 databases are established.
Illustratively, the pending list table to which the pending list belongs is determined according to the number of the pending lists. Optionally, if the number of list generators to which the list to be processed belongs is greater than a third preset number threshold, and the number of the list to be processed corresponding to a single list generator is less than a fourth preset number threshold, determining the list table to be processed to which the list to be processed belongs according to the identification number of the list generator to which the list to be processed belongs; if the number of the list generators to which the list to be processed belongs is larger than a third preset number threshold value and the number of the list to be processed corresponding to a single list generator is larger than or equal to a fourth preset number threshold value, determining a list table to be processed to which the list to be processed belongs according to the identification number of the list generator to which the list to be processed belongs and the number of the list to be processed; otherwise, determining the list table to be processed to which the list to be processed belongs according to the serial number of the list to be processed.
For example, in a case that the pending list is a transaction list, if the transaction manner is a card swiping type transaction, the number of transaction merchants related to the transaction type is large, and daily transaction amount corresponding to each merchant is small, so in order to improve the processing efficiency, a modulo division table is performed according to the identification number of the merchant, for example, the merchant identification number is "0008", the pending list table is set to be 10, and 8 is obtained by dividing 8 by 10, that is, the pending list table is allocated in the 9 th pending list table. If the transaction mode is an internet payment type transaction, the transaction total amount related to the transaction type and the transaction amount corresponding to each merchant are more, and therefore the transaction amount is evenly distributed into the list to be processed according to the list to be processed and the number of the merchants. For example, the merchants are sorted according to the daily transaction amount of each merchant, and the to-be-processed list corresponding to the merchant is distributed to the to-be-processed list table according to the sorting result. And if the transaction mode is a third-party payment mechanism type transaction, the transaction amount related to the simple type is large, and the number of the merchants is small, and then the module is taken and the list is divided according to the identification number of the list to be processed. For example, if the identification number of the to-be-processed list is "000010", and the to-be-processed list table is set to be 100 tables, the remainder obtained by dividing 10 by 100 is 10, that is, the to-be-processed list is allocated in the 11 th to-be-processed list table. The list to be processed is distributed in the table dividing mode, so that the number of the list to be processed and the number of the generation parties are fully considered, the list to be processed is reasonably distributed, and the problem that the distribution of the list to be processed is centralized or dispersed to influence the processing efficiency is solved.
Optionally, before determining the to-be-processed list and the allocation task group to which the allocation stage belongs according to the allocation proportion corresponding to the data allocation stage in the to-be-processed list, the method further includes: and counting the number of the lists to be processed corresponding to each list generator and the number of the lists to be processed in the list table to be processed, and adjusting the number of the lists to be processed in the list table to be processed according to the counting result. For example, the number of the to-be-processed list tables of each library per day is monitored, and if the number of the to-be-processed list tables is greatly different from the number of the to-be-processed list tables at other times, the number of the to-be-processed list tables is adjusted. In addition, if the quantity of the list to be processed corresponding to each list generator is greatly changed, the quantity of the list to be processed distributed to the list to be processed is adjusted according to the statistical result so as to ensure uniform distribution.
Optionally, when the to-be-processed list is distributed, the distributed to-be-processed list is registered, so as to perform synchronous check according to the to-be-processed list, thereby ensuring that all the to-be-processed lists are reasonably distributed without generating a situation of repeated distribution.
S220, according to the distribution proportion corresponding to the data distribution stage in the list to be processed, determining the list to be processed and the distribution task group to which the distribution stage belongs, and determining the processing node corresponding to the distribution task group, wherein the distribution task group comprises a request for distributing the data corresponding to the distribution stage according to the distribution proportion.
Optionally, after determining the distribution task group to which the to-be-processed list belongs according to the distribution proportion of the data in the to-be-processed list, the method further includes:
if the difference value of the number of the received lists to be processed is smaller than the preset difference value in each sub-time period of the preset time period, and the number of the received lists to be processed in the preset time period is smaller than a first preset number threshold value, determining the lists to be processed and the sub-distribution task groups to which the distribution stages belong according to identification numbers of list generators to which the lists to be processed belong in the distribution task groups; if the difference value of the number of the received lists to be processed is smaller than the preset difference value in each sub-time period of the preset time period, and the number of the received lists to be processed in the preset time period is larger than or equal to a first preset number threshold value, determining the lists to be processed and the sub-distribution task groups to which the distribution stages belong according to the serial numbers of the lists to be processed in the distribution task groups; if the difference value of the number of the received lists to be processed is larger than or equal to the preset difference value in each sub-time period of the preset time period, determining the lists to be processed and the sub-distribution task groups to which the distribution stages belong according to the receiving time of the lists to be processed in the distribution task groups. It should be noted that, in this step, the distribution manner is performed according to the identification number of the list generation party to which the to-be-processed list belongs, or according to the number of the to-be-processed list in the distribution task group, which is the same as the distribution manner in S210, and details are not described here.
Optionally, determining the sub-distribution task group to which the to-be-processed list belongs according to the receiving time of the to-be-processed list in the distribution task group, includes: if the number of the received lists to be processed is larger than a second preset number threshold value in the sub-time period, classifying the lists to be processed and the distribution stages received in the first time interval into the same sub-distribution task group; if the number of the received lists to be processed is less than or equal to a second preset number threshold value in the sub-time period, classifying the lists to be processed and the distribution stages received in a second time interval into the same sub-distribution task group; wherein the first time interval is less than the second time interval.
Illustratively, during a peak period generated by the list to be processed, the list to be processed needs to be processed quickly, so that the list to be processed received at the first time interval and the distribution stage are classified into the same sub-distribution task group for processing, and when the list is in a valley period, the time interval can be increased, so that the number of the list to be processed received at the second time interval is similar to the number of the list to be processed received at the first time interval, the stability of the number of the list to be processed in the same sub-distribution task group is ensured, and the processing efficiency is improved.
And S230, judging whether the current distribution stage has a related previous distribution stage or not according to the distribution stage related information of the list to be processed, and determining the data to be distributed corresponding to the current distribution stage to be processed according to a judgment result.
And S240, controlling the processing nodes corresponding to the current distribution task group, and distributing the data to be distributed corresponding to the current distribution stage in the current distribution task group according to the distribution proportion corresponding to the current distribution stage to be processed.
Optionally, controlling the processing node corresponding to the current allocation task group, and allocating the data to be allocated corresponding to the current allocation stage in the current allocation task group according to the allocation proportion corresponding to the current allocation stage to be processed, including: and controlling the sub-processing nodes corresponding to the current sub-allocation task group in the current allocation task group, and allocating the data to be allocated corresponding to the current allocation stage in the current sub-allocation task group according to the allocation proportion corresponding to the current allocation stage to be processed.
And S250, determining a summarizing type according to the processing type of the list to be processed, and summarizing the distribution result according to the summarizing type.
The summary type may include fund collection, account summary, merchant summary and terminal summary. The terminal summary is a summary of each payment acceptance terminal. The merchant pools are always summarized according to the granularity of the order-receiving merchants, which can be 1 merchant: and N terminals. The account number summarization is performed according to the same settlement account number granularity, and can be performed according to the following steps of 1 account number: n merchants. The fund collection is summarized according to the granularity of service scenes, and can be summarized in a 1 scene: n account numbers. For example, when the type of the to-be-processed list is a fund summary class, the to-be-processed list may be summarized according to the terminal to which the to-be-processed list belongs. When the type of the list to be processed is the Zhongyuan classified type, the summary can be performed according to the account corresponding to the list to be processed. By summarizing, integration of list processing results can be achieved, thereby facilitating management.
According to the technical scheme of the embodiment of the invention, the list to be processed is distributed, so that the factors of the number of the list to be processed and the number of the generation parties are fully considered, the list to be processed is reasonably distributed, and the problem that the distribution of the list to be processed is centralized or dispersed to influence the processing efficiency is avoided. And the distributed task group is divided into the sub-distributed task groups, so that the plurality of sub-distributed task groups are executed concurrently, and the processing efficiency is improved.
EXAMPLE III
Fig. 4 is a schematic structural diagram of a list processing apparatus according to a third embodiment of the present invention. The device is suitable for processing the data in the list, can be realized by software and/or hardware, and can be integrated in equipment. Referring to fig. 4, the apparatus specifically includes:
the task group allocation module 310 is configured to determine, according to an allocation proportion corresponding to a data allocation stage in a to-be-processed list, an allocation task group to which the to-be-processed list and the allocation stage belong, and determine a processing node corresponding to the allocation task group, where the allocation task group includes a request for allocating data corresponding to the allocation stage according to the allocation proportion;
A determining module 320, configured to determine whether a current allocation stage has a previous allocation stage associated with the current allocation stage according to the allocation stage association information of the to-be-processed list, and determine, according to a determination result, to-be-allocated data corresponding to the current allocation stage to be processed;
and the data distribution module 330 is configured to control the processing node corresponding to the current distribution task group, and distribute the data to be distributed corresponding to the current distribution stage in the current distribution task group according to the distribution proportion corresponding to the current distribution stage to be processed.
Optionally, the task group allocating module 310 is specifically configured to:
if the distribution proportions corresponding to the data distribution stages in the at least two lists to be processed are the same, classifying the at least two lists to be processed and the distribution stages into the same distribution task group; alternatively, the first and second liquid crystal display panels may be,
if the distribution proportion corresponding to at least two distribution stages in the list to be processed is the same, classifying the list to be processed and the at least two distribution stages into the same distribution task group.
Optionally, the determining module 320 includes:
a first to-be-allocated data determination unit configured to: if the current distribution stage does not exist, the initial data in the list to be processed is used as the data to be distributed corresponding to the current distribution stage;
A second to-be-allocated data determination unit configured to: if the data to be distributed exists, determining the data to be distributed corresponding to the current distribution stage after the data distribution corresponding to the previous distribution stage is finished.
Optionally, the second unit for determining data to be allocated includes:
the distribution result acquisition subunit is used for acquiring a distribution result obtained by distributing the data corresponding to the previous distribution stage by the processing node corresponding to the previous distribution task group;
and the data to be distributed acquisition subunit is used for determining the data to be distributed corresponding to the current distribution stage in the current distribution task group from the distribution result according to the distribution stage association information.
Optionally, the method further includes:
the first determining module is used for determining the list to be processed and the sub-distribution task group to which the distribution stage belongs according to the identification number of the list generator to which the list to be processed belongs in the distribution task group if the difference value of the number of the received lists to be processed is smaller than the preset difference value and the number of the received lists to be processed in the preset time period is smaller than a first preset number threshold value in each sub-time period of the preset time period;
the second determining module is used for determining the list to be processed and the sub-distribution task group to which the distribution stage belongs according to the serial number of the list to be processed in the distribution task group if the difference value of the number of the received lists to be processed is smaller than the preset difference value in each sub-time period of the preset time period and the number of the lists to be processed received in the preset time period is larger than or equal to the first preset number threshold value;
And the third determining module is used for determining the to-be-processed list and the sub-distribution task group to which the distribution stage belongs according to the receiving time of the to-be-processed list in the distribution task group if the difference value of the number of the received to-be-processed lists is greater than or equal to the preset difference value in each sub-time period of the preset time period.
Optionally, the third determining module includes:
the first classification unit is used for classifying the lists to be processed and the distribution stages received at the first time interval into the same sub-distribution task group if the number of the received lists to be processed is larger than a second preset number threshold value in the sub-time period;
the second classification unit is used for classifying the to-be-processed lists received in the second time interval and the distribution stage into the same sub-distribution task group if the number of the received to-be-processed lists is less than or equal to a second preset number threshold value in the sub-time period; wherein the first time interval is less than the second time interval.
Optionally, the data distribution module 330 is specifically configured to:
and controlling the sub-processing nodes corresponding to the current sub-allocation task group in the current allocation task group, and allocating the data to be allocated corresponding to the current allocation stage in the current sub-allocation task group according to the allocation proportion corresponding to the current allocation stage to be processed.
Optionally, the method further includes:
a first list table determining module, configured to determine, according to an identification number of a list generator to which a list to be processed belongs, a list table to be processed to which the list to be processed belongs if the number of the list generators to which the list to be processed belongs is greater than a third preset number threshold and the number of the list to be processed corresponding to a single list generator is less than a fourth preset number threshold;
a second list table determining module, configured to determine, according to the identification number of the list generator to which the list to be processed belongs and the number of the list to be processed, a list table to be processed to which the list to be processed belongs if the number of the list generators to which the list to be processed belongs is greater than a third preset number threshold and the number of the list to be processed corresponding to a single list generator is greater than or equal to a fourth preset number threshold;
and the third list table determining module is used for determining the list table to be processed to which the list to be processed belongs according to the serial number of the list to be processed if the list to be processed does not belong to the third list table determining module.
Optionally, the method further includes:
and the adjusting unit is used for counting the number of the lists to be processed corresponding to each list generator and the number of the lists to be processed in the list table to be processed, and adjusting the number of the lists to be processed in the list table to be processed according to the counting result.
Optionally, the method further includes:
and the summarizing module is used for determining a summarizing type according to the processing type of the list to be processed and summarizing the distribution result according to the summarizing type.
According to the technical scheme of the embodiment of the invention, a task group allocation module determines a to-be-processed list and an allocation task group to which the allocation stage belongs according to an allocation proportion corresponding to the data allocation stage in the to-be-processed list, and determines a processing node corresponding to the allocation task group, wherein the allocation task group comprises a request for allocating the data corresponding to the allocation stage according to the allocation proportion; the judging module judges whether the current distribution stage has a related previous distribution stage according to the distribution stage related information of the list to be processed, and determines data to be distributed corresponding to the current distribution stage to be processed according to a judgment result; the data distribution module controls the processing nodes corresponding to the current distribution task group, and distributes the data to be distributed corresponding to the current distribution stage in the current distribution task group according to the distribution proportion corresponding to the current distribution stage to be processed, so that the task grouping of the list to be processed according to the distribution proportion of the data processing flow stage is realized, the list to be processed is processed by a plurality of task groups, and the processing efficiency is improved.
Example four
Fig. 5 is a schematic structural diagram of an apparatus according to a fourth embodiment of the present invention. FIG. 5 illustrates a block diagram of an exemplary device 412 suitable for use in implementing embodiments of the present invention. The device 412 shown in fig. 5 is only an example and should not impose any limitation on the functionality or scope of use of embodiments of the present invention.
As shown in FIG. 5, device 412 is in the form of a general purpose computing device. The components of device 412 may include, but are not limited to: one or more processors or processors 416, a system memory 428, and a bus 418 that couples the various system components (including the system memory 428 and the processors 416).
Bus 418 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, such architectures include, but are not limited to, Industry Standard Architecture (ISA) bus, micro-channel architecture (MAC) bus, enhanced ISA bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.
Device 412 typically includes a variety of computer system readable storage media. These storage media may be any available storage media that can be accessed by device 412 and includes both volatile and nonvolatile storage media, removable and non-removable storage media.
The system memory 428 may include computer system readable storage media in the form of volatile memory, such as Random Access Memory (RAM)430 and/or cache memory 432. The device 412 may further include other removable/non-removable, volatile/nonvolatile computer system storage media. By way of example only, storage system 434 may be used to read from and write to non-removable, nonvolatile magnetic storage media (not shown in FIG. 5, commonly referred to as "hard drives"). Although not shown in FIG. 5, a magnetic disk drive for reading from and writing to a removable, nonvolatile magnetic disk (e.g., a "floppy disk") and an optical disk drive for reading from or writing to a removable, nonvolatile optical disk (e.g., a CD-ROM, DVD-ROM, or other optical storage medium) may be provided. In these cases, each drive may be connected to bus 418 by one or more data storage media interfaces. Memory 428 can include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the invention.
A program/utility 440 having a set (at least one) of program modules 442 may be stored, for instance, in memory 428, such program modules 462 including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each of which examples or some combination thereof may comprise an implementation of a network environment. Program modules 462 generally perform the functions and/or methodologies of embodiments of the present invention as described herein.
The device 412 may also communicate with one or more external devices 414 (e.g., keyboard, pointing device, display 426, etc.), with one or more devices that enable a user to interact with the device 412, and/or with any devices (e.g., network card, modem, etc.) that enable the device 412 to communicate with one or more other computing devices. Such communication may occur through input/output (I/O) interfaces 422. Also, the device 412 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) through the network adapter 420. As shown, network adapter 420 communicates with the other modules of device 412 over bus 418. It should be appreciated that although not shown in FIG. 5, other hardware and/or software modules may be used in conjunction with device 412, 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.
The processor 416 executes various functional applications and data processing by executing at least one of other programs stored in the system memory 428, for example, to implement a manifest processing method provided by the embodiments of the present invention, including:
Determining a to-be-processed list and an allocation task group to which the allocation stage belongs according to an allocation proportion corresponding to the data allocation stage in the to-be-processed list, and determining a processing node corresponding to the allocation task group, wherein the allocation task group comprises a request for allocating data corresponding to the allocation stage according to the allocation proportion;
judging whether the current distribution stage has a related previous distribution stage according to the distribution stage related information of the list to be processed, and determining data to be distributed corresponding to the current distribution stage to be processed according to a judgment result;
and controlling the processing nodes corresponding to the current distribution task group, and distributing the data to be distributed corresponding to the current distribution stage in the current distribution task group according to the distribution proportion corresponding to the current distribution stage to be processed.
EXAMPLE five
An embodiment of the present invention further provides a storage medium containing computer-executable instructions, which when executed by a computer processor, are configured to perform a manifest processing method:
determining a to-be-processed list and an allocation task group to which the allocation stage belongs according to an allocation proportion corresponding to the data allocation stage in the to-be-processed list, and determining a processing node corresponding to the allocation task group, wherein the allocation task group comprises a request for allocating data corresponding to the allocation stage according to the allocation proportion;
Judging whether the current distribution stage has a related previous distribution stage according to the distribution stage related information of the list to be processed, and determining data to be distributed corresponding to the current distribution stage to be processed according to a judgment result;
and controlling the processing nodes corresponding to the current distribution task group, and distributing the data to be distributed corresponding to the current distribution stage in the current distribution task group according to the distribution proportion corresponding to the current distribution stage to be processed.
Computer storage media for embodiments of the present invention can take the form of any combination of one or more computer-readable storage media. The computer readable storage medium may be a computer readable signal storage medium or a computer readable storage medium. A computer 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 computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, 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. In embodiments of the invention, the computer readable storage medium may be any tangible storage medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal storage medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal storage medium may be any computer readable storage medium that is not a computer 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 computer readable storage medium may be transmitted using any appropriate storage medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer 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, Smalltalk, 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 computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or device. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
It is to be noted that the foregoing description is only exemplary of the invention and that the principles of the technology may be employed. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.

Claims (11)

1. A method of inventory processing, the method comprising:
determining a to-be-processed list and an allocation task group to which the allocation stage belongs according to an allocation proportion corresponding to the data allocation stage in the to-be-processed list, and determining a processing node corresponding to the allocation task group, wherein the allocation task group comprises a request for allocating data corresponding to the allocation stage according to the allocation proportion;
judging whether the current distribution stage has a related previous distribution stage according to the distribution stage related information of the list to be processed, and determining data to be distributed corresponding to the current distribution stage to be processed according to a judgment result;
Controlling a processing node corresponding to the current distribution task group, and distributing the data to be distributed corresponding to the current distribution stage in the current distribution task group according to the distribution proportion corresponding to the current distribution stage to be processed;
the determining, according to the distribution proportion corresponding to the data distribution stage in the to-be-processed list, the to-be-processed list and the distribution task group to which the distribution stage belongs includes: if the distribution proportions corresponding to the data distribution stages in the at least two lists to be processed are the same, classifying the at least two lists to be processed and the distribution stages into the same distribution task group; or if the corresponding distribution proportions of at least two distribution stages in the list to be processed are the same, classifying the list to be processed and the at least two distribution stages into the same distribution task group;
the determining, according to the distribution stage association information of the to-be-processed list, whether a previous distribution stage associated with the current distribution stage exists in the current distribution stage, and determining, according to a determination result, to-be-distributed data corresponding to the current distribution stage to be processed, includes: if the current distribution stage does not exist, the initial data in the list to be processed is used as the data to be distributed corresponding to the current distribution stage;
If the data to be distributed exists, determining the data to be distributed corresponding to the current distribution stage after the data distribution corresponding to the previous distribution stage is finished.
2. The method of claim 1, wherein determining the data to be allocated corresponding to the current allocation stage after the data allocation corresponding to the previous allocation stage is completed comprises:
acquiring an allocation result obtained by allocating the data corresponding to the previous allocation stage by the processing node corresponding to the previous allocation task group;
and determining the data to be distributed corresponding to the current distribution stage in the current distribution task group from the distribution result according to the distribution stage correlation information.
3. The method according to claim 1, wherein after determining the assignment task group to which the pending manifest belongs according to the assignment proportion of the data in the pending manifest, the method further comprises:
if the difference value of the number of the received lists to be processed is smaller than the preset difference value in each sub-time period of the preset time period, and the number of the received lists to be processed in the preset time period is smaller than a first preset number threshold, determining the lists to be processed and the sub-distribution task groups to which the distribution stages belong according to the identification numbers of the list generators to which the lists to be processed belong in the distribution task groups;
If the difference value of the number of the received lists to be processed is smaller than the preset difference value in each sub-time period of the preset time period, and the number of the received lists to be processed in the preset time period is larger than or equal to a first preset number threshold, determining the lists to be processed and the sub-distribution task groups to which the distribution stages belong according to the serial numbers of the lists to be processed in the distribution task groups;
and if the difference value of the number of the received lists to be processed is greater than or equal to the preset difference value in each sub-time period of the preset time period, determining the lists to be processed and the sub-distribution task groups to which the distribution stages belong according to the receiving time of the lists to be processed in the distribution task groups.
4. The method of claim 3, wherein determining the sub-distribution task group to which the to-be-processed list belongs according to the receiving time of the to-be-processed list in the distribution task group comprises:
if the number of the received lists to be processed is larger than a second preset number threshold value in the sub-time period, classifying the lists to be processed and the distribution stages received in the first time interval into the same sub-distribution task group;
if the number of the received lists to be processed is less than or equal to a second preset number threshold value in the sub-time period, classifying the lists to be processed and the distribution stages received in a second time interval into the same sub-distribution task group; wherein the first time interval is less than the second time interval.
5. The method according to claim 3 or 4, wherein controlling the processing node corresponding to the current allocation task group to allocate the data to be allocated corresponding to the current allocation stage in the current allocation task group according to the allocation proportion corresponding to the current allocation stage to be processed comprises:
and controlling the sub-processing nodes corresponding to the current sub-distribution task group in the current distribution task group, and distributing the data to be distributed corresponding to the current distribution stage in the current sub-distribution task group according to the distribution proportion corresponding to the current distribution stage to be processed.
6. The method of claim 1, wherein before determining the pending list and the assignment task group to which the assignment phase belongs according to the assignment proportion corresponding to the data assignment phase in the pending list, the method further comprises:
if the number of the list generators to which the list to be processed belongs is larger than a third preset number threshold value and the number of the list to be processed corresponding to a single list generator is smaller than a fourth preset number threshold value, determining a list table to be processed to which the list to be processed belongs according to the identification number of the list generator to which the list to be processed belongs;
if the number of the list generators to which the list to be processed belongs is larger than a third preset number threshold value and the number of the list to be processed corresponding to a single list generator is larger than or equal to a fourth preset number threshold value, determining a list table to be processed to which the list to be processed belongs according to the identification number of the list generator to which the list to be processed belongs and the number of the list to be processed;
Otherwise, determining the list table to be processed to which the list to be processed belongs according to the serial number of the list to be processed.
7. The method according to claim 6, wherein before determining the pending list and the assignment task group to which the assignment phase belongs according to the assignment proportion corresponding to the data assignment phase in the pending list, the method further comprises:
and counting the number of the lists to be processed corresponding to each list generator and the number of the lists to be processed in the list table to be processed, and adjusting the number of the lists to be processed in the list table to be processed according to the counting result.
8. The method of claim 1, wherein after controlling the processing node corresponding to the current allocation task group to allocate the data to be allocated corresponding to the current allocation stage according to the allocation proportion corresponding to the current allocation stage to be processed, the method further comprises:
and determining a summarizing type according to the processing type of the list to be processed, and summarizing the distribution result according to the summarizing type.
9. A list processing apparatus, characterized in that the apparatus comprises:
the task group allocation module is used for determining the to-be-processed list and an allocation task group to which the allocation stage belongs according to the allocation proportion corresponding to the data allocation stage in the to-be-processed list, and determining a processing node corresponding to the allocation task group, wherein the allocation task group comprises a request for allocating the data corresponding to the allocation stage according to the allocation proportion;
The judging module is used for judging whether the current distribution stage has a related previous distribution stage or not according to the distribution stage related information of the list to be processed and determining the data to be distributed corresponding to the current distribution stage to be processed according to a judgment result;
the data distribution module is used for controlling the processing nodes corresponding to the current distribution task group and distributing the data to be distributed corresponding to the current distribution stage in the current distribution task group according to the distribution proportion corresponding to the current distribution stage to be processed;
the task group allocation module is specifically configured to classify the at least two to-be-processed lists and the allocation stages into the same allocation task group if the allocation proportions corresponding to the data allocation stages in the at least two to-be-processed lists are the same; or if the corresponding distribution proportions of at least two distribution stages in the list to be processed are the same, classifying the list to be processed and the at least two distribution stages into the same distribution task group;
the judging module comprises:
the first to-be-distributed data determining unit is used for taking the initial data in the to-be-processed list as the to-be-distributed data corresponding to the current distribution stage if the initial data does not exist;
And the second to-be-distributed data determining unit is used for determining the to-be-distributed data corresponding to the current distribution stage after the data distribution corresponding to the previous distribution stage is finished if the second to-be-distributed data determining unit exists.
10. An apparatus, characterized in that the apparatus comprises:
one or more processors;
a memory for storing one or more programs;
when executed by the one or more processors, cause the one or more processors to implement a manifest processing method as recited in any one of claims 1-8.
11. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out a method of manifest handling as claimed in any one of the claims 1 to 8.
CN201910951312.3A 2019-10-08 2019-10-08 List processing method, device, equipment and storage medium Active CN110705884B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910951312.3A CN110705884B (en) 2019-10-08 2019-10-08 List processing method, device, equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910951312.3A CN110705884B (en) 2019-10-08 2019-10-08 List processing method, device, equipment and storage medium

Publications (2)

Publication Number Publication Date
CN110705884A CN110705884A (en) 2020-01-17
CN110705884B true CN110705884B (en) 2022-06-28

Family

ID=69198352

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910951312.3A Active CN110705884B (en) 2019-10-08 2019-10-08 List processing method, device, equipment and storage medium

Country Status (1)

Country Link
CN (1) CN110705884B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7003475B1 (en) * 1999-05-07 2006-02-21 Medcohealth Solutions, Inc. Computer implemented resource allocation model and process to dynamically and optimally schedule an arbitrary number of resources subject to an arbitrary number of constraints in the managed care, health care and/or pharmacy industry
US7058949B1 (en) * 2000-11-08 2006-06-06 Unisys Corporation Operating system scheduler/dispatcher with randomized resource allocation and user manipulable weightings
CN105844447A (en) * 2015-02-04 2016-08-10 华美宏道公司 Systems and methods for managing tasks
CN108510213A (en) * 2018-05-11 2018-09-07 苏州华兴源创电子科技有限公司 Task is sequentially allocated to the method, apparatus, equipment and medium of task groups

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10810519B2 (en) * 2009-10-05 2020-10-20 The Boeing Company Hierarchical mission management
US20130311226A1 (en) * 2012-05-15 2013-11-21 Linda Lee Dreselly System and method to estimate resource allocations for a project
US20140207504A1 (en) * 2013-01-21 2014-07-24 International Business Machines Corporation System and method of calculating task efforts and applying the results for resource planning
CN104252391B (en) * 2013-06-28 2017-09-12 国际商业机器公司 Method and apparatus for managing multiple operations in distributed computing system
US20180018610A1 (en) * 2016-07-14 2018-01-18 Lendinghome Corp. Systems and methods for optimizing parallel task completion
US11107021B2 (en) * 2016-11-06 2021-08-31 Microsoft Technology Licensing, Llc Presenting and manipulating task items

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7003475B1 (en) * 1999-05-07 2006-02-21 Medcohealth Solutions, Inc. Computer implemented resource allocation model and process to dynamically and optimally schedule an arbitrary number of resources subject to an arbitrary number of constraints in the managed care, health care and/or pharmacy industry
US7058949B1 (en) * 2000-11-08 2006-06-06 Unisys Corporation Operating system scheduler/dispatcher with randomized resource allocation and user manipulable weightings
CN105844447A (en) * 2015-02-04 2016-08-10 华美宏道公司 Systems and methods for managing tasks
CN108510213A (en) * 2018-05-11 2018-09-07 苏州华兴源创电子科技有限公司 Task is sequentially allocated to the method, apparatus, equipment and medium of task groups

Also Published As

Publication number Publication date
CN110705884A (en) 2020-01-17

Similar Documents

Publication Publication Date Title
CN108595157B (en) Block chain data processing method, device, equipment and storage medium
KR101959153B1 (en) System for efficient processing of transaction requests related to an account in a database
US10002019B2 (en) System and method for assigning a transaction to a serialized execution group based on an execution group limit for parallel processing with other execution groups
CN111861225B (en) Task allocation method and device, electronic equipment and storage medium
CN110008018A (en) A kind of batch tasks processing method, device and equipment
CN112068957B (en) Resource allocation method, device, computer equipment and storage medium
JP7506096B2 (en) Dynamic allocation of computing resources
CN113256426B (en) Data processing method, device, equipment and medium
US9104496B2 (en) Submitting operations to a shared resource based on busy-to-success ratios
CN110716975B (en) Data interface generation method and data interface sharing platform
CN110705884B (en) List processing method, device, equipment and storage medium
CN110515954B (en) Data processing method, device, equipment and storage medium
CN112363914A (en) Parallel test resource configuration optimization method, computing device and storage medium
CN116319810A (en) Flow control method, device, equipment, medium and product of distributed system
CN114217790A (en) Interface scheduling method and device, electronic equipment and medium
CN114298585A (en) Material purchasing quota distribution method and device for purchasing scene
CN115129466A (en) Cloud computing resource hierarchical scheduling method, system, device and medium
CN111382178A (en) Network task allocation method, system, equipment and storage medium
CN111694670A (en) Resource allocation method, device, equipment and computer readable medium
CN112446754A (en) Method and device for processing orders
CN113138850A (en) Resource allocation method and device
CN112966876B (en) Order production scheduling method and device, electronic equipment and readable medium
CN114968586A (en) Data scheduling method, device and system
CN113344577A (en) Target account determination method and device, electronic equipment and storage medium
CN114625505A (en) Waybill task execution method and device, electronic equipment and computer readable medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20220927

Address after: 12 / F, 15 / F, 99 Yincheng Road, China (Shanghai) pilot Free Trade Zone, Pudong New Area, Shanghai, 200120

Patentee after: Jianxin Financial Science and Technology Co.,Ltd.

Address before: 25 Financial Street, Xicheng District, Beijing 100033

Patentee before: CHINA CONSTRUCTION BANK Corp.

Patentee before: Jianxin Financial Science and Technology Co.,Ltd.