Embodiments of the present invention relate generally to memory management. More specifically, embodiments of the present invention may provide one or more techniques for memory management in a hierarchical memory system.
Computer systems are generally employed in numerous configurations to provide a variety of computing functions. Processing speeds, system flexibility, power consumption, and size constraints are typically considered by design engineers tasked with developing computer systems and system components. Computer systems generally include a plurality of memory devices (e.g., a dual in-line memory module (DIMM) may contain 8, 16, or more memory devices, a stacked NAND flash package may contain 2, 4, or 8 NAND die) and a plurality of memory types (i.e., memory devices that may have different performance and/or power characteristics) which may be used to store data (e.g., programs and user data) and which may be accessible to other system components such as processors or peripheral devices. Such memory devices may include volatile and non-volatile memory devices.
Typically, the memory address space of a computing system is managed by a memory management system. In certain computing systems, the memory management system may dynamically allocate portions of the memory address space to programs being executed by the processors and may allocate a separate portion of the memory address space to data being used by such a program. Conversely, the memory management system may deallocate portions of the memory address space from programs when the programs are no longer being executed by the processors. The memory management system may include tables used to map virtual memory addresses that are used by the processors to the physical memory address space. These tables may include a main memory translation table (MMXT) and a translation lookaside buffer (TLB). Often the TLB contains memory mappings for memory addresses that are used more frequently than the memory addresses in the MMXT. Searching through the MMXT and/or the TLB for a memory mapping may be time consuming resulting in delayed data retrieval.
Memory systems are often arranged with a memory hierarchy. For example, certain memory may be found in registers, cache (e.g., level 1, level 2, level 3), main memory (e.g., RAM), disk storage, and so forth. As may be appreciated, some memory systems include memory types that have different operating characteristics (e.g., operate at differing speeds). However, memory management systems generally do not differentiate between types of memory in the memory system (e.g., main memory). Accordingly, such memory management systems may handle all types of memory in the same manner. Further, some memory devices in the memory systems may be accessed (e.g., read from and/or written to) a greater number of times than other memory devices in the memory systems. As such, it may be difficult for a memory management system to identify (e.g., determine) which memory devices operate at a particular speed within the memory system. Likewise, it may be difficult for a memory management system to identify which memory devices are accessed more than others.
Accordingly, embodiments of the present invention may be directed to one or more of the problems set forth above.
Some of the subsequently discussed embodiments may facilitate memory systems with greater versatility, such as memory systems that use multiple different types of memory devices and memory systems that dynamically rearrange data stored on the different types of memory devices. As is described in detail below, a memory management system may include a table that correlates a physical memory address with a type of memory device. For example, a memory management system may include a table having multiple virtual memory addresses. Each virtual memory address may correspond to a physical memory address and to data that identifies a type of corresponding memory device. The physical memory address may be used to access the memory device when a table hit occurs. As such, the following discussion describes devices and methods in accordance with embodiments of the present technique.
Turning now to the drawings, and referring initially to
Various devices may be coupled to the processor 12 depending on the functions that the system 10 performs. For instance, a user interface may be coupled to the processor 12. The user interface may include buttons, switches, a keyboard, a light pen, a mouse, a display, and/or a voice recognition system, for instance. The display may include a touchscreen display, an LCD display, a CRT, LEDs, and/or an audio display, for example. One or more communication ports may also be coupled to the processor 12. The communication port may be adapted to be coupled to one or more peripheral devices such as a modem, a printer, a computer, or to a network, such as a local area network, remote area network, intranet, or the Internet, for instance.
Because the processor 12 generally controls the functioning of the system 10 by implementing software programs, memory is operably coupled to the processor 12 to store and facilitate execution of various programs. Accordingly, a hierarchical memory system 14 is operably coupled to the processor 12 via a system bus 16. The hierarchical memory system 14 includes a memory management system 18 and any number of memory devices. For example, the hierarchical memory system 14 may include a memory_0 20 (e.g., of a first type), a memory_1 22 (e.g., of a second type), and any additional memory devices represented by memory_N 24 (e.g., of an nth type).
The memory management system 18 may perform a variety of memory management functions. For example, the memory management system 18 may manage virtual memory address to physical memory address translation, memory reallocation, memory organization, memory usage, and so forth. As illustrated, the memory management system 18 is operably coupled to the memory devices 20, 22, and 24 by respective data busses PA_0 26, PA_1 28, and PA_N 30. As will be appreciated, PA_N 30 may represent a number of data busses that correspond to the memory devices memory_N 24.
One or more of the memory devices 20, 22, and 24 may be volatile memory which may include Dynamic Random Access Memory (DRAM), and/or Static Random Access Memory (SRAM). The volatile memory may include a number of memory modules, such as single inline memory modules (SIMMs), dual inline memory modules (DIMMs), and/or Hybrid Memory Cubes (HMCs). As will be appreciated, the volatile memory may simply be referred to as the “system memory.” The volatile memory is typically quite large so that it can store dynamically loaded applications and data.
Further, one or more of the memory devices 20, 22, and 24 may be non-volatile memory which may include read-only memory (ROM), such as an EPROM, flash memory (e.g., NOR and/or NAND), and/or phase-change memory (PCM) to be used in conjunction with the volatile memory. The size of the ROM is typically selected to be large enough to store any necessary operating system, application programs, and fixed data. Additionally, the non-volatile memory may include a high capacity memory such as a tape or disk drive memory. Accordingly, the memory devices 20, 22, and 24 do not need to be block storage devices.
As such, the hierarchical memory system 14 is versatile in allowing many types of memory devices 20, 22, and 24 to be operably coupled to the processor 12. Accordingly, the memory management system 14 may be adapted to the hierarchical memory system 14 to optimize the performance of the memory devices 20, 22, and 24. Some examples of the memory management system 18 adapted for use in the hierarchical memory system 14 are illustrated in
Referring now to
To identify the physical memory address 34 that is mapped to the virtual memory address 32, the memory management system 18 uses an XLAT translation device 38 and a translation lookaside buffer (TLB) 40. The XLAT translation device 38 and the TLB 40 may each store a respective table that maps virtual memory addresses to physical memory addresses. Although the XLAT translation device 38 and the TLB 40 are illustrated separately, in certain embodiments, the XLAT translation device 38 and the TLB 40 may be incorporated within a single device. As will be appreciated, the XLAT translation device 38 and the TLB 40 may contain non-overlapping data. For example, the XLAT translation device 38 may contain table entries for a first portion of the virtual memory addresses, while the TLB 40 contains table entries for a second portion of the virtual memory addresses.
Typically, the TLB 40 contains table entries for virtual memory addresses that are accessed more frequently than the virtual memory addresses stored in the XLAT translation device 38. In certain embodiments, a search for the virtual memory address 32 may occur concurrently in the XLAT translation device 38 and the TLB 40. In other embodiments, a search for the virtual memory address 32 may occur in the TLB 40 before the search occurs in the XLAT translation device 38. However, after a table entry including the virtual memory address 32 is identified (e.g., located), both the XLAT translation device 38 and the TLB 40 stop searching for the virtual memory address 32.
In the present embodiment, the XLAT translation device 38 and the TLB 40 may each store data relating to how frequently a particular virtual memory address and/or physical memory address are accessed. Further, the XLAT translation device 38 and the TLB 40 may each store data that identifies a type of memory device corresponding to the physical memory address. Using this additional data, the memory management system 18 may optimize memory usage and/or optimize table mapping data stored in the XLAT translation device 38 and the TLB 40, as explained in detail below.
Accordingly,
The virtual memory address column 46 includes a listing of all virtual memory addresses contained in the TLB 40. Further, the physical memory address column 48 includes a physical memory address in each row 42 that corresponds to the virtual memory address in the virtual memory address column 46 of the respective row 42. The LRU column 50 includes data that relates to how frequently a respective physical memory address is accessed (e.g., access or usage data). For example, the LRU column 50 may include a value that represents the total number of times its corresponding virtual memory address and/or physical memory address have been accessed. As such, the LRU column 50 may be used to identify whether table entries should be removed from the table 42. For example, rows 44 that have been accessed with the least frequency (e.g., have the lowest value stored in the LRU column 50), may be removed from the table 42.
The TYPE column 52 includes device identification data in each row 42 that identifies a type of device that corresponds to the physical memory address in the physical memory address column 48 of the respective row 42. The device is accessed using the physical memory address (e.g., when a table hit occurs). For example, the device identification data may be a value that corresponds to a type of device. As will be appreciated, the memory management system 18 may include data that corresponds to each device. For example, the memory management system 18 may include data such as a name of each device, an operating speed of each device, a bus assigned to each device, an indication of relative speed of each device in relation to other physical devices, an endurance of each device, and so forth. During operation, the physical address may be used to directly access the memory devices 20, 22, and 24, thereby quickly accessing data stored on the memory devices 20, 22, and 24.
Turning to
The virtual memory address column 60 includes a listing of all virtual memory addresses contained in the XT 54. Further, the physical memory address column 62 includes a physical memory address in each row 58 that corresponds to the virtual memory address in the virtual memory address column 60 of the respective row 58. The LRU column 64 includes data that relates to how frequently a respective physical memory address is accessed (e.g., access or usage data). For example, the LRU column 64 may include a value that represents the total number of times its respective virtual memory address and/or physical memory address have been accessed. As such, the LRU column 64 may be used (e.g., by the control unit 56 of the translation device 38) to identify whether table entries should be moved from the XT 54 to the TLB 40. For example, rows 58 that have been accessed with the highest frequency (e.g., have the highest value stored in the LRU column 64), may be moved from the XT 54 into the TLB 40, at least in some conditions.
The TYPE column 66 includes device identification data in each row 58 that identifies a type of device that corresponds to the physical memory address in the physical memory address column 62 of the respective row 58. The device is accessed using the physical memory address (e.g., when a table hit occurs). For example, the device identification data may be a value that corresponds to a type of device. During operation, the physical memory address may be used to directly access the memory devices 20, 22, and 24, thereby quickly accessing data stored on the memory devices 20, 22, and 24.
The XLAT translation device 38 may be any of a variety of different devices, such as a hybrid memory cube (HMC) or a pattern recognition device, such as that disclosed in U.S. Publication Number 2010/0138575. Furthermore, hardware (e.g., processor) and/or software may be used to execute a search of the XT 54. As will be appreciated, prolonged access to the XT 54 may result in a significant performance penalty, particularly if stored in main memory (e.g., where the translation device 38 itself serves as the main memory, as may be the case if embodied in an HMC device). Accordingly, certain translation devices 38 may include hardware and/or software logic in addition to memory cells. For example, the XT 54 may be stored on a high performance memory array (HPMA) (e.g., HMC) or an assistive search memory device, such as the previously mentioned pattern recognition device. Such devices may be configured to search for virtual memory addresses within the XT 54 (e.g., execute a table walk). It should be noted that the TLB 40 may also be stored on an HPMA or an assistive search memory device. In certain embodiments, the TLB 40 and the XT 54 may be stored on the same device. By using an HPMA or an assistive search memory device, improved performance may be achieved. In certain embodiments, the control unit 56 may be used to perform a variety of functions. For example, the control unit 56 may control page table walks, TLB updates, LRU calculations, LRU updates, direct memory access for page movements, dynamically rearranging data that is assigned to the devices, dynamically change the mapping of virtual memory addresses to physical memory addresses, and so forth.
The control unit 56 may include software and/or hardware to aid functions of the memory management system 18. As such,
If there is an XT “hit,” then, at block 82, the memory management system moves the XT table entry to the TLB 40. Further, at block 82, the memory management system 18 moves the least used TLB 40 entry to the XT 54. Next, at block 84, the memory management system 18 translates the virtual memory address to a physical memory address. This occurs after block 82, or in response to a TLB “hit” occurring per block 74. As will be appreciated, translating the virtual memory address to the physical memory address may include accessing all of the data in the entry that relates to the virtual memory address. For example, the memory management system 18 may retrieve the TYPE column data from the table entry for accessing the memory device. At block 86, the LRU data for the accessed table entry is updated (e.g., modified). For example, the value stored in the LRU column may be increased by one. Next, at block 88, the physical memory address is accessed.
Turning now to
If there is not a mismatch, the method may return to block 92. However, if there is a mismatch between the number of times the physical memory address is accessed and the type of memory device corresponding to the physical memory address, the memory management system 18 may identify whether a memory swap can be performed, per block 100. In certain embodiments, a memory swap may include exchanging a first set of data stored in a first type of memory with a second set of data stored in a second type of memory. For example, the memory management system 18 may move a first set of data stored in a first type of memory to a second type of memory and move a second set of data stored in the second type of memory to the first type of memory. Furthermore, moving the first and second sets of data may happen concurrently. For example, certain types of memory may support data movement that occurs simultaneously in both directions, such as DRAM DIMMs and HMC, and DRAM DIMMs and PCM. If a memory swap cannot be performed, the memory management system 18 may identify whether there is any memory available for moving the mismatched data, per block 102. If there is not any memory available, the method may return to block 100.
If there is memory available, per block 104, the memory management system 18 may move data from the memory of the identified entries to the available memory. For example, the memory management system 18 may cause data that corresponds to the identified table entries to be moved to a different type of memory device to remove the mismatch between the number of times the physical memory address is accessed and the type of memory corresponding to the physical memory address. Returning to block 100, if the memory management system 18 is able to perform a memory swap, the memory management system 18 may swap data between the memory devices, per block 106. After block 104 or block 106, the memory management system 18 updates the TLB 40 and/or XT 54 table entries. For example, the memory management system 18 may update the TLB 40 and/or XT 54 table entries with a revised mapping between a virtual memory address and a physical memory address, revised device data, and/or updated LRU data.
While the blocks 92 thorough 108 are described as being performed by the memory management system 18, it should be noted that any portion of the memory management system 18 (e.g., hardware and/or software) may perform the items described. For example, any of blocks 92 thorough 108 may be performed by the control unit 56. In certain embodiments, the memory management system 18 and/or the control unit 56 may be configured to dynamically change the mapping of virtual memory addresses to physical memory addresses based on an endurance or speed of a memory type. Using the techniques described herein, the memory management system 18 may maximize the performance of the system 10 and/or minimize software overhead.
While the invention may be susceptible to various modifications and alternative forms, specific embodiments have been shown by way of example in the drawings and have been described in detail herein. However, it should be understood that the invention is not intended to be limited to the particular forms disclosed. Rather, the invention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the invention as defined by the following appended claims.
The present application is a Continuation of U.S. application Ser. No. 15/371,044, entitled “MEMORY MANAGEMENT FOR A HIERARCHICAL MEMORY SYSTEM,” and filed Dec. 6, 2016, which is a Divisional of U.S. application Ser. No. 13/552,491, entitled “MEMORY MANAGEMENT FOR A HIERARCHICAL MEMORY SYSTEM,” and filed Jul. 18, 2012, now U.S. Pat. No. 9,524,248 which issued Dec. 20, 2016, the entirety of which is incorporated by reference herein for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
3849762 | Fujimoto et al. | Nov 1974 | A |
3921136 | Bar-Lev | Nov 1975 | A |
4011547 | Kimmel | Mar 1977 | A |
4014000 | Uno et al. | Mar 1977 | A |
4123695 | Hale et al. | Oct 1978 | A |
4153897 | Yasuda et al. | May 1979 | A |
4204193 | Schroeder | May 1980 | A |
4414685 | Sternberg | Nov 1983 | A |
4748674 | Freeman | May 1988 | A |
5014327 | Potter et al. | May 1991 | A |
5028821 | Kaplinsky | Jul 1991 | A |
5216748 | Quenot et al. | Jun 1993 | A |
5257361 | Doi et al. | Oct 1993 | A |
5287523 | Allison et al. | Feb 1994 | A |
5291482 | McHarg et al. | Mar 1994 | A |
5300830 | Hawes | Apr 1994 | A |
5331227 | Hawes | Jul 1994 | A |
5357512 | Khaira et al. | Oct 1994 | A |
5371878 | Coker | Dec 1994 | A |
5377129 | Molvig et al. | Dec 1994 | A |
5459798 | Bailey et al. | Oct 1995 | A |
5615237 | Chang et al. | Mar 1997 | A |
5659551 | Huott et al. | Aug 1997 | A |
5723984 | Sharpe-Geisler | Mar 1998 | A |
5754878 | Asghar et al. | May 1998 | A |
5790531 | Ellebracht et al. | Aug 1998 | A |
5881312 | Dulong | Mar 1999 | A |
5896548 | Ofek | Apr 1999 | A |
5956741 | Jones | Sep 1999 | A |
6011407 | New | Jan 2000 | A |
6016361 | Hongu et al. | Jan 2000 | A |
6034963 | Minami et al. | Mar 2000 | A |
6041405 | Green | Mar 2000 | A |
6052766 | Betker et al. | Apr 2000 | A |
6058469 | Baxter | May 2000 | A |
6151644 | Wu | Nov 2000 | A |
6240003 | McElroy | May 2001 | B1 |
6279128 | Arnold et al. | Aug 2001 | B1 |
6317427 | Augusta et al. | Nov 2001 | B1 |
6362868 | Silverbrook | Mar 2002 | B1 |
6400996 | Hoffberg et al. | Jun 2002 | B1 |
6412057 | Sasahara | Jun 2002 | B1 |
6510508 | Zuraski, Jr. | Jan 2003 | B1 |
6606699 | Pechanek et al. | Aug 2003 | B2 |
6614703 | Pitts et al. | Sep 2003 | B2 |
6625740 | Datar et al. | Sep 2003 | B1 |
6633443 | Watanabe et al. | Oct 2003 | B1 |
6636483 | Pannell | Oct 2003 | B1 |
6640262 | Uppunda et al. | Oct 2003 | B1 |
6697979 | Vorbach et al. | Feb 2004 | B1 |
6700404 | Feng et al. | Mar 2004 | B1 |
6880087 | Carter | Apr 2005 | B1 |
6906938 | Kaginele | Jun 2005 | B2 |
6944710 | Regev et al. | Sep 2005 | B2 |
6977897 | Nelson et al. | Dec 2005 | B1 |
7010639 | Larson et al. | Mar 2006 | B2 |
7089352 | Regev et al. | Aug 2006 | B2 |
7146643 | Dapp et al. | Dec 2006 | B2 |
7176717 | Sunkavalli et al. | Feb 2007 | B2 |
7276934 | Young | Oct 2007 | B1 |
7305047 | Turner | Dec 2007 | B1 |
7358761 | Sunkavalli et al. | Apr 2008 | B1 |
7366352 | Kravec et al. | Apr 2008 | B2 |
7392229 | Harris et al. | Jun 2008 | B2 |
7428722 | Sunkavalli et al. | Sep 2008 | B2 |
7487131 | Harris et al. | Feb 2009 | B2 |
7487542 | Boulanger et al. | Feb 2009 | B2 |
7499464 | Ayrapetian et al. | Mar 2009 | B2 |
7725510 | Alicherry et al. | May 2010 | B2 |
7774286 | Harris | Aug 2010 | B1 |
7804719 | Chirania et al. | Sep 2010 | B1 |
7890923 | Elaasar | Feb 2011 | B2 |
7899052 | Hao et al. | Mar 2011 | B1 |
7913255 | Codrescu | Mar 2011 | B2 |
7917684 | Noyes et al. | Mar 2011 | B2 |
7970964 | Noyes | Jun 2011 | B2 |
8015530 | Sinclair et al. | Sep 2011 | B1 |
8020131 | Van Mau et al. | Sep 2011 | B1 |
8065249 | Harris et al. | Nov 2011 | B1 |
8140780 | Noyes | Mar 2012 | B2 |
8146040 | Janneck et al. | Mar 2012 | B1 |
8159900 | Moore et al. | Apr 2012 | B2 |
8209521 | Noyes et al. | Jun 2012 | B2 |
8239660 | Cervini | Aug 2012 | B2 |
8281395 | Pawlowski | Oct 2012 | B2 |
8294490 | Kaviani | Oct 2012 | B1 |
8402188 | Noyes et al. | Mar 2013 | B2 |
8536896 | Trimberger | Sep 2013 | B1 |
8593175 | Noyes et al. | Nov 2013 | B2 |
8648621 | Noyes et al. | Feb 2014 | B2 |
8680888 | Brown et al. | Mar 2014 | B2 |
8725961 | Noyes | May 2014 | B2 |
8782624 | Brown et al. | Jul 2014 | B2 |
8787060 | Lee | Jul 2014 | B2 |
8938590 | Noyes et al. | Jan 2015 | B2 |
9058465 | Noyes et al. | Jun 2015 | B2 |
9063532 | Brown | Jun 2015 | B2 |
9075428 | Brown | Jul 2015 | B2 |
9118327 | Noyes et al. | Aug 2015 | B2 |
9235798 | Brown et al. | Jan 2016 | B2 |
20020186044 | Agrawal et al. | Dec 2002 | A1 |
20030107996 | Black et al. | Jun 2003 | A1 |
20030142698 | Parhl | Jul 2003 | A1 |
20030163615 | Yu | Aug 2003 | A1 |
20030226002 | Boutaud et al. | Dec 2003 | A1 |
20040100980 | Jacobs et al. | May 2004 | A1 |
20040125807 | Liu et al. | Jul 2004 | A1 |
20040151211 | Snider | Aug 2004 | A1 |
20040184662 | Kravec et al. | Sep 2004 | A1 |
20050154916 | Boulanger et al. | Jul 2005 | A1 |
20050251638 | Boutaud et al. | Nov 2005 | A1 |
20060158219 | Sunkavalli et al. | Jul 2006 | A1 |
20060195496 | Vadi et al. | Aug 2006 | A1 |
20060206875 | Ullmann et al. | Sep 2006 | A1 |
20060257043 | Chiu | Nov 2006 | A1 |
20060274001 | Guttag et al. | Dec 2006 | A1 |
20060288070 | Vadi et al. | Dec 2006 | A1 |
20070005869 | Balraj et al. | Jan 2007 | A1 |
20070075878 | Furodet et al. | Apr 2007 | A1 |
20070127482 | Harris et al. | Jun 2007 | A1 |
20070150623 | Kravec et al. | Jun 2007 | A1 |
20070282833 | McMillen | Dec 2007 | A1 |
20070283108 | Isherwood | Dec 2007 | A1 |
20080109592 | Karamcheti | May 2008 | A1 |
20080126690 | Rajan | May 2008 | A1 |
20080129334 | Sunkavalli et al. | Jun 2008 | A1 |
20080133874 | Capek et al. | Jun 2008 | A1 |
20080140661 | Pandya | Jun 2008 | A1 |
20080178031 | Kim | Jul 2008 | A1 |
20080256347 | Eickemeyer et al. | Oct 2008 | A1 |
20080320053 | Iijima et al. | Dec 2008 | A1 |
20090198952 | Khmeinitsky et al. | Aug 2009 | A1 |
20090204734 | Strait et al. | Aug 2009 | A1 |
20100005269 | Davies et al. | Jan 2010 | A1 |
20100100691 | Noyes et al. | Apr 2010 | A1 |
20100100714 | Noyes et al. | Apr 2010 | A1 |
20100115173 | Noyes | May 2010 | A1 |
20100115347 | Noyes | May 2010 | A1 |
20100118425 | Rafaelof | May 2010 | A1 |
20100138432 | Noyes | Jun 2010 | A1 |
20100138575 | Noyes | Jun 2010 | A1 |
20100138634 | Noyes | Jun 2010 | A1 |
20100138635 | Noyes | Jun 2010 | A1 |
20100145182 | Schmidt et al. | Jun 2010 | A1 |
20100153646 | Chen | Jun 2010 | A1 |
20100169602 | Hulbert | Jul 2010 | A1 |
20100174887 | Pawlowski | Jul 2010 | A1 |
20100174929 | Pawlowski | Jul 2010 | A1 |
20100175130 | Pawlowski | Jul 2010 | A1 |
20100185647 | Noyes | Jul 2010 | A1 |
20100325352 | Schuette et al. | Dec 2010 | A1 |
20100332809 | Noyes et al. | Dec 2010 | A1 |
20110004578 | Momma et al. | Jan 2011 | A1 |
20110119456 | Ipek | May 2011 | A1 |
20110145182 | Dlugosch | Jun 2011 | A1 |
20110145271 | Noyes et al. | Jun 2011 | A1 |
20110145544 | Noyes et al. | Jun 2011 | A1 |
20110161620 | Kaminski et al. | Jun 2011 | A1 |
20110208900 | Schuette et al. | Aug 2011 | A1 |
20110258360 | Noyes | Oct 2011 | A1 |
20110289257 | Hathaway | Nov 2011 | A1 |
20110307233 | Tseng et al. | Dec 2011 | A1 |
20110307433 | Dlugosch | Dec 2011 | A1 |
20110307503 | Dlugosch | Dec 2011 | A1 |
20110320759 | Craddock et al. | Dec 2011 | A1 |
20120002330 | Matsuzawa et al. | Jan 2012 | A1 |
20120106228 | Lee | May 2012 | A1 |
20120179854 | Noyes | Jul 2012 | A1 |
20120192163 | Glendenning et al. | Jul 2012 | A1 |
20120192164 | Xu et al. | Jul 2012 | A1 |
20120192165 | Xu et al. | Jul 2012 | A1 |
20120192166 | Xu et al. | Jul 2012 | A1 |
20130154685 | Noyes | Jun 2013 | A1 |
20130156043 | Brown et al. | Jun 2013 | A1 |
20130159239 | Brown et al. | Jun 2013 | A1 |
20130159670 | Noyes | Jun 2013 | A1 |
20130159671 | Brown et al. | Jun 2013 | A1 |
20130275709 | Gajapathy | Oct 2013 | A1 |
20140025614 | Noyes et al. | Jan 2014 | A1 |
20140025923 | Klein | Jan 2014 | A1 |
20140067736 | Noyes | Mar 2014 | A1 |
20140204956 | Brown et al. | Jul 2014 | A1 |
20140225889 | Kim et al. | Aug 2014 | A1 |
20140279776 | Brown et al. | Sep 2014 | A1 |
20140325494 | Brown et al. | Oct 2014 | A1 |
20160342339 | Leidel | Nov 2016 | A1 |
Number | Date | Country |
---|---|---|
0476159 | Mar 1992 | EP |
0943995 | Sep 1999 | EP |
2007304747 | Nov 2007 | JO |
S63244152 | Oct 1988 | JP |
H05233452 | Sep 1993 | JP |
08087462 | Apr 1996 | JP |
10069459 | Mar 1998 | JP |
10111862 | Apr 1998 | JP |
2000231549 | Aug 2000 | JP |
2000347708 | Dec 2000 | JP |
2004157686 | Jun 2004 | JP |
2008090554 | Apr 2008 | JP |
1020080097573 | Nov 2008 | KR |
201107974 | Mar 2011 | TW |
WO00065425 | Nov 2000 | WO |
WO0138978 | May 2001 | WO |
WO03039001 | May 2003 | WO |
WO2005036750 | Apr 2005 | WO |
2009048707 | Apr 2009 | WO |
WO2011114120 | Sep 2011 | WO |
Entry |
---|
Beesley, K. R.; Arabic Morphology Using Only Finite-State Operations; Xerox Research Centre Europe; pp. 50-57; 1998. |
Bird, S. et al.; One-Level Phonology: Autosegmental Representations and Rules as Finite Automata; Association for Computational Linguistics; University of Edinburgh; vol. 20; No. 1; pp. 55-90; 1994. |
Bispo, J. et al.; Regular Expression Matching for Reconfigurable Packet Inspection; IEEE International Conference on Field Programmable Technology; 2006. |
Bispo, J. et al.; Synthesis of Regular Expressions Targeting FPGAs: Current Status and Open Issues; IST/INESC-ID, Libson, Portugal; pp. 1-12; 2007. |
Brodie, B. et al.; A scalable Architecture for High-Throughput Regular-Expression Pattern Matching; Exegy Inc.; pp. 1-12; 2006. |
Clark, C.; Design of Efficient FPGA Circuits for Matching Complex Patterns in Network Intrusion Detection Systems (Master of Science Thesis); Georgia Institute of Technology; pp. 1-56; Dec. 2003. |
Clark, C.; A Unified Model of Pattern-Matching Circuits for Field-Programmable Gate Arrays [Doctoral Dissertation]; Georgia Institute of Technology; pp. 1-177; 2006. |
Clark, C. et al.; Scalable Pattern Matching for High Speed Networks; Proceedings of the 12th Annual IEEE symposium on Field-Programmable Custom Computing Machines (FCCM'04);Georgia Institute of Technology; pp. 1-9; 2004. |
Clark, C. et al.; A Unified Model of Pattern-Matching Circuit Architectures; Tech Report GIT-CERCS-05-20;Georgia Institute of Technology; pp. 1-17; 2005. |
Fide, S.; String Processing in Hardware; Scalable Parallel and Distributed Systems Lab; Proceedings of the 12th Annual IEEE symposium on Field-Programmable Custom Computing Machines (FCCM'04); School of Electrical and Computer Engineering; Georgia Institute of Technology; pp. 1-9; 2004. |
Fisk, M. et al.; Applying Fast String Matching to Intrusion Detection; Los Alamos National Laboratory; University of California San Diego; pp. 1-21; 2002. |
Korenek, J.; Traffic Scanner-Hardware Accelerated Intrusion Detection System; http://www.liberouter.org/ ; 2006. |
Kumar, S. et al.; Curing Regular Expressions matching Algorithms from Insomnia, Amnesia, and Acaluia; Department of Computer Science and Engineering; Washington University in St. Louis; pp. 1-17; Apr. 27, 2007. |
Lipovski, G.; Dynamic Systolic Associative Memory Chip; IEEE; Department of Electrical and Computer Engineering; University of Texas at Austin; pp. 481-492; 1990. |
Lin, C. et al.; Optimization of Pattern Matching Circuits for Regular Expression on FPGA; IEEE Transactions on Very Large Scale Integrations Systems; vol. 15, No. 12, pp. 1-6; Dec. 2007. |
Schultz, K. et al.; Fully Parallel Integrated CAM/RAM Using Preclassification to Enable Large.Capacities; IEEE Journal on Solid-State Circuits; vol. 31; No. 5; pp. 689-699; May 1996. |
Shafai, F. et al.; Fully Parallel 30-MHz, 2.5-Mb CAM; IEEE Journal of Solid-State Circuits, vol. 33; No. 11; pp. 1690-1696; Nov. 1998. |
Sidhu, R. et al.; Fast Regular Expression Pattern Matching using FPGAs; Department of EE-Systems; University of Southern California; pp. 1-12; 2001. |
Wada, T.; Multiobject Behavior Recognition Event Driven Selective Attention Method; IEEE; pp. 1-16; 2000. |
Yu, F.; High Speed Deep Packet Inspection with Hardware Support; Electrical Engineering and Computer Sciences; University of California at Berkeley; pp. 1-217; Nov. 22, 2006. |
Freescale and Kaspersky ® Accelerated Antivirus Solution Platform for OEM Vendors; Freescale Semiconductors Document; pp. 1-16; 2007. |
PCT/US2009/067534 International Search Report and Written Opinion dated Apr. 23, 2010. |
PCT/US2009/061649 International Search Report dated Feb. 15, 2010. |
Taiwan Application No. 098144804 Office Action dated Nov. 4, 2013. |
PCT/US2012/067992 International Search Report dated Mar. 28, 2013. |
PCT/US2012/068011 International Search Report dated Apr. 15, 2013. |
PCT/US2012/067999 International Search Report dated May 14, 2013. |
PCT/US2012/067995 International Search Report dated May 17, 2013. |
PCT/US2012/067988 International Search Report (Partial) dated Jun. 24, 2014. |
PCT/US2013/049744 International Search Report and Written Opinion dated Oct. 22, 2013. |
PCT/US2013/049748 International Search Report and Written Opinion dated Oct. 22, 2013. |
PCT/US2013/049755 International Search Report and Written Opinion dated Oct. 24, 2013. |
PCT/US2013/049753 International Search Report and Written Opinion dated Nove. 7, 2013. |
PCT/US2013/055434 International Search Report and Written Opinion dated Nov. 29, 2013. |
PCT/US2013/055438 International Search Report and Written Opinion dated Nov. 29, 2013. |
PCT/US2013/055436 International Search Report and Written Opinion dated Dec. 9, 2013. |
PCT/US2014/023589 International Search Report and Written Opinion dated Jul. 24, 2014. |
Soewito et al., “Self-Addressable Memory-Based FSM: A scalable Intrusion Detection Engine”, IEEE Network, pp. 14-21; Feb. 2009. |
Hurson A. R.; A VLSI Design for the Parallel Finite State Automation and Its Performance Evaluation as a Hardware Scanner; International Journal of Computer and Information Sciences, vol. 13, No. 6; 1984. |
Carpenter et al., “A Massively Parallel Architecture for a Self-Organizing Neural Pattern Recognition Machine”, Academic Press, Inc.; 1987. |
Cong et al., “Application-Specific Instruction Generation for Configurable Processor Architectures”, Computer Science Department, University of California, ACM; 2004. |
Glette et al., “An Online EHW Pattern Recognition System Applied to Face Image Recognition”, University of Oslo, Norway; 2007. |
Kawai et al., “An Adaptive Pattern Recognition Hardware with On-chip Shift Register-based Partial Reconfiguration”, IEEE; 2008. |
Kutrib et al., “Massively Parallel Pattern Recognition with Link Features”, IFIG Research Report 0003; 2000. |
Marculescu et al., Power Management of Multi-Core Systems: Challenges, Approaches, and Recent Developments Tutorial at ASPLOS, London, UK [online]; Mar. 4, 2012. |
Vitanen et al.; Image Pattern Recognition Using Configurable Logic Cell Array; New Advances in Computer Graphics; pp. 355-368; 1989. |
Yasunaga et al., “Kernel-based Pattern Recognition Hardware: Its Design Methodology Using Evolved Truth Tables”, IEEE, 2000. |
Taiwan Application No. 102125808 Office Action dated May 22, 2015. |
Chinese Application No. 201380038489.5 Office Action dated Jan. 10, 2017. |
U.S. Appl. No. 60/652,738, filed Feb. 12, 2005, Harris. |
U.S. Appl. No. 61/788,364, filed Mar. 15, 2013, Brown et al. |
Korean Office Action for KR Application No. 10-2015-7001783 dated Jul. 19, 2019, 21 pgs. |
Korean Office Action for Application No. 10-2015-7001783 dated Jan. 30, 2020, with English translation, 14 pages. |
Number | Date | Country | |
---|---|---|---|
20180357177 A1 | Dec 2018 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13552491 | Jul 2012 | US |
Child | 15371044 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15371044 | Dec 2016 | US |
Child | 16107662 | US |