IP Library Granted Patent US 12,277,067
Granted Patent B2
US 12,277,067 · App. 18/203,143 · Granted Apr 15, 2025

Memory array page table walk

Inventor: Perry V. Lea (Plano, TX)
G06F12/1009G06F12/0864G06F12/1027G06F12/1045G06F2212/1016G06F2212/1028G06F2212/651G06F2212/652G06F2212/684
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,277,067
App. No.
18/203,143
Granted
Apr 15, 2025
Kind
B2
Abstract

An example memory array page table walk can include using an array of memory cells configured to store a page table. The page table walk can include using sensing circuitry coupled to the array. The page table walk can include using a controller coupled to the array. The controller can be configured to operate the sensing circuitry to determine a physical address of a portion of data by accessing the page table in the array of memory cells. The controller can be configured to operate the sensing circuitry to cause storing of the portion of data in a buffer.

Claims (37)

1. An apparatus, comprising:

an array of memory cells;

sensing circuitry coupled to the array of memory cells; and

one or more compute components included in the array, the one or more compute components configured to:

perform a number of operations based at least in part on a physical address of a portion of data stored in the array, wherein the one or more compute components are configured to perform the number of operations in response to a command from a host, the command comprising an indication of the physical address associated with the portion of the data stored in the array;

use the physical address as an input to a table to obtain at least one result of the number of operations, wherein the table is associated with the array, and wherein the at least one result comprises a result of a respective logical operation; and

store the at least one result of the number of operations without transferring the at least one result outside the array.

2. The apparatus of claim 1 , wherein the apparatus is further configured to store the portion of data in a buffer, wherein the buffer is a translation lookaside buffer (TLB).

3. The apparatus of claim 1 , wherein the apparatus is configured to be used as a fully associative cache to determine the physical address.

4. The apparatus of claim 1 , wherein the apparatus is configured to, in response to the portion of data not being in the array of memory cells, indicate to the host to locate the portion of data in an additional memory location.

5. The apparatus of claim 1 , wherein the apparatus is configured to cause a page walk through a page table in the array independent of receiving intermediate instructions to perform the page table walk from the host.

6. The apparatus of claim 5 , wherein the apparatus is further configured to cause storing of a series of descriptors with tiered levels that indicate a location of the portion of data.

7. The apparatus of claim 6 , wherein each of the tiered levels is a pointer to a sub-section of a subsequent next level of the tiered levels.

8. The apparatus of claim 7 , wherein a final tiered level of the tiered levels indicates the physical address of the portion of data.

9. A method, comprising:

receiving, from a host device, a command comprising an indication of a physical address associated with data stored in an array of memory cells;

performing, by one or more compute components that are included in the array of memory cells, one or more operations in response to the command from the host device, wherein the one or more operations are performed based at least in part on the physical address associated with the data;

generating respective results of the one or more operations based at least in part on using the physical address as an input to a table associated with the array, each of the respective results comprising a result of a logical operation; and

storing the respective results of the one or more operations without transferring the respective results outside the array.

10. The method of claim 9 , wherein performing the one or more operations comprises:

performing a page table walk in the array to determine a physical address of the data, wherein performing the page table walk comprises resolving a first level of a page table in the array to determine a location in a second level of the page table.

11. The method of claim 10 , comprising:

resolving the second level to determine a location in a third level of the page table;

resolving the third level of the page table to determine a location in a fourth level of the page table; and

resolving the fourth level of the page table to determine the physical address corresponding to a virtual address of the data.

12. The method of claim 10 , wherein, in response to determining the physical address, sending a portion of data located at the physical address to be stored in a translation lookaside buffer (TLB).

13. The method of claim 10 , wherein performing the page table walk comprises comparing a virtual address with each of a plurality of elements of the page table simultaneously.

14. The method of claim 13 , wherein comparing the virtual address with each of the plurality of elements comprises comparing the virtual address with a first of the plurality of elements.

15. An apparatus, comprising:

an array of memory cells;

sensing circuitry coupled to the array of memory cells;

one or more compute components included in the array; and

a controller coupled to the one or more compute components and configured to control the one or more compute components to:

in response to a command from a host, perform a number of logical operations based at least in part on a physical address of a portion of data stored in the array, the command comprising an indication of the physical address associated with the portion of the data, wherein the one or more compute components are configured to use the physical address as an input to a table to obtain at least one result of the number of logical operations, wherein the table is associated with the array, and wherein the at least one result comprises a result of a respective logical operation; and

store the at least one result of the number of logical operations without transferring the at least one result outside the array.

16. The apparatus of claim 15 , wherein the physical address of the portion of data corresponds to a virtual address.

