TWM600871U - Computer program product and apparatus for arranging and executing jobs - Google Patents

Abstract

The disclosure discloses a computer program product for arranging and executing jobs being loaded and executed by a processing unit of an application server to include program code to: acquire an object for the top of a primary queue, which is generated by a client to request the application server to execute a service; determine whether the primary queue contains any same object as the acquired object; and if so, drop the object from being processed.

Description

Computer program products and devices for scheduling and executing tasks

The present invention relates to a work processing technology, especially a computer program product and device for scheduling and executing work.

Application servers usually need to handle a variety of different types of tasks. Some tasks need to perform very short tasks, such as simple database transactions; other tasks require a long time to perform, such as a large number of summary calculations in the database tables, resulting in long-term tasks that hinder short-term tasks Implementation. In addition, the execution of some tasks requires sequential and conditional branches. After a short delay, the execution of the secondary branch will be continued after waiting for the completion of the main branch. For example, write multiple pieces of data into the database, and obtain the generation serial number of the last piece of data after the writing is completed, as the input parameter of the next step. Sometimes, when the database system is busy, the serial number cannot be generated quickly, so that the job of generating the serial number for obtaining the last data cannot be completed immediately. Traditionally, the application program will start a timer to repeatedly detect whether the database system has the generation serial number of the last data, causing the application server to continuously receive many detection tasks. Sometimes, users often press the refresh button continuously on the user interface to query data, causing the application server to continuously receive many of the same query tasks. These repeated identical tasks will increase the workload of the application server. Therefore, there is a need for a computer program product and device for scheduling and executing tasks to efficiently process different types of tasks generated by applications.

In view of this, how to reduce or eliminate the deficiencies in the above-mentioned related fields is indeed a problem to be solved.

This manual relates to a computer program product used for scheduling and executing tasks. It contains code that can be loaded and executed by the processing unit of the application server. It is used to: fetch an object from the top of the main queue. This object is provided by the client Generated to request the application server to execute the service; determine whether there is any object that is the same as this object in the main queue; and when there is any object that is the same as this object in the main queue, discard this object without processing.

This specification also relates to a device for scheduling and executing tasks, including a memory and a processing unit. Memory allocation space is given to the main queue. The processing unit is coupled to the memory and used to retrieve an object from the top of the main queue, which is generated by the client to request the device to perform services; determine whether there is any object in the main queue that is the same as this object; and when the main queue is When there is any object that is the same as this object in the column, discard this object without processing.

The other advantages of the present invention will be explained in more detail with the following description and drawings.

The following description is a preferred implementation method for completing the new type, and its purpose is to describe the basic spirit of the new type, but not to limit the new type. The actual new content must refer to the following claims.

It must be understood that the words "including" and "including" used in this specification are used to indicate the existence of specific technical features, values, method steps, operations, elements and/or components, but they do not exclude the possibility of adding More technical features, values, method steps, job processing, components, components, or any combination of the above.

Words such as "first", "second", and "third" used in the claims are used to modify the elements in the claims, and are not used to indicate that there is a precedence, prerequisite relationship, or an element Prior to another element, or the chronological order of execution of method steps, is only used to distinguish elements with the same name.

It must be understood that when an element is described as being “connected” or “coupled” to another element, it can be directly connected or coupled to other elements, and intermediate elements may appear. Conversely, when an element is described as being "directly connected" or "directly coupled" to another element, there are no intervening elements. Other terms used to describe the relationship between elements can also be interpreted in a similar manner, for example, "between" versus "directly between", or "adjacent" versus "directly adjacent" and so on.

The embodiment of the present invention proposes a network system architecture, including servers and multiple clients. Figure 1 is a diagram of the network system architecture according to an embodiment of the present invention. The application server 110, the desktop computer 151, the tablet computer 153, and the mobile phone 155 can communicate with each other through the network 100. The network 100 can be the Internet or a wired local area network (Wired Local Area Network, LAN), wireless local area network, or any combination of the above. The desktop computer 151, the tablet computer 153, and the mobile phone 155 can be called clients, which deploy applications to the application server 110 through the network 100, or execute services running on the application server 110 through the network 100 . Applications are usually developed by Service Providers and deployed to the application server 110. They contain various business logics, including but not limited to digital bank management, online banking, mobile customer service, and internal enterprise process management , Big data storage, big data data integration, big data data retrieval and other fields.

