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

A task scheduling method for a computer network without a central node

A computer network and central node technology, applied in the direction of data exchange network, digital transmission system, electrical components, etc., can solve the problem that the task scheduling method is not applicable and the consideration of the task scheduling method is single and not comprehensive enough

Active Publication Date: 2016-12-07
华北计算技术研究所
View PDF7 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] In view of this, the present invention provides a task scheduling method for a computer network without a central node. The method considers multidimensional factors and is a comprehensive and comprehensive task scheduling method, which is suitable for parallel processing applications and solves the problem that the task scheduling method for wireless sensor networks is not applicable. A single and not comprehensive problem in terms of computer network and existing task scheduling methods

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
  • A task scheduling method for a computer network without a central node

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0035] A task scheduling method for a computer network without a central node provided by the present invention includes the following steps:

[0036] Step 1. Establish a computer network without a central node. There are k nodes in the established network, and the k nodes are numbered from 1 to k, denoted as N 1 ~N k .

[0037] Each node stores a node load table, which records the real-time load status corresponding to all nodes in the network, where the load status includes the number of tasks that have been started, the remaining amount of CPU available, the remaining amount of memory available, and the hard disk Availability remaining.

[0038] In this embodiment, each node communicates regularly to obtain the real-time load status of all nodes and update the node load table. In this embodiment, in order to enable the node load table to identify the nodes, the node load table also includes node number, IP address, power on / off status and started task information.

[00...

Embodiment 2

[0053] According to the solution provided in Example 1, although steps 1 to 10 have achieved the purpose of selecting the optimal node and using the optimal node to start task t, if task t fails and is interrupted during the running process, it needs to be run by The optimal node for the task detects the failure of the task and runs the task again. The specific process is as follows:

[0054] In step 10, after the optimal node starts task t, the following steps are also included:

[0055] The optimal node monitors the running status of the task t in real time. When the task t runs abnormally, it saves the task running breakpoint, and the optimal node restarts the task t, and makes the task t run from the breakpoint.

Embodiment 3

[0057] According to the solution provided in Embodiment 1, if during the running of task t, when the optimal node running the task t fails and shuts down abnormally, it is necessary to reselect the optimal node before executing the task. Therefore, it is necessary to use the monitoring node to monitor the optimal node. If the optimal node is abnormally shut down, the monitoring node is used to broadcast and update the status. Other nodes in the network obtain the tasks running on the faulty node according to the node load table. According to the recorded The task configuration information and the load information of all nodes in the network at the current moment are used to determine whether it is the optimal node for the current task operation, and the optimal node restarts the task operation. Therefore, in step 10, after the optimal node starts task t, the following steps are also included:

[0058] Set the monitoring node to monitor the state of the optimal node in real tim...

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 task scheduling method of a computer network without a center node, and belongs to the field of computer networks. The method comprises the following steps: establishing the computer network without the center node, wherein the computer network has nodes N1 to Nk, each node is used for maintaining a node loading table, and the number of various loads of all nodes is recorded in the table; broadcasting a starting request of a task t to all the nodes by a client; analyzing the starting request by the nodes to obtain the loading requirement of completing the t and the priority thereof; enabling C to be equal to 1, and carrying out the following judgment by taking all the nodes as candidate nodes: if only one node in the candidate nodes has optimal C-level loading requirement, the node is the optimal node; if the C-level loading requirements of a plurality of nodes are optimal, the nodes are new candidate nodes; increasing C by 1, repeating the judgment until the optimal node is selected; if a plurality of candidate nodes still exist when the lowest priority is achieved, the node with the largest or the smallest serial number in the candidate nodes is the optimal node, and finally task scheduling is realized.

Description

technical field [0001] The invention relates to a task scheduling method for a computer network without a central node, which belongs to the field of computer networks and is suitable for a computer network without a central control node or a key node, especially for a computer network without a central node for parallel processing applications. Background technique [0002] At present, there are two main network architectures used in parallel processing applications: one is a computer cluster network, and the other is a computer network without a central node. [0003] For the computer cluster network, there are several types of network nodes with different purposes, including cluster management nodes and cluster computing nodes. Among them, the cluster management node is used to allocate and manage the user accounts and permissions of the cluster system, the management node installs the cluster management software, and acts as the master node to monitor, manage, and job sc...

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 Patents(China)
IPC IPC(8): H04L12/24
Inventor 丁一鸣林川王苏岳
Owner 华北计算技术研究所
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