US 11,907,563 B2 · Clock domain crossing queue

Abstract

Methods, systems, and devices for one or more clock domain crossing queues are described. A queue can receive, from a first clock domain, a first command to store data in the queue. The queue can store the data at a first location indicated by a first pointer. The queue can receive, from the first clock domain, a second command to cause the second clock domain to retrieve the data from the queue. The queue can generate, based on receiving the second command, a third command synchronized with a clock of the second clock domain and to cause the second clock domain to retrieve the data. The queue can retrieve the data from the first location in the queue indicated by a second pointer associated with retrieving data based at least in part on generating the third command. The queue can transmit, to the second clock domain, the data.

Claims20

Dependent claims

A method, comprising:

receiving, from a first clock domain, a first command to store data in a queue as part of transferring the data from the first clock domain to a second clock domain in a memory sub-system;
determining, after receiving the first command, that the queue is full;
storing the data in the queue at a first location based at least in part on the queue being full, wherein storing the data overwrites information previously stored at the first location;
receiving, from the first clock domain, a second command to cause the second clock domain to retrieve the data from the queue;
generating, based at least in part on receiving the second command, a third command synchronized with a clock of the second clock domain and to cause the second clock domain to retrieve the data from the queue;
retrieving the data from the first location of the queue based at least in part on generating the third command;
and
transmitting, to the second clock domain, the data based at least in part on retrieving the data.

5 more elements

An apparatus, comprising:

an array of memory cells comprising one or more chalcogenide storage elements;
a first component associated with the array of memory cells and having a first clock domain;
a second component associated with the array of memory cells and having a second clock domain;
and
a queue coupled with the first component and the second component and configured to transform information from the first clock domain to the second clock domain, wherein the queue further comprises:
a receiver configured to receive a first command to store data in the queue from the first component and to receive a second command to cause the second component to retrieve the data;
a storage component comprising a first location and a second location for storing information and configured to overwrite information previously stored in the first location based on the queue being full;
a synchronizer configured to generate a third command for the second component to retrieve the data from the queue, the third command synchronized with a clock of the second clock domain and based at least in part on receiving the second command;
a retriever configured to retrieve the data from the first location of the storage component based at least in part on generating the third command;
and
a transmitter configured to transmit the data to the second component based at least in part on retrieving the data.

8 more elements

Dependencies are inferred from the claim text.

Clock domain crossing queue

Life of this patent

Clock domain crossing queue

Life of this patent

Abstract

Claims20