Method of executing concurrent tasks by a subsystem managed by a central processor

• US 7,797,700 B2
• Filed: 04/23/2004
• Issued: 09/14/2010
• Est. Priority Date: 04/24/2003
• Status: Active Grant

• Current Assignee: Stmicroelectronics France (STMicroelectronics NV)
• Original Assignee: STMicroelectronics SA (STMicroelectronics NV)
• Inventors: Artieri, Alain, Lefftz, Vincent, Robin, Frederic, Audrain, Stephane, Dumarest, Jacques
• Primary Examiner(s): An; Meng-Ai
• Assistant Examiner(s): Kawsar; Abdullah Al
• Application Number:
  US10/831,539
• Publication Number:
  US 20040268355A1
• Time in Patent Office: 2,335 Days
• Field of Search: 718/1, 718/100, 718/101, 718/102, 718/103, 718/104, 718/105, 718/107, 386/12, 386/27, 386/33, 386/35, 386/48, 386/61, 386/66, 725/20, 725/32, 725/105, 725/109, 725/110, 725/135, 725/139, 725/143, 725/151, 382/232, 382/233, 382/234, 382/235, 719313-316
• US Class Current: 718/100
• CPC Class Codes: G06F 9/52 Program synchronisation; Mutual exclusion, e.g. by means of semaphores
• CPC Class Codes: H04N 19/42 characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation H04N19/635 takes precedence

Abstract

Systems and methods are provided for processing different concurrent tasks by a subsystem managed by a central processor. Each tasks is comprised of successive messages including a first message, intermediate messages, and a last message. Each intermediate message comprises a subtask parameter and a link to the next message that indicates the time when the next message is to be processed. The central processor and the subsystem are connected to a storage memory and several counters associated with respective tasks. The system and method reduce task disruptions of the system.

Claims

1. A method of processing a plurality of concurrent tasks by a subsystem managed by a central processor, the method comprising, for each task, the steps of:

writing by the central processor, the writing step including the sub-steps of;

writing a current message of the task in a memory, the task being comprised of a plurality of successive messages including a first message, at least one intermediate message, and a last message, the current message being one of the successive messages of the task that is currently being processed, each of the intermediate messages of the task comprising at least one subtask parameter and a link to the next message of the task that indicates a time for processing the next message of the task, the next message being the next successive message of the task;

determining if a counter is free for access based on a value of an access management semaphore that is associated with the counter;

if the counter is free for access, changing the value of the access management semaphore so as to prohibit access by the subsystem to the counter, and;

if the counter has a zero value, writing in the subsystem a link that indicates a time for processing the first message of the task by the subsystem, or

if the counter has a non-zero value, writing in the subsystem a link to the next message of the task, this link to the next message of the task being included in the current message of the task written in the memory;

incrementing the counter by a number representative of presence of the current message of the task in the memory; and

changing the value of the access management semaphore so as to end the prohibition against the subsystem accessing the counter; and

processing by the subsystem, the processing step including the sub-steps of;

determining if the counter is free for access based on the value of the access management semaphore;

if the counter is free for access, changing the value of the access management semaphore so as to prohibit access by the central processor to the counter;

if the counter has a non-zero value, reading, from the current message, the link to the next message of the task and decrementing the counter;

changing the value of the access management semaphore so as to end the prohibition against the central processor accessing the counter; and

processing the subtask parameters of the next message of the task at the time for processing the next message of the task that is indicated in the link to the next message of the task, this link to the next message of the task being included in the current message of the task.

2. The method according to claim 1, wherein the link to the next message of the task in each of the intermediate messages of the task also indicates a length of the next message of the task.

3. The method according to claim 1, wherein the plurality of successive messages of the task are arranged sequentially in the memory.

4. The method according to claim 3, wherein the link to the next message of the task in each of the intermediate messages of the task does not include an address of the next message of the task in the memory.

5. The method according to claim 1, wherein the link to the next message of the task in each of the intermediate messages of the task also indicates an address of the next message of the task in the memory.

6. The method according to claim 5, wherein the writing step further includes the sub-step of:

prior to the sub-step of writing the current message of the task in the memory, consulting a list of available addresses in the memory, determining an address at which to store the current message of the task in the memory, and writing the address of the current message of the task in the link of the preceding message of the task.

7. The method according to claim 1, wherein the link to the next message of the task in each of the intermediate messages of the task also indicates a type of the next message of the task.

8. The method according to claim 7, wherein the link to the next message of the task in each of the intermediate messages of the task is capable of indicating an immediate processing of the next message of the task.

9. The method according to claim 8, wherein the link to the next message of the task in each of the intermediate messages of the task is capable of indicating processing of the next message of the task conditioned by an external event.

10. The method according to claim 9, wherein the processing step further includes the sub-step of:

receiving a video synchronization signal representative of an external event, and then processing the next message of the task.

11. The method according to claim 1, wherein the link to the next message of the task in each of the intermediate messages of the task indicates the time for processing the next message of the task by a relative time interval separating the processing of the next message of the task and the processing of the current message of the task.

12. The method according to claim 1, wherein the first message of the task does not include subtask parameters.

13. The method according to claim 12, wherein the last message of the task comprises a link indicating end of the task.

14. The method according to claim 13, wherein the indication of the time for processing the next message of the task in the last message of the task comprises a zero value.

15. The method according to claim 1,

wherein the subsystem executes video processing tasks comprising the management of image acquisition, the management of image display, and image encoding/decoding, and