Figure 2 is a system architecture diagram of a computing device according to an embodiment of the present invention. This system architecture can be implemented in any of the application server 110, the desktop computer 151, the tablet computer 153, and the mobile phone 155, and at least includes the processing unit 210. The processing unit 210 can be implemented in a variety of ways, such as a dedicated hardware circuit or a general-purpose hardware (for example, a single processor, a multi-processor with parallel processing capabilities, a graphics processor, or other processors with computing capabilities). When running code or software, provide the functions described later. The system architecture also includes a memory 250 and a storage unit 240. The memory 250 stores data needed during the execution of the program code, such as variables, data tables, etc. The storage unit 240 stores various electronic files, such as , Web pages, documents, audio files, video files, etc. The system architecture further includes a communication interface 260, so that the processing unit 210 can communicate with other electronic devices. The communication interface 260 may be a wireless telecommunications module (Wireless Telecommunications Module), a local area network (LAN) communication module, or a wireless local area network communication module (WLAN). The wireless telecommunications module (Wireless Telecommunications Module) can include a modem that supports any combination of 2G, 3G, 4G or above technology generations. The input device 230 may include a keyboard, a mouse, a touch panel, etc. The user can press hard keys on the keyboard to input characters, operate the mouse to control the mouse, or make gestures on the touch panel to control the running application. Gestures may include single-click, double-click, single-finger drag, multi-finger drag, etc., but are not limited thereto. The display unit 220 may include a display panel (for example, a thin-film liquid crystal display panel, an organic light-emitting diode panel, or other panels with display capabilities) for displaying input characters, numbers, symbols, moving traces of dragging the mouse, and drawing Patterns or screens provided by applications are provided for users to watch.

The application server 110 provides an application execution environment, providing various services for each application, such as request dispatch and load balancing, digital authentication center, application programming interface (API) authorization management, and user authorization /Traffic/Internet Protocol (IP) control, organizational hierarchy management, information security connection (SSL/TLS) management, digital signature verification, smart data encryption, single sign-on active directory (Single Sign-On Active) Directory, SSO AD) integration, cross-site command (Cross-Site Scripting, XSS) anti-hacking attacks, API hot deployment, session fail-over (Session Fail-over), duplicate transaction prevention mechanism, VIP API priority, heterogeneous deployment/multiple Version operation, API debugging, API track record, server monitoring/alarm, report by API/user, (Java)DC host binding management, .NET site binding management, registered host management, API service registration, API module Deployment and release, API combination and design, etc. On the other hand, these functions can also be used by a variety of different applications. Therefore, the environment in which the applications are executed as described above is also called the Shared Service Platform.

In order to separate the tasks that need to be executed for a long time and for a short time, the application server 110 may provide two task queues in its memory 250: a main queue and a secondary queue. Fig. 3 is a schematic diagram of a queue configuration according to an embodiment of the present invention. For example, the memory 250 allocates space to the main queue 310 and the second queue 330 respectively. The main queue 310 is used to store the objects sent by the client (including the short time and Long-time processing tasks), and the secondary queue 330 is used to store objects migrated from the main queue 310 according to the time sequence when they arrive at the application server 110 (including only tasks that require long-term processing). The main queue 310 and the secondary queue 330 each include a collection formed by multiple entries (Entry). Each item in the main queue 310 and the second queue 330 can store one object. The basic principle of the operation of the main queue 310 and the secondary queue 330 is to add an object (which can be called enqueue) from the end position (as indicated by the index T), and from the start position (as indicated by the index H) ) Remove objects (can be called dequeue). In other words, the first object added to the main queue 310 or the second queue 330 will also be the first to be removed, which conforms to the First-In First-Out (FIFO) principle .

