US 11,907,563 B2
Clock domain crossing queue
Yueh-Hung Chen, Sunnyvale, CA (US); Chih-Kuo Kao, Fremont, CA (US); Ying Yu Tai, Mountain View, CA (US); and Jiangli Zhu, San Jose, CA (US)
Assigned to Micron Technology, Inc., Boise, ID (US)
Filed by Micron Technology, Inc., Boise, ID (US)
Filed on Sep. 8, 2022, as Appl. No. 17/940,751.
Application 17/940,751 is a continuation of application No. 16/916,926, filed on Jun. 30, 2020, granted, now 11,461,030.
Claims priority of provisional application 62/874,442, filed on Jul. 15, 2019.
Prior Publication US 2023/0070078 A1, Mar. 9, 2023
Int. Cl. G06F 3/06 (2006.01); G06F 1/04 (2006.01)
CPC G06F 3/0647 (2013.01) [G06F 1/04 (2013.01); G06F 3/0604 (2013.01); G06F 3/0659 (2013.01); G06F 3/0673 (2013.01)] 20 Claims
OG exemplary drawing
 
1. 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.