CN113127082A - Data processing method, server, service node, system and storage medium - Google Patents

Data processing method, server, service node, system and storage medium Download PDF

Info

Publication number
CN113127082A
CN113127082A CN202110445407.5A CN202110445407A CN113127082A CN 113127082 A CN113127082 A CN 113127082A CN 202110445407 A CN202110445407 A CN 202110445407A CN 113127082 A CN113127082 A CN 113127082A
Authority
CN
China
Prior art keywords
timestamp
time stamp
application server
server
database
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
CN202110445407.5A
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.)
Industrial and Commercial Bank of China Ltd ICBC
Original Assignee
Industrial and Commercial Bank of China Ltd ICBC
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 Industrial and Commercial Bank of China Ltd ICBC filed Critical Industrial and Commercial Bank of China Ltd ICBC
Priority to CN202110445407.5A priority Critical patent/CN113127082A/en
Publication of CN113127082A publication Critical patent/CN113127082A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/4401Bootstrapping
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23Updating

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The present disclosure provides a data processing method based on service nodes, wherein the service nodes comprise thread servers and application servers, and the method comprises the following steps: and acquiring a first timestamp and a second timestamp, wherein the first timestamp is the timestamp when the application server starts, the second timestamp is the timestamp when the thread server finishes starting, whether the first timestamp is earlier than the second timestamp is judged, and if the first timestamp is earlier than the second timestamp, the data updating task is executed. The disclosure also provides a data processing method based on the service node, an application server, a thread server, a service node, a computer system and a storage medium.

Description

