Task dispatching method and device based on DSP (digital signal processing)

A task scheduling and task technology, applied in the direction of multi-program device, program startup/switching, etc., can solve problems such as limited use scenarios, priority reversal, lost hardware interrupts, etc., to ensure execution efficiency, ensure real-time performance, and improve real-time effect

Inactive Publication Date: 2014-06-18
DATANG MOBILE COMM EQUIP CO LTD
View PDF5 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The above-mentioned priority-based preemptible scheduling strategy will cause the following problems in practice: due to multi-task sharing resources, high-priority tasks are blocked by low-priority tasks, and instead, medium-priority tasks are ahead of high-priority tasks. Task execution, that is, the problem of priority inversion
[0017] The above-mentioned interrupt-off method is simple and easy to implement, and can better meet the DSP's calculation and control-based task requirements. However, hardware interrupts will inevitably be lost during the interrupt-off period, so we can only do some simple and quick operations during the interrupt-off period. The operation cannot be applied to all mutually exclusive scenarios
[0018] In summary, the existing priority-based preemptive scheduling schemes of DSP either have poor real-time performance or limited use scenarios

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
  • Task dispatching method and device based on DSP (digital signal processing)
  • Task dispatching method and device based on DSP (digital signal processing)
  • Task dispatching method and device based on DSP (digital signal processing)

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0062] refer to figure 2 , which shows a flow chart of Embodiment 1 of a DSP-based task scheduling method of the present application, which may specifically include:

[0063] Step 201, record the task information occupying the mutex in the data structure of the mutex;

[0064] In a preferred embodiment of the present application, when the P operation of the task on the mutex is successful, the information of the task can be recorded in the data structure of the mutex as the task information occupying the mutex . Since the success of the P operation of the task on the mutex lock can indicate that the mutex is occupied, this preferred embodiment can record the task information occupying the mutex in time. Of course, record the occupation of the mutex in the data structure of the mutex. Other timings for the task information of the mutex are also feasible, for example, within several instruction cycles after the task's P operation on the mutex is successful.

[0065] refer to...

application example 1

[0076] refer to Figure 5 , shows an application example 1 of a DSP-based task scheduling in the present application. In this example 1, there are 3 tasks: A, B, and C. The priorities of the 3 tasks are: A

[0077] At time T0, task A performs P operation on a certain mutex. If the previous state of the mutex was obtainable, it becomes unacquireable now. Task A occupies the mutex. At the same time, the P operation of task A succeeds and Return to continue the execution of task A, and record the information of task A in the data structure of the mutex

[0078] At time T1, interrupt a occurs and triggers task B;

[0079] At time T2, task B preempts the CPU of task A and is running;

[0080] At time T3, interrupt b occurs and triggers task C;

[0081] At T4, task C preempts the CPU of task B and is in the running state. Task C tries to acquire the mutex locked by task A by executing P operation, and is blocked; at this time, r...

example 2

[0087] refer to Figure 6 , shows a method example 2 of a DSP-based task scheduling method of the present application, there are 5 tasks in this example 1: A, B, C, D and E, and the priority ranking of the 5 tasks is: A

[0088] At time T0, task A performs P operation on a certain mutex. If the previous state of the mutex was obtainable, it becomes unacquireable now. Task A occupies the mutex. At the same time, the P operation of task A succeeds and Return to continue the execution of task A, and record the information of task A in the data structure of the mutex

[0089] At time T1, interrupt a occurs and triggers task B;

[0090] At time T2, task B preempts the CPU of task A and is running;

[0091] At time T3, interrupt b occurs and triggers task C;

[0092] At time T4, task C preempts the CPU of task B and is in the running state. Task C tries to acquire the mutex occupied by task A by executing P operation,...

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 embodiment of the invention provides a task dispatching method and a task dispatching device based on DSP (digital signal processing), wherein the method concretely comprises the following steps that task information occupying an exclusive lock is recorded in a data structure of the exclusive lock; when the P operation is executed on the exclusive lock in the current task, the task information occupying the exclusive lock is read from the data structure of the exclusive lock, in addition, the priority of the current task is compared with the priority of the task occupying the exclusive lock, and if the priority of the current task is higher than the priority of the task occupying the exclusive lock, the priority of the task occupying the exclusive lock is improved to the priority of the current task. The method and the device have the advantage that the real-time performance of the DSP is improved on the premise of not being limited by use scenes.

Description

technical field [0001] The present application relates to the technical field of DSP (Digital Signal Processing, Digital Signal Processing), in particular to a DSP-based task scheduling method and device. Background technique [0002] DSP technology is mainly used in applications with strong real-time performance, large amount of data, and intensive calculation, such as communication, control, testing, electronic entertainment and other fields; among them, real-time performance means that the response time of DSP must be within the specified time, beyond this Time constraints will cause DSP fatal errors. [0003] In order to meet the real-time requirements of DSP and ensure timely response and processing of high-urgency real-time events, existing DSP-based task scheduling methods usually adopt a priority-based preemptive scheduling strategy. Among them, the priority is the only basis for selecting tasks to run. Based on the priority, that is, the ready task with the highest...

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/48
Inventor 侯彦龙雷文
Owner DATANG MOBILE COMM EQUIP CO LTD
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
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap