# US 2004/0083272 A1 · Method and communication system for data exchanging data between users of a bus system

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

- Number: US 2004/0083272 A1
- Document ID: US20040083272A1
- Status: Published application
- Kind: A1
- Application number: 10/451,558
- Filed: 2003-12-22
- Published: 2004-04-29
- Earliest claimed: 2000-12-28
- Assignees: Robert Bosch GmbH
- Inventors: Thomas Fuehrer; Bernd Mueller
- Web page: https://patentgrep.com/patent/US20040083272A1

## CPC

- G06F 13/4217: {with synchronous protocol}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The present invention relates to a method and a communications system (1) for the exchange of data between at least two users (2, 3, 4) who are in contact with one another using a bus system (5). The data are included in messages which are transmitted by users (2, 3, 4) over the bus system (5). A specifiable priority is assigned to each message. In order to achieve, in the normal case, a high probability of a short latency period (t) of a message to be transmitted, and to be able to guarantee, in the worst case, a maximum latency period (tmax), it is proposed that the priorities assigned to the messages be dynamically modified during the operation of bus system (5). Preferably, the set of all messages is subdivided into equivalence classes, and a priority is assigned to each equivalence class. During the operation of the bus system (5), the priorities of the messages are dynamically modified within an equivalence class, and the priorities of the equivalence classes are dynamically modified.

## Claims

### Claim 1

A method for exchanging data between at least two users (2, 3, 4) which are in contact using a bus system (5), the data being included in messages which are transmitted by users 2, 3, 4 via the bus system (5), and a specifiable priority being assigned to each message, wherein the priorities assigned to the messages are dynamically modified during the operation of the bus system (5).

### Claim 2 (depends on 1)

The method as recited in claim 1, wherein
the set of all messages is subdivided into equivalence classes; and
during the operation of the bus system (5), the priorities of the messages are dynamically modified within an equivalence class.

### Claim 3 (depends on 1, 2)

The method as recited in claim 1 or 2, wherein
the set of all messages is subdivided into equivalence classes;
a priority is assigned to each equivalence class which preferably corresponds to the highest priority of a message in the equivalence class; and
during the operation of the bus system (5), the priorities of the equivalence classes are dynamically modified.

### Claim 4 (depends on 2, 3)

The method as recited in claim 2 or 3, wherein the priority of the messages within an equivalence class after the transmission of a message is cyclically modified in such a way that the priority of a transmitted message within the equivalence class, after the transmission of the message, is set to the lowest possible priority value within the equivalence class.

### Claim 5 (depends on 2, 3, 4)

The method as recited in one of claims 2 through 4, wherein the priority of the non-transmitted messages within an equivalence class, after the transmission of one of the messages of the same equivalence class, is increased by a value which is ascertained from a number (k) of the maximum possible priorities in the equivalence class minus the priority (k-r) of the transmitted message plus one, the result being interpreted modulo number (k) of the priorities.

### Claim 6 (depends on 3, 4, 5)

The method as recited in one of claims 3 through 5, wherein during the operation of the bus system (5), the priorities of the equivalence classes are dynamically modified according to the following scheme:
If the priority of an equivalence class is (i, 0) and the EC priority of a transmitted message is (j, 0), the priority (i, 0) of the equivalence class is maintained if j>i, and the priority of the equivalence class is reduced to (0, −i) if j≦i.
If the priority of an equivalence class is (i, 0) and the EC priority of a transmitted message is (0, −j), the priority of the equivalence class is always reduced to (0, −i).
If the priority of an equivalence class is (0, −i) and the EC priority of a transmitted message is (j, 0), the priority (0, −i) of the equivalence class is maintained if j>i, and the priority of the equivalence class is increased to (i, 0) if j≦i.
If the priority of an equivalence class is (0, −i) and the EC priority of a transmitted message is (0, −j), the priority (0, −i) of the equivalence class is maintained if j≧i, and the priority of the equivalence class is increased to (i, 0) if j<i.
The priority of an equivalence class is permanently set to (i, 0) if no message is transmitted, even though the system bus (5) is free.

### Claim 7 (depends on 1, 2, 3, 4, 5, 6)

The method as recited in one of claims 1 through 6, wherein compulsory transmission is introduced for each user (2, 3, 4) of the communications system (1).

### Claim 8 (depends on 7)

The method as recited in claim 7, wherein at least one of the users (2, 3, 4) transmits dummy messages over the bus system (5).

### Claim 9 (depends on 1, 2, 3, 4, 5, 6, 7, 8)

The method as recited in one of claims 1 through 8, wherein messages not having a latency period guarantee are combined in an equivalence class of their own, to which a priority is assigned that is as low as possible.

### Claim 10 (depends on 1, 2)

The method as recited in claim 1 or 2, wherein messages, whose transmission time is regulated not by the bus system (5) but by applications, are combined in an equivalence class of their own, to which a priority (i, j) is assigned that is as high is possible, the priority (i, j) of this equivalence class not being modified during the operation of the bus system (5).

### Claim 11 (depends on 3, 4, 5)

The method as recited in one of claims 3 through 5, wherein the priorities of the equivalence classes after the transmission of a message are cyclically modified in such a way that the priority of the equivalence class, from which a message was transmitted, after the transmission of the message is set to the lowest possible priority value.

### Claim 12 (depends on 3, 4, 5)

The method as recited in claim 3 through 5, or 11, wherein the priority of the equivalence classes from which no message was transmitted, after the transmission of a message, is increased by a value which is ascertained from a number (k) of the maximum possible priorities in the equivalence class minus the priority (k-r) of the transmitted message plus one, the result being interpreted modulo number (k) of the priorities.

### Claim 13

A communications system (1) having at least two users (2, 3, 4) and a bus system (5), via which the users (2, 3, 4) are in contact with one another for the exchange of data between the users (2, 3, 4), the data being included in messages which are able to be transmitted by the users (2, 3, 4) via the bus system (5), and a specifiable priority being assigned to each message, wherein the communications system (1) has means for dynamically modifying the priorities assigned to the messages during the operation of the bus system (5).

### Claim 14 (depends on 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)

The communications system as recited in claim 13, wherein it has means for carrying out a method as recited in one of claims 2 through 12.

### Claim 15 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)

A bus system (5) for the exchange of data between at least two users (2, 3, 4) of a communications system (1), wherein using the bus system (5), a method according to one of claims 1 through 12 is carried out.

### Claim 16 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)

A storage element (7), especially a read-only memory, a random-access memory or a flash memory, for a user (2, 3, 4), of a communications system (1), which is in contact via a bus system (5) with at least one additional user (2, 3, 4) for the exchange of data, on which a computer program is stored which is able to run on a computing unit of the user, especially on a microprocessor (6), and is suitable for executing a method according to one of claims 1 through 12.

### Claim 17 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)

A computer program, wherein it is suitable for executing a method according to one of claims 1 through 12 when it runs on a computing unit, particularly on a microprocessor (6), of a user (2, 3, 4) of a communications system (1) which is in contact with at least one additional user (2, 3, 4) for exchanging data over a bus system (5).

### Claim 18 (depends on 17)

The computer program as recited in claim 17, wherein it is stored on a storage element (7), preferably on a flash memory.
