30 results about "Worst-case execution time" patented technology

Signal stream processing jobs contain tasks (100), each task (100) to be performed by repeated execution of an operation that processes a chunk of data from a stream. Each job comprises a plurality ofthe tasks (100) in stream communication with one another. A plurality of processing units (10), which are mutually coupled for the communication of signal streams execute that tasks. A preliminary computation is performed for each job individually, to determine execution parameters required for the job to support a required minimum stream throughput rate if each task of the job is executed in a respective context wherein opportunities to start execution of the task occur separated at most by a cycle time T defined for the task. At run time combination of jobs is selected for execution. Groupsof the tasks of the selected combination of jobs are assigned to respective ones of the processing units (10), checking that for each particular processing unit (10) a sum of worst case execution times for the tasks assigned to that particular processing unit (10) does not exceed the defined cycle time T defined for any of the tasks (100) assigned to the particular processing unit (10). The processing unit (10) execute the selected combination of jobs concurrently, each processing unit (10) time multiplexing execution of the group of tasks (100) assigned to that processing unit (10).

The invention relates to a task scheduling method based on a task application signal and an execution cost value of a processor core. The task scheduling method comprises the following steps: (1) the task application signal: a global linked list and a processor core scheduling queue are adopted to record a task; (2) the execution cost value of the processor core: each processor core maintains one execution cost value vector, and the processor core calculates to obtain the execution cost value of each task in the global linked list, and stores the execution cost value of each task into the execution cost value vector; and (3) task scheduling probability: the processor core calculates the probability for scheduling the task to the processor core scheduling queue from the global linked list according to the execution cost value of the task and the application signal of the task. The global linked list and the processor core scheduling queue are adopted to record tasks, the application signal intensity of the task and the task execution cost value of the processor core are used as task scheduling criterions, cost generated in a task transfer process can be effectively reduced, and task execution time is shortened.