Data processing method, server, service node, system and storage medium
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a data processing method based on a service node, an application server, a thread server, a service node, a computer system, and a storage medium.
Background
In one service node, the thread server acquires product parameters from a product data source at regular time and updates the product parameters to a database. The application server obtains the product data from the database and provides service for the application. The normal service providing of the application server depends on the operation of the thread server, and the dependence causes the problem of strong coupling between the thread server and the starting of the application server.
Disclosure of Invention
In view of the above, the present disclosure provides a data processing method based on a service node, an application server, a thread server, a service node, a computer system, and a storage medium, which can solve the problem of strong coupling between the start of the thread server and the start of the application server.
One aspect of the present disclosure provides a data processing method based on a service node, the service node including a thread server and an application server, the method being performed by the application server, the method including:
acquiring a first time stamp and a second time stamp, wherein the first time stamp is the time stamp when the application server starts, and the second time stamp is the time stamp when the thread server finishes starting;
judging whether the first timestamp is earlier than the second timestamp;
and if the first time stamp is earlier than the second time stamp, executing a data updating task.
Optionally, after executing the data update task, the method further includes:
and acquiring a current timestamp, and updating the time of the first timestamp to the time of the current timestamp.
Optionally, the service node further includes a database, and the executing data update task includes:
acquiring product data stored in the database;
and updating the product data stored in the memory of the application server into the product data stored in the database.
Optionally, the first timestamp is stored in a memory of the application server, and the second timestamp is stored in the database;
the obtaining the first timestamp and the second timestamp comprises:
and acquiring the first time stamp from the memory, and acquiring the second time stamp from the database.
Optionally, the operation of obtaining the first timestamp and the second timestamp is executed every preset time.
Another aspect of the present disclosure provides a data processing method based on a service node, the service node including a thread server and an application server, the method being performed by the thread server, the method including:
when the thread server is detected to be started completely, acquiring a time stamp when the thread server is started completely;
and saving the time stamp when the starting is finished as a second time stamp so that the application server acquires a first time stamp and the second time stamp, wherein the first time stamp is the time stamp when the starting of the application server is started, judging whether the first time stamp is earlier than the second time stamp, and executing a data updating task if the first time stamp is earlier than the second time stamp.
Optionally, the service node further includes a database, and after saving the time stamp when the start is completed as the second time stamp, the method further includes:
and sending the second time stamp to a database so that the application server acquires the second time stamp from the database.
Another aspect of the present disclosure provides an application server in a service node, including:
the system comprises a first acquisition module and a second acquisition module, wherein the first acquisition module is used for acquiring a first time stamp and a second time stamp, the first time stamp is the time stamp when the application server starts, and the second time stamp is the time stamp when the thread server finishes starting;
the judging module is used for judging whether the first timestamp is earlier than the second timestamp;
and the updating module is used for executing a data updating task if the first time stamp is earlier than the second time stamp.
Optionally, the method further includes:
the second acquisition module is used for acquiring the current timestamp;
and the updating module is used for updating the time of the first timestamp to the time of the current timestamp.
Optionally, the service node further includes a database, and the update module is specifically configured to, if the first timestamp is earlier than the second timestamp, acquire the product data stored in the database, and update the product data stored in the memory of the application server to the product data stored in the database.
Optionally, the first obtaining module is further configured to execute the operation of obtaining the first timestamp and the second timestamp every preset time.
Another aspect of the present disclosure provides a thread server in a service node, including:
the third acquisition module is used for acquiring a time stamp when the thread server is started completely when the thread server is detected to be started completely;
and the saving module is used for saving the time stamp when the starting is finished as a second time stamp so as to enable the application server to obtain a first time stamp and the second time stamp, wherein the first time stamp is the time stamp when the starting of the application server is started, judging whether the first time stamp is earlier than the second time stamp, and executing a data updating task if the first time stamp is earlier than the second time stamp.
Optionally, the service node further includes a database, and the thread server further includes:
and the sending module is used for sending the second timestamp to a database so that the application server acquires the second timestamp from the database.
Another aspect of the present disclosure provides a service node, including:
an application server as described above, a thread server as described above.
Another aspect of the present disclosure provides a service node, including:
an application server as described above, a thread server as described above, a database for storing the second time stamp and the product data.
Another aspect of the present disclosure provides a computer system comprising:
one or more processors;
a memory for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement any of the methods described above.
Another aspect of the disclosure provides a computer-readable storage medium storing computer-executable instructions for implementing the method as described in any one of the above when executed.
Another aspect of the disclosure provides a computer program comprising computer executable instructions for implementing a method as any one of the above when executed.
According to the embodiment of the disclosure, the initialization sequence of the thread server and the application server is not controlled, and a first timestamp and a second timestamp are obtained, the first timestamp is the timestamp when the application server starts, the second timestamp is the timestamp when the thread server starts to complete, whether the first timestamp is earlier than the second timestamp is judged, if the application server starts the start time to be earlier than the thread server start completion time, the application server directly updates the product data stored in the memory once, so as to guarantee the correctness of the product data stored in the memory of the application server, dirty data is avoided, and the current service node can be fast for the client.
Drawings
The above and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:
figure 1 schematically illustrates a service node according to an embodiment of the disclosure;
FIG. 2 schematically illustrates a flow chart of a service node based data processing method according to an embodiment of the present disclosure;
FIG. 3 schematically shows a flow chart of a service node based data processing method according to an embodiment of the present disclosure;
FIG. 4 schematically shows a flow chart of a service node based data processing method according to an embodiment of the present disclosure;
FIG. 5 schematically illustrates a flow chart of a service node based data processing method according to an embodiment of the present disclosure;
FIG. 6 schematically shows a flow chart of a service node based data processing method according to an embodiment of the present disclosure;
FIG. 7 schematically shows a block diagram of an application server according to an embodiment of the present disclosure;
FIG. 8 is a block diagram that schematically illustrates a thread server, in accordance with an embodiment of the present disclosure;
FIG. 9 schematically shows a block diagram of a computer system according to an embodiment of the disclosure.
Detailed Description
In order to make the purpose, features and advantages of the present application more obvious and understandable, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). Where a convention analogous to "A, B or at least one of C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B or C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).
The embodiment of the disclosure provides a data processing method based on service nodes, wherein each service node comprises a thread server and an application server. The method comprises the steps that when the thread server is detected to be started completely, the thread server obtains a timestamp when the thread server is started completely, the thread server stores the timestamp when the thread server is started completely as a second timestamp, when the application server starts a data updating task, a first timestamp and a second timestamp are obtained, the first timestamp is the timestamp when the application server is started, the application server judges whether the first timestamp is earlier than the second timestamp, if the first timestamp is earlier than the second timestamp, the application server executes the data updating task, obtains the current timestamp, and updates the moment of the first timestamp to the moment of the current timestamp.
Fig. 1 schematically shows a serving node 100 according to an embodiment of the disclosure. It should be noted that fig. 1 is only an example to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.
As shown in fig. 1, a service node includes a database 101, a thread server 102 and at least one application server 103, which can provide services to users individually.
The database 101 is used to store product data, technical parameters, and the like, and is accessible only by the server of the service node.
The thread server 102 is a server for updating the product data in the database, and periodically obtains the product data from the product data source and updates the product data to the database.
The application server 103 is a server for providing services to users, and reads product data from a database at regular time and stores the product data in a local memory depending on the product data.
Wherein, the database 101, the thread server 102 and the application server 103 can communicate with each other through a wired and/or wireless network. The product data refers to information required for providing specific services to users, such as financing, insurance and the like.
In the present disclosure, when the thread server 102 starts, product data is obtained from a product data source, and then the product data is updated to the database 101, after all product parameters are updated, the thread server 102 finishes starting, and then a timestamp of the thread server 102 finishing starting is recorded. When the application server 103 is started, recording a timestamp of the start of the application server 103 in a memory, then acquiring a timestamp of the start completion of the latest thread server 102, and checking whether the start time of the application server 103 is earlier than the start time of the thread server 102, if so, indicating that the product data needs to be updated, executing a data updating task, and updating the timestamp of the start in the memory to be a current timestamp; if the time stamp of the application server 103 in the memory at the start is not earlier than the time stamp of the thread server 102 at the end of the start, it indicates that the product parameters do not need to be updated, the data updating task is not executed, and the next time of acquiring the first time stamp and the second time stamp is waited.
It should be understood that the number of application servers in fig. 1 is merely illustrative. There may be any number of application servers in a service node, depending on implementation needs.
Fig. 2 schematically shows a flowchart of a data processing method based on a service node, the service node including a thread server and an application server, the data processing method being performed by the application server, according to an embodiment of the present disclosure.
As shown in fig. 2, the method includes operations S201 to S203.
In operation S201, a first timestamp and a second timestamp are obtained, where the first timestamp is a timestamp when the application server starts, and the second timestamp is a timestamp when the thread server finishes starting.
In operation S202, it is determined whether the first timestamp is earlier than the second timestamp.
In operation S203, if the first timestamp is earlier than the second timestamp, a data update task is executed.
In the present disclosure, operation S201 is performed once every preset time period. The preset time period is, for example, 5 seconds, 30 seconds, 1 minute, etc., which the present disclosure does not limit. The data updating task refers to that the application server updates the product data stored in the application server.
In the present disclosure, the time stamp at the start of the application server startup refers to the time when the application server starts the data update task. In this embodiment, the timestamp when the thread server completes starting refers to the time when the thread server successfully acquires and stores the product data from the product data source. The place of saving may be an external database or a certain storage space in the thread server.
In the present disclosure, the data update task is not performed if the first timestamp is not earlier than the second timestamp. And waiting for the preset time duration, and performing operation S201 next time.
According to this disclosure, do not control the initialization sequence of thread server and application server, and acquire first timestamp and second timestamp, first timestamp is the timestamp when application server starts the beginning, the second timestamp is the timestamp when thread server starts the completion, judge whether first timestamp is earlier than the second timestamp, if application server starts the beginning earlier than thread server starts the completion time, the product data of storage in the memory is directly updated to application server, with the exactness of the product data of storage in guaranteeing application server memory, dirty data avoids appearing, make current service node can be fast to the visitor.
Fig. 3 schematically shows a flowchart of a data processing method based on a service node, the service node including a thread server and an application server, the data processing method being performed by the application server, according to an embodiment of the present disclosure.
As shown in fig. 3, the method includes operations S301 to S304.
In operation S301, a first timestamp that is a timestamp of when the application server starts up and a second timestamp that is a timestamp of when the thread server finishes starting up are obtained.
In operation S302, it is determined whether the first timestamp is earlier than the second timestamp.
In operation S303, if the first timestamp is earlier than the second timestamp, a data update task is performed.
In operation S304, a current timestamp is acquired, and the time of the first timestamp is updated to the time of the current timestamp.
In one example, the first timestamp is 20 seconds at 12 o 'clock at 3/30/2021, and the second timestamp is 25 seconds at 12 o' clock at 30/2021, and the first timestamp is earlier than the second timestamp, so that the data updating task is executed, the current timestamp is acquired after the task is executed, and the time of the first timestamp is updated to 30 seconds at 12 o 'clock at 30/3/2021, assuming that the current timestamp is 30 seconds at 12 o' clock at 3/30/2021.
According to the embodiment of the disclosure, after the application server executes the data updating task, the first timestamp is updated, and it is ensured that the acquired first timestamp is the correct timestamp when the data updating task is executed each time.
Fig. 4 schematically shows a flowchart of a data processing method based on a service node, the service node including a thread server, an application server and a database, the data processing method being performed by the application server, according to an embodiment of the present disclosure.
As shown in fig. 4, the method includes operations S401 to S403.
In operation S401, a first timestamp is obtained from the memory, and a second timestamp is obtained from the database, where the first timestamp is a timestamp of the start of the application server, and the second timestamp is a timestamp of the completion of the start of the thread server.
In operation S402, it is determined whether the first timestamp is earlier than the second timestamp.
In operation S403, if the first timestamp is earlier than the second timestamp, the product data stored in the database is obtained, and the product data stored in the memory of the application server is updated to the product data stored in the database.
In this disclosure, the thread server is started up to be completed, which means that the thread server successfully saves the product data acquired from the product data source to the database. That is, the timestamp when the thread server is started up means that the thread server obtains product data from a product data source after starting up, and then sends the obtained product data to the database, and the database successfully stores the current time recorded after the product data.
In one embodiment of the present disclosure, after operation S403, a current timestamp is obtained, the time of the first timestamp is updated to the time of the current timestamp, and operation S401 is performed again.
Fig. 5 schematically shows a flowchart of a data processing method based on a service node, the service node including a thread server and an application server, the data processing method being performed by the thread server according to an embodiment of the present disclosure.
As shown in fig. 5, the method includes operations S501 to S503.
In operation S501, when the thread server boot completion is detected, a timestamp of the boot completion is acquired.
In operation S502, the timestamp of the completion of the start is saved as a second timestamp, so that the application server obtains a first timestamp and the second timestamp, where the first timestamp is the timestamp of the start of the application server, and determines whether the first timestamp is earlier than the second timestamp, and if the first timestamp is earlier than the second timestamp, the data update task is executed.
In this disclosure, the thread server is started up and completed means that the thread server successfully obtains the product data from the product data source and successfully stores the product data.
Fig. 6 schematically shows a flowchart of a data processing method based on a service node, the service node including a thread server, an application server and a database, the data processing method being performed by the thread server according to an embodiment of the present disclosure.
As shown in fig. 6, the method includes operations S601 to S603.
In operation S601, when the thread server startup completion is detected, a timestamp of the startup completion is acquired.
Saving the time stamp at the completion of the booting as a second time stamp in operation S602;
in operation S603, the second timestamp is sent to the database, so that the application server obtains the second timestamp and the product data from the database, and determines whether the first timestamp is earlier than the second timestamp, and if the first timestamp is earlier than the second timestamp, the product data stored in the memory of the application server is updated to the product data stored in the database.
Fig. 7 schematically shows a block diagram of an application server according to an embodiment of the present disclosure.
As shown in fig. 7, the application server 700 includes a first obtaining module 710, a determining module 720, and an updating module 730, and the application server 700 is the same as the application server 103 shown in fig. 1.
The first obtaining module 710 is configured to obtain a first timestamp and a second timestamp, where the first timestamp is a timestamp when the application server starts, and the second timestamp is a timestamp when the thread server finishes starting.
A determining module 720, configured to determine whether the first timestamp is earlier than the second timestamp.
The updating module 730 is configured to execute a data updating task if the first timestamp is earlier than the second timestamp.
In one embodiment of the present disclosure, the thread server 700 further includes:
the second acquisition module is used for acquiring the current timestamp;
and the updating module is used for updating the time of the first timestamp to the time of the current timestamp.
In one embodiment of the present disclosure, the service node further includes a database, and the updating module 730 is specifically configured to, if the first timestamp is earlier than the second timestamp, acquire the product data stored in the database, and update the product data stored in the memory of the application server to the product data stored in the database.
In one embodiment of the present disclosure, the memory of the application server stores the first timestamp, and the database stores the second timestamp; the first obtaining module is specifically configured to obtain the first timestamp from the memory, and obtain the second timestamp from the database.
In one embodiment of the present disclosure, the first obtaining module is specifically configured to obtain the first timestamp and the second timestamp every preset time.
Fig. 8 schematically shows a block diagram of a thread server according to an embodiment of the present disclosure.
As shown in fig. 8, the thread server 800 includes a second obtaining module 810 and a saving module 820, and the thread server 800 is the same as the application server 102 shown in fig. 1.
A third obtaining module 810, configured to, when it is detected that the thread server is started completely, obtain a timestamp of the time when the thread server is started completely;
a saving module 820, configured to save the timestamp when the start is completed as a second timestamp, so that the application server obtains a first timestamp and the second timestamp, where the first timestamp is the timestamp when the start of the application server is started, and determine whether the first timestamp is earlier than the second timestamp, and if the first timestamp is earlier than the second timestamp, execute the data updating task.
In one embodiment of the present disclosure, the service node further includes a database, and the thread server 800 further includes:
and the sending module is used for sending the second timestamp to a database so that the application server acquires the second timestamp from the database.
Any number of modules, sub-modules, units, sub-units, or at least part of the functionality of any number thereof according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented by being split into a plurality of modules. Any one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in any other reasonable manner of hardware or firmware by integrating or packaging a circuit, or in any one of or a suitable combination of software, hardware, and firmware implementations. Alternatively, one or more of the modules, sub-modules, units, sub-units according to embodiments of the disclosure may be at least partially implemented as a computer program module, which when executed may perform the corresponding functions.
For example, any plurality of the first obtaining module 710, the determining module 720 and the updating module 730 may be combined into one module/unit/sub-unit to be implemented, or any one of the modules/units/sub-units may be split into a plurality of modules/units/sub-units. Alternatively, at least part of the functionality of one or more of these modules/units/sub-units may be combined with at least part of the functionality of other modules/units/sub-units and implemented in one module/unit/sub-unit. According to an embodiment of the present disclosure, at least one of the first obtaining module 710, the determining module 720 and the updating module 730 may be implemented at least partially as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented by hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or may be implemented by any one of or a suitable combination of three implementations of software, hardware and firmware. Alternatively, at least one of the first obtaining module 710, the determining module 720 and the updating module 730 may be at least partially implemented as a computer program module, which, when executed, may perform a corresponding function.
It should be noted that, in the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
FIG. 9 schematically shows a block diagram of a computer system suitable for implementing the above described method according to an embodiment of the present disclosure. The computer system illustrated in FIG. 9 is only one example and should not impose any limitations on the scope of use or functionality of embodiments of the disclosure.
As shown in fig. 9, a computer system 900 according to an embodiment of the present disclosure includes a processor 901 which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)902 or a program loaded from a storage section 908 into a Random Access Memory (RAM) 903. Processor 901 may comprise, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 901 may also include on-board memory for caching purposes. The processor 901 may comprise a single processing unit or a plurality of processing units for performing the different actions of the method flows according to embodiments of the present disclosure.
In the RAM 903, various programs and data necessary for the operation of the system 900 are stored. The processor 901, the ROM 902, and the RAM 903 are connected to each other through a bus 904. The processor 901 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 902 and/or the RAM 903. Note that the programs may also be stored in one or more memories other than the ROM 902 and the RAM 903. The processor 901 may also perform various operations of the method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.
System 900 may also include an input/output (I/O) interface 905, input/output (I/O) interface 905 also connected to bus 904, according to an embodiment of the present disclosure. The system 900 may also include one or more of the following components connected to the I/O interface 905: an input portion 906 including a keyboard, a mouse, and the like; an output section 907 including components such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 908 including a hard disk and the like; and a communication section 909 including a network interface card such as a LAN card, a modem, or the like. The communication section 909 performs communication processing via a network such as the internet. The drive 910 is also connected to the I/O interface 905 as necessary. A removable medium 911 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 910 as necessary, so that a computer program read out therefrom is mounted into the storage section 908 as necessary.
According to embodiments of the present disclosure, method flows according to embodiments of the present disclosure may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable storage medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 909, and/or installed from the removable medium 911. The computer program, when executed by the processor 901, performs the above-described functions defined in the system of the embodiment of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.
According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium. Examples may include, but are not limited to: 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), 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 the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
For example, according to embodiments of the present disclosure, a computer-readable storage medium may include the ROM 902 and/or the RAM 903 described above and/or one or more memories other than the ROM 902 and the RAM 903.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.

