METHOD AND APPARATUS FOR COMMUNICATION WITHIN CONTROL SYSTEMS

• US 20110144862A1
• Filed: 02/25/2011
• Published: 06/16/2011
• Est. Priority Date: 01/04/2005
• Status: Active Grant

• Current Assignee: GM Global Technology Operations LLC (General Motors Company)
• Original Assignee: GM Global Technology Operations LLC (General Motors Company)
• Inventors: Supal, Miroslawa A., Fuhrman, Thomas E., Millsap, Arnold W.
• Granted Patent: US 8,437,909 B2
• Time in Patent Office: Days
• US Class Current: 701/36
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues

Abstract

A computer program product includes a storage medium that stores instructions for execution by a processing circuit for practicing a method for synchronous communication in a control system. Within a first time interval, a first source task is executed to broadcast a first destination task, within a second sequential time interval, the first destination task is communicated over a channel to a first destination, and within a third sequential time interval, the first destination task is consumed. Within the first time interval, a second source task may be executed to broadcast a second destination task, within the second sequential time interval, the second destination task may be communicated over the channel to a second destination, and within the third sequential time interval, the second destination task may be consumed. The first source task is allowed to be scheduled ahead of the second source task, and the second source task is allowed to be scheduled ahead of the first source task.

Claims

1. A computer program product for synchronous communication in a control system, the product comprising:

a storage medium, readable by a processing circuit, storing instructions for execution by the processing circuit for;

executing, within a first time interval, a first source task to broadcast a first destination task;

communicating, within a second sequential time interval, the first destination task over a channel to a first destination;

consuming, within a third sequential time interval, delivery of the first destination task;

executing a second source task to broadcast a second destination task within the first time interval;

communicating the second destination task over the channel to a second destination within the second sequential time interval; and

consuming the second destination task within the third sequential time interval;

wherein the first source task is allowed to be scheduled ahead of the second source task, and the second source task is allowed to be scheduled ahead of the first source task.

2. The product of claim 1, wherein:

each of the first, the second, and the third time intervals are a synchronous communication cycle.

3. The product of claim 1, wherein:

each of the first, the second, and the third time intervals are a sequential segment of at least one synchronous communication cycle.

4. The product of claim 3, wherein:

each synchronous communication cycle comprises at least two segments.

5. The product of claim 1, wherein:

the communicating the first destination task over a channel comprises communicating the first destination task over a first channel slot;

the communicating the second destination task over the channel comprises communicating the second destination task over a second channel slot; and

the first channel slot is allowed to be scheduled ahead of the second channel slot, and the second channel slot is allowed to be scheduled ahead of the first channel slot.

6. The product of claim 5, wherein:

the consumption of the first destination task is allowed to be scheduled ahead of the consumption of the second destination task, and the consumption of the second destination task is allowed to be scheduled ahead of the consumption of the first destination task.

7. The product of claim 6, wherein:

the storage medium further stores instructions for execution by the processing circuit for;

executing the first and second source tasks, communicating the first and second destination tasks, and consuming the first and second destination tasks, via a three-stage pipeline.