In order to distinguish between tasks that require long-term processing and tasks that require short-term processing, the client-side application can generate objects that inherit different abstract classes (Abstract Class), and send the generated objects to the application server 110 through the network 100 . 4A and 4B are class diagrams according to the embodiment of the present invention.

The category diagram of FIG. 4A contains a job abstract category "Abstract Job" 410, which contains at least one attribute: a long integer of job type "jobType"; and a method: a job execution "runJob()" that does not return a value. The mail category "Mail" 422 and the database processing category "DB_Trans" 424 extension (Extends) work abstract category "Abstract Job" 410, representing that they are short-time processing jobs. The mail category "Mail" 422 contains at least several attributes: the long integer of the group identification code "groupID", the string of multiple receiving addresses "To[]" and the string of multiple duplicate addresses "CC[]"; and One method: execute "runJob()" for jobs that do not return a value. The database processing category "DB_Trans" 424 contains at least several attributes: the long integer of the group ID "groupID", the string of the database name "dbName" and the string of the SQL command "sqlQuery"; and one method: do not pass The return job executes "runJob()". Among them, the group identification code "groupID" is used to distinguish whether different objects are the same or not. For example, if the application repeatedly detects whether the database system has the last piece of data, the serial number will generate multiple objects of the database processing type "DB_Trans" 424. However, their group ID "groupID" is the same .

The category diagram of FIG. 4B includes the deferrable job abstract category "Abstract DefferableJob" 450, which contains at least one attribute: a long integer of the job type "jobType"; and a method: a job execution "runJob()" that does not return a value. The group mail category "GroupMail" 462 and the database batch processing category "DB_BatchTrans" 464 expand the deferable job abstract category "Abstract DefferableJob" 450, representing that they are long-time processing jobs. The group mail category "GroupMail" 462 contains at least several attributes: the long integer of the group identification code "groupID", the string of multiple receiving addresses "To[]" and the string of multiple duplicate addresses "CC[]" ; And a method: "runJob()" is executed without returning a value. The database batch processing category "DB_BatchTrans" 464 contains at least several attributes: the long integer of the group ID "groupID", the string of the database name "dbName" and the string of the SQL command "sqlQuery"; and a method: "RunJob()" is executed for jobs that do not return a value. Similarly, the group ID "groupID" is used to distinguish whether different objects are the same or not.

In addition, a long integer of the job type "jobType" can store the information of an object whose type is extended from the job abstract type "Abstract Job" 410 or the deferable job abstract type "Abstract DefferableJob" 450.

The client can request applications after generating objects of the mail category "Mail" 422, database processing category "DB_Trans" 424, group mail category "GroupMail" 462, database batch processing category "DB_BatchTrans" 464 or other categories The commands executed by the server 110 are placed in the job execution method "runJob()", which is used to complete the requested job after the application server 110 executes these commands.

FIG. 5 is a flowchart of a method of scheduling and executing tasks according to an embodiment of the present invention, which is implemented by the processing unit 210 of the application server 110 (hereinafter referred to as the processing unit 210 for simplicity) when loading and executing a specific software module , Used to complete the work stored in the main queue 310. The detailed description is as follows:

Step S510: Take out an object from the top of the main queue 310. The object is generated by the client to request the application server to perform a specific service.

Step S520: Determine whether there are any objects in the main queue 310 that are the same as the retrieved objects. If yes, continue with the processing of step S530; otherwise, continue with the processing of step S550. In detail, the processing unit 210 can determine whether there is any object in the main queue 310, which includes the same group ID as the group ID of the retrieved object. If so, it indicates whether the same object exists in the main queue 310.

Step S530: Discard the object without processing. Since the same task only needs to be executed once, the processing unit 210 can discard the previous repeated tasks and only execute the last task, so as to avoid the application server 110 from spending unnecessary time and resources for processing. Although the previous repeated work is discarded, the user can still get the results of the last work execution.

Step S540: Wait for a preset period of time, such as 0.5 second, 1 second, or preset time greater than 0 second according to system requirements.

