A JAVA unifed task center scheduling method

Abstract

The invention provides a JAVA unified task center scheduling method, comprising the following steps: accessing a task through a unified task API interface; distributing the accessed tasks to a local server or a network server; processing the tasks through queuing. The invention provides sufficient task scheduling extension points through the unified task interface, and has flexible configuration and distributed task scheduling, avoids task repeated execution, and realizes flexible and efficient automatic task switching execution strategy.

Description

technical field [0001] The invention belongs to the technical field of task schedulers, and in particular relates to a JAVA unified task center scheduling method. Background technique [0002] In computer software programming, any job scheduler in the strict sense provides direct specification of execution time, storage of job information to various introductions, customization using hooks, and other more functions. Several mainstream job schedulers are mainly used now. , such as JDK's native Timer scheduler, which is suitable for simple scheduling, but the configuration is simple, it cannot support flexible scheduling, and only tasks can be executed serially. The result of the previous task affects the next task. If there is a scheduled task running, unprocessed If there is an exception, the current thread will stop, and all scheduled tasks will be stopped and affected, and need to be created repeatedly during execution. There is no concept of thread pool, and resources can...

AI Technical Summary

Problems solved by technology

[0002] In computer software programming, any job scheduler in the strict sense provides direct specification of execution time, storage of job information to various introductions, customization using hooks, and other more functions. Several mainstream job schedulers are mainly used now. , such as JDK's native Timer scheduler, which is suitable for simple scheduling, but the configuration is simple, it cannot support flexible scheduling, and only tasks can be executed serially. The result of the previous task affects the next task. If there is a scheduled task running, unprocessed If there is an exception, the current thread will stop, and all scheduled tasks will be stopped and affected, and need to be created repeatedly during execution. There is no concept of thread pool, and resources cannot be shared; for thread pool task scheduling, it is suitable for simple scheduling, task execution The time interval is not fixed, it does not support complex scheduling tasks, and it cannot achieve task cluster scheduling; for Quartz task scheduling, it is suitable for complex scheduling, but it is difficult to learn, difficult to master, and it is inconvenient to change time rules, and it cannot distinguish between horizontal clusters or vertical clusters

[0003] From the above-mentioned mainstream schedulers, we can see that all kinds of scheduling of the execution scheduler need to be learned, and the learning cycle is long. Some task scheduling cannot be distributed, and the task configuration is not uniform, scattered, difficult to manage, and there is no convenient and quick management. In the background, it is difficult to adjust in time. At the same time, task scheduling has no persistence, which is easy to lose and difficult to recover

The shortcomings of mainstream schedulers make it difficult for these schedulers to become a full-fledged job scheduler

Images