Claims (18)

1. A method of data processing based on a service node, the service node comprising a thread server and an application server, the method being performed by the application server, the method comprising:
acquiring a first time stamp and a second time stamp, wherein the first time stamp is the time stamp when the application server starts, and the second time stamp is the time stamp when the thread server finishes starting;
judging whether the first timestamp is earlier than the second timestamp;
and if the first time stamp is earlier than the second time stamp, executing a data updating task.
2. The method of claim 1, after performing the data update task, further comprising:
acquiring a current timestamp;
and updating the time of the first timestamp to the time of the current timestamp.
3. The method of claim 1, the service node further comprising a database, the performing data update tasks comprising:
acquiring product data stored in the database;
and updating the product data stored in the memory of the application server into the product data stored in the database.
4. The method of claim 3, the first timestamp being stored in a memory of the application server, the second timestamp being stored in the database;
the obtaining the first timestamp and the second timestamp comprises:
and acquiring the first time stamp from the memory, and acquiring the second time stamp from the database.
5. The method according to any one of claims 1 to 4, wherein the operation of acquiring the first timestamp and the second timestamp is performed every preset time period.
6. A method of data processing based on a service node, the service node comprising a thread server and an application server, the method being performed by the thread server, the method comprising:
when the thread server is detected to be started completely, acquiring a time stamp when the thread server is started completely;
and saving the time stamp when the starting is finished as a second time stamp so that the application server acquires a first time stamp and the second time stamp, wherein the first time stamp is the time stamp when the starting of the application server is started, judging whether the first time stamp is earlier than the second time stamp, and executing a data updating task if the first time stamp is earlier than the second time stamp.
7. The method of claim 6, the service node further comprising a database, the saving the timestamp when the boot-up was completed as the second timestamp, further comprising:
and sending the second time stamp to a database so that the application server acquires the second time stamp from the database.
8. An application server in a service node, comprising:
the system comprises a first acquisition module and a second acquisition module, wherein the first acquisition module is used for acquiring a first time stamp and a second time stamp, the first time stamp is the time stamp when the application server starts, and the second time stamp is the time stamp when the thread server finishes starting;
the judging module is used for judging whether the first timestamp is earlier than the second timestamp;
and the updating module is used for executing a data updating task if the first time stamp is earlier than the second time stamp.
9. The application server of claim 8, further comprising:
the second acquisition module is used for acquiring the current timestamp;
and the updating module is used for updating the time of the first timestamp to the time of the current timestamp.
10. The application server according to claim 8, wherein the service node further includes a database, and the update module is specifically configured to, if the first timestamp is earlier than the second timestamp, acquire the product data stored in the database, and update the product data stored in the memory of the application server to the product data stored in the database.
11. A thread server in a service node, comprising:
the third acquisition module is used for acquiring a time stamp when the thread server is started completely when the thread server is detected to be started completely;
and the saving module is used for saving the time stamp when the starting is finished as a second time stamp so as to enable the application server to obtain a first time stamp and the second time stamp, wherein the first time stamp is the time stamp when the starting of the application server is started, judging whether the first time stamp is earlier than the second time stamp, and executing a data updating task if the first time stamp is earlier than the second time stamp.
12. The thread server of claim 11, the service node further comprising a database, the thread server further comprising:
and the sending module is used for sending the second timestamp to a database so that the application server acquires the second timestamp from the database.
13. A serving node, comprising:
an application server according to any one of claims 8 to 10, a thread server according to claim 11 or 12.
14. A serving node, comprising:
an application server according to any one of claims 8 to 10, a thread server according to claim 11 or 12, a database for storing the second time stamp and the product data.
15. A computer system, comprising:
one or more processors;
a memory for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method of any of claims 1-5.
16. A computer system, comprising:
one or more processors;
a memory for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method of claim 6 or 7.
17. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to carry out the method of any one of claims 1 to 5.
18. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to carry out the method of claim 6 or 7.
CN202110445407.5A 2021-04-23 2021-04-23 Data processing method, server, service node, system and storage medium Pending CN113127082A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110445407.5A CN113127082A (en) 2021-04-23 2021-04-23 Data processing method, server, service node, system and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110445407.5A CN113127082A (en) 2021-04-23 2021-04-23 Data processing method, server, service node, system and storage medium