Step S550: Determine whether the retrieved object contains short-time processing tasks. If yes, continue with the processing of step S560; otherwise, continue with the processing of step S580. In detail, the processing unit 210 can determine whether the retrieved object is extended from the abstract job category "Abstract Job" 410 or extended from the abstract job category "Abstract DefferableJob" 450. If it is expanded from the job abstract category "Abstract Job" 410, then the representative judgment is established.

Step S560: Perform the work of taking out the object. In detail, the processing unit 210 can execute the task execution method "runJob()" for taking out the object to complete the short-time processing task.

Step S570: Reply the execution result of this task to the client. In detail, the processing unit 210 can reply the execution result of the task (for example, a message of execution success or failure, searched data, etc.) to the client via the network 100 through the communication interface 260.

Step S580: Reply to the client that the task is being executed. In detail, since this task needs to be executed for a long time, the processing unit 210 can first reply to the client a message that the task is being executed via the network 100 through the communication interface 260.

Step S590: Migrate the retrieved objects to the bottom end of the secondary queue 330. It should be noted here that the processing unit 210 will fetch and execute the objects in the secondary queue 330 in FIFO order at an appropriate time.

Here are a few use cases to help illustrate the method shown in Figure 5. Assume that the initial state of the main queue 310 and the secondary queue 330 is shown in Figure 3, where the object "X" represents the object of the database batch processing category "DB_BatchTrans" 464, and the object "Y" represents the database processing category " The object of "DB_Trans" 424, and the object "Z" represents an object of the group mail category "GroupMail" 462.

FIG. 6 is a schematic diagram of the work in the main queue being executed at time t1 according to the embodiment of the present invention. Since the object "Y" contains a job that needs to be processed in a short time (the path of "Yes" in step S550), the processing unit 210 directly executes the task indicated in the object "Y" (step S560), and replies the execution result of this job to the client End (step S570).

FIG. 7 is a schematic diagram of the tasks in the main queue being executed from time points t2 to t4 according to an embodiment of the present invention. Since the main queue 310 contains the same object "X" (the path of "Yes" in step S520), the processing unit 210 directly takes these duplicate objects "X" from the main queue 310 and discards them without executing.

FIG. 8 is a schematic diagram of the work in the main queue being executed at time t5 according to the embodiment of the present invention. Since there is no longer the same object "X" in the main queue 310 (the path of "No" in step S520) and the object "X" contains work that requires a long time to process (the path of "No" in step S550), the processing unit 210 Reply the message that the task is being executed to the client (step S580), and migrate the object "X" retrieved from the main queue 310 to the bottom end of the secondary queue 330, waiting to be executed in the future (step S590). It should be noted here that the application server 110 can execute another method when loading and executing related code, which is used to sequentially retrieve objects from the top of the secondary queue 330 and perform the services requested by the objects.

All or part of the steps in the method of the present invention can be implemented by computer programs, such as the operating system of the computer, the driver of a specific hardware in the computer, or a software application. In addition, it can also be implemented in other types of programs as shown above. Those with ordinary knowledge in the technical field can write the method of the embodiment of the present invention into a computer program, which will not be described for brevity. The computer program implemented according to the method of the embodiment of the present invention can be stored in a suitable computer readable data carrier, such as DVD, CD-ROM, USB disk, hard disk, and can also be placed on the Internet (for example, Internet Or other appropriate vehicle).

Although FIG. 2 includes the above-described components, it is not ruled out that without violating the spirit of the new type, more other additional components are used to achieve better technical effects. In addition, although the steps in Figure 5 are executed in a specified order, those skilled in the art can modify the order of these steps on the premise of achieving the same effect without violating the spirit of the new style. Therefore, the present invention does not It is limited to using only the sequence described above. In addition, those skilled in the art can also integrate several steps into one step, or perform more steps in addition to these steps sequentially or in parallel, and the present invention is not limited by this.

Although the present invention is described using the above embodiments, it should be noted that these descriptions are not intended to limit the present invention. On the contrary, this new model covers modifications and similar settings that are obvious to those skilled in the art. Therefore, the scope of applied claims must be interpreted in the broadest way to include all obvious modifications and similar settings.

