CN111309496A - Method, system, device, equipment and storage medium for realizing delay task - Google Patents
Method, system, device, equipment and storage medium for realizing delay task Download PDFInfo
- Publication number
- CN111309496A CN111309496A CN202010084689.6A CN202010084689A CN111309496A CN 111309496 A CN111309496 A CN 111309496A CN 202010084689 A CN202010084689 A CN 202010084689A CN 111309496 A CN111309496 A CN 111309496A
- Authority
- CN
- China
- Prior art keywords
- task
- delay
- triggering
- writing
- delayed
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/547—Remote procedure calls [RPC]; Web services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/54—Indexing scheme relating to G06F9/54
- G06F2209/548—Queue
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/54—Indexing scheme relating to G06F9/54
- G06F2209/549—Remote execution
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The disclosure provides a method, a device, equipment and a storage medium for realizing a delay task. The method for realizing the delayed task comprises the following steps: performing delay task registration, writing the delay task into a delay task for storage and writing the delay task into a delay task queue; scanning the delay task queue of the current time period to read the delay task; and triggering the delay task meeting the preset condition, wherein the triggering mode at least comprises one of Remote Procedure Call (RPC) triggering and message queue triggering. The method and the device can realize accurate execution time, high task carrying quantity and various triggering modes, and improve the use experience of users.
Description
Technical Field
The present disclosure relates to the field of computer software technologies, and in particular, to a method, an apparatus, a device, and a storage medium for implementing a delay task.
Background
In the application development process, business requirements that corresponding delay tasks need to be executed when specified time comes are often met. For example, after an order is submitted, if the payment is not successful after the specified payment time is exceeded, the order needs to be deleted, and for example, after the order is completed, if the evaluation is not evaluated in time after the specified evaluation time is exceeded, the evaluation of the order is set as five-star good evaluation by default, and for example, after a virtual network resource such as a voucher is activated, if the virtual network resource is not used after the specified use time is exceeded, the virtual network resource is automatically invalidated. At present, for such service requirements, in some embodiments, after receiving a delay task, trigger information of the delay task is stored in a database, and meanwhile, the database is periodically scanned by a timing task to detect whether there is a delay task to be executed, and if there is a delay task to be executed, the delay task is executed in batch at one time. However, in the prior art, the execution time of the delay tasks is not accurate, the number of the bearable delay tasks is small, the mode of triggering the delay tasks is single, and a plurality of problems exist.
Disclosure of Invention
The present disclosure has been made to solve the above problems, and an object of the present disclosure is to provide a method, an apparatus, a device, and a storage medium for implementing a delayed task, which are simple and efficient, can implement a precise execution time, a high number of received tasks, and a variety of trigger methods. This disclosure provides this summary in order to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
In order to solve the above technical problem, an embodiment of the present disclosure provides a method for implementing a delay task, which adopts the following technical solutions:
performing delay task registration, writing the delay task into a delay task for storage and writing the delay task into a delay task queue;
scanning the delay task queue of the current time period to read the delay task;
and triggering the delay task meeting the preset condition, wherein the triggering mode at least comprises one of Remote Procedure Call (RPC) triggering and message queue triggering.
In order to solve the above technical problem, an embodiment of the present disclosure provides a system for implementing a delay task, which adopts the following technical solutions:
the task registration module is used for registering the delay tasks, writing the delay tasks into the delay tasks for storage and writing the delay tasks into the delay task queue;
and the task scanning module is used for scanning the delay task queue in the current time period to read the delay task.
In order to solve the foregoing technical problem, an embodiment of the present disclosure further provides a device for implementing a delay task, where the following technical solution is adopted, and the device includes:
the task registration module is used for registering the delay tasks, writing the delay tasks into the delay tasks for storage and writing the delay tasks into the delay task queue;
the task scanning module is used for scanning the delay task queue in the current time period to read the delay task;
the task triggering module is used for triggering the delay task meeting the preset condition, and the triggering mode at least comprises one of Remote Procedure Call (RPC) triggering and message queue triggering;
the writing delay task storage at least comprises one of writing time stamp information, task identification and task name.
In order to solve the above technical problem, an embodiment of the present disclosure further provides a computer device, which adopts the following technical solutions:
comprising a memory having a computer program stored therein and a processor implementing the method as described above when executing the computer program.
In order to solve the above technical problem, an embodiment of the present disclosure further provides a computer-readable storage medium, which adopts the following technical solutions:
the computer-readable storage medium has stored thereon a computer program which, when executed by a processor, implements the method as described above.
According to the technical scheme disclosed by the disclosure, compared with the prior art, the method and the device can realize the delayed task execution with accurate execution time, high task carrying quantity and various triggering modes, and improve the use experience of users.
Drawings
FIG. 1 is a flow diagram of one embodiment of a delayed task implementation method according to the present disclosure;
FIG. 2 is a schematic diagram of one embodiment of a delayed task implementation method according to the present disclosure;
FIG. 3 is a schematic diagram of one embodiment of a delayed task implementation system according to the present disclosure;
FIG. 4 is a schematic diagram of one embodiment of a delayed task implementation apparatus, according to the present disclosure;
FIG. 5 is a schematic block diagram of one embodiment of a computer device according to the present disclosure.
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and features are not necessarily drawn to scale.
Detailed Description
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs; the terminology used in the description of the application herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure; the terms "including" and "having," and any variations thereof, in the description and claims of this disclosure and the description of the above figures are intended to cover non-exclusive inclusions. The terms "first," "second," and the like in the description and claims of the present disclosure or in the above-described drawings are used for distinguishing between different objects and not for describing a particular order.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the disclosure. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
In order to make the technical solutions of the present disclosure better understood by those skilled in the art, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings.
[ delay task implementation method ]
Referring to fig. 1, a flow diagram of one embodiment of a delayed task implementation method in accordance with the present disclosure is shown. The method for realizing the delayed task comprises the following steps:
s21, registering the delay task, writing the delay task into the delay task for storage and writing the delay task into the delay task queue;
here, the write latency task storage includes at least one of write time stamp information, task identification, and task name.
Here, the timestamp information is, for example, a time point of the delayed task execution, where the delayed tasks in the delayed task queue are arranged according to the timestamp information, where the timestamp information may be accurate to a second level, and may be set to a minute level or other time levels, without limitation. Here, the order of magnitude of the delay task queue is not limited, and may be any number.
Here, the delayed task registration further includes logging the offline task to the data warehouse tool.
S22, scanning the delay task queue of the current time period to read the delay task;
here, scanning the delayed task queue of the current time slot includes determining whether the delayed task is executed in the current time slot by scanning timestamp information of the delayed task, and reading other detailed information of the delayed task if the delayed task is executed in the current time slot, for example, information including a task identifier, a task name, and the like.
And S23, triggering the delay task meeting the preset condition, wherein the triggering mode at least comprises one of Remote Procedure Call (RPC) triggering and message queue triggering.
Here, it is determined whether the delay task in the current time period meets a preset condition, for example, it is determined whether the delay task meets the preset condition according to the task identifier, it is determined whether the delay task meets the preset condition according to the task name, and the like.
Here, triggering the delayed task meeting the preset condition further includes recording the triggering result to the data warehouse tool.
It should be understood that, although the steps in the flowcharts of the figures are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and may be performed in other orders unless explicitly stated herein. Moreover, at least a portion of the steps in the flow chart of the figure may include multiple sub-steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, which are not necessarily performed in sequence, but may be performed alternately or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
[ example method ]
The method of an embodiment of the present disclosure is explained below, and referring to fig. 2, a schematic diagram of an embodiment of a delayed task implementation method according to the present disclosure is shown, which includes the following steps:
step 1, determining a delay task to be set to be registered from various services and registering the delay task;
step 2, performing delay task registration, writing the delay task into a delay task storage (Redis) and into a delay task queue (Redis Zset);
here, the write latency task storage (Redis) includes at least one of write time stamp information, task identification, and task name.
Here, the timestamp information is, for example, a time point of the delayed task execution, here, the delayed tasks in the delayed task queue (RedisZset) are arranged according to the timestamp information, where the timestamp information may be accurate to the second level, and may also be set to the minute level or other time levels, which is not limited. Here, the order of magnitude of the delay task queue (Redis Zset) is not limited, and may be any number.
Here, the delayed task registration further includes logging the offline task to a data warehouse tool (hive).
Step 3, scanning a delay task queue (Redis Zset) of the current time period to read a delay task;
here, the scanning of the delayed task queue (Redis Zset) of the current time slot includes determining whether the delayed task is executed in the current time slot by scanning timestamp information of the delayed task, and reading other detailed information of the delayed task if the delayed task is executed in the current time slot, for example, including information of a task identifier, a task name, and the like.
And 4, triggering the delay tasks meeting the preset conditions, wherein the triggering mode at least comprises one of Remote Procedure Call (RPC) triggering and message queue triggering.
Here, it is determined whether the delay task in the current time period meets a preset condition, for example, it is determined whether the delay task meets the preset condition according to the task identifier, it is determined whether the delay task meets the preset condition according to the task name, and the like.
And 5, after the delayed task meeting the preset condition is triggered, recording a triggering result to a data warehouse tool (hive).
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and can include the processes of the embodiments of the methods described above when the computer program is executed. The storage medium may be a non-volatile storage medium such as a magnetic disk, an optical disk, a Read Only Memory (ROM), or a Random Access Memory (RAM).
[ delay task implementation System ]
As shown in fig. 3, in order to implement the technical solution in the embodiment of the present disclosure, the present disclosure provides a delay task implementation system, which can be specifically applied to various electronic terminal devices, including,
the task registration module 301 is configured to perform delay task registration, write a delay task into a delay task for storage, and write the delay task into a delay task queue;
here, the write latency task storage includes at least one of write time stamp information, task identification, and task name.
Here, the timestamp information is, for example, a time point of the delayed task execution, where the delayed tasks in the delayed task queue are arranged according to the timestamp information, where the timestamp information may be accurate to a second level, and may be set to a minute level or other time levels, without limitation. Here, the order of magnitude of the delay task queue is not limited, and may be any number.
Here, the delayed task registration further includes logging the offline task to the data warehouse tool.
And a task scanning module 302, configured to scan the delayed task queue of the current time period to read the delayed task.
Here, scanning the delayed task queue of the current time slot includes determining whether the delayed task is executed in the current time slot by scanning timestamp information of the delayed task, and reading other detailed information of the delayed task if the delayed task is executed in the current time slot, for example, information including a task identifier, a task name, and the like.
[ delay task implementation device ]
As shown in fig. 4, in order to implement the technical solution in the embodiment of the present disclosure, the present disclosure provides a delay task implementing device, which may be specifically applied to various electronic terminal devices.
The delay task implementation device described in this embodiment includes: a task registration module 401, a task scanning module 402, a task triggering module 403, and a data storage module 404.
The task registration module 401 is configured to perform delay task registration, write a delay task into a delay task for storage, and write the delay task into a delay task queue;
a task scanning module 402, configured to scan the delayed task queue in the current time period to read the delayed task;
here, the functions of the task registration module 401 and the task scanning module 402 are similar to those of the task registration module 301 and the task scanning module 302 in the delayed task implementation system, and are not described again.
A task triggering module 403, configured to trigger a delay task meeting a preset condition, where a triggering manner at least includes one of Remote Procedure Call (RPC) triggering and message queue triggering;
here, it is determined whether the delay task in the current time period meets a preset condition, for example, it is determined whether the delay task meets the preset condition according to the task identifier, it is determined whether the delay task meets the preset condition according to the task name, and the like.
The data storage module 404 is configured to record the offline task when the delayed task is registered and/or record a trigger result when the delayed task meeting a preset condition is triggered.
It should be understood that although each block in the block diagrams of the figures may represent a module, a portion of which comprises one or more executable instructions for implementing the specified logical function(s), the blocks are not necessarily executed sequentially. Each module and functional unit in the device embodiments in the present disclosure may be integrated into one processing module, or each unit may exist alone physically, or two or more modules or functional units are integrated into one module. The integrated modules can be realized in a hardware mode, and can also be realized in a software functional module mode. The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may also be stored in a computer readable storage medium. The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc.
[ delay task implementation device ]
In order to solve the technical problem, an embodiment of the present disclosure further provides an electronic device. Referring now to fig. 5, a schematic diagram of an electronic device (e.g., the terminal device or the server in fig. 1) 500 suitable for implementing embodiments of the present disclosure is shown. The terminal device in the embodiments of the present disclosure may include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a PDA (personal digital assistant), a PAD (tablet computer), a PMP (portable multimedia player), a vehicle terminal (e.g., a car navigation terminal), and the like, and a stationary terminal such as a digital TV, a desktop computer, and the like. The electronic device shown in fig. 5 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 5, electronic device 500 may include a processing means (e.g., central processing unit, graphics processor, etc.) 501 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage means 506 into a Random Access Memory (RAM) 503. In the RAM503, various programs and data necessary for the operation of the electronic apparatus 500 are also stored. The processing device 501, the ROM502, and the RAM503 are connected to each other through a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
Generally, the following devices may be connected to the I/O interface 505: input devices 506 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 507 including, for example, a Liquid Crystal Display (LCD), speakers, vibrators, and the like; storage devices 506 including, for example, magnetic tape, hard disk, etc.; and a communication device 509. The communication means 509 may allow the electronic device 500 to communicate with other devices wirelessly or by wire to exchange data. While fig. 5 illustrates an electronic device 500 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a non-transitory computer readable 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 via the communication means 509, or installed from the storage means 506, or installed from the ROM 502. The computer program performs the above-described functions defined in the methods of the embodiments of the present disclosure when executed by the processing device 501.
It should be noted that the computer readable medium in the present disclosure can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In 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. In contrast, in the present disclosure, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
In some embodiments, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (hypertext transfer protocol), and may interconnect with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the Internet (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed network.
The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device.
The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: acquiring at least two internet protocol addresses; sending a node evaluation request comprising the at least two internet protocol addresses to node evaluation equipment, wherein the node evaluation equipment selects the internet protocol addresses from the at least two internet protocol addresses and returns the internet protocol addresses; receiving an internet protocol address returned by the node evaluation equipment; wherein the obtained internet protocol address indicates an edge node in the content distribution network.
Alternatively, the computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: receiving a node evaluation request comprising at least two internet protocol addresses; selecting an internet protocol address from the at least two internet protocol addresses; returning the selected internet protocol address; wherein the received internet protocol address indicates an edge node in the content distribution network.
Computer program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including but not limited to an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
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 and/or flowchart illustration, and combinations of blocks in the block diagrams and/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.
The units described in the embodiments of the present disclosure may be implemented by software or hardware. Where the name of a unit does not in some cases constitute a limitation of the unit itself, for example, the first retrieving unit may also be described as a "unit for retrieving at least two internet protocol addresses".
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
According to one or more embodiments of the present disclosure, a method for implementing a delayed task is provided, where the method includes:
performing delay task registration, writing the delay task into a delay task for storage and writing the delay task into a delay task queue;
scanning the delay task queue of the current time period to read the delay task;
and triggering the delay task meeting the preset condition, wherein the triggering mode at least comprises one of Remote Procedure Call (RPC) triggering and message queue triggering.
According to one or more embodiments of the present disclosure, there is provided a delay task implementation method, characterized in that,
the writing delay task storage at least comprises one of writing time stamp information, task identification and task name.
According to one or more embodiments of the present disclosure, there is provided a delay task implementation method, characterized in that,
the delayed task registration further comprises logging the offline task to a data warehouse tool.
According to one or more embodiments of the present disclosure, there is provided a delay task implementation method, characterized in that,
the triggering of the delay task meeting the preset conditions further comprises recording a triggering result to a data warehouse tool.
According to one or more embodiments of the present disclosure, there is provided a delay task implementation system, including:
the task registration module is used for registering the delay tasks, writing the delay tasks into the delay tasks for storage and writing the delay tasks into the delay task queue;
and the task scanning module is used for scanning the delay task queue in the current time period to read the delay task.
According to one or more embodiments of the present disclosure, there is provided a delay task implementation system, including:
the writing delay task storage at least comprises one of writing time stamp information, task identification and task name.
According to one or more embodiments of the present disclosure, there is provided a delay task implementing apparatus, including:
the task registration module is used for registering the delay tasks, writing the delay tasks into the delay tasks for storage and writing the delay tasks into the delay task queue;
the task scanning module is used for scanning the delay task queue in the current time period to read the delay task;
the task triggering module is used for triggering the delay task meeting the preset condition, and the triggering mode at least comprises one of Remote Procedure Call (RPC) triggering and message queue triggering;
the writing delay task storage at least comprises one of writing time stamp information, task identification and task name.
According to one or more embodiments of the present disclosure, there is provided a delay task implementing apparatus, characterized in that,
and the data storage module is used for recording an offline task when the delay task is registered and/or recording a trigger result when the delay task meeting the preset condition is triggered.
According to one or more embodiments of the present disclosure, there is provided a computer device comprising a memory having stored therein a computer program and a processor implementing the method according to any one of the above when the computer program is executed by the processor.
According to one or more embodiments of the present disclosure, a computer-readable storage medium is provided, characterized in that a computer program is stored thereon, which, when being executed by a processor, implements the method according to any one of the above.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the disclosure herein is not limited to the particular combination of features described above, but also encompasses other embodiments in which any combination of the features described above or their equivalents does not depart from the spirit of the disclosure. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.
Further, while operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limitations on the scope of the disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.
Claims (10)
1. A method for realizing a delayed task is characterized by comprising the following steps:
performing delay task registration, writing the delay task into a delay task for storage and writing the delay task into a delay task queue;
scanning the delay task queue of the current time period to read the delay task;
and triggering the delay task meeting the preset condition, wherein the triggering mode at least comprises one of Remote Procedure Call (RPC) triggering and message queue triggering.
2. The latency task implementing method of claim 1,
the writing delay task storage at least comprises one of writing time stamp information, task identification and task name.
3. The delayed task implementing method of claim 1, wherein said delayed task registration further comprises,
the offline task is recorded to the data warehouse tool.
4. The method for implementing delayed tasks according to claim 1, wherein the triggering the delayed tasks meeting a preset condition further comprises,
recording the trigger results to the data warehouse tool.
5. A system for implementing a delayed task, comprising:
the task registration module is used for registering the delay tasks, writing the delay tasks into the delay tasks for storage and writing the delay tasks into the delay task queue;
and the task scanning module is used for scanning the delay task queue in the current time period to read the delay task.
6. The delayed task implementation system of claim 5, comprising,
the writing delay task storage at least comprises one of writing time stamp information, task identification and task name.
7. A delayed task implementing apparatus, comprising:
the task registration module is used for registering the delay tasks, writing the delay tasks into the delay tasks for storage and writing the delay tasks into the delay task queue;
the task scanning module is used for scanning the delay task queue in the current time period to read the delay task;
the task triggering module is used for triggering the delay task meeting the preset condition, and the triggering mode at least comprises one of Remote Procedure Call (RPC) triggering and message queue triggering;
the writing delay task storage at least comprises one of writing time stamp information, task identification and task name.
8. The latency task implementing device of claim 7, further comprising,
and the data storage module is used for recording an offline task when the delay task is registered and/or recording a trigger result when the delay task meeting the preset condition is triggered.
9. A computer device comprising a memory having stored therein a computer program and a processor implementing the method of any of claims 1-4 when executing the computer program.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored thereon a computer program which, when being executed by a processor, carries out the method according to any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010084689.6A CN111309496A (en) | 2020-02-10 | 2020-02-10 | Method, system, device, equipment and storage medium for realizing delay task |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010084689.6A CN111309496A (en) | 2020-02-10 | 2020-02-10 | Method, system, device, equipment and storage medium for realizing delay task |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111309496A true CN111309496A (en) | 2020-06-19 |
Family
ID=71156547
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010084689.6A Pending CN111309496A (en) | 2020-02-10 | 2020-02-10 | Method, system, device, equipment and storage medium for realizing delay task |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111309496A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112286655A (en) * | 2020-10-19 | 2021-01-29 | 江苏银承网络科技股份有限公司 | Distributed delay scheduling method, device and system |
| CN112948081A (en) * | 2021-02-26 | 2021-06-11 | 北京百度网讯科技有限公司 | Method, device and equipment for processing task in delayed mode and storage medium |
| CN113419832A (en) * | 2021-06-24 | 2021-09-21 | 广州欢网科技有限责任公司 | Processing method and device of delay task and terminal |
| CN113900821A (en) * | 2021-10-27 | 2022-01-07 | Oppo广东移动通信有限公司 | Task processing method and device, storage medium and electronic equipment |
| CN115061821A (en) * | 2022-06-29 | 2022-09-16 | 苏州浪潮智能科技有限公司 | Method, device, equipment and medium for executing command |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110296528A1 (en) * | 2010-05-26 | 2011-12-01 | Tethy Solutions Llc, Dba Automation Anywhere | System and method for creating and executing portable software |
| CN103885825A (en) * | 2014-03-05 | 2014-06-25 | 南京邮电大学 | Real-time speed monotony scheduling method based on dynamic time slices |
| CN107291566A (en) * | 2017-06-15 | 2017-10-24 | 北京京东尚科信息技术有限公司 | The method and apparatus that delay task is performed |
| CN107391271A (en) * | 2017-05-17 | 2017-11-24 | 阿里巴巴集团控股有限公司 | A kind of delayed tasks triggering method and device based on Message Queuing system |
| CN108733462A (en) * | 2017-04-18 | 2018-11-02 | 北京京东尚科信息技术有限公司 | The method and apparatus of delay task |
| CN108874513A (en) * | 2017-05-11 | 2018-11-23 | 北京京东尚科信息技术有限公司 | Handle method, system, electronic equipment and the computer-readable medium of timed task |
| CN108984333A (en) * | 2017-05-31 | 2018-12-11 | 北京京东尚科信息技术有限公司 | The method and device calculated in real time for big data |
| CN109643255A (en) * | 2016-08-12 | 2019-04-16 | 华为技术有限公司 | Detect distributed concurrence error automatically in cloud system |
| CN110032438A (en) * | 2019-04-24 | 2019-07-19 | 北京高途云集教育科技有限公司 | Delayed tasks execute method, apparatus and electronic equipment |
| CN110109764A (en) * | 2019-05-15 | 2019-08-09 | 重庆天蓬网络有限公司 | Delayed tasks creation method, device, medium and electronic equipment |
| CN110413384A (en) * | 2019-06-25 | 2019-11-05 | 腾讯科技（深圳）有限公司 | Delayed tasks processing method and processing device, storage medium, electronic equipment |
| CN110502327A (en) * | 2019-08-28 | 2019-11-26 | 四川长虹电器股份有限公司 | Method based on the processing of Redis high concurrent delayed tasks |
-
2020
- 2020-02-10 CN CN202010084689.6A patent/CN111309496A/en active Pending
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110296528A1 (en) * | 2010-05-26 | 2011-12-01 | Tethy Solutions Llc, Dba Automation Anywhere | System and method for creating and executing portable software |
| CN103885825A (en) * | 2014-03-05 | 2014-06-25 | 南京邮电大学 | Real-time speed monotony scheduling method based on dynamic time slices |
| CN109643255A (en) * | 2016-08-12 | 2019-04-16 | 华为技术有限公司 | Detect distributed concurrence error automatically in cloud system |
| CN108733462A (en) * | 2017-04-18 | 2018-11-02 | 北京京东尚科信息技术有限公司 | The method and apparatus of delay task |
| CN108874513A (en) * | 2017-05-11 | 2018-11-23 | 北京京东尚科信息技术有限公司 | Handle method, system, electronic equipment and the computer-readable medium of timed task |
| CN107391271A (en) * | 2017-05-17 | 2017-11-24 | 阿里巴巴集团控股有限公司 | A kind of delayed tasks triggering method and device based on Message Queuing system |
| CN108984333A (en) * | 2017-05-31 | 2018-12-11 | 北京京东尚科信息技术有限公司 | The method and device calculated in real time for big data |
| CN107291566A (en) * | 2017-06-15 | 2017-10-24 | 北京京东尚科信息技术有限公司 | The method and apparatus that delay task is performed |
| CN110032438A (en) * | 2019-04-24 | 2019-07-19 | 北京高途云集教育科技有限公司 | Delayed tasks execute method, apparatus and electronic equipment |
| CN110109764A (en) * | 2019-05-15 | 2019-08-09 | 重庆天蓬网络有限公司 | Delayed tasks creation method, device, medium and electronic equipment |
| CN110413384A (en) * | 2019-06-25 | 2019-11-05 | 腾讯科技（深圳）有限公司 | Delayed tasks processing method and processing device, storage medium, electronic equipment |
| CN110502327A (en) * | 2019-08-28 | 2019-11-26 | 四川长虹电器股份有限公司 | Method based on the processing of Redis high concurrent delayed tasks |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112286655A (en) * | 2020-10-19 | 2021-01-29 | 江苏银承网络科技股份有限公司 | Distributed delay scheduling method, device and system |
| CN112948081A (en) * | 2021-02-26 | 2021-06-11 | 北京百度网讯科技有限公司 | Method, device and equipment for processing task in delayed mode and storage medium |
| CN112948081B (en) * | 2021-02-26 | 2023-08-01 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for processing tasks in delayed mode |
| CN113419832A (en) * | 2021-06-24 | 2021-09-21 | 广州欢网科技有限责任公司 | Processing method and device of delay task and terminal |
| CN113900821A (en) * | 2021-10-27 | 2022-01-07 | Oppo广东移动通信有限公司 | Task processing method and device, storage medium and electronic equipment |
| CN115061821A (en) * | 2022-06-29 | 2022-09-16 | 苏州浪潮智能科技有限公司 | Method, device, equipment and medium for executing command |
| CN115061821B (en) * | 2022-06-29 | 2024-10-18 | 苏州浪潮智能科技有限公司 | Method, device, equipment and medium for executing command |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111309496A (en) | Method, system, device, equipment and storage medium for realizing delay task | |
| CN110516159B (en) | Information recommendation method and device, electronic equipment and storage medium | |
| CN110781373B (en) | List updating method and device, readable medium and electronic equipment | |
| CN114443897B (en) | Video recommendation method and device, electronic equipment and storage medium | |
| CN111459364B (en) | Icon updating method and device and electronic equipment | |
| CN111163336B (en) | Video resource pushing method and device, electronic equipment and computer readable medium | |
| CN111246228B (en) | Method, device, medium and electronic equipment for updating gift resources of live broadcast room | |
| CN112379982B (en) | Task processing method, device, electronic equipment and computer readable storage medium | |
| CN111596991A (en) | Interactive operation execution method and device and electronic equipment | |
| CN111427647A (en) | Page display method and device of application program, storage medium and electronic equipment | |
| CN110837333A (en) | Method, device, terminal and storage medium for adjusting playing progress of multimedia file | |
| CN110633950B (en) | Task information processing method and device, electronic equipment and storage medium | |
| CN110674481B (en) | Account registration method, device, equipment and storage medium of application program | |
| CN112257478A (en) | Code scanning method, device, terminal and storage medium | |
| CN110336592B (en) | Data transmission method suitable for Bluetooth card reader, electronic equipment and storage medium | |
| CN114116247A (en) | Redis-based message processing method, device, system, server and medium | |
| CN110619101B (en) | Method and apparatus for processing information | |
| CN111240758A (en) | Material display method and device, electronic equipment and storage medium | |
| CN116319932A (en) | Training method, device, equipment and storage medium of content push model | |
| CN115587860A (en) | Service processing method, device, storage medium and electronic equipment | |
| CN115269978A (en) | Video tag generation method, device, equipment and medium | |
| CN112153091B (en) | Method and device for determining relevance of equipment | |
| CN109614137B (en) | Software version control method, device, equipment and medium | |
| CN111367592B (en) | Information processing method and device | |
| CN112311840A (en) | Multi-terminal data synchronization method, device, equipment and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20230407 Address after: Room 802, Information Building, 13 Linyin North Street, Pinggu District, Beijing, 101299 Applicant after: Beijing youzhuju Network Technology Co.,Ltd. Address before: No. 715, 7th floor, building 3, 52 Zhongguancun South Street, Haidian District, Beijing 100081 Applicant before: Beijing infinite light field technology Co.,Ltd. |