Timing operation scheduling method and system capable of supporting operation dependency relationship

A technology of dependencies and job scheduling, applied in the computer field, can solve problems such as job dependencies, and achieve the effects of simple system implementation, high efficiency, and simple technology implementation.

Inactive Publication Date: 2018-05-15
SUN YAT SEN UNIV
View PDF8 Cites 17 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The present invention proposes a timing job scheduling method capable of supporting job dependencies, which solves the problem of dependencies between jobs and also solves the problem of jobs being scheduled and executed at a specified time

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
  • Timing operation scheduling method and system capable of supporting operation dependency relationship
  • Timing operation scheduling method and system capable of supporting operation dependency relationship
  • Timing operation scheduling method and system capable of supporting operation dependency relationship

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0057] figure 1 The functional modules of the present invention are described, including storage unit, scheduler and execution unit. The storage unit is used to read and write data to the persistence layer, and provides an interface for the scheduler to read job-related information; the scheduler performs dependent scheduling and timing scheduling on tasks, obtains job information from the storage unit, and assigns tasks to the execution unit; The execution unit is the working node that executes the task, receives and executes the task assigned by the scheduler, and feeds back the task execution result to the scheduler.

[0058] The specific process of the method provided in this embodiment is as follows:

[0059] S1. The scheduler loads job-related data from the storage unit, including job information list and job dependencies;

[0060] S2. The scheduler converts the job information list into a job directed acyclic graph according to the job dependencies;

[0061] S3. The ...

Embodiment 2

[0067] figure 2 The initialization process of the scheduler is described, and the specific process is as follows:

[0068] S11: the scheduler loads job-related data from the storage unit, including job information list and job dependencies;

[0069] S12: Transform the job list into a job graph structure according to the job dependencies, where each node of the job graph structure represents the corresponding job information;

[0070] S13: Determine whether there is a cycle in the operation graph structure, if there is, continue to step S14, otherwise transfer to step S15;

[0071] S14: Obtain the sub-connected graph where the ring is located in the job graph structure, remove the sub-connected graph to make the job graph structure legal, and at the same time, the system alarms to indicate that the job dependency is abnormal;

[0072] S15: Obtain a legal DAG of jobs;

[0073] S16: Using the job directed acyclic graph as a copy to generate a task directed acyclic graph, wher...

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 relates to a timing operation scheduling method capable of supporting an operation dependency relationship. The method comprises the following steps that: S1: a scheduler loads operationrelated data, including an operation information list and an operation dependency relationship, from a memory unit; S2: according to the operation dependency relationship, converting the operation information list into an operation directed acyclic graph; S3: the scheduler takes the operation directed acyclic graph as a copy to generate a task directed acyclic graph; S4: the scheduler carries outdependency scheduling on tasks of which the node incoming degree is 0 in the task directed acyclic graph; S5: the scheduler carries out timing scheduling on the tasks of which the node incoming degree is 0 in the task directed acyclic graph according to task triggering time; and S6: after an execution unit executes the above task, a relevant execution result is fed back to the scheduler.

Description

technical field [0001] The present invention relates to the field of computer technology, and more specifically, to a timing job scheduling method and system supporting job dependencies. Background technique [0002] In recent years, with the rapid development of the Internet, big data storage, and distributed computing, the increasing scale of computing has become a severe challenge and a valuable opportunity for many Internet industries. The emergence of big data has profoundly changed people's lives and work. Way. Utilizing a reasonable and efficient computing model, getting rid of the geographical and structural limitations of various computing resources in the network, and making full use of computing resources are the practical and urgent needs of Internet companies. Therefore, the design and development of the scheduler has become a hot technology in the research and practice of large Internet companies at home and abroad. [0003] The existing off-line computing te...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F9/48
CPCG06F9/4881
Inventor 余阳何勇标
Owner SUN YAT SEN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap