TWI756685B - 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 performing work

The present invention relates to a job processing technology, and more particularly to a computer program product and apparatus for scheduling and executing jobs.

Application servers are often required to handle a variety of different types of work. Some tasks need to be performed for a short period of time, such as simple database transactions; other tasks need to be performed for a long time, such as a large number of summary calculations for data tables in the database, resulting in long-term tasks that will hinder short-time tasks. execution. In addition, some jobs need to be executed sequentially and conditionally. After a short delay, the execution of the secondary branch will not be continued until the execution of the primary branch is completed. For example, multiple pieces of data are written into the database, and after the writing is completed, the generation serial number of the last piece of data is obtained 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 work of generating the serial number to obtain the last piece of 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 piece of data, causing the application server to continuously receive a lot of detection work. In other cases, users often press the refresh button on the user interface to query data continuously, causing the application server to continuously receive many of the same query jobs. These repetitions of the same work can increase the workload of the application server. Therefore, there is a need for a computer program product and apparatus for scheduling and executing jobs that efficiently handle the different types of jobs generated by applications.

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

This specification relates to a computer program product for scheduling and executing work, including code that can be loaded and executed by a processing unit of an application server for: fetching an object from the top of the main queue, the object being executed by the client Generated to request the application server to perform service; determine whether there is any object identical to this object in the main queue; and when there is any object identical to this object in the main queue, discard this object without processing.

The present specification also relates to an apparatus for scheduling and executing work, including a memory and a processing unit. Memory allocation space for the main queue. The processing unit is coupled to the memory, and is used for fetching an object from the top of the main queue, the object is generated by the client to request the device to execute the service; determining whether there is any object identical to the object in the main queue; and when the main queue When there is any object in the row that is identical to this object, this object is discarded and not processed.

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

The following description is a preferred implementation manner to complete the invention, and its purpose is to describe the basic spirit of the invention, but it is not intended to limit the invention. Reference must be made to the scope of the following claims for the actual inventive content.

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

The use of words such as "first", "second", "third", etc. in the claims is used to modify the elements in the claims, and is not used to indicate that there is a priority order, a preceding relationship between them, or an element Prior to another element, or chronological order in which method steps are performed, 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 the other element, and intervening elements may be present. In contrast, when an element is described as being "directly connected" or "directly coupled" to another element, there are no intervening elements present. Other words used to describe the relationship between elements can also be read in a similar fashion, such as "between" versus "directly interposed," or "adjacent" versus "directly adjoining," and the like.

An embodiment of the present invention provides a network system architecture, including a server (servers) and a plurality of clients (clients). FIG. 1 is an architecture diagram of a network system 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 , and the network 100 can be the Internet, a 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 referred to as clients, deploying applications to the application server 110 through the network 100 , or executing services running on the application server 110 through the network 100 . The application is usually developed by a service provider and deployed to the application server 110, and includes various business logics, which may include but are not limited to digital banking management, online banking, mobile customer service, and enterprise internal process management , big data storage, big data data integration, big data data retrieval and other fields.

FIG. 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 one of the application server 110 , the desktop computer 151 , the tablet computer 153 , and the mobile phone 155 , including at least the processing unit 210 . The processing unit 210 may be implemented in a variety of ways, such as in dedicated hardware circuits or general-purpose hardware (eg, a single processor, a multiprocessor with parallel processing capabilities, a graphics processor, or other processors with computing capabilities), and in When the code or software is executed, the functions described later are provided. The system architecture further includes a memory 250 and a storage unit 240. The memory 250 stores data required during the execution of the code, such as variables, data tables, etc., and 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 for the processing unit 210 to 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 may include any combination of modems (Modems) supporting 2G, 3G, 4G or above technology generations. The input device 230 may include a keyboard, a mouse, a touch panel, and the like. The user can press hard keys on the keyboard to input characters, control the mouse by operating the mouse, or control the running application by making gestures on the touch panel. 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 (eg, a thin-film liquid crystal display panel, an organic light-emitting diode panel, or other panels with display capability) for displaying inputted characters, numbers, symbols, dragging mouse movements, and drawn The picture provided by the pattern or the application program is provided for the user to watch.

