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

Method for using lock protocol under parallel task packet scheduling

A group scheduling and task technology, applied in resource allocation, program synchronization, program control design, etc., can solve the problem that the lock protocol method cannot be directly applied to parallel task scheduling, and the parallel task structure is complicated, so as to reduce deadlock, improve efficiency, The effect of reducing scheduling loss

Active Publication Date: 2021-06-15
UNIV OF ELECTRONICS SCI & TECH OF CHINA
View PDF8 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The existing lock protocols are basically related to the scheduling of serial tasks. With the development of multi-core systems, the demand for parallel tasks is also increasing. Unlike the simple serial relationship of serial tasks, the parallel task The structure is more complex, and the existing lock protocol methods for serial tasks cannot be directly applied to the scheduling of parallel tasks

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 using lock protocol under parallel task packet scheduling
  • Method for using lock protocol under parallel task packet scheduling
  • Method for using lock protocol under parallel task packet scheduling

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0040] The present invention proposes a method of using the lock protocol under parallel task group scheduling, such as figure 1 , figure 2 As shown, firstly, the P-FP scheduling of fixed priority group scheduling is adopted, and a fixed priority is set for all parallel tasks, and each subtask of the parallel task is fixedly assigned to a specific processor p k Go up, that is, set i processors p k , k=1, 2, 3, ..., i; and all subtasks of the parallel task are fixedly assigned to specific processors p k Go in; then in the case of using P-FP scheduling, the shared resource l q Divided into local resources and global resources; then set the resource ceiling priority Ω q , System ceiling priority Π k , according to shared resource l q Divide into the specific situation of local resources and global resources and combine resource ceiling priority Ω q , System ceiling priority Π k Perform priority sorting, the resource ceiling priority Ω q Shared resources for all access l ...

Embodiment 2

[0049] In this embodiment, on the basis of the above-mentioned embodiment 1, in order to better realize the present invention, a priority promotion flag is set for each subtask, and a certain parallelism is defined when using the lock protocol according to the priority. Task i resides on some processor p k A subtask x in when subtask Need to access a shared resource during the execution of q , if the shared resources that need to be accessed l q is a global resource, the subtask The priority increase flag bit is marked, so that the subtasks marked with the priority increase flag bit Subtasks at the same priority level that are not marked with the priority boost flag are processed first.

[0050] Furthermore, when the subtask Need to access a shared resource during the execution of q , if the accessed shared resource l q is a global resource and has been used by other subtasks locked, the subtask Block and join the resource blocking queue SQ q middle.

[0051...

Embodiment 3

[0055] In this embodiment, on the basis of any one of the above-mentioned embodiments 1-2, in order to better realize the present invention, further, when using the lock protocol according to the priority, it is defined that a certain parallel task i is located in a certain processor p k A subtask x in when subtask Need to access a shared resource during the execution of q , if the shared resources that need to be accessed l q is a local resource and has been used by other subtasks locked, the subtask Block and join the resource blocking queue SQ q middle.

[0056] Further, if other subtasks has a higher priority than subtasks If the priority is low, other subtasks will be temporarily promoted by priority inheritance The priority of the subtask The priority of , the specific calculation formula is:

[0057]

[0058] in for subtasks base priority, for subtasks The effective priority of the subtask Priority after priority inheritance.

[0059] Fur...

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

According to the invention, it is disclosed that subtasks are fixedly distributed to each specific core through P-FP scheduling by using a lock protocol method under parallel task packet scheduling, so that the subtasks can be approximately regarded as serial tasks; dividing the shared resources lq into local resources and global resources; and the priorities of the subtasks, the priorities of the processors and the like are set; through the setting, distribution among the sub-tasks, the shared resources and the processors and use of the lock protocol are specifically combined, so that the technical requirement of using the lock protocol of the serial tasks in the technical field of parallel task scheduling in the prior art is met; therefore, the lock protocol of the serial task can be adaptively migrated to the scheduling of the parallel task, the problems of deadlock, chain blocking and the like of the parallel task are reduced, the scheduling loss caused by priority overturning is reduced, the scheduling efficiency of the parallel task is improved, and the like.

Description

technical field [0001] The invention belongs to the technical field of computer real-time information processing task scheduling, and in particular relates to a method for using a lock protocol under parallel task group scheduling. Background technique [0002] In a real-time system, when tasks mutually exclusive access to shared resources such as key data structures and I / O devices, real-time lock protocols need to be used to avoid deadlocks and blocking chains, and at the same time reduce scheduling losses caused by priority inversion. [0003] The existing lock protocols are basically related to the scheduling of serial tasks. With the development of multi-core systems, the demand for parallel tasks is also increasing. Unlike the simple serial relationship of serial tasks, the parallel task The structure is more complex, and the existing lock protocol methods for serial tasks cannot be directly applied to the scheduling of parallel tasks. Contents of the invention [0...

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/52G06F9/50
CPCG06F9/524G06F9/5038Y02D10/00
Inventor 王俊杰杨茂林廖勇陈泽玮姜良重周攀
Owner UNIV OF ELECTRONICS SCI & TECH OF CHINA
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