Check patentability & draft patents in minutes with Patsnap Eureka AI!

Dynamic task scheduling algorithm for real-time requirements of cloud computing system

A technology of dynamic tasks and scheduling algorithms, applied in the field of cloud computing, can solve problems such as real-time impact

Active Publication Date: 2021-08-06
FUDAN UNIV
View PDF8 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, tasks are submitted one after another at variable intervals, waiting for all tasks to be submitted before scheduling has a serious impact on real-time performance

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
  • Dynamic task scheduling algorithm for real-time requirements of cloud computing system
  • Dynamic task scheduling algorithm for real-time requirements of cloud computing system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0032] Step 1. Sorting process

[0033] 1. The user submits the task according to the standard submission method provided by the cloud computing system.

[0034] 2. After the task is submitted, first check the running status of the cloud computing system. If the number of waiting tasks in the cloud computing system has reached more than 10 times the number of running tasks, the task will be rejected and a message will be returned to the user that the task is full and cannot continue Submitting the task, please wait. If the task is successfully submitted, a unique ID number is assigned to the task. The generation of the ID number is mainly processed by two linked lists, specifically the free linked list and the occupied linked list. The total number of the two can be set by the user, and this value is the maximum value of the sum of the waiting tasks and the running tasks of the cloud computing system. At runtime, if a new task is submitted, it is judged whether the free list...

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 belongs to the technical field of cloud computing, and particularly relates to a dynamic task scheduling algorithm for real-time requirements of a cloud computing system, which comprises the following steps that a user submits a task to be completed; the sequencer calculates priority values of the tasks according to the running time and the waiting time of the tasks; a sorter resorts the tasks from high to low according to the priority values of the tasks; the scheduler takes out a certain number of tasks from the sequencer; the scheduler allocates tasks according to the sizes of the tasks and the current state of the host; and the host executes the tasks according to the task size from low to high. According to the invention, the real-time response to the task can be greatly improved through the mutual cooperation of the sequencer and the scheduler, and meanwhile, the execution efficiency and the load balance are not influenced.

Description

technical field [0001] The invention belongs to the technical field of cloud computing, and in particular relates to a dynamic task scheduling algorithm aiming at the real-time requirements of a cloud computing system. Background technique [0002] With the widespread application of cloud computing, the number of tasks processed by the cloud computing system increases explosively, which leads to the congestion of the cloud computing system. However, users have higher and higher requirements for real-time performance, while the current algorithm puts too much energy on execution efficiency and load balancing, but ignores real-time performance, an important dimension of human-computer interaction. Most of them are static scheduling algorithms, and they must wait until all tasks are submitted before they can schedule tasks, which is also an important reason for low real-time performance. Some representative algorithms are introduced below. [0003] The First Come First Serve ...

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/48
CPCG06F9/4881
Inventor 刘志恒荆明娥范益波曾晓洋
Owner FUDAN UNIV
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

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