when two or more links indicate the same time for processing the next message of the task, the subsystem gives priority to processing the subtask parameters of an image acquisition management message, then to the subtask parameters of an image display message, and then to the subtask parameters of an image encoding/decoding message.

16. The method according to claim 1, further comprising the step of providing a common clock signal to the subsystem and the central processor, each of the subsystem and the central processor determining its system time based on the common clock signal.

17. The method according to claim 16, wherein the processing of the subtask parameters of one of the messages of the task is performed when the system time of the subsystem is equal to the time for processing that message that is indicated in the link to that message.

18. An electronic system for executing a plurality of concurrent tasks, the system comprising:

a storage memory;

a central processor for generating and writing messages of the concurrent tasks in the storage memory, each of the tasks being comprised of a plurality of successive messages including a first message, at least one intermediate message, and a last message, each of the intermediate messages of the task comprising at least one subtask parameter and a link to the next message of the task that indicates a time for processing the next message of the task, the next message being the next successive message of the task;

a subsystem for reading the messages of the tasks from the storage memory, the subsystem comprising command means for requesting the processing of one of the messages of one of the tasks at the time for processing the one message of the one task that is indicated in the link of the preceding message of the one task, and processing means for processing the one message of the one task in response to the request;

a plurality of counters, the counters being associated with the tasks such that a different one of the tasks is associated with each of the counters, each of the counters indicating the number of messages of that counter'"'"'s one associated task that are stored in the storage memory, each of the counters being incremented by the central processor to indicate the writing of a message of that counter'"'"'s one associated task in the storage memory, and each of the counters being decremented by the subsystem to indicate the reading of a message of that counter'"'"'s one associated task from the storage memory; and

a plurality of semaphores, the semaphores being associated with the counters such that a different one of the counters is associated with each of the semaphores, each of the semaphores authorizing an access by the central processor to that semaphore'"'"'s one associated counter only in the absence of an access by the subsystem to that semaphore'"'"'s one associated counter, and authorizing an access by the subsystem to that semaphore'"'"'s one associated counter only in the absence of an access by the central processor to that semaphore'"'"'s one associated counter.

19. The system according to claim 18, wherein the storage memory comprises a plurality of FIFO-type parallel storage lines, the input of each of the storage lines being connected to the central processor and the output of each of the storage lines being connected to the subsystem.

20. The system according to claim 18, further comprising a clock supplying a single clock signal to the central processor and the subsystem.

21. The system according to claim 20, wherein the central processor and the subsystem each include means for determining a system time as a function of the single clock signal.

22. The system according to claim 21, wherein the subsystem comprises a time module for comparing the system time and the time for processing the one message of the one task, and for generating the request upon an equality between the system time and the time for processing.

23. The system according to claim 18, wherein the subsystem includes an input for receiving external events other than clock signals.

24. The system according to claim 23, wherein the subsystem includes means for synchronizing the processing of at least one of the messages of one of the tasks with a received external event.

25. The system according to claim 18, wherein the link to the next message of the task in each of the intermediate messages includes an execution time indicator that indicates the time for processing the next message of the task.

26. A non-transitory machine readable medium encoded with a program for processing a plurality of concurrent tasks by a subsystem managed by a central processor, the program containing instructions for performing, for each task, the steps of:

writing by the central processor, the writing step including the sub-steps of;

writing a current message of the task in a memory, the task being comprised of a plurality of successive messages including a first message, at least one intermediate message, and a last message, the current message being one of the successive messages of the task that is currently being processed, each of the intermediate messages of the task comprising at least one subtask parameter and a link to the next message of the task that indicates a time for processing the next message of the task, the next message being the next successive message of the task;

determining if a counter is free for access based on a value of an access management semaphore that is associated with the counter;

if the counter is free for access, changing the value of the access management semaphore so as to prohibit access by the subsystem to the counter, and;

if the counter has a zero value, writing in the subsystem a link that indicates a time of processing for the first message of the task by the subsystem, or

if the counter has a non-zero value, writing in the subsystem a link to the next message of the task, this link to the next message of the task being included in the current message of the task written in the memory;

incrementing the counter by a number representative of presence of the current message of the task in the memory; and

changing the value of the access management semaphore so as to end the prohibition against the subsystem accessing the counter; and

processing by the subsystem, the processing step including the sub-steps of;

determining if the counter is free for access based on the value of the access management semaphore;

if the counter is free for access, changing the value of the access management semaphore so as to prohibit access by the central processor to the counter;

if the counter has a non-zero value, reading, from the current message, the link to the next message of the task and decrementing the counter;

changing the value of the access management semaphore so as to end the prohibition against the central processor accessing the counter; and

processing the subtask parameters of the next message of the task at the time for processing the next message of the task that is indicated in the link to the next message of the task, this link to the next message of the task being included in the current message of the task.

27. The non-transitory machine readable medium according to claim 26, wherein the plurality of successive messages of the task are arranged sequentially in the memory.

28. The non-transitory machine readable medium according to claim 26, wherein the link to the next message of the task in each of the intermediate messages of the task indicates the time for processing the next message of the task by a relative time interval separating the processing of the next message of the task and the processing of the current message of the task.

29. The non-transitory machine readable medium according to claim 26, wherein the program further contains instructions for performing the step of providing a common clock signal to the subsystem and the central processor, each of the subsystem and the central processor determining its system time based on the common clock signal.