CN117149731A - Daily cutting method, device, equipment and storage medium based on task nodes - Google Patents

Daily cutting method, device, equipment and storage medium based on task nodes Download PDF

Info

Publication number
CN117149731A
CN117149731A CN202311099746.8A CN202311099746A CN117149731A CN 117149731 A CN117149731 A CN 117149731A CN 202311099746 A CN202311099746 A CN 202311099746A CN 117149731 A CN117149731 A CN 117149731A
Authority
CN
China
Prior art keywords
cut
task
daily
nodes
day
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202311099746.8A
Other languages
Chinese (zh)
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.)
Chongqing Ant Consumer Finance Co ltd
Original Assignee
Chongqing Ant Consumer Finance 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 Chongqing Ant Consumer Finance Co ltd filed Critical Chongqing Ant Consumer Finance Co ltd
Priority to CN202311099746.8A priority Critical patent/CN117149731A/en
Publication of CN117149731A publication Critical patent/CN117149731A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/18File system types
    • G06F16/1805Append-only file systems, e.g. using logs or journals to store data
    • G06F16/1815Journaling file systems
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The specification discloses a daily cutting method, device, equipment and storage medium based on task nodes, wherein the method comprises the following steps: under the condition that the date cutting time of the current date is reached, acquiring a plurality of task nodes to be subjected to date cutting, wherein the types of different task nodes are different; determining a target daily cut sequence of the plurality of task nodes based on the types of the task nodes and daily cut dependency relationships among the plurality of task nodes; and controlling the task nodes to perform daily cutting according to the target daily cutting sequence.

Description