The application server 110 provides an application execution environment and provides various services for each application, such as request dispatch and load balancing, digital authentication center, application programming interface (API) authorization management, user authorization /traffic/Internet Protocol (IP) control, organization level management, information security connection (SSL/TLS) management, digital signature verification, sensitive data encryption, single sign-on active directory (Single Sign-On Active Directory) Directory, SSO AD) integration, Cross-Site Scripting (XSS) anti-hack attack, API hot deployment, Session Fail-over, Duplicate transaction prevention mechanism, VIP API priority, heterogeneous deployment/multiple Version operation, API debugging, API track record, server monitoring/alarm, API/user report, (Java)DC host binding management, .NET platform binding management, registered host management, API service registration, API module Deployment release, API composition 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 a Shared Service Platform.

To separate long-running and short-running jobs, the application server 110 may provide two job queues in its memory 250: a primary 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 primary queue 310 and the secondary queue 330, respectively. The primary queue 310 is used to store the objects (including the objects that need a short time and Long-running jobs), while the secondary queue 330 is used to store objects migrated from the primary queue 310 (including only long-running jobs) in chronological order of arrival at the application server 110. The primary queue 310 and the secondary queue 330 each contain a collection formed by multiple entries (Entry). Each item in the primary queue 310 and the secondary queue 330 can store one object. The basic principle of 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 (such as the position indicated by the indicator T), and add an object (which can be called entering the queue) from the end position (such as the position indicated by the index H), and add an object (may be called entering the queue) from the end position (such as the position indicated by the index H), and start the position (such as the position indicated by the index H). ) to remove the object (may be called dequeuing). That is to say, the first object added to the primary queue 310 or the secondary queue 330 will also be the first to be removed, which conforms to the First-In First-Out (FIFO) principle. .

In order to distinguish the work that needs to be processed for a long time from the work that needs to be processed in a short time, the application program executed by the client can generate objects that inherit different abstract classes, and transmit the generated objects to the application server 110 through the network 100 . 4A and 4B are class diagrams according to an embodiment of the present invention.

The class diagram of Figure 4A contains a job abstract class "Abstract Job" 410, containing at least one attribute: a long integer of job type "jobType"; and a method: a job execution "runJob()" that returns no value. The mail class "Mail" 422 and the database processing class "DB_Trans" 424 extend (Extends) the job abstract class "Abstract Job" 410 to represent that they are short-term processing jobs. The mail class "Mail" 422 contains at least several attributes: a long integer of the group identifier "groupID", a string of multiple recipient addresses "To[]", and a string of multiple copy 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: a long integer for the group identifier "groupID", a string for the database name "dbName", and a string for the SQL command "sqlQuery"; and a method: not transfer The job that returns the value executes "runJob()". Among them, the group identification code "groupID" is used to distinguish whether different objects are the same or not. For example, the application program repeatedly detects whether the database system has the generation serial number of the last data, and multiple databases will be generated to process objects of type "DB_Trans" 424, however, their group ID "groupID" is the same .

The class diagram of Figure 4B contains a deferred job abstract class "Abstract DefferableJob" 450, containing at least one attribute: a long integer of job type "jobType"; and a method: a job execution "runJob()" that returns no value. The group mail class "GroupMail" 462 and the database batch class "DB_BatchTrans" 464 extend the deferred job abstract class "Abstract DefferableJob" 450 to represent that they are long-running jobs. The group mail category "GroupMail" 462 contains at least several attributes: a long integer of the group identification code "groupID", a string of multiple recipient addresses "To[]", and a string of multiple copy addresses "CC[]" ; and a method: a job that does not return a value executes "runJob()". The database batch class "DB_BatchTrans" 464 contains at least several attributes: a long integer for the group identifier "groupID", a string for the database name "dbName", and a string for the SQL command "sqlQuery"; and a method: Jobs that do not return a value execute "runJob()". Similarly, the group identifier "groupID" is used to distinguish different objects from being the same or not.

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

