# US 2021/0279190 A1 · Data bus, data processing method thereof, and data processing apparatus

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

- Number: US 2021/0279190 A1
- Document ID: US20210279190A1
- Status: Published application
- Kind: A1
- Application number: 17/191,255
- Filed: 2021-03-03
- Published: 2021-09-09
- Earliest claimed: 2020-03-06
- Assignees: Samsung Electronics Co., Ltd.
- Applicants: Samsung Electronics Co., Ltd.
- Inventors: KEONGHO LEE; YOUNGSEH KIM; WONJIN KIM; SEUNGBEOM LEE
- Web page: https://patentgrep.com/patent/US20210279190A1

## CPC

- G06F 13/1668: {Details of memory controller}
- G06F 9/30036: {Instructions to perform operations on packed data, e.g. vector, tile or matrix operations}
- G06F 9/30043: {LOAD or STORE instructions; Clear instruction}
- G06F 9/3824: {Operand accessing}
- G06F 9/3838: {Dependency mechanisms, e.g. register scoreboarding}
- G06F 16/2379: {Updates performed during online database operations; commit processing}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A data bus includes: a transaction selection circuit configured to receive vector data including a plurality of transactions from outside of the data bus, select at least one transaction from the plurality of transactions in which no traffic conflict occurs based on whether there is a traffic conflict among the plurality of transactions, and output the selected at least one transaction; and a memory data path including at least one register and configured to output the selected at least one transaction provided by the transaction selection circuit via the at least one register to the outside of the data bus.

## Claims

### Claim 1

A data bus comprising:
a transaction selection circuit configured to receive vector data including a plurality of transactions from outside of the data bus, select at least one transaction from the plurality of transactions in which no traffic conflict occurs based on whether there is a traffic conflict among the plurality of transactions, and output the selected at least one transaction; and
a memory data path comprising at least one register and configured to output the selected at least one transaction provided by the transaction selection circuit via the at least one register to the outside of the data bus.

### Claim 2 (depends on 1)

The data bus of claim 1, wherein the transaction selection circuit generates a conflict table including information about whether there is a traffic conflict among the plurality of transactions, and selects the selected at least one transaction based on the conflict table.

### Claim 3 (depends on 2)

The data bus of claim 2, wherein the transaction selection circuit, after outputting at least one first transaction, updates the conflict table based on information about the at least one first transaction, and by selecting at least one second transaction based on the conflict table, outputs the selected at least one second transaction.

### Claim 4 (depends on 1)

The data bus of claim 1, wherein the transaction selection circuit comprises:
a conflict table management circuit configured to generate a conflict table including information about whether there is a traffic conflict among the plurality of transactions, update the conflict table, and output selected information including information about the selected at least one transaction based on the conflict table; and
a transaction output circuit configured to output the selected at least one transaction among the plurality of transactions based on the selected information provided by the conflict table management circuit.

### Claim 5 (depends on 1)

The data bus of claim 1, wherein the transaction selection circuit outputs the selected at least one transaction based on a conflict table,
wherein the conflict table includes a square matrix in which a row length and a column length thereof correspond to a number transactions, and an element value corresponding to an ith row and a jth column includes a value indicating whether there is a traffic conflict between the ith transaction and the jth transaction, and
wherein i and j are natural numbers >=1 and <=the number of transactions.

### Claim 6 (depends on 1)

The data bus of claim 1, wherein the plurality of transactions comprise a first transaction through an Nth transaction, and
wherein the transaction selection circuit outputs the selected at least one transaction based on a conflict table,
wherein the conflict table includes a first row through an Nth row, all element values of the first row are padded with first logical values, an (i+1)th row includes values indicating whether there is a traffic conflict between an ith transaction and an (i+1)th transaction through the Nth transaction, and the Nth row includes a value indicating whether there is a traffic conflict between the (N−1)th transaction and the Nth transaction,
wherein N is a natural number,
wherein i is a natural number >=1 and (N−2) or less.

### Claim 7 (depends on 6)

The data bus of claim 6, wherein a value indicating whether there is a traffic conflict between an nth transaction and an mth transaction included in the conflict table has a second logical value,
when a sub-bank storing the nth transaction is identical to a sub-bank storing the mth transaction, and a strobe storing the nth transaction is identical to a strobe storing the mth transaction, or when the sub-bank storing the nth transaction is identical to the sub-bank storing the mth transaction, and the strobe storing the nth transaction is different from the strobe storing the mth transaction, a bank storing the nth transaction is identical to a bank storing the mth transaction, and a row storing the nth transaction is different from a row storing the mth transaction,
wherein n and m are natural numbers.

### Claim 8 (depends on 6)

The data bus of claim 6, wherein the transaction selection circuit selects at least one transaction corresponding to a column in which element values of all rows in the conflict table indicate the first logical value and a transaction corresponding to a current row as the selected at least one transaction, and outputs the selected at least one transaction.