Publications (1)

Publication Number Publication Date
CN113127082A true CN113127082A (en) 2021-07-16

Family

ID=76779724

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110445407.5A Pending CN113127082A (en) 2021-04-23 2021-04-23 Data processing method, server, service node, system and storage medium

Country Status (1)

Country Link
CN (1) CN113127082A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115048207A (en) * 2022-08-17 2022-09-13 恒丰银行股份有限公司 Task execution method, device and medium based on fixed time interval

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108200220A (en) * 2018-04-08 2018-06-22 武汉斗鱼网络科技有限公司 A kind of method of data synchronization, server and storage medium
CN108337303A (en) * 2018-01-24 2018-07-27 中国银联股份有限公司 A kind of method of data synchronization and distributed system
CN109309582A (en) * 2018-08-23 2019-02-05 深圳点猫科技有限公司 A kind of cloud synchronous method and electronic equipment based on education operating system
CN109831372A (en) * 2019-02-12 2019-05-31 北京云中融信网络科技有限公司 Message synchronization method and instant communicating system
CN111078171A (en) * 2019-11-30 2020-04-28 北京城市网邻信息技术有限公司 Method, terminal device, device and readable storage medium for synchronous display

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108337303A (en) * 2018-01-24 2018-07-27 中国银联股份有限公司 A kind of method of data synchronization and distributed system
CN108200220A (en) * 2018-04-08 2018-06-22 武汉斗鱼网络科技有限公司 A kind of method of data synchronization, server and storage medium
CN109309582A (en) * 2018-08-23 2019-02-05 深圳点猫科技有限公司 A kind of cloud synchronous method and electronic equipment based on education operating system
CN109831372A (en) * 2019-02-12 2019-05-31 北京云中融信网络科技有限公司 Message synchronization method and instant communicating system
CN111078171A (en) * 2019-11-30 2020-04-28 北京城市网邻信息技术有限公司 Method, terminal device, device and readable storage medium for synchronous display

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115048207A (en) * 2022-08-17 2022-09-13 恒丰银行股份有限公司 Task execution method, device and medium based on fixed time interval