The client may request the application after generating objects of the mail class "Mail" 422, the database processing class "DB_Trans" 424, the group mail class "GroupMail" 462, the database batch processing class "DB_BatchTrans" 464 or other classes. The instructions executed by the server 110 are placed in the job execution method "runJob( )" to complete the requested job after the application server 110 executes the instructions.

5 is a flowchart of a method for scheduling and executing tasks according to an embodiment of the present invention, which is implemented by the processing unit 210 (hereinafter referred to as the processing unit 210 for brevity) of the application server 110 when loading and executing a specific software module , used to complete the work stored in the main queue 310. Details are 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 execute a specific service.

Step S520: Determine whether there is any object in the main queue 310 that is the same as the extracted object. If yes, proceed to the process of step S530; otherwise, proceed to the process of step S550. Specifically, 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 "groupID" of the extracted object. If yes, it represents whether the same object exists in the main queue 310.

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

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

Step S550: Determine whether the extracted object includes short-time processing work. If yes, proceed to the process of step S560; otherwise, proceed to the process of step S580. Specifically, the processing unit 210 can determine whether the fetched object is extended from the job abstract class “Abstract Job” 410 or from the deferred job abstract class “Abstract DefferableJob” 450 . If it is extended from the job abstract category "Abstract Job" 410, it means that the judgment is established.

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

Step S570: Reply the execution result of the work to the client. Specifically, the processing unit 210 can reply the execution result of the work (eg, a message of execution success or failure, searched data, etc.) to the client through the communication interface 260 via the network 100 .

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

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

Several use cases are listed below to assist in explaining the method shown in Figure 5. Assume that the initial state of the primary queue 310 and the secondary queue 330 is as shown in Figure 3, wherein the object "X" represents the object of the database batch processing class "DB_BatchTrans" 464, and the object "Y" represents the database processing class " DB_Trans" 424 object, and object "Z" represents an object of the group mail class "GroupMail" 462.

FIG. 6 is a schematic diagram of executing work in the main queue at time point t1 according to an 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 job indicated in the object "Y" (step S560 ), and returns the execution result of this job to the client terminal (step S570).

FIG. 7 is a schematic diagram of performing work in the main queue at 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 out these duplicate objects "X" from the main queue 310 and discards them without executing.

FIG. 8 is a schematic diagram of executing work in the main queue at time t5 according to an embodiment of the present invention. Since the same object "X" already does not exist in the main queue 310 (the path of "No" in step S520) and the object "X" contains work that needs to be processed for a long time (the path of "No" in step S550), the processing unit 210 Reply the message that the job is being executed to the client (step S580 ), and migrate the object “X” taken out from the primary queue 310 to the bottom of the secondary queue 330 , waiting to be executed in the future (step S590 ). It should be noted here that the application server 110 may execute another method when the relevant code is loaded and executed, for sequentially fetching the object from the top of the secondary queue 330 and executing the service requested by the object.

All or part of the steps in the method of the present invention can be implemented by a computer program, such as a computer's operating system, a specific hardware driver in the computer, or a software application. In addition, it can also be implemented in other types of programs as shown above. Those skilled in the art can write the methods of the embodiments of the present invention into computer programs, which are not described for brevity. The computer program implemented by the method according to 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, or can be stored in a computer that can be accessed through a network (for example, the Internet route, or other suitable vehicle) to access the web server.