17. The apparatus of claim 16 , wherein the controller is configured to control the one or more compute components to perform a walk through of a page table, the walk through including resolving page table levels simultaneously by comparing the virtual address to each of a plurality of elements in the page table.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 22, 2024
From: MICRON TECHNOLOGY, INC.
To: LODESTAR LICENSING GROUP LLC
Reel/Frame 067179/0485 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 30, 2023
From: LEA, PERRY V.
To: MICRON TECHNOLOGY, INC.
Reel/Frame 063791/0709 →
Continuity (4)
Continuation 17531551 · Nov 19, 2021
Continuation 16556989 · Aug 30, 2019
Continuation 15437982 · Feb 21, 2017
Related Publication 20230401158A1 · Dec 14, 2023
References Cited (373)
US 4380046A · Fung · 1983 [cited by applicant]
US 4435792A · Bechtolsheim · 1984 [cited by applicant]
US 4435793A · Ochii · 1984 [cited by applicant]
US 4727474A · Batcher · 1988 [cited by applicant]
US 4843264A · Galbraith · 1989 [cited by applicant]
US 4958378A · Bell · 1990 [cited by applicant]
US 4977542A · Matsuda et al. · 1990 [cited by applicant]
US 5023838A · Herbert · 1991 [cited by applicant]
US 5034636A · Reis et al. · 1991 [cited by applicant]
US 5201039A · Sakamura · 1993 [cited by applicant]
US 5210850A · Kelly et al. · 1993 [cited by applicant]
US 5253308A · Johnson · 1993 [cited by applicant]
US 5276643A · Hoffman et al. · 1994 [cited by applicant]
US 5325519A · Long et al. · 1994 [cited by applicant]
US 5367488A · An · 1994 [cited by applicant]
US 5379257A · Matsumura et al. · 1995 [cited by applicant]
US 5386379A · Ali-Yahia et al. · 1995 [cited by applicant]
US 5398213A · Yeon et al. · 1995 [cited by applicant]
US 5440482A · Davis · 1995 [cited by applicant]
US 5446690A · Tanaka et al. · 1995 [cited by applicant]
US 5473576A · Matsui · 1995 [cited by applicant]
US 5481500A · Reohr et al. · 1996 [cited by applicant]
US 5485373A · Davis et al. · 1996 [cited by applicant]
US 5506811A · McLaury · 1996 [cited by applicant]
US 5615404A · Knoll et al. · 1997 [cited by applicant]
US 5638128A · Hoogenboom · 1997 [cited by applicant]
US 5638317A · Tran · 1997 [cited by applicant]
US 5654936A · Cho · 1997 [cited by applicant]
US 5678021A · Pawate et al. · 1997 [cited by applicant]
US 5680565A · Glew · 1997 [cited by applicant]
US 5724291A · Matano · 1998 [cited by applicant]
US 5724366A · Furutani · 1998 [cited by applicant]
US 5751987A · Mahant-Shetti et al. · 1998 [cited by applicant]
US 5787458A · Miwa · 1998 [cited by applicant]
US 5854636A · Watanabe et al. · 1998 [cited by applicant]
US 5867429A · Chen et al. · 1999 [cited by applicant]
US 5870504A · Nemoto et al. · 1999 [cited by applicant]
US 5915084A · Wendell · 1999 [cited by applicant]
US 5935263A · Keeth et al. · 1999 [cited by applicant]
US 5986942A · Sugibayashi · 1999 [cited by applicant]
US 5991209A · Chow · 1999 [cited by applicant]
US 5991785A · Alidina et al. · 1999 [cited by applicant]
US 6005799A · Rao · 1999 [cited by applicant]
US 6009020A · Nagata · 1999 [cited by applicant]
US 6092186A · Betker et al. · 2000 [cited by applicant]
US 6122211A · Morgan et al. · 2000 [cited by applicant]
US 6125071A · Kohno et al. · 2000 [cited by applicant]
US 6134164A · Lattimore et al. · 2000 [cited by applicant]
US 6147514A · Shiratake · 2000 [cited by applicant]
US 6151244A · Fujino et al. · 2000 [cited by applicant]
US 6157578A · Brady · 2000 [cited by applicant]
US 6163862A · Adams et al. · 2000 [cited by applicant]
US 6166942A · Vo et al. · 2000 [cited by applicant]
US 6172918B1 · Hidaka · 2001 [cited by applicant]
US 6175514B1 · Henderson · 2001 [cited by applicant]
US 6181698B1 · Hariguchi · 2001 [cited by applicant]
US 6208544B1 · Beadle et al. · 2001 [cited by applicant]
US 6226215B1 · Yoon · 2001 [cited by applicant]
US 6301153B1 · Takeuchi et al. · 2001 [cited by applicant]
US 6301164B1 · Manning et al. · 2001 [cited by applicant]
US 6304477B1 · Naji · 2001 [cited by applicant]
US 6389507B1 · Sherman · 2002 [cited by applicant]
US 6418498B1 · Martwick · 2002 [cited by applicant]
US 6466499B1 · Blodgett · 2002 [cited by applicant]
US 6510098B1 · Taylor · 2003 [cited by applicant]
US 6563754B1 · Lien et al. · 2003 [cited by applicant]
US 6578058B1 · Nygaard · 2003 [cited by applicant]
US 6731542B1 · Le et al. · 2004 [cited by applicant]
US 6754746B1 · Leung et al. · 2004 [cited by applicant]
US 6768679B1 · Le et al. · 2004 [cited by applicant]
US 6807614B2 · Chung · 2004 [cited by applicant]
US 6816422B2 · Hamade et al. · 2004 [cited by applicant]
US 6819612B1 · Achter · 2004 [cited by applicant]
US 6894549B2 · Eliason · 2005 [cited by applicant]
US 6943579B1 · Hazanchuk et al. · 2005 [cited by applicant]
US 6948056B1 · Roth · 2005 [cited by applicant]
US 6950771B1 · Fan et al. · 2005 [cited by applicant]
US 6950898B2 · Merritt et al. · 2005 [cited by applicant]
US 6956770B2 · Khalid et al. · 2005 [cited by applicant]
US 6961272B2 · Schreck · 2005 [cited by applicant]
US 6965648B1 · Smith et al. · 2005 [cited by applicant]
US 6985394B2 · Kim · 2006 [cited by applicant]
US 6987693B2 · Cernea et al. · 2006 [cited by applicant]
US 7020017B2 · Chen et al. · 2006 [cited by applicant]
US 7028170B2 · Saulsbury · 2006 [cited by applicant]
US 7045834B2 · Tran et al. · 2006 [cited by applicant]
US 7054178B1 · Shiah et al. · 2006 [cited by applicant]
US 7061817B2 · Raad et al. · 2006 [cited by applicant]
US 7079407B1 · Dimitrelis · 2006 [cited by applicant]
US 7173857B2 · Kato et al. · 2007 [cited by applicant]
US 7187585B2 · Li et al. · 2007 [cited by applicant]
US 7196928B2 · Chen · 2007 [cited by applicant]
US 7260565B2 · Lee et al. · 2007 [cited by applicant]
US 7260672B2 · Garney · 2007 [cited by applicant]
US 7372715B2 · Han · 2008 [cited by applicant]
US 7400532B2 · Aritome · 2008 [cited by applicant]
US 7406494B2 · Magee · 2008 [cited by applicant]
US 7447720B2 · Beaumont · 2008 [cited by applicant]
US 7454451B2 · Beaumont · 2008 [cited by applicant]
US 7457181B2 · Lee et al. · 2008 [cited by applicant]
US 7535769B2 · Cernea · 2009 [cited by applicant]
US 7546438B2 · Chung · 2009 [cited by applicant]
US 7562198B2 · Noda et al. · 2009 [cited by applicant]
US 7574466B2 · Beaumont · 2009 [cited by applicant]
US 7602647B2 · Li et al. · 2009 [cited by applicant]
US 7663928B2 · Tsai et al. · 2010 [cited by applicant]
US 7685365B2 · Rajwar et al. · 2010 [cited by applicant]
US 7692466B2 · Ahmadi · 2010 [cited by applicant]
US 7752417B2 · Manczak et al. · 2010 [cited by applicant]
US 7791962B2 · Noda et al. · 2010 [cited by applicant]
US 7796453B2 · Riho et al. · 2010 [cited by applicant]
US 7805587B1 · Van Dyke et al. · 2010 [cited by applicant]
US 7808854B2 · Takase · 2010 [cited by applicant]
US 7827372B2 · Bink et al. · 2010 [cited by applicant]
US 7869273B2 · Lee et al. · 2011 [cited by applicant]
US 7898864B2 · Dong · 2011 [cited by applicant]
US 7924628B2 · Danon et al. · 2011 [cited by applicant]
US 7937535B2 · Ozer et al. · 2011 [cited by applicant]
US 7957206B2 · Bauser · 2011 [cited by applicant]
US 7979667B2 · Allen et al. · 2011 [cited by applicant]
US 7996749B2 · Ding et al. · 2011 [cited by applicant]
US 8042082B2 · Solomon · 2011 [cited by applicant]
US 8045391B2 · Mohklesi · 2011 [cited by applicant]
US 8059438B2 · Chang et al. · 2011 [cited by applicant]
US 8095825B2 · Hirotsu et al. · 2012 [cited by applicant]
US 8117462B2 · Snapp et al. · 2012 [cited by applicant]
US 8164942B2 · Gebara et al. · 2012 [cited by applicant]
US 8208328B2 · Hong · 2012 [cited by applicant]
US 8213248B2 · Moon et al. · 2012 [cited by applicant]
US 8223568B2 · Seo · 2012 [cited by applicant]
US 8238173B2 · Akerib et al. · 2012 [cited by applicant]
US 8274841B2 · Shimano et al. · 2012 [cited by applicant]
US 8279683B2 · Klein · 2012 [cited by applicant]
US 8310884B2 · Iwai et al. · 2012 [cited by applicant]
US 8332367B2 · Bhattacherjee et al. · 2012 [cited by applicant]
US 8339824B2 · Cooke · 2012 [cited by applicant]
US 8339883B2 · Yu et al. · 2012 [cited by applicant]
US 8347154B2 · Bahali et al. · 2013 [cited by applicant]
US 8351292B2 · Matano · 2013 [cited by applicant]
US 8356144B2 · Hessel et al. · 2013 [cited by applicant]
US 8417921B2 · Gonion et al. · 2013 [cited by applicant]
US 8462532B1 · Argyres · 2013 [cited by applicant]
US 8484276B2 · Carlson et al. · 2013 [cited by applicant]
US 8495438B2 · Roine · 2013 [cited by applicant]
US 8503250B2 · Demone · 2013 [cited by applicant]
US 8526239B2 · Kim · 2013 [cited by applicant]
US 8533245B1 · Cheung · 2013 [cited by applicant]
US 8555037B2 · Gonion · 2013 [cited by applicant]
US 8599613B2 · Abiko et al. · 2013 [cited by applicant]
US 8605015B2 · Guttag et al. · 2013 [cited by applicant]
US 8625376B2 · Jung et al. · 2014 [cited by applicant]
US 8644101B2 · Jun et al. · 2014 [cited by applicant]
US 8650232B2 · Stortz et al. · 2014 [cited by applicant]
US 8873272B2 · Lee · 2014 [cited by applicant]
US 8964496B2 · Manning · 2015 [cited by applicant]
US 8971124B1 · Manning · 2015 [cited by applicant]
US 9015390B2 · Klein · 2015 [cited by applicant]
US 9047193B2 · Lin et al. · 2015 [cited by applicant]
US 9165023B2 · Moskovich et al. · 2015 [cited by applicant]
US 9892058B2 · Wilkes · 2018 [cited by examiner]
US 9996479B2 · Lea · 2018 [cited by examiner]
US 10402340B2 · Lea · 2019 [cited by examiner]
US 10489308B2 · Bear · 2019 [cited by examiner]
US 11182304B2 · Lea · 2021 [cited by applicant]
US 20010007112A1 · Porterfield · 2001 [cited by applicant]
US 20010008492A1 · Higashiho · 2001 [cited by applicant]
US 20010010057A1 · Yamada · 2001 [cited by applicant]
US 20010028584A1 · Nakayama et al. · 2001 [cited by applicant]
US 20010043089A1 · Forbes et al. · 2001 [cited by applicant]
US 20020059355A1 · Peleg et al. · 2002 [cited by applicant]
US 20030167426A1 · Slobodnik · 2003 [cited by applicant]
US 20030222879A1 · Lin et al. · 2003 [cited by applicant]
US 20040073592A1 · Kim et al. · 2004 [cited by applicant]
US 20040073773A1 · Demjanenko · 2004 [cited by applicant]
US 20040085840A1 · Vali et al. · 2004 [cited by applicant]
US 20040095826A1 · Perner · 2004 [cited by applicant]
US 20040154002A1 · Ball et al. · 2004 [cited by applicant]
US 20040205289A1 · Srinivasan · 2004 [cited by applicant]
US 20040240251A1 · Nozawa et al. · 2004 [cited by applicant]
US 20050015557A1 · Wang et al. · 2005 [cited by applicant]
US 20050078514A1 · Scheuerlein et al. · 2005 [cited by applicant]
US 20050097417A1 · Agrawal et al. · 2005 [cited by applicant]
US 20060047937A1 · Selvaggi et al. · 2006 [cited by applicant]
US 20060069849A1 · Rudelic · 2006 [cited by applicant]
US 20060146623A1 · Mizuno et al. · 2006 [cited by applicant]
US 20060149804A1 · Luick et al. · 2006 [cited by applicant]
US 20060181917A1 · Kang et al. · 2006 [cited by applicant]
US 20060215432A1 · Wickeraad et al. · 2006 [cited by applicant]
US 20060225072A1 · Lari et al. · 2006 [cited by applicant]
US 20060282644A1 · Wong · 2006 [cited by applicant]
US 20060291282A1 · Liu et al. · 2006 [cited by applicant]
US 20070103986A1 · Chen · 2007 [cited by applicant]
US 20070171747A1 · Hunter et al. · 2007 [cited by applicant]
US 20070180006A1 · Gyoten et al. · 2007 [cited by applicant]
US 20070180184A1 · Sakashita et al. · 2007 [cited by applicant]
US 20070195602A1 · Fong et al. · 2007 [cited by applicant]
US 20070285131A1 · Sohn · 2007 [cited by applicant]
US 20070285979A1 · Turner · 2007 [cited by applicant]
US 20070291532A1 · Tsuj · 2007 [cited by applicant]
US 20080025073A1 · Arsovski · 2008 [cited by applicant]
US 20080037333A1 · Kim et al. · 2008 [cited by applicant]
US 20080052711A1 · Forin et al. · 2008 [cited by applicant]
US 20080137388A1 · Krishnan et al. · 2008 [cited by applicant]
US 20080165601A1 · Matick et al. · 2008 [cited by applicant]
US 20080178053A1 · Gorman et al. · 2008 [cited by applicant]
US 20080215937A1 · Dreibelbis et al. · 2008 [cited by applicant]
US 20090067218A1 · Graber · 2009 [cited by applicant]
US 20090154238A1 · Lee · 2009 [cited by applicant]
US 20090154273A1 · Borot et al. · 2009 [cited by applicant]
US 20090182976A1 · Agesen · 2009 [cited by applicant]
US 20090254697A1 · Akerib · 2009 [cited by applicant]
US 20100023682A1 · Lee et al. · 2010 [cited by applicant]
US 20100067296A1 · Li · 2010 [cited by applicant]
US 20100091582A1 · Vali et al. · 2010 [cited by applicant]
US 20100162038A1 · Hulbert et al. · 2010 [cited by applicant]
US 20100172190A1 · Lavi et al. · 2010 [cited by applicant]
US 20100180145A1 · Chu · 2010 [cited by applicant]
US 20100210076A1 · Gruber et al. · 2010 [cited by applicant]
US 20100226183A1 · Kim · 2010 [cited by applicant]
US 20100308858A1 · Noda et al. · 2010 [cited by applicant]
US 20100332895A1 · Billing et al. · 2010 [cited by applicant]
US 20110051523A1 · Manabe et al. · 2011 [cited by applicant]
US 20110063919A1 · Chandrasekhar et al. · 2011 [cited by applicant]
US 20110093662A1 · Walker et al. · 2011 [cited by applicant]
US 20110103151A1 · Kim et al. · 2011 [cited by applicant]
US 20110119467A1 · Cadambi et al. · 2011 [cited by applicant]
US 20110122695A1 · Li et al. · 2011 [cited by applicant]
US 20110140741A1 · Zerbe et al. · 2011 [cited by applicant]
US 20110219260A1 · Nobunaga et al. · 2011 [cited by applicant]
US 20110267883A1 · Lee et al. · 2011 [cited by applicant]
US 20110317496A1 · Bunce et al. · 2011 [cited by applicant]
US 20120005397A1 · Lim et al. · 2012 [cited by applicant]
US 20120017039A1 · Margetts · 2012 [cited by applicant]
US 20120023281A1 · Kawasaki et al. · 2012 [cited by applicant]
US 20120120705A1 · Mitsubori et al. · 2012 [cited by applicant]
US 20120134216A1 · Singh · 2012 [cited by applicant]
US 20120134226A1 · Chow · 2012 [cited by applicant]
US 20120135225A1 · Chow · 2012 [cited by applicant]
US 20120140540A1 · Agam et al. · 2012 [cited by applicant]
US 20120182798A1 · Hosono et al. · 2012 [cited by applicant]
US 20120195146A1 · Jun et al. · 2012 [cited by applicant]
US 20120198310A1 · Tran et al. · 2012 [cited by applicant]
US 20120246380A1 · Akerib et al. · 2012 [cited by applicant]
US 20120265964A1 · Murata et al. · 2012 [cited by applicant]
US 20120281486A1 · Rao et al. · 2012 [cited by applicant]
US 20120303627A1 · Keeton et al. · 2012 [cited by applicant]
US 20120331265A1 · Rozario et al. · 2012 [cited by applicant]
US 20130003467A1 · Klein · 2013 [cited by applicant]
US 20130061006A1 · Hein · 2013 [cited by applicant]
US 20130107623A1 · Kavalipurapu et al. · 2013 [cited by applicant]
US 20130117541A1 · Choquette et al. · 2013 [cited by applicant]
US 20130124783A1 · Yoon et al. · 2013 [cited by applicant]
US 20130132702A1 · Patel et al. · 2013 [cited by applicant]
US 20130138646A1 · Sirer et al. · 2013 [cited by applicant]
US 20130163362A1 · Kim · 2013 [cited by applicant]
US 20130173888A1 · Hansen et al. · 2013 [cited by applicant]
US 20130205114A1 · Badam et al. · 2013 [cited by applicant]
US 20130219112A1 · Okin et al. · 2013 [cited by applicant]
US 20130227361A1 · Bowers et al. · 2013 [cited by applicant]
US 20130283122A1 · Anholt et al. · 2013 [cited by applicant]
US 20130286705A1 · Grover et al. · 2013 [cited by applicant]
US 20130326154A1 · Haswell · 2013 [cited by applicant]
US 20130332707A1 · Gueron et al. · 2013 [cited by applicant]
US 20140089572A1 · Koka et al. · 2014 [cited by applicant]
US 20140185395A1 · Seo · 2014 [cited by applicant]
US 20140215185A1 · Danielsen · 2014 [cited by applicant]
US 20140250279A1 · Manning · 2014 [cited by applicant]
US 20140344934A1 · Jorgensen · 2014 [cited by applicant]
US 20150029798A1 · Manning · 2015 [cited by applicant]
US 20150042380A1 · Manning · 2015 [cited by applicant]
US 20150063052A1 · Manning · 2015 [cited by applicant]
US 20150078108A1 · Cowles et al. · 2015 [cited by applicant]
US 20150279466A1 · Manning · 2015 [cited by applicant]
US 20150120987A1 · Wheeler · 2015 [cited by applicant]
US 20150134713A1 · Wheeler · 2015 [cited by applicant]
US 20150270015A1 · Murphy et al. · 2015 [cited by applicant]
US 20150324290A1 · Leidel · 2015 [cited by applicant]
US 20150325272A1 · Murphy · 2015 [cited by applicant]
US 20150356009A1 · Wheeler et al. · 2015 [cited by applicant]
US 20150356022A1 · Leidel et al. · 2015 [cited by applicant]
US 20150357007A1 · Manning et al. · 2015 [cited by applicant]
US 20150357008A1 · Manning et al. · 2015 [cited by applicant]
US 20150357019A1 · Wheeler et al. · 2015 [cited by applicant]
US 20150357020A1 · Manning · 2015 [cited by applicant]
US 20150357021A1 · Hush · 2015 [cited by applicant]
US 20150357022A1 · Hush · 2015 [cited by applicant]
US 20150357023A1 · Hush · 2015 [cited by applicant]
US 20150357024A1 · Hush et al. · 2015 [cited by applicant]
US 20150357047A1 · Tiwari · 2015 [cited by applicant]
US 20160062672A1 · Wheeler · 2016 [cited by applicant]
US 20160062673A1 · Tiwari · 2016 [cited by applicant]
US 20160062692A1 · Finkbeiner et al. · 2016 [cited by applicant]
US 20160062733A1 · Tiwari · 2016 [cited by applicant]
US 20160063284A1 · Tiwari · 2016 [cited by applicant]
US 20160064045A1 · La Fratta · 2016 [cited by applicant]
US 20160064047A1 · Tiwari · 2016 [cited by applicant]
US 20160098208A1 · Willcock · 2016 [cited by applicant]
US 20160098209A1 · Leidel et al. · 2016 [cited by applicant]
US 20160110135A1 · Wheeler et al. · 2016 [cited by applicant]
US 20160125919A1 · Hush · 2016 [cited by applicant]
US 20160140048A1 · Mukherjee et al. · 2016 [cited by applicant]
US 20160147667A1 · Awasthi et al. · 2016 [cited by applicant]
US 20160154596A1 · Willcock et al. · 2016 [cited by applicant]
US 20160155482A1 · La Fratta · 2016 [cited by applicant]
US 20160188250A1 · Wheeler · 2016 [cited by applicant]
US 20160196142A1 · Wheeler et al. · 2016 [cited by applicant]
US 20160196856A1 · Tiwari et al. · 2016 [cited by applicant]
US 20160225422A1 · Tiwari et al. · 2016 [cited by applicant]
US 20160266873A1 · Tiwari et al. · 2016 [cited by applicant]
US 20160266899A1 · Tiwari · 2016 [cited by applicant]
US 20160267951A1 · Tiwari · 2016 [cited by applicant]
US 20160283396A1 · Ter-Grigoryan · 2016 [cited by examiner]
US 20160292080A1 · Leidel et al. · 2016 [cited by applicant]
US 20160306584A1 · Zawodny et al. · 2016 [cited by applicant]
US 20160306614A1 · Leidel et al. · 2016 [cited by applicant]
US 20160365129A1 · Willcock · 2016 [cited by applicant]
US 20160371033A1 · La Fratta et al. · 2016 [cited by applicant]
US 20170212843A1 · Agesen · 2017 [cited by applicant]
US 20190026232A1 · Warkentin · 2019 [cited by examiner]
US 20190391814A1 · Warkentin · 2019 [cited by examiner]
US 20200117612A1 · Gandhi · 2020 [cited by examiner]
US 20200233804A1 · Gandhi · 2020 [cited by examiner]
US 20230401158A1 · Lea · 2023 [cited by examiner]
CN 102141905 · 2011 [cited by applicant]
EP 0214718 · 1987 [cited by applicant]
EP 2026209 · 2009 [cited by applicant]
JP H0831168 · 1996 [cited by applicant]
JP 2009259193 · 2015 [cited by applicant]
KR 100211482 · 1998 [cited by applicant]
KR 1020100134235 · 2010 [cited by applicant]
KR 1020130049421 · 2013 [cited by applicant]
WO 2001065359 · 2001 [cited by applicant]
WO 2010079451 · 2010 [cited by applicant]
WO 2013062596 · 2013 [cited by applicant]
WO 2013081588 · 2013 [cited by applicant]
WO 2013095592 · 2013 [cited by applicant]
WO 2016016605 · 2016 [cited by applicant]
WO 2016144726 · 2016 [cited by applicant]
Processing in Memory: Chips to Petaflops; Kogge et al.; In Workshop on Mixing Logic and DRAM: Chips that Compute and Remember at ISCA '97; 1997; retrieved from http://www.cs.ucf.edu/courses/cda5106/summer02/papers/kogge… [cited by examiner]
Y. Kim and J. Park, “Energy-Efficient STT-MRAM based Digital PIM supporting Vertical Computations Using Sense Amplifier,” 2022 19th International SoC Design Conference (ISOCC), Gangneung-si, Korea, Republic of, 2022, pp… [cited by examiner]
Seung-Moon Yoo et al., “New current-mode sense amplifiers for high density DRAM and PIM architectures,” ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No. 01CH37196), Sydney, NSW, 2001, … [cited by examiner]
S. Kim and H.-J. Yoo, “An Overview of Computing-in-Memory Circuits With DRAM and NVM,” in IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 71, No. 3, pp. 1626-1631, Mar. 2024, doi: 10.1109/TCSII.2023.3… [cited by examiner]
S. Kim et al., “DynaPlasia: An eDRAM In-Memory Computing-Based Reconfigurable Spatial Accelerator With Triple-Mode Cell,” in IEEE Journal of Solid-State Circuits, vol. 59, No. 1, pp. 102-115, Jan. 2024, doi: 10.1109/JSS… [cited by examiner]
“4.9.3 MINLOC and MAXLOC”, Jun. 12, 1995, (5pgs.), Message Passing Interface Forum 1.1, retrieved from http://www.mpi-forum.org/docs/mpi-1.1/mpi-11-html/node79.html. [cited by applicant]
Stojmenovic, “Multiplicative Circulant Networks Topological Properties and Communication Algorithms”, (25 pgs.), Discrete Applied Mathematics 77 (1997) 281-305. [cited by applicant]
Boyd et al., “On the General Applicability of Instruction-Set Randomization”, Jul.-Sep. 2010, (14 pgs.), vol. 7, Issue 3, IEEE Transactions on Dependable and Secure Computing. [cited by applicant]
Elliot, et al., “Computational RAM: Implementing Processors in Memory”, Jan.-Mar. 1999, (10 pgs.), vol. 16, Issue 1, IEEE Design and Test of Computers Magazine. [cited by applicant]
International Search Report and Written Opinion for related PCT Application No. PCT/US2018/017901, dated May 28, 2018, 25 pages. [cited by applicant]
Office Action for related Taiwan Patent Application No. 107105673, dated Oct. 15, 2018, 9 pages. [cited by applicant]
Office Action for related Taiwan Patent Application No. 107105673, dated Mar. 11, 2019, 18 pages. [cited by applicant]
Extended European Search Report and Written Opinion for related EP Patent Application No. 18757312.6, dated Dec. 14, 2020, 7 pages. [cited by applicant]
FELIX: fast and energy-efficient logic in memory; Gupta et al.; Proceedings of the International Conference on Computer-Aided Design, Article No. 55; Nov. 5-8, 2018 (Year: 2018). [cited by applicant]
Lu Pis: Latch-up based ultra efficient processing in-memory system; Sim et al.; 19th International Symposium on Quality Electronic Design; Mar. 13-14, 2018 (Year: 2018). [cited by applicant]
Gen PI M: Generalized processing in-memory to accelerate data intensive applications; Imani et al.; 2018 Design, Automation & Test in Europe; Mar. 19-23, 2018 (Year: 2016). [cited by applicant]
New current-mode sense amplifiers for high density DRAM and PIM architectures; Yoo et al.; 2001 IEEE International Symposium on Circuits and Systems; May 6-9, 2001 (Year: 2001). [cited by applicant]
Shaahin Angizi, Zhezhi He, and Deliang Fan. 2019. ParaPIM: a parallel processing-in-memory accelerator for binary-weight deep neural networks. Proceedings of the 24th Asia and South Pacific Design Automation Conference,… [cited by applicant]
Vivek Seshadriet al. Ambit: in-memory accelerator for bulk bitwise operations using commodity DRAM technology. Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture. Oct. 2017. pp. 273-287… [cited by applicant]
Amir Morad, Leonid Yavits, and Ran Ginosar. 2015. GP-SI MD Processing-in-Memory. <i>ACM Trans. Arch it. Code Optim.</i> 11, 4, Article 53 (Jan. 2015), 26 pages. (Year: 2015). [cited by applicant]
Definition cache memory; Rouse, Margaret; May 2018; retrieved from https://searchstorage.techtarget.com/definition/cache-meory on May 28, 2018. [cited by applicant]
Dybdahl, et al., “Destructive-Read in Embedded DRAM, Impact on Power Consumption,” Apr. 2006, (10 pgs.), vol. 2, Issue 2, Journal of Embedded Computing-Issues in embedded single-chip multicore architectures. [cited by applicant]
Kogge, et al., “Processing in Memory: Chips to Petaflops,” May 23, 1997, (8 pgs.), retrieved from: http://www.cs.ucf.edu/courses/cda5106/summer02/papers/kogge97PIM.pdf. [cited by applicant]
Draper, et al., “The Architecture of the DIVA Processing-In-Memory Chip,” Jun. 22-26, 2002, (12 pgs.), ICS '02, retrieved from: http://www.isi.edu/˜draper/papers/ics02.pdf. [cited by applicant]
Adibi, et al., “Processing-In-Memory Technology for Knowledge Discovery Algorithms,” Jun. 25, 2006, (10 pgs.), Proceeding of the Second International Workshop on Data Management on New Hardware, retrieved from: http://w… [cited by applicant]
U.S. Appl. No. 13/449,082, entitled, “Methods and Apparatus for Pattern Matching,” filed Apr. 17, 2012, (37 pgs.). [cited by applicant]
U.S. Appl. No. 13/743,686, entitled, “Weighted Search and Compare in a Memory Device,” filed Jan. 17, 2013, (25 pgs.). [cited by applicant]
U.S. Appl. No. 13/774,636, entitled, “Memory as a Programmable Logic Device,” filed Feb. 22, 2013, (30 pgs.). [cited by applicant]
U.S. Appl. No. 13/774,553, entitled, “Neural Network in a Memory Device,” filed Feb. 22, 2013, (63 pgs.). [cited by applicant]
U.S. Appl. No. 13/796,189, entitled, “Performing Complex Arithmetic Functions in a Memory Device,” filed Mar. 12, 2013, (23 pgs.). [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2013/043702, mailed Sep. 26, 2013, (11 pgs.). [cited by applicant]
Pagiamtzis, et al., “Content-Addressable Memory (CAM) Circuits and Architectures: A Tutorial and Survey”, Mar. 2006, (16 pgs.), vol. 41, No. 3, IEEE Journal of Solid-State Circuits. [cited by applicant]
Pagiamtzis, Kostas, “Content-Addressable Memory Introduction”, Jun. 25, 2007, (6 pgs.), retrieved from: http://www.pagiamtzis.com/cam/camintro. [cited by applicant]
Debnath, Biplob, Bloomflash: Bloom Filter on Flash-Based Storage, 2011 31st Annual Conference on Distributed Computing Systems, Jun. 20-24, 2011, 10 pgs. [cited by applicant]
Derby, et al., “A High-Performance Embedded DSP Core with Novel SIMD Features”, Apr. 6-10, 2003, (4 pgs), vol. 2, pp. 301-304, 2003 IEEE International Conference on Accoustics, Speech, and Signal Processing. [cited by applicant]