### Claim 9 (depends on 8)

The data bus of claim 8, wherein the transaction selection circuit performs logical OR operation on at least one column in the conflict table by using all element values included in the corresponding column, and selects at least one transaction corresponding to a column in which a result value of performing the logical OR operation indicates the first logical value as a portion of the selected at least one transaction.

### Claim 10 (depends on 8)

The data bus of claim 8, wherein the transaction selection circuit updates all element values of a row corresponding to the selected at least one transaction in the conflict table to the first logical value, and in response to that at least one element value in the updated conflict table having the second logical value, changes the current row to a row corresponding to one transaction among the plurality of transactions that is unselected.

### Claim 11 (depends on 1)

The data bus of claim 1, wherein the memory data path comprises a plurality of stages, the stages comprising a plurality of registers connected to each other in a tree structure, and the memory data path outputs the selected at least one transaction via the registers corresponding to a last stage among the plurality of stages and via a plurality of output terminals.

### Claim 12

A data processing method of a data bus, the method comprising:
receiving, by the data bus, vector data including a plurality of transactions;
obtaining, by the data bus, a conflict table including information about whether there is a traffic conflict among the plurality of transactions;
selecting, by the data bus, at least one transaction from the transactions in which no traffic conflict occurs among the plurality of transactions based on the conflict table; and
outputting, by the data bus, the selected at least one transaction.

### Claim 13 (depends on 12)

The method of claim 12, further comprising:
updating the conflict table based on information about the selected at least one transaction; and
outputting at least one transaction among the plurality of transactions that is unselected based on the updated conflict table.

### Claim 14 (depends on 12)

The method of claim 12, wherein the plurality of transactions comprise a first transaction through an Nth transaction,
wherein the conflict table includes a first row through an Nth row, all element values of the first row are padded with first logical values, an (i+1)th row comprises values indicating whether there is a traffic conflict between an ith transaction and an (i+1)th transaction through the Nth transaction, and the Nth row comprises a value indicating whether there is a traffic conflict between the (N−1)th transaction and the Nth transaction,
wherein N is a natural number,
wherein i is a natural number >=1 and (N−2) or less.

### Claim 15 (depends on 14)

The method of claim 14, wherein the obtaining of the conflict table includes determining whether there is a traffic conflict between an nth transaction and an mth transaction,
wherein the determining of whether there is a traffic conflict comprises:
determining that there is a traffic conflict between the nth transaction and the mth transaction in response to determining that a sub-bank storing the nth transaction is identical to a sub-bank storing the mth transaction, and determining that a strobe storing the nth transaction is identical to a strobe storing the mth transaction; and
determining that there is a traffic conflict between the nth transaction and the mth transaction in response to determining that a sub-bank storing the nth transaction is identical to a sub-bank storing the mth transaction, determining that a strobe storing the nth transaction is not identical to a strobe storing the mth transaction, determining that a bank storing the nth transaction is identical to a bank storing the mth transaction, and determining that a row storing the nth transaction is identical to a row storing the mth transaction,
wherein n and m are natural numbers.

### Claim 16 (depends on 14)

The method of claim 14, wherein the selecting of the at least one transaction comprises selecting at least one transaction corresponding to a column in which element values of all rows in the conflict table indicate the first logical value and a transaction corresponding to a current row as the selected at least one transaction.

### Claim 17 (depends on 16)

The method of claim 16, wherein the selecting of the at least one transaction comprises:
performing a logical OR operation on at least one row in the conflict table by using all element values included in a corresponding row; and
selecting at least one transaction in which a result value of performing the logical OR operation corresponds to a row indicating the first logical value as a portion of the selected at least one transaction.

### Claim 18 (depends on 16)

The method of claim 16, further comprising:
updating all element values in a row corresponding to the selected at least one transaction in the conflict table to the first logical value; and
in response to determining that at least one element value in the updated conflict table has a second logical value, changing a current row to a row corresponding to one transaction among one transaction among the plurality of transactions that is unselected.

### Claim 19

A data processing device comprising:
a processor configured to output vector data including a plurality of transactions;
a memory comprising a plurality of memory banks and configured to store the plurality of transactions; and
a data bus configured to select at least one transaction in which no traffic conflict occurs among the plurality of transactions, based on whether there is a traffic conflict among the plurality of transactions, and provide the selected at least one transaction to the plurality of memory banks via a memory data path having a tree structure.

### Claim 20 (depends on 19)

The data bus of claim 19, wherein the data bus obtains a conflict table including information about whether there is a traffic conflict among the plurality of transactions, outputs at least one first transaction in which no traffic conflict occurs among the plurality of transactions based on the conflict table, and after updating the conflict table based on information about the at least one first transaction, outputs at least one second transaction in which no traffic conflict occurs among the plurality of transactions based on the updated conflict table.

### Claim at position 21

21-25. (canceled)
