Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Distributed job scheduling method

A job scheduling and distributed technology, applied in resource allocation, program startup/switching, program control design, etc., can solve problems such as job level expansion and sacrifice, and achieve the effect of good efficiency and performance, and high task efficiency

Pending Publication Date: 2020-01-14
SICHUAN XW BANK CO LTD
View PDF5 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] In view of the above-mentioned research problems, the purpose of the present invention is to provide a distributed job scheduling method to solve the problem in the prior art that dependent jobs can only have one fragment, resulting in the sacrifice of horizontal expansion of jobs

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Distributed job scheduling method
  • Distributed job scheduling method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0058] The job configuration exists in the MySQL database, and the job operation mode is job fragmentation, that is, the job fragmentation is stored in the memory of the server running the job.

[0059] In the application scenario of dependent jobs in the financial field, configure four jobs A, B1, B2, and C. The number of slices for each job is 2. B1, B2, and C are configured with corresponding job names of dependent jobs, as follows ;

[0060] Job A: Execute the trigger once a day, no dependent jobs;

[0061] Job B1: Execute a trigger every second, depending on job A, that is, both job slices depend on A;

[0062] Job B2: Execute the trigger once per second and depend on job A, that is, both job slices depend on A;

[0063] Job C: Execute a trigger every second, depending on jobs B1 and B2, that is, both job slices depend on B1 and B2;

[0064] After all jobs (that is, JAVA-dependent jobs A, B1, B2, and C) are enabled, other jobs except the initial job A (that is, all job...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a distributed job scheduling method, belongs to the technical field of job scheduling under a distributed task scheduling framework, and solves the problem that horizontal capacity expansion of jobs is sacrificed due to the fact that only one fragment exists in dependent jobs in the prior art. The method comprises the following steps: fragmenting each job according to an application scene to obtain job fragments; wherein each job has a field used for describing dependent jobs of the job, if the job is not an initial job, related information of the dependent jobs is configured in the fields, all JAVA dependent jobs are obtained after configuration, and all the JAVA dependent jobs comprise the initial job and the JAVA dependent jobs configured with the fields; and based on the job fragments and all JAVA dependent jobs, periodically triggering each JAVA dependent job to execute logic judgment, and executing or not executing the jobs according to a judgment result until all jobs in the whole process are normally completed. The method is used for distributed job scheduling.

Description

technical field [0001] A distributed job scheduling method is used for distributed job scheduling and belongs to the technical field of job scheduling under the framework of distributed task scheduling. Background technique [0002] In the prior art, scheduled tasks are managed and scheduled through a cluster, and distributed deployment is adopted to ensure high availability of the system and improve fault tolerance. This is what a distributed job scheduling platform can achieve. [0003] In the prior art, Saturn 3.3.0 already has its own dependent job implementation, and its implementation scheme is as follows: [0004] 1) Whether the job is executed is judged by the immediate execution detection of the worker corresponding to the job once per second. [0005] 2) Selection of job type: Job scheduling is an orderly and acyclic process, so the first job and other jobs are two job types (the first job is a JAVA / SHELL scheduled job, and the other jobs are JAVA / SHELL dependent...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F9/48G06F9/50
CPCG06F9/4843G06F9/5061Y02D10/00
Inventor 谢延泽李佳明周勇
Owner SICHUAN XW BANK CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com