Write transactions combining large writes
A system for combining large write write transactions includes a processor including at least a first die and a second die, and a link coupling the first die and the second die. When a link interface on one die sends a packet over a link to another die, the link interface identifies, from a queue co...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A system for combining large write write transactions includes a processor including at least a first die and a second die, and a link coupling the first die and the second die. When a link interface on one die sends a packet over a link to another die, the link interface identifies, from a queue containing a plurality of write transactions, two or more write transactions in the queue as candidates for making a combination, based on one or more attributes of each write transaction. The link interface determines whether two or more candidate write transactions are combinable based on a set of conditions. When two or more candidate write transactions are combinable, the link interface combines the candidate write transactions into a single combined write transaction and sends the combined write transaction. A link interface on the receiving die decodes the combined write transaction and iteratively regenerates individual write transactions using control information in the combined write transaction.
本公开涉及一种用于组合 |
---|