Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Heuristic scheduling algorithm for multi-core data independent task

A heuristic scheduling, independent task technology, applied in electrical digital data processing, computing, multi-programming and other directions, can solve problems such as poor performance, and achieve the effect of improving load balancing

Inactive Publication Date: 2021-07-23
FUDAN UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although these algorithms all achieve good performance when tasks are interdependent, they perform poorly in data-independent scenarios because they focus too much on data dependencies and ignore the characteristics of tasks and processor cores.

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
  • Heuristic scheduling algorithm for multi-core data independent task
  • Heuristic scheduling algorithm for multi-core data independent task
  • Heuristic scheduling algorithm for multi-core data independent task

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] In the present invention, a heuristic scheduling algorithm for independent tasks of multi-core data is proposed, and the flow of the whole algorithm is as follows figure 1 As shown, the working process of the algorithm is as follows.

[0025] 1. Use the API provided by the host operating system to design scripts to obtain the CPU core information of the server host, and set the ID to distinguish different cores and use the linked list to manage the cores to form a core list CL. Similarly, the task submitted by the user also forms a list TL by setting the ID number and managing the task with a linked list.

[0026] 2. At the beginning, wait for the task submission. When the task submission is completed, send a signal to the algorithm to start the scheduling process and stop the task submission. After that, for each task, a random number is used to randomly select a core.

[0027] 3. First set the maximum value of the number of iterations, and then start the iterative p...

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 operating system design, and particularly relates to a heuristic scheduling algorithm for a multi-core data independent task. The algorithm comprises the following basic steps that a core list and a task list are obtained, the iteration process of the algorithm is started, a core effective value is calculated, the core position of task movement is selected through a rotation method to move repeatedly, and finally a task reaches a proper position. At present, the situation that multiple users use a single server at the same time is very common, at the moment, data of different users are independent from one another, the algorithm is designed in this way, and the operation efficiency and the load balance are greatly improved under the situation.

Description

technical field [0001] The invention belongs to the technical field of operating system design, and in particular relates to a heuristic scheduling algorithm for multi-core data independent tasks. Background technique [0002] It is a major trend for the technological development of processors to shift from increasing the frequency to increasing the number of cores. With the development of distributed computing and cloud computing, multi-core has been widely applied to server clusters with multi-user operating systems. Many users share a server at the same time, and the tasks submitted by them are usually independent of each other. However, traditional multi-core task scheduling algorithms usually consider that tasks are interdependent. [0003] For example, a color-sensitive task partitioning algorithm is used to allocate shared colors between processors. A dynamic color-sensitive scheduler checks cache coherency at runtime to reduce contention caused by cache coherency ...

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/4806
Inventor 刘志恒荆明娥范益波曾晓洋
Owner FUDAN 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
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