Similar Documents

Publication Publication Date Title
US10776129B2 (en) Method and apparatus for controlling a startup bootstrap program of an intelligent TV set
US10846124B2 (en) Communication method, apparatus and system for virtual machine and host machine
US11392404B2 (en) Maintaining virtual machine templates
CN108304209B (en) Firmware upgrading method and firmware upgrading system
WO2015192608A1 (en) Method for updating app in android system, terminal and storage medium
US11048577B2 (en) Automatic correcting of computing cluster execution failure
US10949215B2 (en) Rebooting timing adjustment for improved performance
US10564889B2 (en) Method and apparatus for processing data based on physical host
US11288164B2 (en) Dynamic distributed tracing instrumentation in a microservice architecture
CN111831325A (en) Method, device, system and medium for updating configuration file in application
CN115357310A (en) System starting method and device, electronic equipment and storage medium
CN110399209B (en) Data processing method, system, electronic device and storage medium
US9026777B2 (en) Automatic update of persistent boot parameter storage
US11762666B2 (en) Methods and apparatus for hypervisor boot up
CN113127082A (en) Data processing method, server, service node, system and storage medium
CN113515448A (en) Method and device for acquiring starting time information of application program
CN109582386B (en) Service starting processing method and device, electronic equipment and readable storage medium
CN116450184A (en) System upgrading method and device, electronic equipment and storage medium
CN111522535A (en) Data source aggregation method and device, storage medium and computer equipment
CN109189442B (en) Updating method, system and electronic equipment
CN114925066A (en) Data processing method and device, electronic equipment and storage medium
CN109871226B (en) Configuration method, device and medium of downloader and electronic equipment
US9317324B2 (en) Automatic service lifecycle management
CN111858234A (en) Task execution method, device, equipment and medium
US20220391495A1 (en) Managing incompliances identified at instances of cloud applications

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