# US 2016/0259642 A1 · Method of sequencing execution commands, execution method, computer program and integrated circuit

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2016/0259642 A1
- Document ID: US20160259642A1
- Status: Published application
- Kind: A1
- Application number: 15/059,815
- Filed: 2016-03-03
- Published: 2016-09-08
- Earliest claimed: 2015-03-03
- Assignees: Zodiac Aerotechnics
- Applicants: Zodiac Aerotechnics
- Inventors: Mikaël Deschamps; Gilles Saint-Aubin
- Web page: https://patentgrep.com/patent/US20160259642A1

## CPC

- G06F 9/30021: {Compare instructions, e.g. Greater-Than, Equal-To, MINMAX}
- G06F 9/30058: {Conditional branch instructions}
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 9/4887: {involving deadlines, e.g. rate based, periodic}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The invention relates to a method of sequencing commands to execute N sets of instructions, where N is a natural number greater than or equal to two, said method being implemented by a control unit suitable for periodically receiving time interrupts and for generating commands to execute the sets of instructions to be executed, said control unit comprising at least a main counter. The method comprises the steps of: a) initializing the main counter; b) incrementing the main counter upon receipt of a time interrupt; c) generating a command to execute a set of instructions to be executed, said set of instructions being selected based on an instantaneous value p of the main counter; d) repeating steps a) to d).

## Claims

### Claim at position 1

1-13. (canceled)

### Claim 14

Method of sequencing commands to execute N sets of instructions, where N is a natural number greater than or equal to two; said method being implemented by a control unit suitable for periodically receiving time interrupts and for generating commands to execute the sets of instructions to be executed, said control unit comprising at least a main counter, characterized wherein the method comprises the following steps:
a) initializing the main counter;
b) incrementing the main counter upon receipt of a time interrupt;
c) generating a command to execute a set of instructions to be executed, said set of instructions being selected based on an instantaneous value p of the main counter;
d) repeating steps a) to d).

### Claim 15 (depends on 14)

Sequencing method according to claim 14, wherein said control unit comprises a memory storing a predefined threshold and a secondary counter, and wherein each set of instructions is identified by an integer greater than or equal to zero called a rank, the values of said rank being between Rmin and Rmax inclusive, the generating step comprising the steps of:
i) initializing the secondary counter;
ii) calculating a variable V based on the instantaneous value p of the main counter and on an instantaneous value s of the secondary counter;
iii) determining whether the calculated variable V is an integer;
if said calculated variable V is an integer:
comparing the instantaneous value s of the secondary counter to the predefined threshold;
when the instantaneous value s of the secondary counter is less than the predefined threshold, generating the instantaneous value s of the secondary counter to identify the rank of the set of instructions to be executed;
if the calculated variable V is not an integer, incrementing the secondary counter and repeating steps ii) and iii).

### Claim 16 (depends on 15)

Sequencing method according to claim 15, wherein the method returns to step a) when the instantaneous value s of the secondary counter is greater than the predefined threshold.

### Claim 17

Sequencing method according to 15, Wherein the step ii) of calculating the variable V is carried out using the formula indicated below:
V=(=2)/(2×2s)
where p is the instantaneous value of the main counter and s is the instantaneous value of the secondary counter.

### Claim 18 (depends on 14)

Sequencing method according to claim 14, wherein the sets of instructions are stored in a working memory, said sets of instructions being intended to be executed periodically by a processing unit at periods that are different from one another, the method comprising an identification step, prior to the initialization step a), in which each set of instructions is identified by a rank, said rank being assigned according to the execution period desired for each set of instructions, the lowest rank being assigned to the set of instructions having the smallest desired execution period.

### Claim 19 (depends on 15)

Sequencing method according to claim 15, wherein said predefined threshold is greater than the total number N of sets of instructions to be executed, said method further comprising a step of identifying an additional set of instructions to he executed by an integer greater than the maximum rank identifying a set of instructions already stored in said working memory, and a step of saving in the working memory an additional set of instructions to be executed.

### Claim 20 (depends on 15)

Sequencing method according to claim 15, wherein said predefined threshold is equal to the total number N of sets of instructions to be executed.

### Claim 21 (depends on 4)

Sequencing method according to claim 4, comprising a step of modifying the period defined between the receipt of two consecutive time interrupts.

### Claim 22 (depends on 15)

Sequencing method according to claim 15, further comprising a step of comparing the instantaneous value p of the main counter to 2Rmax+1,
if said instantaneous value p of the main counter is less than 2Rmax+1, the method returns to step a),
if said instantaneous value p of the main counter is greater than 2Rmax+1, the main counter is incremented by one and the method returns to step b).

### Claim 23 (depends on 14)

Computer program, characterized in that it comprises instructions for implementing the method according to claim 14, when executed by a control unit.

### Claim 24

Method of executing at least N sets of instructions stored in a working memory, where N is a natural number greater than or equal to two; each set of instructions being identified by a natural number greater than or equal to zero, called a rank R; said method being executed by a processing unit connected to said working memory,
wherein that the sets of instructions are executed periodically, the period of a set of instructions of rank i being equal to twice the period of a set of instructions of rank i-1 for any integer i between 1 and N inclusive.

### Claim 25 (depends on 14)

Integrated circuit comprising:
a time interrupt generator suitable for periodically generating time interrupts,
a control unit suitable for receiving said time interrupts,
a working memory containing N sets of instructions, each set of instructions being identified by an integer greater than or equal to zero, called a rank;
characterized in that said control unit is adapted to execute the method of sequencing commands to execute sets of instructions according to claim 14.

### Claim 26 (depends on 25)

Integrated circuit according to claim 25, further comprising a processing unit connected to said working memory and to the control unit.