100: Internet 110: Application server 151: Desktop Computer 153: Tablet 155: Mobile 210: Processing Unit 220: display unit 230: input device 240: storage device 250: memory 260: Communication interface 310: Main Queue 330: Level 2 Queue 410,450: Abstract category 422,424,462,464: category S510~S590: method steps X, Y, Z: Object t1~t5: time point

Figure 1 is a diagram of the network system architecture according to an embodiment of the present invention. Figure 2 is a system architecture diagram of a computing device according to an embodiment of the present invention. Fig. 3 is a schematic diagram of a queue configuration according to an embodiment of the present invention. 4A and 4B are category diagrams according to the embodiment of the present invention. Figure 5 is a flowchart of a method for scheduling and executing tasks according to an embodiment of the present invention. FIG. 6 is a schematic diagram of the work in the main queue being executed at time t1 according to the embodiment of the present invention. FIG. 7 is a schematic diagram of the tasks in the main queue being executed from time points t2 to t4 according to an embodiment of the present invention. FIG. 8 is a schematic diagram of the work in the main queue being executed at time t5 according to the embodiment of the present invention.

110: Application server

151: Desktop Computer

153: Tablet

155: Mobile

210: Processing Unit

220: display unit

230: input device

240: storage device

250: memory

260: Communication interface

Claims (10)

A computer program product for scheduling and executing tasks, containing code that can be loaded and executed by a processing unit of an application server, used to: Fetch an object from the top of a main queue, wherein the object is generated by a client to request the application server to perform a service; Determine whether there are any objects in the main queue that are the same as the above objects; and When there is any object that is the same as the above object in the above main queue, the above object is discarded without processing. The computer program product for scheduling and executing tasks as described in claim 1, wherein, by detecting a group identification code attribute of all objects in the main queue, it is determined whether the main queue is the same as the object Any object. The computer program product for scheduling and executing tasks as described in claim 1, including code for: When there is no object that is the same as the above-mentioned object in the above-mentioned main queue, it is determined that the above-mentioned object includes a short-term processing task or a long-term processing task; When the above-mentioned object contains the above-mentioned short-time processing work, execute the above-mentioned short-time processing work; and When the above-mentioned object includes the above-mentioned long-term processing work, the above-mentioned object is moved to the bottom end of the first-level and second-level queue for future processing. The computer program product for scheduling and executing tasks as described in claim 3, wherein, by determining whether the object is extended from a first abstract category or a second abstract category, it is determined that the object includes the short-time processing task or the long-term processing task. Time to deal with work. The computer program product for scheduling and executing tasks according to claim 3, wherein the short-time processing tasks are completed by executing one of the methods in the above objects. A device for scheduling and executing tasks, including: A memory for allocating space for a main queue; and A processing unit, coupled to the memory, used to retrieve an object from the top of the main queue, wherein the object is generated by a client to request the device to perform a service; and determine whether there is the same in the main queue Any object of the object; and when there is any object that is the same as the above object in the main queue, the above object is discarded without processing. The device for scheduling and executing tasks according to claim 6, wherein the processing unit determines whether there are objects in the main queue that are the same as the above objects by detecting a group identification code attribute of all objects in the main queue Of any object. The device for scheduling and executing tasks according to claim 6, wherein the processing unit determines that the object includes a short time processing task or a long time when there is no object that is the same as the above object in the main queue Processing work; when the above-mentioned object contains the above-mentioned short-time processing work, execute the above-mentioned short-time processing work; and when the above-mentioned object contains the above-mentioned long-time processing work, move the above-mentioned object to the bottom of the first and second queues for future processing . The device for scheduling and executing tasks according to claim 8, wherein the processing unit determines that the object includes the short-term processing task or the short-term processing task by determining whether the object is extended from a first abstract category or a second abstract category. Processing work for a long time. The device for scheduling and executing tasks according to claim 8, wherein the processing unit completes the short-time processing tasks by executing one of the methods in the above objects.

Images