Although the above-described elements are included in FIG. 2 , it is not excluded that more other additional elements may be used to achieve better technical effects without departing from the spirit of the invention. In addition, although the steps in FIG. 5 are performed 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 invention. Therefore, the present invention does not Constrained to use only the sequence as described above. In addition, those skilled in the art can also integrate several steps into one step, or in addition to these steps, perform more steps sequentially or in parallel, and the present invention is not limited thereby.

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 invention covers modifications and similar arrangements obvious to those skilled in the art. Therefore, the scope of the appended claims is to be construed in the broadest manner so as to encompass all obvious modifications and similar arrangements.

100: Internet 110: Application Server 151: Desktop Computers 153: Tablet PC 155: cell phone 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

FIG. 1 is an architecture diagram of a network system according to an embodiment of the present invention. FIG. 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 class diagrams according to embodiments of the present invention. FIG. 5 is a flowchart of a method for scheduling and executing work according to an embodiment of the present invention. FIG. 6 is a schematic diagram of executing work in the main queue at time point t1 according to an embodiment of the present invention. FIG. 7 is a schematic diagram of performing work in the main queue at time points t2 to t4 according to an embodiment of the present invention. FIG. 8 is a schematic diagram of executing work in the main queue at time t5 according to an embodiment of the present invention.

S510~S590: method steps

Claims (8)

A computer program product for scheduling and executing work, comprising code capable of being loaded and executed by a processing unit of an application server for: retrieving an object from the top of a main queue, wherein the object is composed of a The client is generated to request the above-mentioned application server to perform a service; it is judged whether there is any object identical to the above-mentioned object in the above-mentioned main queue; when there is any object that is identical to the above-mentioned object in the above-mentioned main queue, the above-mentioned object is discarded and No processing; when there is no object identical to the above-mentioned object in the above-mentioned main queue, it is determined that the above-mentioned object contains a first-type job or a second-type job, wherein the above-mentioned first-type job requires more processing time than the above-mentioned second type of job. The processing time required for the type of work is short; when the above-mentioned object contains the above-mentioned first type of work, the above-mentioned first type of work is executed; and when the above-mentioned object contains the above-mentioned second type of work, the above-mentioned object is moved to the bottom of the first-level queue. terminal for future processing. The computer program product for scheduling and executing work as claimed in claim 1, wherein whether there is an object in the main queue that is the same as the object is determined by detecting a group identifier attribute of all objects in the main queue. any object. The computer program product for scheduling and executing work according to claim 1, wherein it is judged that the object includes the work of the first class or the work of the first class by judging whether the object is extended from a first abstract class or a second abstract class Two categories of work. The computer program product for scheduling and performing work of claim 1, wherein the work of the first category is accomplished by executing a method of the objects. A device for scheduling and executing work, comprising: a memory for allocating space to a main queue; and a processing unit, coupled to the memory, for fetching an object from the top of the main queue, wherein The above-mentioned object is generated by a client to request the above-mentioned device to perform a service; it is judged whether there is any object identical to the above-mentioned object in the above-mentioned main queue; and when any object identical to the above-mentioned object exists in the above-mentioned main queue, the above-mentioned object is discarded The object is not processed; wherein: when the above-mentioned main queue does not exist any object identical to the above-mentioned object, the above-mentioned processing unit judges that the above-mentioned object includes a first type of work or a second type of work, wherein the above-mentioned first type of work requires The processing time is shorter than the processing time required for the above-mentioned second type of work; when the above-mentioned object contains the above-mentioned first type of work, execute the above-mentioned first type of work; and when the above-mentioned object contains the above-mentioned second type of work, migrate the above-mentioned object to The bottom of the first- and second-level queues for future processing. The device for scheduling and executing work according to claim 5, wherein the processing unit determines whether the same object exists in the main queue by detecting a group identifier attribute of all objects in the main queue of any object. The apparatus for scheduling and executing work according to claim 5, wherein the processing unit determines that the object includes the work of the first class or the work of the first class by judging whether the object is extended from a first abstract class or a second abstract class The second category of work. The apparatus for scheduling and executing work according to claim 5, wherein the processing unit completes the work of the first category by executing a method in the object.

Images