Daily cutting method, device, equipment and storage medium based on task nodes
Technical Field
The embodiment of the specification relates to the technical field of computers, in particular to a daily cutting method, device and equipment based on task nodes and a storage medium.
Background
With the development of network technology, more and more transactions are completed through the network. In order to ensure the accuracy of the transaction data, different transaction nodes switch the billing time every day, i.e. make daily cuts.
In the related art, as the number of transaction nodes increases, the complexity and diversity of daily cuts also increase, and how to effectively control daily cuts of a plurality of transaction nodes is a research hotspot.
Disclosure of Invention
The embodiment of the specification provides a daily cutting method, device, equipment and storage medium based on task nodes, which can effectively control a plurality of transaction nodes to perform daily cutting, and the technical scheme is as follows:
in one aspect, a day cutting method based on task nodes is provided, and the method comprises the following steps:
under the condition that the date cutting time of the current date is reached, acquiring a plurality of task nodes to be subjected to date cutting, wherein the types of different task nodes are different;
determining a target daily cut sequence of the plurality of task nodes based on the types of the task nodes and daily cut dependency relationships among the plurality of task nodes;
and controlling the task nodes to perform daily cutting according to the target daily cutting sequence.
In a possible implementation manner, in the case of reaching the date cut time of the current date, acquiring a plurality of task nodes to be subjected to date cut includes:
under the condition that the date cutting time of the current date is reached, acquiring a date processing task of the current date, wherein the date processing task is a date cutting task to be executed;
and determining the task nodes corresponding to the daily processing task.
In one possible implementation manner, the determining the target daily cut order of the plurality of task nodes based on the types of the task nodes and daily cut dependency relationships among the plurality of task nodes includes:
Determining an initial daily cut sequence of the plurality of task nodes based on the types of the task nodes;
and adjusting the initial day-cut sequence based on day-cut dependency relations among the plurality of task nodes to obtain the target day-cut sequence.
In one possible implementation manner, the adjusting the initial daily cut order based on the daily cut dependency relationship among the plurality of task nodes, to obtain the target daily cut order includes:
determining at least one node set from the plurality of task nodes, wherein the node set comprises at least two task nodes, and the task nodes in the node set have daily cut dependency relations;
and adjusting the positions of the task nodes in the at least one node set in the initial daily cutting sequence so that the task nodes in the same node set are adjacent to each other, and obtaining the target daily cutting sequence.
In one possible implementation manner, the plurality of task nodes include an accounting node and a plurality of transaction nodes, the accounting node is located after the plurality of transaction nodes in the target daily cut sequence, and the controlling the plurality of task nodes to perform daily cuts according to the target daily cut sequence includes:
Sequentially controlling the plurality of transaction nodes to perform daily cutting according to the target daily cutting sequence;
under the condition that the transaction nodes finish daily cutting, performing finishing detection on the transaction nodes and executing the accounting task of the accounting node;
and under the condition that the accounting task is completed, controlling the accounting node to perform daily cut.
In a possible implementation manner, the performing the completion detection on the plurality of transaction nodes and performing the accounting task of the accounting node when the plurality of transaction nodes complete the day-cut includes:
under the condition that the plurality of transaction nodes finish daily cutting, acquiring a plurality of daily cutting data of the plurality of transaction nodes and daily cutting states of the daily cutting data, wherein the daily cutting states are used for indicating whether daily cutting is finished or not;
and executing the accounting task of the accounting node under the condition that the day cut state of each day cut data is a complete day cut.
In one possible implementation manner, the performing the accounting task of the accounting node includes:
under the condition that the day cutting state of each day cutting data is a complete day cutting, processing settlement resource quantities of different departments;
And under the condition that the settlement resource quantity of different orders is processed, generating a resource accounting report.
In a possible implementation manner, the controlling the accounting node to make a day cut when the accounting task is completed includes:
performing balance check on resource transfer data of the accounting node under the condition that the accounting task is completed, wherein the resource transfer data comprises resource transfer-out data and resource transfer-in data;
and controlling the accounting node to perform daily cut under the condition that the resource transfer data passes the balance check.
In one possible implementation, the plurality of task nodes further includes a financial node, and controlling the accounting node to make a daily cut if the resource transfer data passes a balance check includes:
under the condition that the resource transfer data passes the balance check, sending a date cut instruction to the financial node, wherein the date cut instruction is used for indicating the financial node to conduct date cut;
and under the condition that the financial node completes the day cut, controlling the accounting node to conduct the day cut.
In one possible embodiment, the method further comprises:
generating a daily cut log of the task node under the condition that any one of the task nodes completes daily cut;
And/or the number of the groups of groups,
and under the condition that all the task nodes complete the date cut, generating a date cut log of the current date.
In one aspect, a task node-based day cutting device is provided, the device comprising:
the task node acquisition module is used for acquiring a plurality of task nodes to be subjected to day cutting under the condition that the day cutting time of the current date is reached, and the types of different task nodes are different;
the target daily cut sequence determining module is used for determining the target daily cut sequence of the plurality of task nodes based on the types of the task nodes and daily cut dependency relations among the plurality of task nodes;
and the daily cut control module is used for controlling the plurality of task nodes to perform daily cut according to the target daily cut sequence.
In a possible implementation manner, the task node obtaining module is configured to obtain a day processing task on a current date when a day cutting time on the current date is reached, where the day processing task is a day cutting task that needs to be executed; and determining the task nodes corresponding to the daily processing task.
In a possible implementation manner, the target daily cut sequence determining module is configured to determine an initial daily cut sequence of the plurality of task nodes based on a type of each task node; and adjusting the initial day-cut sequence based on day-cut dependency relations among the plurality of task nodes to obtain the target day-cut sequence.
In a possible implementation manner, the target daily cut order determining module is configured to determine at least one node set from the plurality of task nodes, where the node set includes at least two task nodes, and a daily cut dependency relationship exists between task nodes in the node set; and adjusting the positions of the task nodes in the at least one node set in the initial daily cutting sequence so that the task nodes in the same node set are adjacent to each other, and obtaining the target daily cutting sequence.
In a possible implementation manner, the plurality of task nodes include an accounting node and a plurality of transaction nodes, the accounting node is located after the plurality of transaction nodes in the target daily cut sequence, and the daily cut control module is used for sequentially controlling the plurality of transaction nodes to perform daily cuts according to the target daily cut sequence; under the condition that the transaction nodes finish daily cutting, performing finishing detection on the transaction nodes and executing the accounting task of the accounting node; and under the condition that the accounting task is completed, controlling the accounting node to perform daily cut.
In a possible implementation manner, the day cut control module is configured to obtain, when the plurality of transaction nodes complete day cuts, a plurality of day cut data of the plurality of transaction nodes and day cut states of the day cut data, where the day cut states are used to indicate whether day cuts are completed; and executing the accounting task of the accounting node under the condition that the day cut state of each day cut data is a complete day cut.
In one possible implementation manner, the day cut control module is configured to process the settlement resource amounts of different departments when the day cut states of the day cut data are all complete day cuts; and under the condition that the settlement resource quantity of different orders is processed, generating a resource accounting report.
In a possible implementation manner, the day cut control module is configured to perform balance checking on resource transfer data of the accounting node, where the resource transfer data includes resource roll-out data and resource roll-in data, when the accounting task is completed; and controlling the accounting node to perform daily cut under the condition that the resource transfer data passes the balance check.
In a possible implementation manner, the plurality of task nodes further comprise a financial node, and the day cut control module is configured to send a day cut instruction to the financial node, where the resource transfer data passes a balance check, and the day cut instruction is configured to instruct the financial node to make a day cut; and under the condition that the financial node completes the day cut, controlling the accounting node to conduct the day cut.
In one possible embodiment, the apparatus further comprises:
The log generation module is used for generating a daily cut log of the task node under the condition that any one of the task nodes completes daily cut; and/or generating a date cut log of the current date under the condition that all the task nodes complete date cut.
In one aspect, a computer device is provided that includes one or more processors and one or more memories having at least one computer program stored therein, the computer program loaded and executed by the one or more processors to implement the task node based day cut method.
In one aspect, a computer readable storage medium having at least one computer program stored therein is provided, the computer program being loaded and executed by a processor to implement the task node based day cut method.
In one aspect, a computer program product or a computer program is provided, the computer program product or computer program comprising a program code, the program code being stored in a computer readable storage medium, the program code being read from the computer readable storage medium by a processor of a computer device, the program code being executed by the processor, causing the computer device to perform the task node based day cut method described above.
According to the technical scheme provided by the embodiment of the specification, under the condition that the date and time of the current date is reached, a plurality of task nodes to be subjected to date and time cutting are obtained, and the types of different task nodes are different. Based on the type of each task node and the daily cut dependency relationship among the plurality of task nodes, a target daily cut order of the plurality of task nodes is determined. The plurality of task nodes are controlled to perform daily cutting according to the target daily cutting sequence, so that the daily cutting of a plurality of task nodes of different types can be completed, the daily cutting difficulty is reduced, and the daily cutting efficiency is improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present description, the following description will briefly explain the drawings needed in the description of the embodiments, and it is obvious that the drawings in the following description are only some embodiments of the present description, and that other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic diagram of an implementation environment of a task node-based day cut method provided in an embodiment of the present disclosure;
FIG. 2 is a flowchart of a task node-based day cut method provided in an embodiment of the present disclosure;
FIG. 3 is a flow chart of another task node-based day cut method provided by embodiments of the present disclosure;
FIG. 4 is a flowchart of yet another task node-based day cut method provided by an embodiment of the present disclosure;
fig. 5 is a schematic structural diagram of a day cutting device based on task nodes according to an embodiment of the present disclosure;
fig. 6 is a schematic structural diagram of a terminal according to an embodiment of the present disclosure;
fig. 7 is a schematic structural diagram of a server according to an embodiment of the present disclosure.
Detailed Description
For the purposes of clarity, technical solutions and advantages of the present specification, the following description will describe embodiments of the present specification in further detail with reference to the accompanying drawings.
The terms "first," "second," and the like in this specification are used for distinguishing between similar elements or items having substantially the same function and function, and it should be understood that there is no logical or chronological dependency between the terms "first," "second," and "n," and that there is no limitation on the number and order of execution.
Day cutting: colloquially, the time to change the billing of the system, the system switches from the current day to the next day, and transactions can be submitted and processed correctly back as usual during day-cut.
And (3) middleware: the middleware is a type of software between the application system and the system software, uses basic services (functions) provided by the system software to connect various parts of the application system or different applications on the network, and can achieve the purposes of resource sharing and function sharing.
Library table: refers to a medium for storing data, and in the embodiment of the present specification, the database table is a hundred database table.
Accounting: the method is an economic management activity which uses currency as a main measurement unit and uses a special method to continuously, systematically and comprehensively reflect and supervise the economic activities of enterprises or other economic organizations. Specifically, accounting is the accounting and supervision of certain subjects' economic activities and provides accounting information to related aspects.
Finance: refers to the activity of an enterprise involving funds in the production process, indicating the formal nature of finance.
Service provider interface (Service Provider Interface, SPI): is a vendor-provided application program interface meeting certain service standards, and the SPI and the application program interface (Application Programming Interface, API) of the service are compatible.
It should be noted that, information (including but not limited to user equipment information, user personal information, etc.), data (including but not limited to data for analysis, stored data, presented data, etc.), and signals referred to in this specification are all authorized by the user or are fully authorized by the parties, and the collection, use, and processing of relevant data is required to comply with relevant laws and regulations and standards of relevant countries and regions.
Fig. 1 is a schematic diagram of an implementation environment of a task node-based day cut method according to an embodiment of the present disclosure, and referring to fig. 1, an accounting platform 110, a finance platform 120, and a transaction platform 140 may be included in the implementation environment.
Accounting platform 110 is an independent physical accounting platform, or an accounting platform cluster or a distributed system formed by a plurality of physical accounting platforms, or a cloud accounting platform providing cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, distribution networks (Content Delivery Network, CDN), and basic cloud computing services such as big data and artificial intelligence platforms. The accounting platform 110 is used for performing accounting-related processing, and in this embodiment of the present disclosure, the accounting platform 110 is used for executing the day-cut method based on task nodes provided in this embodiment of the present disclosure, where the accounting platform 110 also belongs to one task node.
The financial platform 120 is connected with the accounting platform 110 through a wired network or a wireless network, and the financial platform 120 is an independent physical accounting platform, or an accounting platform cluster or a distributed system formed by a plurality of physical accounting platforms, or a cloud accounting platform for providing cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, distribution networks, basic cloud computing services such as big data and artificial intelligence platforms, and the like. Finance platform 120 is used to perform finance-related processing, finance platform 120 belongs to the task node in this specification embodiment.
The transaction platform 140 is connected with the accounting platform 110 and the financial platform 120 through a wired network or a wireless network, the transaction platform 140 is an independent physical accounting platform, or an accounting platform cluster or a distributed system formed by a plurality of physical accounting platforms, or a cloud accounting platform for providing cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, distribution networks, basic cloud computing services such as big data and artificial intelligent platforms, and the like. The transaction platform 140 is used for performing transaction-related processing, and the transaction platform 140 belongs to task nodes in the embodiment of the present specification.
Those skilled in the art will appreciate that the number of transaction platforms described above may be greater or lesser. Such as only one terminal, or tens or hundreds, or more, other terminals are also included in the implementation environment. The number of terminals and the type of devices are not limited in the embodiment of the present specification.
After the implementation environment of the embodiments of the present specification is introduced, the application scenario of the embodiments of the present specification is described below. The daily cutting method based on the task nodes provided by the embodiment of the specification can be applied to various scenes needing daily cutting. For example, the technical solution provided in the embodiments of the present disclosure may be applied to a scenario where multiple departments of an enterprise make a day cut, where each of the multiple departments serves as a task node in the day cut, and the multiple departments include an accounting department. In the embodiment of the present specification, day cutting for a plurality of departments is performed by an accounting platform, which is a platform corresponding to the accounting department. Under the condition that the date and time of the current date is reached, the accounting platform acquires a plurality of task nodes to be subjected to date and time cutting, and the types of different task nodes are different, wherein the types refer to the departments. The accounting platform determines a target date cutting sequence of a plurality of task nodes based on the types of the task nodes and date cutting dependency relations among the task nodes, wherein the date cutting dependency relations refer to that one task node starts date cutting and depends on another task node to complete date cutting. And the accounting platform controls the task nodes to cut according to the target cut sequence, namely, the cut of the departments is realized.
After describing the implementation environment and the application scenario of the embodiments of the present disclosure, the task node-based day-cut method provided in the embodiments of the present disclosure is described below, referring to fig. 2, taking an execution subject as an accounting platform as an example, where the method includes the following steps.
202. Under the condition that the date cutting time of the current date is reached, the accounting platform acquires a plurality of task nodes to be subjected to date cutting, and the types of different task nodes are different.
The time of day cutting refers to the time required for day cutting, and the time of day cutting is set or adjusted by a technician according to actual conditions, which is not limited in the embodiment of the present specification. In some embodiments, the cut time is a periodic cut time, i.e., after the cut time is configured, the cut is triggered at each cut time per day. The accounting platform is a platform corresponding to an accounting department, and the accounting department can conduct accounting-related processing through the accounting platform. The task nodes are nodes requiring daily cutting, the types of the task nodes refer to departments, and correspondingly, a plurality of task nodes represent a plurality of departments of the same enterprise, and of course, task nodes corresponding to accounting departments exist in the plurality of task nodes.
204. The accounting platform determines a target daily cut order of the plurality of task nodes based on the type of each task node and the daily cut dependency relationship between the plurality of task nodes.
The day-cut dependency relationship means that the start day-cut of one task node depends on the completion of day-cut of another task node, for example, a task node A and a task node B exist in the plurality of task nodes, and the day-cut of the task node B depends on the completion of day-cut of the task node A. The target daily cutting sequence of the plurality of task nodes is the sequence of daily cutting of the plurality of task nodes.
206. And the accounting platform controls the task nodes to perform daily cutting according to the target daily cutting sequence.
According to the technical scheme provided by the embodiment of the specification, under the condition that the date and time of the current date is reached, a plurality of task nodes to be subjected to date and time cutting are obtained, and the types of different task nodes are different. Based on the type of each task node and the daily cut dependency relationship among the plurality of task nodes, a target daily cut order of the plurality of task nodes is determined. The plurality of task nodes are controlled to perform daily cutting according to the target daily cutting sequence, so that the daily cutting of a plurality of task nodes of different types can be completed, the daily cutting difficulty is reduced, and the daily cutting efficiency is improved.
It should be noted that, the steps 202 to 206 are simple descriptions of the technical solutions provided in the embodiments of the present disclosure, and the technical solutions provided in the embodiments of the present disclosure will be more clearly described below with reference to fig. 3, and the method includes the following steps taking the execution subject as an example of an accounting platform.
302. Under the condition that the date cutting time of the current date is reached, the accounting platform acquires a plurality of task nodes to be subjected to date cutting, and the types of different task nodes are different.
The time of day cutting refers to the time required for day cutting, and the time of day cutting is set or adjusted by a technician according to actual conditions, which is not limited in the embodiment of the present specification. In some embodiments, the cut time is a periodic cut time, i.e., after the cut time is configured, the cut is triggered at each cut time per day. The accounting platform is a platform corresponding to an accounting department, and the accounting department can conduct accounting-related processing through the accounting platform. The task nodes are nodes requiring daily cutting, the types of the task nodes refer to departments, and correspondingly, a plurality of task nodes represent a plurality of departments of the same enterprise, and of course, task nodes corresponding to accounting departments exist in the plurality of task nodes. In some embodiments, the task node is a platform corresponding to a department, personnel of the department can process business related to the department on the corresponding platform, business data of the department is stored in the task node, and the business data needs to be checked when the task node makes a daily cut, so the business data is also called daily cut data.
In one possible implementation, in the case of reaching the date-cut time of the current date, the accounting platform obtains the date-treatment task of the current date, where the date-treatment task is the date-cut task that needs to be executed. The accounting platform determines the task nodes corresponding to the daily processing task.
The day processing task on the current date refers to a day cutting task to be executed on the current date, and a task configuration of the day processing task carries a plurality of task nodes to be day-cut. In some embodiments, the accounting platform uses the target middleware to execute a defined cron expression to make a determination as to whether the time has reached the time of day.
In this embodiment, when the date and time of the current date is reached, the current date and time processing task is acquired, and a plurality of task nodes may be directly acquired from the task configuration of the current date and time processing task, so that the task node acquisition efficiency is high. In addition, as the task configuration can be adjusted according to the needs, the flexibility of the task nodes is improved.
For example, in the case of reaching the day cut time of the current date, the accounting platform executes a day cut management task and an accounting day cut task to obtain a task configuration of the day processing task of the current date, wherein the day cut management task refers to a day cut management task for other departments, and the accounting day cut task refers to a day cut task for an accounting department. The accounting platform obtains the plurality of task nodes from the task configuration. The task configuration is set by a technician according to actual situations, for example, the technician can delete or add task nodes in the task configuration according to needs, which is not limited in the embodiment of the present disclosure. In some embodiments, the task configuration also carries the type of task nodes and the daily cut dependencies between task nodes.
For example, in the case of reaching the day cut time of the current date, the accounting platform executes the day cut management task and accounts for the day cut task to acquire the task configuration of the day processing task of the current date. The accounting platform displays a plurality of candidate task nodes carried by the task configuration. And responding to the selection operation of the plurality of candidate task nodes, and determining the plurality of task nodes corresponding to the daily processing task from the plurality of candidate task nodes. In the embodiment, the user of the accounting platform can select the task node according to the requirement, and the flexibility of selecting the task node is higher.
In one possible implementation, the accounting platform obtains the plurality of task nodes from a day cut profile of the current date if the day cut time of the current date is reached.
The daily cut configuration file is set by a technician according to actual situations, for example, the technician can delete or add task nodes in the daily cut configuration file according to needs, which is not limited in the embodiment of the present specification. In some embodiments, the cut-to-date profile also carries the type of task nodes and cut-to-date dependencies between task nodes.
In this embodiment, the plurality of task nodes can be obtained directly from the day cut configuration file, and the obtaining efficiency of the plurality of task nodes is high.
It should be noted that, the accounting platform can obtain a plurality of task nodes through any of the above embodiments, which is not limited in this embodiment of the present disclosure.
Optionally, after step 302, the accounting platform is also capable of performing the following steps.
In one possible implementation, the accounting platform performs exclusive lock control.
The exclusive lock control is performed to prevent data inconsistency caused by high concurrency and ensure accuracy of day cutting. After the exclusive lock control is performed, only one task node is cut every day at a time, so that the accuracy of the cut every day is ensured.
In some embodiments, the accounting platform performs exclusive lock control through a database row lock, which is a locking mechanism for a single record in the database, which can prevent other sessions from modifying or deleting the same row of data, thereby ensuring consistency and integrity of the data.
In one possible implementation, the accounting platform creates a daily cut log in which content is filled during subsequent daily cuts to ensure traceability of the daily cut.
304. The accounting platform determines a target daily cut order of the plurality of task nodes based on the type of each task node and the daily cut dependency relationship between the plurality of task nodes.
The day-cut dependency relationship means that the start day-cut of one task node depends on the completion of day-cut of another task node, for example, a task node A and a task node B exist in the plurality of task nodes, and the day-cut of the task node B depends on the completion of day-cut of the task node A. The target daily cutting sequence of the plurality of task nodes is the sequence of daily cutting of the plurality of task nodes. In some embodiments, the plurality of task nodes arranged in the target cut-to-cut order is also referred to as cut-to-cut links. In the daily cut link, there is an upstream-downstream relationship between task nodes, where the upstream-downstream relationship indicates a sequence of performing daily cuts of the task nodes, for example, there are task node a and task node B in the daily cut link, where the daily cut time of task node a is earlier than the daily cut time of task node B, so that task node a is an upstream node of task node B, and task node B is a downstream node of task node a.
In one possible implementation, the accounting platform determines an initial daily cut order for the plurality of task nodes based on the type of each task node. And the accounting platform adjusts the initial day cutting sequence based on the day cutting dependency relationship among the task nodes to obtain the target day cutting sequence.
In the embodiment, the initial daily cutting sequence is determined based on the types of the task nodes, and then the initial daily cutting sequence is adjusted according to the daily cutting dependency relationship among the task nodes to obtain the target daily cutting sequence, wherein the target daily cutting sequence combines the types and the daily cutting dependency relationship, and the accuracy is high.
In order to more clearly describe the above embodiments, the above embodiments will be described below in two parts.
The first part, the accounting platform, determines an initial daily cut order of the plurality of task nodes based on the type of each task node.
In one possible implementation, the accounting platform determines the priority of each task node based on the type of each task node. The accounting platform determines an initial daily cut order of the plurality of task nodes based on the priorities of the respective task nodes.
The corresponding relation between the type of the task node and the priority is set by a technician according to the actual situation, which is not limited in the embodiment of the present specification.
In this embodiment, the priorities of the respective task nodes are determined based on the types of the respective task nodes, and the initial daily cut order of the plurality of task nodes is determined based on the priorities, with the types of the task nodes being fully utilized.
For example, the accounting platform queries based on the type of each task node to obtain the priority of each task node. The accounting platform determines the ranking of each task node based on the priority of each task node, wherein the higher the priority is, the higher the ranking is. The accounting platform determines an initial daily cut order for the plurality of task nodes based on the ranking of the respective task nodes.
And the second part and the accounting platform adjust the initial daily cutting sequence based on daily cutting dependency relations among the task nodes to obtain the target daily cutting sequence.
In one possible implementation, the accounting platform determines at least one set of nodes from the plurality of task nodes, the set of nodes including at least two task nodes, the task nodes in the set of nodes having a daily cut dependency relationship therebetween. And the accounting platform adjusts the positions of the task nodes in the at least one node set in the initial daily cutting sequence so that the task nodes in the same node set are adjacent to each other, and the target daily cutting sequence is obtained.
In such an embodiment, at least one set of nodes is determined from the plurality of tasks, the task nodes in the set of nodes having a daily cut dependency relationship therebetween. And the initial daily cutting sequence is adjusted by utilizing at least one node set, so that a target daily cutting sequence is obtained, the target daily cutting sequence fully fuses daily cutting dependency relations among task nodes, and the rationality of the target daily cutting sequence is higher.
In some embodiments, in addition to determining the target daily cut sequence through step 304 described above, the target daily cut sequence can be configured by a technician according to actual conditions, for example, the target daily cut sequence can be configured through the following steps.
In one possible implementation, prior to step 302, the accounting platform displays a day cut order configuration interface for configuring the day cut order of the task nodes. In response to an operation on the cut order configuration interface, the accounting platform determines a reference cut order for a plurality of candidate task nodes, the plurality of candidate task nodes being all task nodes available for selection. Under the condition that the date and time of the current date and time is reached, the accounting platform obtains a plurality of task nodes to be subjected to date and time cutting, and the plurality of task nodes belong to the plurality of candidate task nodes. The accounting platform determines a target daily cut order for the plurality of task nodes based on the reference daily cut order.
In the embodiment, the reference daily cutting sequence is configured through the daily cutting sequence configuration interface, the target daily cutting sequence of the plurality of task nodes is determined by utilizing the reference daily cutting sequence, and the accuracy and the suitability of the target daily cutting sequence are improved.
For example, the accounting platform displays a day cut order configuration interface that includes a plurality of candidate task nodes. In response to a drag operation on the candidate task nodes, the accounting platform determines a reference daily cut order for the plurality of candidate task nodes. Under the condition that the date and time of the current date is reached, the accounting platform acquires a plurality of task nodes to be subjected to date and time cutting. And the accounting platform sorts the task nodes according to the sequence indicated by the reference daily cutting sequence to obtain the target daily cutting sequence.
306. And the accounting platform controls the task nodes to perform daily cutting according to the target daily cutting sequence.
In some embodiments, the accounting platform may use the exclusive lock to control the daily cutting of the plurality of task nodes in the process of controlling the plurality of task nodes to perform daily cutting according to the target daily cutting sequence, that is, only one task node is controlled to perform daily cutting at a time, so as to ensure the accuracy of daily cutting.
In one possible implementation manner, the plurality of task nodes include an accounting node and a plurality of transaction nodes, and the accounting node is located after the plurality of transaction nodes in the target daily cut sequence, and the accounting platform sequentially controls the plurality of transaction nodes to perform daily cuts according to the target daily cut sequence. And under the condition that the transaction nodes complete daily cutting, the accounting platform performs finishing detection on the transaction nodes and executes accounting tasks of the accounting nodes. Under the condition that the accounting task is completed, the accounting platform controls the accounting node to make daily cuts.
The accounting nodes are task nodes corresponding to the accounting departments, namely the accounting platform, and the accounting platform controls other departments to perform daily cutting and also needs to perform daily cutting. The back office node refers to a task node corresponding to a back office, the back office refers to a department other than an accounting department and a financial department, the back office is a department executing a specific back office in an enterprise, the number of back offices and the type of executing the back office vary according to the setting of the enterprise, and the embodiment of the present specification is not limited thereto. The completion detection is used for detecting whether the transaction nodes complete the day cut, and the accounting task is the task executed by the accounting node before the day cut is completed and is set by a technician according to the actual situation.
Under the implementation mode, a plurality of transaction nodes are controlled to perform daily cutting, under the condition that the plurality of transaction nodes complete daily cutting, the plurality of transaction nodes are subjected to finishing detection and the accounting tasks of the accounting nodes are executed, under the condition that the accounting tasks are completed, the accounting nodes are controlled to perform daily cutting so as to complete daily cutting of the plurality of task nodes, and the accuracy of daily cutting of the plurality of task nodes is ensured.
In order to more clearly describe the above embodiments, the above embodiments will be described below in sections.
And the first part and the accounting platform sequentially control the transaction nodes to perform daily cutting according to the target daily cutting sequence.
In one possible implementation, the accounting platform sequentially sends day-cut instructions to the plurality of transaction nodes according to the target day-cut order to control the plurality of transaction nodes to make day-cuts.
The daily cut instruction is used for indicating the transaction node to perform daily cut.
Under the implementation mode, when the transaction nodes need to be controlled to perform day cutting, the accounting platform sequentially sends day cutting instructions to the transaction nodes according to the target day cutting sequence so as to instruct the transaction nodes to perform day cutting, and high-efficiency control of the day cutting of the transaction nodes is achieved.
For example, the accounting platform sends a daily cut instruction to a first transaction node of the plurality of transaction nodes in the target daily cut order. And under the condition that the date cutting completion prompt of the first transaction node is received, the accounting platform sends a date cutting instruction to a second transaction node in the plurality of transaction nodes according to the target date cutting sequence. Under the condition that the date cutting completion prompt of the second transaction node is received, the accounting platform sequentially sends the date cutting instructions to other transaction nodes in the transaction nodes according to the target date cutting sequence until the date cutting completion prompt of the last transaction node in the transaction nodes is received, wherein the date cutting completion prompt indicates that all the transaction nodes are completed.
And the second part, when the plurality of transaction nodes finish date cutting, the accounting platform performs end detection on the plurality of transaction nodes and executes accounting tasks of the accounting nodes.
The transaction nodes are upstream nodes of the accounting node, and the transaction nodes are subjected to finishing detection, namely the upstream nodes are subjected to finishing detection, so that whether the upstream nodes finish daily cutting or not is determined, the daily cutting of the transaction nodes in a daily cutting link is guaranteed, and meanwhile data are not missed. In the process of performing finish detection on the upstream node, the accounting platform performs message backlog detection to determine whether unprocessed daily cut data exists or not, so that the daily cut data is prevented from being missed. After the message backlog check is completed, the accounting platform queries the state of day cut data stored in the separate library table, wherein the state comprises a complete day cut and an incomplete day cut. And the accounting platform filters the day cut data stored in the database table based on the state of the day cut data to obtain reference day cut data, wherein the state of the reference day cut data is the condition that the day cut is not completed. The accounting platform splits the reference date cut data and date cuts the split reference date cut data.
In one possible implementation, in a case that the plurality of transaction nodes complete the day cut, the accounting platform obtains a plurality of day cut data of the plurality of transaction nodes and a day cut state of each day cut data, where the day cut state is used to indicate whether the day cut is completed. And under the condition that the day cut state of each day cut data is the complete day cut, the accounting platform executes the accounting task of the accounting node. Under the condition that the day cutting state of each day cutting data is the complete day cutting, the accounting platform processes the settlement resource quantity of different departments. Under the condition that the settlement resource quantity of different orders is processed, the accounting platform generates a resource accounting report. Under the condition of generating a resource accounting report, the accounting platform controls the accounting node to make daily cuts.
And the third part, under the condition that the accounting task is completed, the accounting platform controls the accounting node to perform daily cut.
In one possible embodiment, the accounting platform performs a balance check on the accounting node's resource transfer data, including resource roll-out data and resource roll-in data, upon completion of the accounting task. In the case that the resource transfer data passes the balance check, the accounting platform controls the accounting node to make a daily cut.
The balance check is a basic accounting checking means, under the lending and billing method, there is a lending and loan, the lending and loan are equal, and accounting errors are reduced by comparing the balances of the lending and the loan.
For example, the plurality of task nodes further includes a financial node, and the accounting platform performs a balance check on the resource transfer data of the accounting node in the event that the accounting task is completed. And under the condition that the resource transfer-out data and the resource transfer-in data are the same, the accounting platform sends a day-cut instruction to the financial node, and the day-cut instruction is used for indicating the financial node to perform day-cut. Under the condition that the financial node completes the day cut, the accounting platform controls the accounting node to conduct the day cut.
The financial node is a task node corresponding to a financial department, the financial department is used as a department for producing financial report of an enterprise, and is the last node on a daily cut link, namely, the upstream transaction data is finally summarized and daily cut is carried out.
Optionally, in a case that any task node of the plurality of task nodes completes the daily cut, the accounting platform generates a daily cut log of the task node. That is, each time a task node on a daily cut link completes a daily cut, a log will be dropped in the database, so as to conveniently track the link execution condition.
308. And under the condition that all the task nodes complete the day cut, the accounting platform generates a day cut log of the current date.
In order to more clearly describe the technical solution provided in the embodiment of the present disclosure, the steps 302 to 308 will be described below with reference to fig. 4.
Referring to fig. 4, in case of reaching the day cut time of the current date, the accounting platform performs a day cut management task and an accounting day cut task, and pushes the management day cut by the management day cut schedule and the accounting day cut schedule. The accounting platform obtains the task configuration of the day processing task of the current date, and a plurality of task nodes are obtained from the task configuration. The accounting platform performs exclusive lock control on the task nodes, and determines a decision accounting date state, wherein the decision accounting date state is used for indicating whether the daily processing task is completed. Under the condition that the day processing task is not completed, the accounting platform creates a day-to-day log, namely, a day-to-day log of the current date. And the accounting platform pushes the task nodes to perform day cutting according to the target day cutting sequence, and in the control process, the upstream node of the accounting node is pushed to perform day cutting. Under the condition that the upstream node finishes daily cut, the accounting platform performs finishing detection on the upstream node, and in the process of performing finishing detection on the upstream node, the accounting platform performs message backlog detection to determine whether unprocessed daily cut data exists or not, so that the daily cut data is prevented from being missed. After the message backlog check is completed, the accounting platform queries the state of day cut data stored in the separate library table, wherein the state comprises a complete day cut and an incomplete day cut. And the accounting platform filters the day cut data stored in the database table based on the state of the day cut data to obtain reference day cut data, wherein the state of the reference day cut data is the condition that the day cut is not completed. The accounting platform splits the reference date cut data and date cuts the split reference date cut data. And under the condition that the completion detection of the upstream node is finished, the accounting platform carries out the detection of the accounting node on the accounting node. And under the condition that the detection of the accounting node is completed, the accounting platform performs balance check on the resource transfer data of the accounting node. In the case that the resource transfer data passes the balance check, the metering platform sends a day cut instruction to the financial node, the day cut instruction being for instructing the financial node to make a day cut. Under the condition that the financial node completes the day cut, the accounting platform controls the accounting node to conduct the day cut.
All the above optional solutions may be combined arbitrarily to form an optional embodiment of the present specification, which is not described herein.
According to the technical scheme provided by the embodiment of the specification, under the condition that the date and time of the current date is reached, a plurality of task nodes to be subjected to date and time cutting are obtained, and the types of different task nodes are different. Based on the type of each task node and the daily cut dependency relationship among the plurality of task nodes, a target daily cut order of the plurality of task nodes is determined. The plurality of task nodes are controlled to perform daily cutting according to the target daily cutting sequence, so that the daily cutting of a plurality of task nodes of different types can be completed, the daily cutting difficulty is reduced, and the daily cutting efficiency is improved.
Fig. 5 is a schematic structural diagram of a task node-based day cutting device according to an embodiment of the present disclosure, and referring to fig. 5, the device includes: a task node acquisition module 501, a target date cut order determination module 502, and a date cut control module 503.
The task node obtaining module 501 is configured to obtain a plurality of task nodes to be day-cut when the day-cut time of the current date is reached, where different task nodes are different in type.
The target daily cut order determining module 502 is configured to determine a target daily cut order of the plurality of task nodes based on a type of each of the task nodes and daily cut dependency relationships among the plurality of task nodes.
And the daily cut control module 503 is configured to control the plurality of task nodes to perform daily cuts according to the target daily cut sequence.
In a possible implementation manner, the task node obtaining module 501 is configured to obtain, when the day cut time of the current date arrives, a day processing task of the current date, where the day processing task is a day cut task that needs to be executed. And determining the task nodes corresponding to the daily processing task.
In a possible implementation manner, the target daily cut sequence determining module 502 is configured to determine an initial daily cut sequence of the plurality of task nodes based on a type of each of the task nodes. And adjusting the initial date cutting sequence based on the date cutting dependency relationship among the plurality of task nodes to obtain the target date cutting sequence.
In a possible implementation manner, the target daily cut order determining module 502 is configured to determine at least one node set from the plurality of task nodes, where the node set includes at least two task nodes, and a daily cut dependency relationship between task nodes in the node set. And adjusting the positions of the task nodes in the at least one node set in the initial daily cutting sequence so that the task nodes in the same node set are adjacent to each other, and obtaining the target daily cutting sequence.
In a possible implementation manner, the plurality of task nodes include an accounting node and a plurality of transaction nodes, the accounting node is located after the plurality of transaction nodes in the target daily cut sequence, and the daily cut control module 503 is configured to sequentially control the plurality of transaction nodes to perform daily cuts according to the target daily cut sequence. And under the condition that the transaction nodes finish date cutting, performing ending detection on the transaction nodes and executing the accounting task of the accounting node. And when the accounting task is completed, controlling the accounting node to perform daily cutting.
In a possible implementation manner, the day cut control module 503 is configured to obtain, when the plurality of transaction nodes complete day cuts, a plurality of day cut data of the plurality of transaction nodes and day cut states of the day cut data, where the day cut states are used to indicate whether day cuts are completed. And executing the accounting task of the accounting node when the date cut state of each date cut data is a complete date cut.
In one possible implementation, the day cut control module 503 is configured to process the settlement resource amounts of different departments when the day cut states of the day cut data are all complete day cuts. And under the condition that the settlement resource quantity of different orders is processed, generating a resource accounting report.
In a possible implementation manner, the day cut control module 503 is configured to perform a balance check on the resource transfer data of the accounting node, where the resource transfer data includes resource roll-out data and resource roll-in data when the accounting task is completed. In the case where the resource transfer data passes the balance check, the accounting node is controlled to make a daily cut.
In a possible implementation manner, the plurality of task nodes further include a financial node, and the day cut control module 503 is configured to send a day cut instruction to the financial node, where the resource transfer data passes the balance check, and the day cut instruction is configured to instruct the financial node to make a day cut. And controlling the accounting node to perform day cutting under the condition that the financial node completes day cutting.
In one possible embodiment, the apparatus further comprises:
and the log generation module is used for generating a daily cut log of any task node in the plurality of task nodes when the daily cut is completed by the task node. And/or, generating a day cut log of the current date when the plurality of task nodes all complete day cuts.
It should be noted that: in the day cutting device based on task nodes provided in the above embodiment, only the division of the above functional modules is used for illustrating when the day cutting is performed based on task nodes, and in practical application, the above functional allocation may be performed by different functional modules according to needs, that is, the internal structure of the computer device is divided into different functional modules, so as to complete all or part of the functions described above. In addition, the task node-based day cutting device provided in the above embodiment and the task node-based day cutting method embodiment belong to the same concept, and detailed implementation processes of the task node-based day cutting device are detailed in the method embodiment, and are not described herein.
According to the technical scheme provided by the embodiment of the specification, under the condition that the date and time of the current date is reached, a plurality of task nodes to be subjected to date and time cutting are obtained, and the types of different task nodes are different. Based on the type of each task node and the daily cut dependency relationship among the plurality of task nodes, a target daily cut order of the plurality of task nodes is determined. The plurality of task nodes are controlled to perform daily cutting according to the target daily cutting sequence, so that the daily cutting of a plurality of task nodes of different types can be completed, the daily cutting difficulty is reduced, and the daily cutting efficiency is improved.
Embodiments of the present disclosure provide a computer device for performing the above method, which may be implemented as the above accounting platform.
Fig. 6 is a schematic structural diagram of a computer device according to an embodiment of the present disclosure. The computer device 600 may be: smart phones, tablet computers, notebook computers or desktop computers. The computer device 600 may also be referred to by other names as user device, portable computer device, laptop computer device, desktop computer device, etc.
In general, the computer device 600 includes: one or more processors 601 and one or more memories 602.
Processor 601 may include one or more processing cores, such as a 4-core processor, an 8-core processor, and the like. The processor 601 may be implemented in at least one hardware form of DSP (Digital Signal Processing ), FPGA (Field-Programmable Gate Array, field programmable gate array), PLA (Programmable Logic Array ). The processor 601 may also include a main processor, which is a processor for processing data in an awake state, also called a CPU (Central Processing Unit ), and a coprocessor; a coprocessor is a low-power processor for processing data in a standby state. In some embodiments, the processor 601 may integrate a GPU (Graphics Processing Unit, image processor) for rendering and drawing of content required to be displayed by the display screen. In some embodiments, the processor 601 may also include an AI (Artificial Intelligence ) processor for processing computing operations related to machine learning.
The memory 602 may include one or more computer-readable storage media, which may be non-transitory. The memory 602 may also include high-speed random access memory, as well as non-volatile memory, such as one or more magnetic disk storage devices, flash memory storage devices. In some embodiments, a non-transitory computer readable storage medium in memory 602 is used to store at least one computer program for execution by processor 601 to implement the task node-based day cut method provided by the method embodiments in this specification.
In some embodiments, the computer device 600 may further optionally include: a peripheral interface 603, and at least one peripheral. The processor 601, memory 602, and peripheral interface 603 may be connected by a bus or signal line. The individual peripheral devices may be connected to the peripheral device interface 603 via buses, signal lines or a circuit board. Specifically, the peripheral device includes: at least one of radio frequency circuitry 604, a display 605, a camera assembly 606, audio circuitry 607, and a power supply 608.
Peripheral interface 603 may be used to connect at least one Input/Output (I/O) related peripheral to processor 601 and memory 602. In some embodiments, the processor 601, memory 602, and peripheral interface 603 are integrated on the same chip or circuit board; in some other embodiments, either or both of the processor 601, memory 602, and peripheral interface 603 may be implemented on separate chips or circuit boards, which is not limited in this embodiment.
The Radio Frequency circuit 604 is configured to receive and transmit RF (Radio Frequency) signals, also known as electromagnetic signals. The radio frequency circuit 604 communicates with a communication network and other communication devices via electromagnetic signals. The radio frequency circuit 604 converts an electrical signal into an electromagnetic signal for transmission, or converts a received electromagnetic signal into an electrical signal. Optionally, the radio frequency circuit 604 includes: antenna systems, RF transceivers, one or more amplifiers, tuners, oscillators, digital signal processors, codec chipsets, subscriber identity module cards, and so forth.
The display screen 605 is used to display a UI (User Interface). The UI may include graphics, text, icons, video, and any combination thereof. When the display 605 is a touch display, the display 605 also has the ability to collect touch signals at or above the surface of the display 605. The touch signal may be input as a control signal to the processor 601 for processing. At this point, the display 605 may also be used to provide virtual buttons and/or virtual keyboards, also referred to as soft buttons and/or soft keyboards.
The camera assembly 606 is used to capture images or video. Optionally, the camera assembly 606 includes a front camera and a rear camera. Typically, the front camera is disposed on a front panel of the computer device and the rear camera is disposed on a rear surface of the computer device.
The audio circuit 607 may include a microphone and a speaker. The microphone is used for collecting sound waves of users and environments, converting the sound waves into electric signals, and inputting the electric signals to the processor 601 for processing, or inputting the electric signals to the radio frequency circuit 604 for voice communication.
The power supply 608 is used to power the various components in the computer device 600. The power source 608 may be alternating current, direct current, disposable or rechargeable.
In some embodiments, the computer device 600 further includes one or more sensors 609. The one or more sensors 609 include, but are not limited to: acceleration sensor 610, gyroscope sensor 611, pressure sensor 612, optical sensor 613, and proximity sensor 614.
The acceleration sensor 610 may detect the magnitudes of accelerations on three coordinate axes of a coordinate system established with the computer device 600.
The gyro sensor 611 may be used to collect 3D motion of the user on the computer device 600 in conjunction with the acceleration sensor 610, and the gyro sensor 611 may be used to collect the body direction and the rotation angle of the computer device 600.
Pressure sensor 612 may be disposed on a side frame of computer device 600 and/or on an underlying layer of display 605. When the pressure sensor 612 is disposed on a side frame of the computer device 600, a grip signal of the computer device 600 by a user may be detected, and the processor 601 performs a left-right hand recognition or a shortcut operation according to the grip signal collected by the pressure sensor 612. When the pressure sensor 612 is disposed at the lower layer of the display screen 605, the processor 601 controls the operability control on the UI interface according to the pressure operation of the user on the display screen 605.
The optical sensor 613 is used to collect the intensity of ambient light. In one embodiment, processor 601 may control the display brightness of display 605 based on the intensity of ambient light collected by optical sensor 613.
The proximity sensor 614 is used to capture the distance between the user and the front of the computer device 600.
Those skilled in the art will appreciate that the architecture shown in fig. 6 is not limiting as to the computer device 600, and may include more or fewer components than shown, or may combine certain components, or employ a different arrangement of components.
Fig. 7 is a schematic structural diagram of a server according to the embodiment of the present disclosure, where the server 700 may have a relatively large difference due to configuration or performance, and may include one or more processors (Central Processing Units, CPU) 701 and one or more memories 702, where the one or more memories 702 store at least one computer program, and the at least one computer program is loaded and executed by the one or more processors 701 to implement the methods provided in the foregoing method embodiments. Of course, the server 700 may also have components such as a wired or wireless network interface, a keyboard, and an input/output interface, so as to perform input/output, and the server 700 may also include other components for implementing the functions of the device, which are not described herein.
In an exemplary embodiment, a computer readable storage medium, e.g. a memory comprising a computer program, executable by a processor to perform the task node based day cut method of the above embodiments is also provided. For example, the computer readable storage medium may be Read-Only Memory (ROM), random-access Memory (Random Access Memory, RAM), compact disc Read-Only Memory (CD-ROM), magnetic tape, floppy disk, optical data storage device, and the like.
In an exemplary embodiment, a computer program product or a computer program is also provided, which computer program product or computer program comprises a program code, which program code is stored in a computer readable storage medium, from which computer readable storage medium a processor of a computer device reads the program code, which program code is executed by a processor, such that the computer device performs the task node based day cut method described above.
In some embodiments, the computer program according to the embodiments of the present specification may be deployed to be executed on one computer device or on a plurality of computer devices located at one site, or on a plurality of computer devices distributed at a plurality of sites and interconnected by a communication network, where the plurality of computer devices distributed at a plurality of sites and interconnected by a communication network may constitute a blockchain system.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program for instructing relevant hardware, where the program may be stored in a computer readable storage medium, and the above storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
The foregoing description of the preferred embodiments is merely exemplary in nature and is not intended to limit the invention, thus, any modification, equivalent replacement, improvement, or the like that comes within the spirit and principles of the present invention are intended to be included in the scope of the present invention.

