Method for optimizing a link schedule

• US 20080229317A1
• Filed: 03/05/2008
• Published: 09/18/2008
• Est. Priority Date: 10/29/2002
• Status: Active Grant

• Current Assignee: William R. Hodson
• Original Assignee: William R. Hodson
• Inventors: Hodson, William R.
• Granted Patent: US 7,945,682 B2
• Time in Patent Office: Days
• US Class Current: 718/103
• CPC Class Codes: A01K 15/025 Toys specially adapted for animals
• CPC Class Codes: G06F 15/16 Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs coordinating program control therefor G06F9/52; in regulating and control system G05B
• CPC Class Codes: G06F 9/46 Multiprogramming arrangements
• CPC Class Codes: H04L 12/40 Bus networks
• CPC Class Codes: H04L 12/5601 Transfer mode dependent, e.g. ATM
• CPC Class Codes: H04L 2012/40208 characterized by the use of a particular bus standard
• CPC Class Codes: H04L 2012/4026 Bus for use in automation systems
• CPC Class Codes: H04L 47/24 Traffic characterised by specific attributes, e.g. priority or QoS
• CPC Class Codes: H04L 47/2475 for supporting traffic characterised by the type of applications
• CPC Class Codes: H04L 47/28 in relation to timing considerations
• CPC Class Codes: H04L 47/283 in response to processing delays, e.g. caused by jitter or round trip time [RTT]

Abstract

A method for improving a link schedule used in a communications network is disclosed. While the method applies generally to networks that operate on a scheduled communications basis, it is described in the context of a Foundation FIELDBUS. The method includes: scheduling sequences and their associated publications according to their relative priority, per application; minimizing delays between certain function blocks, and between certain function blocks and publications; and grouping certain publications. Accordingly, advantages such as latency reduction, schedule length reduction, and improved communications capacity are gained.

Claims

1-24. -24. (canceled)

25. A method comprising:

identifying a plurality of function blocks requiring execution;

identifying the function blocks as members of multiple groups;

prioritizing the groups such that each group has a priority; and

scheduling the groups containing at least one unscheduled function block for communication on a network to produce a schedule, the groups scheduled in an order based on the priority of the groups;

wherein identifying the function blocks as members of multiple groups comprises;

following one or more connections in a sequence of function blocks;

adding each unique function block in the sequence to a first of the groups; and

preventing function blocks in the sequence that have already been added to the first group from being added again to the first group again.

26. The method of claim 25, wherein, if more than one primary connection out of one of the function blocks exists, a group is identified for each of the primary connections.

27. The method of claim 25, wherein prioritizing the groups comprises:

assigning one or more first priorities to one or more groups associated with monitoring an industrial process; and

assigning one or more second priorities to one or more groups associated with controlling the industrial process, the one or more second priorities higher than the one or more first priorities.

28. The method of claim 27, wherein assigning the one or more second priorities comprises:

assigning a higher second priority to a group having a longer execution and publication time and a lower second priority to a group having a shorter execution and publication time.

29. The method of claim 25, wherein scheduling the groups comprises:

adding non-back-calculation publications associated with the function blocks to the schedule, wherein any non-back-calculation publications associated with one of the groups are added to the schedule before any non-back-calculation publications associated with lower priority groups are added.

30. The method of claim 29, wherein scheduling the groups further comprises:

adding back-calculation publications associated with the function blocks to the schedule after the non-back-calculation publications have been added to the schedule, wherein each back-calculation publication is one of;

scheduled immediately adjacent to an already-scheduled publication if possible; and

scheduled where a publication gap is maximized if it is not possible to schedule the back-calculation publication immediately adjacent to an already-scheduled publication.

31. The method of claim 30, wherein scheduling the groups further comprises:

minimizing a delay between (i) a completion of execution of a first function block producing a primary connection output and (ii) an initiation of execution of a second function block directly inputting the primary connection output produced by the first function block;

