METHOD FOR EXECUTING TASKS IN A COMPUTER NETWORK
Method for executing tasks in a computer network, wherein said computer network comprises nodes and optionally at least one starcoupler, wherein said nodes are connected to each other, directly, for example via a bus or a bus system, and/or by said at least one starcoupler and/or by at least one multi-hop network, and wherein in said computer network nodes exchange time-triggered messages.
1 . Method for executing tasks in a computer network, wherein said computer network comprises nodes and optionally at least one starcoupler, wherein said nodes are connected to each other, directly, for example via a bus or a bus system, and/or by said at least one starcoupler and/or by at least one multi-hop network, and wherein in said computer network nodes exchange time-triggered messages,
characterized in that
said tasks are executed on nodes and/or on the at least one starcoupler according to a static task schedule, wherein said task schedule is computed by the following steps:
a) transforming a defined task set to a periodic asynchronous task model (p 1 ), preferably an EDF task model (p 1 ), yielding a first quantity of task sets;
b) applying a feasibility test (p 2 ) to the first quantity of task sets obtained in step a) for reducing the number of task sets to a second quantity of task sets (s 1 ), a so-called schedulable task sets (s 1 );
c) applying a precedence test (p 3 ) to the second quantity of task sets obtained in step b), producing a subset of task sets of the second quantity of task sets, said subset of task sets comprising the so-called compliant task sets (s 2 );
d) applying a criteria (p 4 ) over the set of compliant task sets (s 2 ), resulting in one task set, a so-called “final” task set (s 3 ).
2 . Method according to claim 1 , wherein a dynamic scheduling algorithm simulator (p 5 ), preferably an EDF simulator, more preferably an offline EDF simulator, generates, based on the final task set (s 3 ), a schedule, the so called final schedule.
3 . Method according to claim 1 or 2 , wherein in step d) an optimal criteria (p 4 ) is applied over the set of compliant task sets (s 2 ), resulting in one task set, a so called optimal task set (s 3 ).
4 . Method according to one of the claims 1 to 3 , wherein the task schedule is computed offline.
5 . Method according to one of the claims 1 to 4 , wherein dependencies with TT-messages for those tasks involved in the production or consumption of payload data are considered during the specification of task parameters.
6 . Method according to one of the claims 1 to 5 , wherein the static schedule is calculated by taking into account the dependencies of tasks to a network schedule of the computer network.
7 . Method according to one of the claims 1 to 6 , wherein the static schedule is calculated by taking into account interdependencies of different tasks.
8 . Method according to one of the claims 1 to 7 , wherein each task set of the compliant task sets (s 2 ) is assigned a utility function, preferably a Time Utility Function (TUF) evaluating the optimality of each possible parameter value.
9 . Method for calculating task parameters and/or task schedules in a computer network, wherein said computer network comprises nodes and optionally at least one starcoupler, wherein said nodes are connected to each other, directly, for example via a bus or a bus system, and/or by said at least one starcoupler and/or by at least one multi-hop network, and wherein in said computer network nodes exchange time-triggered messages,
characterized in that
said tasks are executed on nodes and/or on the at least one starcoupler according to a static task schedule, wherein said task schedule is computed by the following steps:
a) transforming a defined task set to a periodic asynchronous task model (p 1 ), preferably an EDF task model (p 1 ), yielding a first quantity of task sets;
b) applying a feasibility test (p 2 ) to the first quantity of task sets obtained in step a) for reducing the number of task sets to a second quantity of task sets (s 1 ), a so-called schedulable task sets (s 1 );
c) applying a precedence test (p 3 ) to the second quantity of task sets obtained in step b), producing a subset of task sets of the second quantity of task sets, said subset of task sets comprising the so-called compliant task sets (s 2 ).
d) applying a criteria (p 4 ) over the set of compliant task sets (s 2 ), resulting in one task set, a so-called “final” task set (s 3 ).
10 . Method according to claim 9 , wherein a dynamic scheduling algorithm simulator (p 5 ), preferably an EDF simulator, more preferably an offline EDF simulator, generates, based on the final task set (s 3 ), a schedule, the so called final schedule.
11 . Method according to claim 9 or 10 , wherein in step d) an optimal criteria (p 4 ) is applied over the set of compliant task sets (s 2 ), resulting in one task set, a so called optimal task set (s 3 ).
12 . Method according to one of the claims 9 to 11 , wherein the task schedule is computed offline.
13 . Method according to one of the claims 9 to 12 , wherein dependencies with TT-messages for those tasks involved in the production or consumption of payload data are considered during the specification of task parameters.
14 . Method according to one of the claims 9 to 13 , wherein the static schedule is calculated by taking into account the dependencies of tasks to a network schedule of the computer network.
15 . Method according to one of the claims 9 to 14 , wherein the static schedule is calculated by taking into account interdependencies of different tasks.
16 . Method according to one of the claims 9 to 15 , wherein each task set of the compliant task sets (s 2 ) is assigned a utility function, preferably a Time Utility Function (TUF) evaluating the optimality of each possible parameter value.
17 . Computer network comprising nodes and optionally at least one starcoupler, wherein said nodes are connected to each other, directly, for example via a bus or a bus system, and/or by said at least one starcoupler and/or by at least one multi-hop network, and wherein in said computer network nodes exchange time-triggered messages,
characterized in that
said tasks are executed on nodes and/or on the at least one starcoupler according to a static task schedule, wherein said task schedule is computed by the following steps:
a) transforming a defined task set to a periodic asynchronous task model (p 1 ), preferably an EDF task model (p 1 ), yielding a first quantity of task sets;
b) applying a feasibility test (p 2 ) to the first quantity of task sets obtained in step a) for reducing the number of task sets to a second quantity of task sets (s 1 ), a so-called schedulable task sets (s 1 );
c) applying a precedence test (p 3 ) to the second quantity of task sets obtained in step b), producing a subset of task sets of the second quantity of task sets, said subset of task sets comprising the so-called compliant task sets (s 2 );
d) applying a criteria (p 4 ) over the set of compliant task sets (s 2 ), resulting in one task set, a so-called “final” task set (s 3 ).
18 . Computer network according to claim 17 , wherein a dynamic scheduling algorithm simulator (p 5 ), preferably an EDF simulator, more preferably an offline EDF simulator, generates, based on the final task set (s 3 ), a schedule, the so called final schedule.
19 . Computer network according to claim 17 or 18 , wherein in step d) an optimal criteria (p 4 ) is applied over the set of compliant task sets (s 2 ), resulting in one task set, a so called optimal task set (s 3 ).
20 . Computer network according to one of the claims 17 to 19 , wherein the task schedule is computed offline.
21 . Computer network according to one of the claims 17 to 20 , wherein dependencies with TT-messages for those tasks involved in the production or consumption of payload data are considered during the specification of task parameters.
22 . Computer network according to one of the claims 17 to 21 , wherein the static schedule is calculated by taking into account the dependencies of tasks to a network schedule of the computer network.
23 . Computer network according to one of the claims 17 to 22 , wherein the static schedule is calculated by taking into account interdependencies of different tasks.
24 . Computer network according to one of the claims 17 to 23 , wherein each task set of the compliant task sets (s 2 ) is assigned a utility function, preferably a Time Utility Function (TUF), evaluating the optimality of each possible parameter value.