Claims (14)

1. A task node-based day cut method, the method comprising:
under the condition that the date cutting time of the current date is reached, acquiring a plurality of task nodes to be subjected to date cutting, wherein the types of different task nodes are different;
determining a target daily cut sequence of the plurality of task nodes based on the types of the task nodes and daily cut dependency relationships among the plurality of task nodes;
and controlling the task nodes to perform daily cutting according to the target daily cutting sequence.
2. The method of claim 1, wherein, in the case of reaching a date cut time of a current date, acquiring a plurality of task nodes to be subjected to date cut comprises:
Under the condition that the date cutting time of the current date is reached, acquiring a date processing task of the current date, wherein the date processing task is a date cutting task to be executed;
and determining the task nodes corresponding to the daily processing task.
3. The method of claim 1, the determining a target daily cut order for the plurality of task nodes based on the type of each of the task nodes and daily cut dependencies between the plurality of task nodes comprising:
determining an initial daily cut sequence of the plurality of task nodes based on the types of the task nodes;
and adjusting the initial day-cut sequence based on day-cut dependency relations among the plurality of task nodes to obtain the target day-cut sequence.
4. The method of claim 3, wherein adjusting the initial daily cut order based on daily cut dependencies among the plurality of task nodes to obtain the target daily cut order comprises:
determining at least one node set from the plurality of task nodes, wherein the node set comprises at least two task nodes, and the task nodes in the node set have daily cut dependency relations;
and adjusting the positions of the task nodes in the at least one node set in the initial daily cutting sequence so that the task nodes in the same node set are adjacent to each other, and obtaining the target daily cutting sequence.
5. The method of claim 1, the plurality of task nodes comprising an accounting node and a plurality of transaction nodes, the accounting node being located after the plurality of transaction nodes in the target daily cut order, the controlling the plurality of task nodes to daily cut in the target daily cut order comprising:
sequentially controlling the plurality of transaction nodes to perform daily cutting according to the target daily cutting sequence;
under the condition that the transaction nodes finish daily cutting, performing finishing detection on the transaction nodes and executing the accounting task of the accounting node;
and under the condition that the accounting task is completed, controlling the accounting node to perform daily cut.
6. The method of claim 5, wherein, in the event that the plurality of transactional nodes complete a day cut, performing a completion detection on the plurality of transactional nodes and performing an accounting task for the accounting node comprises:
under the condition that the plurality of transaction nodes finish daily cutting, acquiring a plurality of daily cutting data of the plurality of transaction nodes and daily cutting states of the daily cutting data, wherein the daily cutting states are used for indicating whether daily cutting is finished or not;
and executing the accounting task of the accounting node under the condition that the day cut state of each day cut data is a complete day cut.
7. The method of claim 6, wherein, in the case where the day cut status of each of the day cut data is a complete day cut, performing the accounting task of the accounting node comprises:
under the condition that the day cutting state of each day cutting data is a complete day cutting, processing settlement resource quantities of different departments;
and under the condition that the settlement resource quantity of different orders is processed, generating a resource accounting report.
8. The method of claim 5, the controlling the accounting node to make a daily cut if the accounting task is complete comprising:
performing balance check on resource transfer data of the accounting node under the condition that the accounting task is completed, wherein the resource transfer data comprises resource transfer-out data and resource transfer-in data;
and controlling the accounting node to perform daily cut under the condition that the resource transfer data passes the balance check.
9. The method of claim 8, the plurality of task nodes further comprising a financial node, the controlling the accounting node to make a daily cut if the resource transfer data passes a balance check comprising:
under the condition that the resource transfer data passes the balance check, sending a date cut instruction to the financial node, wherein the date cut instruction is used for indicating the financial node to conduct date cut;
And under the condition that the financial node completes the day cut, controlling the accounting node to conduct the day cut.
10. The method of claim 1, the method further comprising:
generating a daily cut log of the task node under the condition that any one of the task nodes completes daily cut;
and/or the number of the groups of groups,
and under the condition that all the task nodes complete the date cut, generating a date cut log of the current date.
11. A task node-based day cut device, the device comprising:
the task node acquisition module is used for acquiring a plurality of task nodes to be subjected to day cutting under the condition that the day cutting time of the current date is reached, and the types of different task nodes are different;
the target daily cut sequence determining module is used for determining the target daily cut sequence of the plurality of task nodes based on the types of the task nodes and daily cut dependency relations among the plurality of task nodes;
and the daily cut control module is used for controlling the plurality of task nodes to perform daily cut according to the target daily cut sequence.
12. A computer device comprising one or more processors and one or more memories, the one or more memories having stored therein at least one computer program loaded and executed by the one or more processors to implement the task node-based day cut method of any of claims 1-10.
13. A computer readable storage medium having stored therein at least one computer program loaded and executed by a processor to implement the task node based day cut method of any one of claims 1 to 10.
14. A computer program product comprising a computer program which, when executed by a processor, implements the task node based day cut method of any one of claims 1 to 10.
CN202311099746.8A 2023-08-29 2023-08-29 Daily cutting method, device, equipment and storage medium based on task nodes Pending CN117149731A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311099746.8A CN117149731A (en) 2023-08-29 2023-08-29 Daily cutting method, device, equipment and storage medium based on task nodes

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311099746.8A CN117149731A (en) 2023-08-29 2023-08-29 Daily cutting method, device, equipment and storage medium based on task nodes