minimizing a delay between (i) a completion of execution of a third function block producing a non-back-calculation publication and (ii) the non-back-calculation publication produced by the third function block; and

minimizing a delay between (i) an initiation of execution of a fourth function block inputting the non-back-calculation publication and (ii) the input of the non-back-calculation publication by the fourth function block.

32. The method of claim 30, wherein scheduling the groups further comprises:

prohibiting execution times of two function blocks associated with a single-application processor device from overlapping; and

prohibiting execution times of any two publications from at least partially overlapping.

33. A method comprising:

identifying a plurality of function blocks requiring execution;

identifying the function blocks as members of multiple groups;

prioritizing the groups such that each group has a priority; and

scheduling the groups containing at least one unscheduled function block for communication on a network to produce a schedule, the groups scheduled in an order based on the priority of the groups;

wherein scheduling the groups comprises;

adding non-back-calculation publications associated with the function blocks to the schedule, wherein any non-back-calculation publications associated with one of the groups are added to the schedule before any non-back-calculation publications associated with lower priority groups are added to the schedule; and

adding back-calculation publications associated with the function blocks to the schedule after the non-back-calculation publications have been added to the schedule.

34. The method of claim 33, wherein each back-calculation publication is one of:

scheduled immediately adjacent to an already-scheduled publication if possible; and

scheduled where a publication gap is maximized if it is not possible to schedule the back-calculation publication immediately adjacent to an already-scheduled publication

35. The method of claim 33, wherein prioritizing the groups comprises prioritizing the groups based on at least one of:

a group type associated with each group; and

a period length associated with each group.

36. The method of claim 33, wherein prioritizing the groups comprises:

assigning one or more first priorities to one or more groups associated with monitoring an industrial process; and

assigning one or more second priorities to one or more groups associated with controlling the industrial process, the one or more second priorities higher than the one or more first priorities.

37. The method of claim 36, wherein assigning the second priorities to the groups associated with controlling the industrial process comprises:

assigning a higher second priority to a group having a longer execution and publication time and a lower second priority to a group having a shorter execution and publication time.

38. A method comprising:

identifying a plurality of function blocks requiring execution;

identifying the function blocks as members of multiple groups;

prioritizing the groups such that each group has a priority; and

scheduling the groups containing at least one unscheduled function block for communication on a network to produce a schedule, the groups scheduled in an order based on the priority of the groups;

wherein scheduling the groups comprises scheduling execution of the function blocks so that;

execution of at least some of the function blocks in different devices overlap; and

publications by the function blocks in different devices do not overlap.

39. The method of claim 38, wherein the multiple devices comprise multiple processors.

40. The method of claim 38, wherein scheduling the groups comprises:

adding non-back-calculation publications associated with the function blocks to the schedule, wherein any non-back-calculation publications associated with one of the groups are added to the schedule before any non-back-calculation publications associated with lower priority groups are added.

41. The method of claim 40, wherein scheduling the groups further comprises:

adding back-calculation publications associated with the function blocks to the schedule after the non-back-calculation publications have been added to the schedule, wherein each back-calculation publication is one of;

scheduled immediately adjacent to an already-scheduled publication if possible; and

scheduled where a publication gap is maximized if it is not possible to schedule the back-calculation publication immediately adjacent to an already-scheduled publication.

42. The method of claim 41, wherein scheduling the groups further comprises:

minimizing a delay between (i) a completion of execution of a first function block producing a primary connection output and (ii) an initiation of execution of a second function block directly inputting the primary connection output produced by the first function block;

minimizing a delay between (i) a completion of execution of a third function block producing a non-back-calculation publication and (ii) the non-back-calculation publication produced by the third function block; and

minimizing a delay between (i) an initiation of execution of a fourth function block inputting the non-back-calculation publication and (ii) the input of the non-back-calculation publication by the fourth function block.

43. The method of claim 41, wherein scheduling the groups further comprises prohibiting execution times of two function blocks associated with a single one of the devices from overlapping.

44. The method of claim 38, wherein the network comprises a fieldbus.