US 12,079,149 B2
Presentation of direct accessed storage under a logical drive model
Thomas M. Slaight, Beaverton, OR (US); Sivakumar Radhakrishnan, Portland, OR (US); Mark Schmisseur, Phoenix, AZ (US); Pankaj Kumar, Chandler, AZ (US); Saptarshi Mondal, Chandler, AZ (US); Sin S. Tan, Portland, OR (US); David C. Lee, Beaverton, OR (US); Marc T. Jones, Longmont, CO (US); Geetani R. Edirisooriya, Tempe, AZ (US); Bradley A. Burres, Waltham, MA (US); Brian M. Leitner, Hillsboro, OR (US); Kenneth C. Haren, Portland, OR (US); Michael T. Klinglesmith, Portland, OR (US); Matthew R. Wilcox, Ottawa (CA); and Eric J. Dahlen, Sherwood, OR (US)
Assigned to SK hynix NAND Product Solutions Corp., Rancho Cordova, CA (US)
Filed by SK hynix NAND Product Solutions Corp., San Jose, CA (US)
Filed on Feb. 8, 2023, as Appl. No. 18/107,465.
Application 15/224,006 is a division of application No. 13/976,262, granted, now 9,417,821, issued on Aug. 16, 2016, previously published as PCT/US2011/054313, filed on Sep. 30, 2011.
Application 18/107,465 is a continuation of application No. 16/936,078, filed on Jul. 22, 2020, granted, now 11,604,746.
Application 16/936,078 is a continuation of application No. 15/224,006, filed on Jul. 29, 2016, abandoned.
Prior Publication US 2023/0185747 A1, Jun. 15, 2023
Int. Cl. G06F 3/06 (2006.01); G06F 11/10 (2006.01); G06F 12/0866 (2016.01); G06F 13/10 (2006.01); G06F 13/16 (2006.01); G06F 13/28 (2006.01); G06F 13/40 (2006.01); G06F 13/42 (2006.01)
CPC G06F 13/28 (2013.01) [G06F 3/0607 (2013.01); G06F 3/061 (2013.01); G06F 3/0613 (2013.01); G06F 3/0619 (2013.01); G06F 3/0626 (2013.01); G06F 3/064 (2013.01); G06F 3/0646 (2013.01); G06F 3/065 (2013.01); G06F 3/0659 (2013.01); G06F 3/0661 (2013.01); G06F 3/0673 (2013.01); G06F 3/0688 (2013.01); G06F 3/0689 (2013.01); G06F 11/1068 (2013.01); G06F 12/0866 (2013.01); G06F 13/102 (2013.01); G06F 13/1668 (2013.01); G06F 13/4068 (2013.01); G06F 13/4282 (2013.01); G06F 2212/262 (2013.01); G06F 2213/0026 (2013.01); G06F 2213/0032 (2013.01)] 21 Claims
OG exemplary drawing
 
1. A method for queuing job entries, comprising:
receiving a first job entry;
determining that a first count of job entries in a first queue meets a threshold at a first point in time;
adding the first job entry to the first queue;
receiving a second job entry;
determining that a second count of job entries in the first queue does not meet the threshold at a second point in time, wherein the second point in time is subsequent to the first point in time;
in response to determining that the second count of job entries does not meet the threshold, adding the second job entry to a second queue;
in response to adding the second job entry to the second queue, determining that the second job entry matches a pending job entry; and
in response to determining that the second job entry matches the pending job entry, dropping the second job entry from the second queue.