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

Method for dynamic scheduling in a distributed environment

Inactive Publication Date: 2006-05-25
SERVICENOW INC
View PDF9 Cites 78 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

[0007] This invention comprises a method and system for dynamically

Problems solved by technology

Problems with FIFO arise when a program in the queue is subject to dependency upon execution of another program.
The FIFO routine does not support scheduling a dependent program based upon execution of a prior program.
The process of transferring data between nodes consumes resources of both nodes associated with data encryption and decryption.
However, the negative aspect of the decentralized scheduler is complexity of control and communication among the schedulers to efficient allocate resources in a sequential manner to reduce operation and transmission costs associated with transferring data across nodes for execution of dependent programs.
Accordingly, there is an increased communication cost associated with a decentralized scheduler.

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
  • Method for dynamic scheduling in a distributed environment
  • Method for dynamic scheduling in a distributed environment
  • Method for dynamic scheduling in a distributed environment

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

Technical Details

[0020] A grid environment (50) is shown in FIG. 2 and is composed of a global scheduler (60) and a plurality of program execution units (70) and (80), known as nodes. Although only two nodes are shown, more nodes may be addressed to the system. Each node has a program execution unit (72) and (82), respectively, and a local scheduler (74) and (84) that has a local program execution queue (not shown) to manage execution of programs assigned to the respective node. The nodes (70) and (80) communicate with each other and the global scheduler (60) across a local or wide area network (90). An execution request for a program is made to the centralized scheduler (60) which assigns the program to one of the nodes (70, 80) in accordance with a state of each node to execute the program. The centralized scheduler (60) includes a wait queue (62), a workflow database (64), a performance database (66), and an assignment database (68). Each of the nodes (70) and (80) provide proce...

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

A method and system is provided for assigning programs in a workflow to one or more nodes for execution. Prior to the assignment, a priority of execution of each program is calculated in relation to its dependency upon data received and transmitted data. Based upon the calculated priority and the state of each of the nodes, the programs in the workflow are dynamically assigned to one or more nodes for execution. In addition to the node assignment based upon priority, preemptive execution of the programs in the workflow is determined so that the programs in the workflow may not preemptively be executed at a selected node in response to the determination.

Description

BACKGROUND OF THE INVENTION [0001] 1. Technical Field [0002] This invention relates to a method and system for dynamically scheduling programs for execution on one or more nodes. [0003] 2. Description of the Prior Art [0004] A directed acyclic graph (DAG) includes a set of nodes connected by a set of edges. Each node represents a task, and the weight of the node is the execution time of the task. Each edge represents a message transferred from one node to another node, with its weight being the transmission time of the message. Scheduling programs for execution onto processors is a crucial component of a parallel processing system. There are generally two categories of prior art scheduler using DAGs: centralized and decentralized (not shown). An example of a centralized scheduler (10) is shown in FIG. 1 to include a scheduler (30) and a plurality of program execution nodes (12), (14), (16), (18), and (20). The nodes (12), (14), (16), (18), and (20) communicate with each other and th...

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/46
CPCG06F9/5038G06F9/5083G06F2209/5021
Inventor TANIGUCHI, MASAAKIKUBO, HARUNOBU
Owner SERVICENOW INC
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