Publications (1)

Publication Number Publication Date
CN117149731A true CN117149731A (en) 2023-12-01

Family

ID=88886121

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311099746.8A Pending CN117149731A (en) 2023-08-29 2023-08-29 Daily cutting method, device, equipment and storage medium based on task nodes

Country Status (1)

Country Link
CN (1) CN117149731A (en)

Similar Documents

Publication Publication Date Title
CN110602097B (en) Block chain-based task processing method, device, equipment and storage medium
CN111192005B (en) Government affair service processing method and device, computer equipment and readable storage medium
CN111427971B (en) Business modeling method, device, system and medium for computer system
CN111049878A (en) Method, device, electronic device and storage medium for visualizing micro-service call chain
CN107357718A (en) One kind structure method of testing and device
CN109462508B (en) Node deployment method, device and storage medium
CN112184469B (en) Group interaction method, device, equipment and storage medium
CN112035350B (en) Test method and device for block chain system and computer equipment
CN111292090A (en) Method and device for detecting abnormal account
CN112612624A (en) Data interaction method and device between systems, computer equipment and storage medium
CN110852819A (en) Transaction processing method and device, storage medium and electronic equipment
CN113850603A (en) Method and device for determining reason of payment failure
CN112070637A (en) Case processing method and device based on block chain
CN112102099A (en) Policy data processing method and device, electronic equipment and storage medium
CN114936199B (en) Data processing method for system reconstruction, computer equipment and storage medium
CN111522933A (en) Conversation process control method, device, equipment and medium
CN117149731A (en) Daily cutting method, device, equipment and storage medium based on task nodes
US11995587B2 (en) Method and device for managing project by using data merging
CN110018815A (en) Application development system and method based on database and spreadsheet software
CN109299948A (en) A kind of red packet sending method, device, wearable device and storage medium
CN111857670B (en) Application architecture determining method and device
KR20210060998A (en) Method for generating finite state machine, method for operating finite state machine, server and computer program for performing the same
CN117611368A (en) Method, device, equipment and storage medium for debugging account checking parameters
CN109711958A (en) It keeps accounts method, apparatus, terminal device and computer readable storage medium to public affairs
CN109194828A (en) Application program management-control method and terminal

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