EP3262518A1 - Using a memory controller to manage access to a memory based on a memory initialization state indicator - Google Patents

Using a memory controller to manage access to a memory based on a memory initialization state indicator

Info

Publication number
EP3262518A1
EP3262518A1 EP15905600.1A EP15905600A EP3262518A1 EP 3262518 A1 EP3262518 A1 EP 3262518A1 EP 15905600 A EP15905600 A EP 15905600A EP 3262518 A1 EP3262518 A1 EP 3262518A1
Authority
EP
European Patent Office
Prior art keywords
memory
request
data
page
controller
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
EP15905600.1A
Other languages
German (de)
French (fr)
Other versions
EP3262518A4 (en
Inventor
Amro J. AWAD
Pratyusa K. Manadhata
William G. Horne
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hewlett Packard Enterprise Development LP
Original Assignee
Hewlett Packard Enterprise Development LP
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hewlett Packard Enterprise Development LP filed Critical Hewlett Packard Enterprise Development LP
Publication of EP3262518A1 publication Critical patent/EP3262518A1/en
Publication of EP3262518A4 publication Critical patent/EP3262518A4/en
Ceased legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0629Configuration or reconfiguration of storage systems
    • G06F3/0632Configuration or reconfiguration of storage systems by initialisation or re-initialisation of storage systems
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/0223User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023Free address space management
    • G06F12/0238Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
    • G06F12/0246Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/14Handling requests for interconnection or transfer
    • G06F13/16Handling requests for interconnection or transfer for access to memory bus
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/14Handling requests for interconnection or transfer
    • G06F13/16Handling requests for interconnection or transfer for access to memory bus
    • G06F13/1668Details of memory controller
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/061Improving I/O performance
    • G06F3/0611Improving I/O performance in relation to response time
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0646Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G06F3/0652Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0655Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
    • G06F3/0659Command handling arrangements, e.g. command buffers, queues, command scheduling
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0673Single storage device
    • G06F3/0679Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/10Providing a specific technical effect
    • G06F2212/1016Performance improvement
    • G06F2212/1024Latency reduction
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/72Details relating to flash memory management
    • G06F2212/7201Logical to physical mapping or translation of blocks or pages
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/72Details relating to flash memory management
    • G06F2212/7203Temporary buffering, e.g. using volatile buffer or dedicated buffer blocks

Definitions

  • DRAM Dynamic Random Access Memory
  • NVM non-volatile memory
  • Fig 1 is a schematic diagram of a physical machine according to an example implementation.
  • Fig. 2A illustrates a scenario in which a memory controller of the physical machine Fig. 1 receives a zero page request and updates a Zero Tracking Table (ZTT) according to an example implementation.
  • ZTT Zero Tracking Table
  • Fig. 2B illustrates a scenario in which a memory controller responds to a read request for data corresponding to a cache line region that is zeroed according to an example implementation.
  • Fig. 2C illustrates a scenario in which a memory controller responds to a read request for data corresponding to a cache line region that is not zeroed according to an example implementation.
  • Fig. 2D illustrates a scenario in which a memory controller responds to a write request according to an example implementation.
  • FIGs. 3 and 4 are flow diagrams depicting techniques to use a memory controller to manage access to a region of memory based on a memory initialization state indicator according to example implementations.
  • Fig. 5A illustrates an organization of the ZTT according to an example implementation.
  • Fig. 5B illustrates the organization of a page entry of the ZTT according to an example implementation.
  • a computer system may employ measures to protect data associated with applications executing on the system from being exposed to internal or external adversaries.
  • One approach to protect data from one application from being visible to another application includes clearing, or "zeroing," units of memory (pages of memory, for example) before the units are allocated to a new application. In this manner, the computer system may zero a given memory unit by writing zeros to all of the addressable locations of the unit. Due to the zeroing, the newly-allocated units of memory do not contain data traces left behind by other applications to which the units were previously allocated. .
  • NVMs Non-Volatile Memories
  • NVMs include flash memories, memristors, phase change memories, ferroelectric random access memories (F- RAMs) and magnetoresistive random access memories (MRAMs), to name a few.
  • F- RAMs ferroelectric random access memories
  • MRAMs magnetoresistive random access memories
  • an NVM may have advantages over a volatile memory. For example, the NVM may be more scalable, as compared to a volatile memory, thereby providing a higher storage density. Other advantages may be that NVM cells are not refreshed (thereby not consuming refresh power); the NVM does not lose its content upon power loss; and the NVM allows for the potential of persistent data.
  • a potential challenge, however, with using zeroing to protect application data in an NVM-based computer system is that the NVM may have a relatively large write latency (i.e., an NVM device may take a relatively longer time to store data, as compared to a volatile memory device). Therefore, for example, zeroing an NVM page may consume more time than zeroing a page of volatile memory.
  • Another potential challenge in zeroing NVM is that an NVM cell may be written a finite number of times before the cell is no longer usable. Therefore, the above-described zeroing approach may potentially impact the lifetime of the NVM.
  • Example implementations are disclosed herein in which a region of memory, such as a page, may be effectively zeroed without actually writing zeros to the memory.
  • a computer system includes a memory controller that manages access to a memory of the system based on initialization state indicators that are stored in a table of the memory controller.
  • the memory controller may effectively initialize a region of the memory by updating the corresponding indicator(s) in the local table, instead of by, for example, writing zeros to the region.
  • the memory controller maintains and uses a Zero Tracking Table (ZTT) for purposes of tracking regions of the memory that are zeroed.
  • ZTT Zero Tracking Table
  • the computer system may use the ZTT to track and manage the zeroed status of regions of the memory, which correspond to cache line-aligned memory boundaries (called "cache line regions" herein).
  • the memory controller may also use the ZTT to zero out a page of memory (containing multiple cache line regions), without actually writing zeros or any other data to the memory. In this manner, instead of accessing the memory to zero out a page, the memory controller updates the ZTT so that the ZTT stores data that represents that the cache lines of the page have been zeroed.
  • the memory controller when a requestor submits a read request to read data from a cache line region, which the ZTT indicates is zeroed, the memory controller furnishes a cache line-sized block of zeros to the requestor, without actually accessing the memory.
  • the memory controller updates the ZTT so that the ZTT stores data that represents that the cache line region is no longer zeroed. It is noted that the written cache line might have the value of zero, but, in accordance with example implementations, the cache line is still marked in the ZTT table as being no longer zero.
  • Fig. 1 depicts a physical machine 100, in accordance with some implementations.
  • the physical machine 100 is an actual machine, which includes actual hardware 1 10 and actual machine executable instructions 150, or "software.”
  • the physical machine 100 may include such hardware 1 10 as one or multiple processors 1 12 (one or multiple Central Processing Unit (CPU) cores, for example); a memory 120; and a memory controller 130.
  • the memory 120 may be an NVM, although the memory 120 may be a volatile memory, in accordance with further example implementations.
  • the machine executable instructions 150 includes instructions that when executed by one or multiple processors 1 12 form an operating system 152, one or multiple device drivers 154, one or multiple applications, 156, and so forth.
  • the memory 120 contains regions referred to as "pages 123" herein.
  • the page 123 represents memory locations in the memory 120, which are part of a corresponding virtual memory page, which is the smallest unit of virtual memory that is tracked by a physical-to-virtual address mapping page table of the physical machine 100.
  • each page 123 contains cache line regions 123.
  • a cache line region 123 corresponds to a set of contiguous physical memory addresses that are aligned with a cache line boundary. It is noted that although the physical memory addresses of the cache line region 123 are contiguous, the cache line regions 123 for a given page 123 may be stored in multiple, non-contiguous physical addresses of the memory 120.
  • the memory controller 130 controls the flow of data into and out of the memory 120 in response to requests 140 (read requests, write requests, zero page requests, and so forth) that are provided by requestors of the physical machine 100.
  • a requestor may be a processor 1 12 that executes instructions associated with the operating system 152 to cause the processor 1 12 to submit a read, write or zero request 140.
  • a requestor may also be an entity other than a processor 1 12, such as a direct memory access (DMA) controller, a graphics controller, and so forth.
  • DMA direct memory access
  • the memory controller 130 may receive the requests 140 through signaling that occurs over one or multiple communication links of the physical machine 100, such as a communication link to one or multiple processors, a
  • PCI Peripheral Component Interconnect
  • the memory controller 130 may communicate responses 142 to the requests 140 over the same communication links.
  • the memory controller 130 For a request 140 that involves writing data in or reading data from the memory 120, the memory controller 130 provides signals to a memory bus 144 that is coupled to the memory 120.
  • the memory controller 130 For example, to write data to the memory 120, the memory controller 130 provides control signals that identify the bus operation as being a write operation, address signals that represent an address of the memory 120 in which the data is to be stored and data signals that represent the data.
  • the memory 120 responds by storing the data in the memory cells associated with the address.
  • the memory controller 130 To read data from the memory 120, the memory controller 130 provides control signals to the memory bus 144, such as signals that identify the bus operation as being a read operation and address signals that represent a physical address of the memory 120 from which the data is to retrieved.
  • the memory 120 responds by providing data signals to the memory bus 144, which represent the data stored in the memory cells associated with the address.
  • the memory controller 130 may be part of an IC contains a bridge (a north bridge, for example) that is separate from the processors 120.
  • a bridge a north bridge, for example
  • the memory controller 130 may be part of a CPU semiconductor package that contains one or multiple processors 1 12.
  • the memory controller 130 has access to a local memory 135 that stores a Zero Tracking Table (ZTT) 134, which stores data that represents which cache line regions 123 and which pages 122 of the memory 120 are to be treated as being zeroed.
  • ZTT Zero Tracking Table
  • the local memory 135 may be a volatile memory or a non-volatile memory; and in accordance with some implementations, the local memory 135 may be part of an IC that also contains the memory controller 130.
  • FIG. 2A depicts an example scenario 200 in which the memory controller 130 responds to a zero page request 140-1 without actually writing any zeros or other data to the memory 120.
  • a requestor may generate the zero page request 140-1 for purposes of zeroing out, (i.e., zero filling or writing all zeros) a page 122-1 of the memory 120.
  • one or multiple processors 1 12 may execute machine executable instructions that cause a user level process to pass a virtual address to a kernel of the operating system 152 using a system call; and in response to the system call, the operating system kernel may write the physical address of the page to be zeroed to a memory-mapped input/output (I/O) register 131 of the memory controller 130.
  • I/O input/output
  • the zero page request 140-1 may be generated by a requestor other than a requestor associated with a processor 1 12, and the zero page request 140-1 may be generated by executing instructions other than instructions associated with an operating system, in accordance with further example implementations.
  • the memory controller 130 updates the ZTT 134, as indicated at reference numeral 210 in Fig. 2A.
  • the update modifies an entry 500 of the ZTT 134, which serves as an indicator to indicate whether the page 122-1 is to be treated as being zeroed. Therefore, for example scenario 200, the memory controller 130 updates the ZTT 134 so that the entry 500 that corresponds to the page 122-1 is modified to represent that the page 122-1 has been zeroed. It is noted that in processing the zero page request 140-1 , the memory controller 130 does not actually access the memory 120 to write zeros or any other data to the memory 120.
  • the memory controller 130 For a subsequent read request that targets a cache line region 123 of the zeroed page 122-1 , the memory controller 130 selectively accesses the memory 120, based on whether the ZTT 134 indicates whether the cache line region 123 has been written after being zeroed. In this manner, in accordance with example implementations, the memory controller 130 updates the ZTT 134 when a write occurs to a zeroed cache line region 123 for purposes of changing the corresponding indicator of the ZTT 134 to reflect that the region 123 should no longer be treated as being zeroed (although the write may be a write of all zeroes to the cache line region 123).
  • Fig. 2B depicts an example scenario 220 in which the memory controller 130 responds to a read request 140-2 that is directed to a cache line 123-1 of the page 122-1 , which remains zeroed after the zeroing of the page 122-1 ; and Fig. 2C depicts an example scenario 240 in which the memory controller 130 responds to a read request 140-3 that is directed to the cache line region 123-1 , which has been written after the zeroing of the page 122-1 .
  • the processor 1 12 for scenario 220 submits the read request 140-2 that targets the cache line region 123-1 , and the memory controller 130 checks 226 the ZTT 134 to determine whether the ZTT 134 stores data that represents whether the cache line region 123-1 is zeroed. Because for scenario 220, the cache line region 123-1 has not been written (as represented by ZTT 134), the memory controller 134 does not request the data from the memory 120. Rather, the memory controller 130 responds, as indicated at reference numeral 142-1 , by providing a zero block of data, which corresponds to a cache line of zeros, to the requestor (here, the processor 1 12).
  • the memory controller 130 first identifies the non-zeroed status of the cache line 123-1 from the ZTT 134, as depicted at reference numeral 246. The memory controller 130 then generates a read request 248 to the memory 120 to read the data for the cache line region 123-1 from the memory 120. In this manner, the memory controller 130 may, for example, provide signals to the memory bus 144 (Fig. 1 ) for purposes of causing the memory 120 to furnish data 250 corresponding to the region 123-1 to the memory controller 130. The memory controller 130 then provides the data 250 read from the memory 120 to the requestor (here, the processor 1 12), as depicted at reference numeral 142-2.
  • the requestor here, the processor 1 12
  • Fig. 2D depicts an example scenario 260 in which a write occurs to the cache line region 123-1 of a page 122-1 that has been zeroed.
  • the memory controller 130 updates 268 the ZTT 134 (assuming that the write is the first write to the cache line region 123-1 after being zeroed) so that the ZTT 134 stores data that represents that the cache line region 123-1 no longer contains zero data.
  • the memory controller 130 then provides a write request 270 to the memory 120 for purposes of writing the new data to the cache line region 123-1 .
  • a page may be initialized before being allocated to an application with a predetermined data pattern other than a pattern of all zeros (a pattern of all ones, a certain predetermined pattern of ones and zeros, and so forth).
  • the memory controller may initialize regions of the memory other than pages (units of multiple pages, for example).
  • the memory controller may track regions of the memory other than cache line boundary-aligned regions.
  • a technique 300 generally includes receiving (block 304), in a memory controller, a request to read data that is stored in a region of memory; and using a memory controller to manage access to the memory based at least in part an initialization state indicator for the memory region.
  • Using the memory controller to manage the memory access includes determining (block 308) whether the region of memory is associated with the initialization state based on the indicator and based at least in part on the determination, selectively bypassing accessing the memory and using the memory controller to provide data having a predetermined data pattern, as depicted in block 312.
  • the memory controller 130 may perform a technique 400, which includes receiving (block 404) a request to access a given location of a memory.
  • the technique 400 includes, in response to the request, selectively providing (block 408) signals to a memory bus to access the memory, based at least in part on data stored in a tracking table, which represents locations of the memory associated with a predetermined data pattern.
  • the ZTT 134 includes N entries 500 (entries 500-1 , 500-2...500-N, via depicted as examples in Fig. 5A), which correspond to N pages 122 of the memory 120.
  • Each entry 500 in turn, in accordance with example implementations, contains data representing the initialized status (zeroed status, for example) of a corresponding page 122 of the memory 120. In this manner, in accordance with example implementations, each entry 500 may be associated with a particular page address.
  • Fig. 5B in conjunction with Fig.
  • each entry 500 may include a set of cache line bit indicators 510 (P cache line bit indicators 510-1 , 510-2....510-P, being depicted as examples in Fig. 5B), where each cache line bit indicator 510 may be as a bit that represents the zeroed status of an associated cache line region 123 of the page 122. For example, a logic zero for the bit may represent a zeroed status for an associated cache line region 123, and a logic one for the bit may represent that the cache line region 123 is not zeroed.
  • the memory controller 133 may update the corresponding entry 500 of the ZTT 134 to clear all of the cache line bit indicators 510 to represent that all of the cache line regions 123 of the page 122 have been zeroed.
  • the memory controller 130 may, in accordance with example
  • the page entry 500 serve as an indicator to indicate or represent whether an associated page is zeroed or not; and the bit indicator 510 serves as an indicator to indicate or represent whether an associated cache line region is zeroed or not.
  • the ZTT 134 may have a different format and may contain data arranged in a different fashion than that depicted in Figs. 5A and 5B, in accordance with further implementations.
  • the memory controller 130 invalidates zeroed cache line memory regions. For example, in accordance with some implementations, a zero page request may be followed with the execution of PCOMMIT and SFENCE instructions. It is assumed for this approach that the address range of the register 131 (Fig. 1 ) is declared as persistent, and the memory controller 130 marks the zero page request write as being flushed when all of the invalidations have been posted. In accordance with further example
  • the memory controller 130 may loop to continuously read the register 131 until the register 131 returns the value of zero. The memory controller 130 may then set the value stored in the register 1 31 to zero after sending out all of the invalidations. Such a waiting loop does not generate any traffic on the memory bus 144.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Memory System Of A Hierarchy Structure (AREA)

Abstract

A technique includes receiving, in a memory controller, a request to read data that is stored in the region of memory. The technique includes using the memory controller to manage access to the memory based on an initialization state indicator for the region of memory. Managing the access includes determining whether the region of memory is associated with the initialized state based on the indicator; and based at least in part on the determination, selectively bypassing accessing the memory and using the memory controller to provide data having a provide a predetermined data pattern.

Description

USING A MEMORY CONTROLLER TO MANAGE ACCESS TO A
MEMORY BASED ON A MEMORY INITIALIZATION STATE INDICATOR
Background
[0001 ] For purposes of analyzing relatively large data sets (often called "big data"), computer systems have ever-increasingly large main memories. One type of memory is a volatile memory, such as a Dynamic Random Access Memory (DRAM). A volatile memory loses its content in the event of a power loss. Moreover, the memory cells of certain volatile memories, such as the DRAM, are frequently refreshed to avoid data loss. Another type of memory is a non-volatile memory (NVM), which retains its data in the event of a power loss. The memory cells of an NVM retain their stored data without being refreshed.
Brief Description of the Drawings
[0002] Fig 1 is a schematic diagram of a physical machine according to an example implementation.
[0003] Fig. 2A illustrates a scenario in which a memory controller of the physical machine Fig. 1 receives a zero page request and updates a Zero Tracking Table (ZTT) according to an example implementation.
[0004] Fig. 2B illustrates a scenario in which a memory controller responds to a read request for data corresponding to a cache line region that is zeroed according to an example implementation.
[0005] Fig. 2C illustrates a scenario in which a memory controller responds to a read request for data corresponding to a cache line region that is not zeroed according to an example implementation.
[0006] Fig. 2D illustrates a scenario in which a memory controller responds to a write request according to an example implementation.
[0007] Figs. 3 and 4 are flow diagrams depicting techniques to use a memory controller to manage access to a region of memory based on a memory initialization state indicator according to example implementations.
[0008] Fig. 5A illustrates an organization of the ZTT according to an example implementation.
[0009] Fig. 5B illustrates the organization of a page entry of the ZTT according to an example implementation.
Detailed Description
[0010] A computer system may employ measures to protect data associated with applications executing on the system from being exposed to internal or external adversaries. One approach to protect data from one application from being visible to another application includes clearing, or "zeroing," units of memory (pages of memory, for example) before the units are allocated to a new application. In this manner, the computer system may zero a given memory unit by writing zeros to all of the addressable locations of the unit. Due to the zeroing, the newly-allocated units of memory do not contain data traces left behind by other applications to which the units were previously allocated. .
[001 1 ] Non-Volatile Memories (NVMs) are ever-increasingly being used as replacements for volatile memories. As examples, NVMs include flash memories, memristors, phase change memories, ferroelectric random access memories (F- RAMs) and magnetoresistive random access memories (MRAMs), to name a few. In general, an NVM may have advantages over a volatile memory. For example, the NVM may be more scalable, as compared to a volatile memory, thereby providing a higher storage density. Other advantages may be that NVM cells are not refreshed (thereby not consuming refresh power); the NVM does not lose its content upon power loss; and the NVM allows for the potential of persistent data.
[0012] A potential challenge, however, with using zeroing to protect application data in an NVM-based computer system is that the NVM may have a relatively large write latency (i.e., an NVM device may take a relatively longer time to store data, as compared to a volatile memory device). Therefore, for example, zeroing an NVM page may consume more time than zeroing a page of volatile memory. Another potential challenge in zeroing NVM is that an NVM cell may be written a finite number of times before the cell is no longer usable. Therefore, the above-described zeroing approach may potentially impact the lifetime of the NVM.
[0013] Example implementations are disclosed herein in which a region of memory, such as a page, may be effectively zeroed without actually writing zeros to the memory. More specifically, in accordance with example implementations, a computer system includes a memory controller that manages access to a memory of the system based on initialization state indicators that are stored in a table of the memory controller. Using this approach, the memory controller may effectively initialize a region of the memory by updating the corresponding indicator(s) in the local table, instead of by, for example, writing zeros to the region.
[0014] More specifically, in accordance with example implementations, the memory controller maintains and uses a Zero Tracking Table (ZTT) for purposes of tracking regions of the memory that are zeroed. In accordance with example
implementations, the computer system may use the ZTT to track and manage the zeroed status of regions of the memory, which correspond to cache line-aligned memory boundaries (called "cache line regions" herein). As described herein, the memory controller may also use the ZTT to zero out a page of memory (containing multiple cache line regions), without actually writing zeros or any other data to the memory. In this manner, instead of accessing the memory to zero out a page, the memory controller updates the ZTT so that the ZTT stores data that represents that the cache lines of the page have been zeroed.
[0015] Moreover, in accordance with example implementations, when a requestor submits a read request to read data from a cache line region, which the ZTT indicates is zeroed, the memory controller furnishes a cache line-sized block of zeros to the requestor, without actually accessing the memory. When a requestor writes to a zeroed cache line, the memory controller updates the ZTT so that the ZTT stores data that represents that the cache line region is no longer zeroed. It is noted that the written cache line might have the value of zero, but, in accordance with example implementations, the cache line is still marked in the ZTT table as being no longer zero.
[0016] As a more specific example, Fig. 1 depicts a physical machine 100, in accordance with some implementations. The physical machine 100 is an actual machine, which includes actual hardware 1 10 and actual machine executable instructions 150, or "software." The physical machine 100 may include such hardware 1 10 as one or multiple processors 1 12 (one or multiple Central Processing Unit (CPU) cores, for example); a memory 120; and a memory controller 130. In accordance with example implementations, the memory 120 may be an NVM, although the memory 120 may be a volatile memory, in accordance with further example implementations. In accordance with example implementations, the machine executable instructions 150 includes instructions that when executed by one or multiple processors 1 12 form an operating system 152, one or multiple device drivers 154, one or multiple applications, 156, and so forth.
[0017] As depicted in Fig. 1 , the memory 120 contains regions referred to as "pages 123" herein. In accordance with example implementations, the page 123 represents memory locations in the memory 120, which are part of a corresponding virtual memory page, which is the smallest unit of virtual memory that is tracked by a physical-to-virtual address mapping page table of the physical machine 100.
Moreover, in accordance with example implementations, each page 123 contains cache line regions 123. A cache line region 123 corresponds to a set of contiguous physical memory addresses that are aligned with a cache line boundary. It is noted that although the physical memory addresses of the cache line region 123 are contiguous, the cache line regions 123 for a given page 123 may be stored in multiple, non-contiguous physical addresses of the memory 120.
[0018] The memory controller 130 controls the flow of data into and out of the memory 120 in response to requests 140 (read requests, write requests, zero page requests, and so forth) that are provided by requestors of the physical machine 100. As an example, a requestor may be a processor 1 12 that executes instructions associated with the operating system 152 to cause the processor 1 12 to submit a read, write or zero request 140. A requestor may also be an entity other than a processor 1 12, such as a direct memory access (DMA) controller, a graphics controller, and so forth.
[0019] In general, the memory controller 130 may receive the requests 140 through signaling that occurs over one or multiple communication links of the physical machine 100, such as a communication link to one or multiple processors, a
Peripheral Component Interconnect (PCI)-Express bus, a Direct Media Interface, and so forth. The memory controller 130 may communicate responses 142 to the requests 140 over the same communication links. [0020] For a request 140 that involves writing data in or reading data from the memory 120, the memory controller 130 provides signals to a memory bus 144 that is coupled to the memory 120. For example, to write data to the memory 120, the memory controller 130 provides control signals that identify the bus operation as being a write operation, address signals that represent an address of the memory 120 in which the data is to be stored and data signals that represent the data. The memory 120 responds by storing the data in the memory cells associated with the address.
[0021 ] To read data from the memory 120, the memory controller 130 provides control signals to the memory bus 144, such as signals that identify the bus operation as being a read operation and address signals that represent a physical address of the memory 120 from which the data is to retrieved. The memory 120 responds by providing data signals to the memory bus 144, which represent the data stored in the memory cells associated with the address.
[0022] In accordance with example implementations, the memory controller 130 may be an integrated circuit (IC). Moreover, in accordance with example
implementations, the memory controller 130 may be part of an IC contains a bridge (a north bridge, for example) that is separate from the processors 120. In
accordance with further example implementations, the memory controller 130 may be part of a CPU semiconductor package that contains one or multiple processors 1 12.
[0023] In accordance with some implementations, the memory controller 130 has access to a local memory 135 that stores a Zero Tracking Table (ZTT) 134, which stores data that represents which cache line regions 123 and which pages 122 of the memory 120 are to be treated as being zeroed. Depending on the particular implementation, the local memory 135 may be a volatile memory or a non-volatile memory; and in accordance with some implementations, the local memory 135 may be part of an IC that also contains the memory controller 130.
[0024] Fig. 2A depicts an example scenario 200 in which the memory controller 130 responds to a zero page request 140-1 without actually writing any zeros or other data to the memory 120. Referring to Fig. 2A in conjunction with Fig. 1 , a requestor, may generate the zero page request 140-1 for purposes of zeroing out, (i.e., zero filling or writing all zeros) a page 122-1 of the memory 120.
[0025] As a more specific example, in accordance with example implementations, to generate the zero page request 140-1 , one or multiple processors 1 12 may execute machine executable instructions that cause a user level process to pass a virtual address to a kernel of the operating system 152 using a system call; and in response to the system call, the operating system kernel may write the physical address of the page to be zeroed to a memory-mapped input/output (I/O) register 131 of the memory controller 130. It is noted that such a mechanism may be used, in lieu of having applications directly write to the register 131 , as such application access may introduce a security vulnerability.
[0026] The zero page request 140-1 may be generated by a requestor other than a requestor associated with a processor 1 12, and the zero page request 140-1 may be generated by executing instructions other than instructions associated with an operating system, in accordance with further example implementations.
[0027] In response to the zero page request 140-1 , the memory controller 130 updates the ZTT 134, as indicated at reference numeral 210 in Fig. 2A. The update modifies an entry 500 of the ZTT 134, which serves as an indicator to indicate whether the page 122-1 is to be treated as being zeroed. Therefore, for example scenario 200, the memory controller 130 updates the ZTT 134 so that the entry 500 that corresponds to the page 122-1 is modified to represent that the page 122-1 has been zeroed. It is noted that in processing the zero page request 140-1 , the memory controller 130 does not actually access the memory 120 to write zeros or any other data to the memory 120.
[0028] For a subsequent read request that targets a cache line region 123 of the zeroed page 122-1 , the memory controller 130 selectively accesses the memory 120, based on whether the ZTT 134 indicates whether the cache line region 123 has been written after being zeroed. In this manner, in accordance with example implementations, the memory controller 130 updates the ZTT 134 when a write occurs to a zeroed cache line region 123 for purposes of changing the corresponding indicator of the ZTT 134 to reflect that the region 123 should no longer be treated as being zeroed (although the write may be a write of all zeroes to the cache line region 123).
[0029] More specifically, Fig. 2B depicts an example scenario 220 in which the memory controller 130 responds to a read request 140-2 that is directed to a cache line 123-1 of the page 122-1 , which remains zeroed after the zeroing of the page 122-1 ; and Fig. 2C depicts an example scenario 240 in which the memory controller 130 responds to a read request 140-3 that is directed to the cache line region 123-1 , which has been written after the zeroing of the page 122-1 .
[0030] Referring to Fig. 2B in conjunction with Fig. 1 , the processor 1 12 for scenario 220 submits the read request 140-2 that targets the cache line region 123-1 , and the memory controller 130 checks 226 the ZTT 134 to determine whether the ZTT 134 stores data that represents whether the cache line region 123-1 is zeroed. Because for scenario 220, the cache line region 123-1 has not been written (as represented by ZTT 134), the memory controller 134 does not request the data from the memory 120. Rather, the memory controller 130 responds, as indicated at reference numeral 142-1 , by providing a zero block of data, which corresponds to a cache line of zeros, to the requestor (here, the processor 1 12).
[0031 ] Referring to Fig. 2C in conjunction with Fig. 1 , for the scenario 240 in which the read request 140-3 targets the cache line region 123-1 that has been written after being zeroed, the memory controller 130 first identifies the non-zeroed status of the cache line 123-1 from the ZTT 134, as depicted at reference numeral 246. The memory controller 130 then generates a read request 248 to the memory 120 to read the data for the cache line region 123-1 from the memory 120. In this manner, the memory controller 130 may, for example, provide signals to the memory bus 144 (Fig. 1 ) for purposes of causing the memory 120 to furnish data 250 corresponding to the region 123-1 to the memory controller 130. The memory controller 130 then provides the data 250 read from the memory 120 to the requestor (here, the processor 1 12), as depicted at reference numeral 142-2.
[0032] Fig. 2D depicts an example scenario 260 in which a write occurs to the cache line region 123-1 of a page 122-1 that has been zeroed. In response to the write request 140-4, the memory controller 130 updates 268 the ZTT 134 (assuming that the write is the first write to the cache line region 123-1 after being zeroed) so that the ZTT 134 stores data that represents that the cache line region 123-1 no longer contains zero data. The memory controller 130 then provides a write request 270 to the memory 120 for purposes of writing the new data to the cache line region 123-1 .
[0033] In accordance with further example implementations, a page may be initialized before being allocated to an application with a predetermined data pattern other than a pattern of all zeros (a pattern of all ones, a certain predetermined pattern of ones and zeros, and so forth). Moreover, in accordance with further example implementations, the memory controller may initialize regions of the memory other than pages (units of multiple pages, for example). In accordance with further example implementations, the memory controller may track regions of the memory other than cache line boundary-aligned regions.
[0034] Thus, referring to Fig. 3, in accordance with example implementations, a technique 300 generally includes receiving (block 304), in a memory controller, a request to read data that is stored in a region of memory; and using a memory controller to manage access to the memory based at least in part an initialization state indicator for the memory region. Using the memory controller to manage the memory access includes determining (block 308) whether the region of memory is associated with the initialization state based on the indicator and based at least in part on the determination, selectively bypassing accessing the memory and using the memory controller to provide data having a predetermined data pattern, as depicted in block 312.
[0035] Referring to Fig. 4, in accordance with example implementations, the memory controller 130 may perform a technique 400, which includes receiving (block 404) a request to access a given location of a memory. The technique 400 includes, in response to the request, selectively providing (block 408) signals to a memory bus to access the memory, based at least in part on data stored in a tracking table, which represents locations of the memory associated with a predetermined data pattern.
[0036] Referring to Fig. 5A, in accordance with example implementations, the ZTT 134 includes N entries 500 (entries 500-1 , 500-2...500-N, via depicted as examples in Fig. 5A), which correspond to N pages 122 of the memory 120. Each entry 500, in turn, in accordance with example implementations, contains data representing the initialized status (zeroed status, for example) of a corresponding page 122 of the memory 120. In this manner, in accordance with example implementations, each entry 500 may be associated with a particular page address. Moreover, referring to Fig. 5B in conjunction with Fig. 5A, in accordance with some implementations, each entry 500 may include a set of cache line bit indicators 510 (P cache line bit indicators 510-1 , 510-2....510-P, being depicted as examples in Fig. 5B), where each cache line bit indicator 510 may be as a bit that represents the zeroed status of an associated cache line region 123 of the page 122. For example, a logic zero for the bit may represent a zeroed status for an associated cache line region 123, and a logic one for the bit may represent that the cache line region 123 is not zeroed.
[0037] Thus, in accordance with example implementations, in response to receiving a zero page request, the memory controller 133 may update the corresponding entry 500 of the ZTT 134 to clear all of the cache line bit indicators 510 to represent that all of the cache line regions 123 of the page 122 have been zeroed. As writes occur to a given page, the memory controller 130 may, in accordance with example
implementations, update the corresponding cache line bit indicators 510 to set the corporate indicators 510 (i.e., store corresponding one bits in the indicators 510) to indicate that the cache line regions 123 are no longer zeroed. Therefore, in
accordance with example implementations, the page entry 500 serve as an indicator to indicate or represent whether an associated page is zeroed or not; and the bit indicator 510 serves as an indicator to indicate or represent whether an associated cache line region is zeroed or not.
[0038] The ZTT 134 may have a different format and may contain data arranged in a different fashion than that depicted in Figs. 5A and 5B, in accordance with further implementations.
[0039] In accordance with some implementations, the memory controller 130 invalidates zeroed cache line memory regions. For example, in accordance with some implementations, a zero page request may be followed with the execution of PCOMMIT and SFENCE instructions. It is assumed for this approach that the address range of the register 131 (Fig. 1 ) is declared as persistent, and the memory controller 130 marks the zero page request write as being flushed when all of the invalidations have been posted. In accordance with further example
implementations, the memory controller 130 may loop to continuously read the register 131 until the register 131 returns the value of zero. The memory controller 130 may then set the value stored in the register 1 31 to zero after sending out all of the invalidations. Such a waiting loop does not generate any traffic on the memory bus 144.
[0040] While the present invention has been described with respect to a limited number of embodiments, those skilled in the art, having the benefit of this disclosure, will appreciate numerous modifications and variations therefrom. It is intended that the appended claims cover all such modifications and variations as fall within the true spirit and scope of this present invention.

Claims

What Is claimed Is 1 . A method comprising:
receiving, in a memory controller, a request to read data stored in a region of memory;
using the memory controller to manage access to the memory based on an initialization state indicator for the region of memory, wherein managing access comprises:
determining whether the region of memory is associated with the initialization state based on the indicator; and
based at least in part on the determination, selectively bypassing accessing the memory and using the memory controller to provide data having a predetermined data pattern.
2. The method of claim 1 , wherein determining whether the region of memory is associated with the initialization state comprises indexing a table based on a cache line and a page associated with the request to retrieve an indicator representing whether the region of memory is associated with the initialization state.
3. The method of claim 1 , wherein selectively bypassing accessing the memory comprises selectively providing signals to a memory bus to read the data stored in the region of memory.
4. The method of claim 1 , further comprising:
using the memory controller to maintain a table representing regions of the memory associated with the initialization state; and
selectively updating the table in response to a write request.
5. The method of claim 1 , further comprising:
using the memory controller to maintain a table representing regions of the memory associated with the initialization state; and
selectively updating the table to represent that a given region of the regions represented by the table is associated with the initialization state in response to the memory controlling receiving a request to initialize the given region with the initialization state.
6. An apparatus comprising:
a tracking table to store data representing locations of a memory associated with an initialized data pattern; and
a controller to:
receive a request to access the memory, the request targeting a given location of the memory; and
in response to the request, selectively provide signals to a memory bus to access the memory, based at least in part on the data stored in the tracking table.
7. The apparatus of claim 6, wherein the request comprises a read request, and the controller provides the signals to the memory bus to access the memory in response to the given location being a location other than of the locations
represented by the data stored in the tracking table.
8. The apparatus of claim 6, wherein:
the request comprises a write request;
the given location is one of the locations represented by the data stored in the tracking table; and
the controller updates the data stored in the tracking table to cause the data to represent that the given location is not associated with the initialized data pattern.
9. The apparatus of claim 8, wherein the controller further provides signals to the memory bus to write data associated with the write request to the given location of the memory.
10. The apparatus of claim 8, wherein the initialized data pattern comprises a pattern of zeros.
1 1 . A system comprising:
a memory comprising a plurality of pages and first pages of the plurality of pages being associated zero fill page requests;
a processor to provide a request to read data from the memory, the request being associated with a given page of the first pages; and
a memory controller to:
access a table storing entries, wherein each first page comprises a plurality of cache line regions, and each entry is associated with one of the first pages and represents states of the cache line regions of the associated first page; and
manage the request to read data from the memory based at least in part on the entry associated with the given page.
12. The system of claim 1 1 , wherein the states comprise states representing whether the cache lines have zeroed contents.
13. The system of claim 12, wherein:
the processor further provides a request to write data to first page of the plurality of first pages; and
the memory controller updates the table in response to the request.
14. The system of claim 1 1 , further comprising:
an integrated circuit; and
another memory to store the table,
wherein the memory controller and another memory are part of the integrated circuit.
15. The system of claim 1 1 , wherein the memory controller updates the table in response to a request to receiving a request to zero fill a page of the memory.
EP15905600.1A 2015-09-30 2015-09-30 Using a memory controller to manage access to a memory based on a memory initialization state indicator Ceased EP3262518A4 (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/US2015/053308 WO2017058218A1 (en) 2015-09-30 2015-09-30 Using a memory controller to manage access to a memory based on a memory initialization state indicator

Publications (2)

Publication Number Publication Date
EP3262518A1 true EP3262518A1 (en) 2018-01-03
EP3262518A4 EP3262518A4 (en) 2018-04-18

Family

ID=58427790

Family Applications (1)

Application Number Title Priority Date Filing Date
EP15905600.1A Ceased EP3262518A4 (en) 2015-09-30 2015-09-30 Using a memory controller to manage access to a memory based on a memory initialization state indicator

Country Status (4)

Country Link
US (1) US10705745B2 (en)
EP (1) EP3262518A4 (en)
CN (1) CN107533523A (en)
WO (1) WO2017058218A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11086660B2 (en) * 2016-03-09 2021-08-10 Hewlett Packard Enterprise Development Lp Server virtual address space

Family Cites Families (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05324453A (en) * 1992-05-18 1993-12-07 Fujitsu Ltd Initialization control system for external storage device
US6160739A (en) 1999-04-16 2000-12-12 Sandisk Corporation Non-volatile memories with improved endurance and extended lifetime
US6396744B1 (en) 2000-04-25 2002-05-28 Multi Level Memory Technology Flash memory with dynamic refresh
US20020095487A1 (en) * 2001-01-18 2002-07-18 Robert Day System for registering, locating, and identifying network equipment
US6948026B2 (en) * 2001-08-24 2005-09-20 Micron Technology, Inc. Erase block management
CN100426256C (en) * 2003-02-20 2008-10-15 松下电器产业株式会社 Information recording medium and area management method thereof
KR100706242B1 (en) * 2005-02-07 2007-04-11 삼성전자주식회사 How to configure the memory system and its run unit address mapping table
JP4736593B2 (en) * 2005-07-25 2011-07-27 ソニー株式会社 Data storage device, data recording method, recording and / or reproducing system, and electronic device
US7694119B1 (en) * 2006-03-30 2010-04-06 Emc Corporation Techniques for device initialization
CN101169760B (en) * 2006-10-26 2011-09-28 北京华旗资讯数码科技有限公司 Electronic hard disk storage room management method
US7646636B2 (en) 2007-02-16 2010-01-12 Mosaid Technologies Incorporated Non-volatile memory with dynamic multi-mode operation
US7774525B2 (en) * 2007-03-13 2010-08-10 Dell Products L.P. Zoned initialization of a solid state drive
US7877541B2 (en) * 2007-12-22 2011-01-25 Unity Semiconductor Corporation Method and system for accessing non-volatile memory
JP5286796B2 (en) * 2008-01-17 2013-09-11 日本電気株式会社 Memory control device
US8046529B2 (en) * 2008-02-20 2011-10-25 Hewlett-Packard Development Company, L.P. Updating control information in non-volatile memory to control selection of content
US8099544B2 (en) * 2008-02-29 2012-01-17 Kabushiki Kaisha Toshiba Information processing apparatus and nonvolatile semiconductor memory drive
US8738840B2 (en) * 2008-03-31 2014-05-27 Spansion Llc Operating system based DRAM/FLASH management scheme
US9720616B2 (en) * 2008-06-18 2017-08-01 Super Talent Technology, Corp. Data-retention controller/driver for stand-alone or hosted card reader, solid-state-drive (SSD), or super-enhanced-endurance SSD (SEED)
US8959280B2 (en) * 2008-06-18 2015-02-17 Super Talent Technology, Corp. Super-endurance solid-state drive with endurance translation layer (ETL) and diversion of temp files for reduced flash wear
US8954654B2 (en) * 2008-06-18 2015-02-10 Super Talent Technology, Corp. Virtual memory device (VMD) application/driver with dual-level interception for data-type splitting, meta-page grouping, and diversion of temp files to ramdisks for enhanced flash endurance
US8255616B2 (en) * 2010-01-12 2012-08-28 Freescale Semiconductor, Inc. Non-volatile memory device and method therefor
US8626986B2 (en) * 2010-06-30 2014-01-07 Sandisk Technologies Inc. Pre-emptive garbage collection of memory blocks
EP2416251B1 (en) * 2010-08-06 2013-01-02 Alcatel Lucent A method of managing computer memory, corresponding computer program product, and data storage device therefor
JP5722685B2 (en) 2011-04-12 2015-05-27 株式会社日立製作所 Method for controlling semiconductor device and nonvolatile memory device
CN104298616B (en) * 2013-07-15 2017-10-17 华为技术有限公司 Data block initial method, cache memory and terminal
US9329797B2 (en) 2013-12-30 2016-05-03 Sandisk Technologies Inc. Method and system for adjusting block erase or program parameters based on a predicted erase life

Also Published As

Publication number Publication date
WO2017058218A1 (en) 2017-04-06
CN107533523A (en) 2018-01-02
EP3262518A4 (en) 2018-04-18
US10705745B2 (en) 2020-07-07
US20180121122A1 (en) 2018-05-03

Similar Documents

Publication Publication Date Title
US8451281B2 (en) Shared virtual memory between a host and discrete graphics device in a computing system
JP5528554B2 (en) Block-based non-transparent cache
JP5752989B2 (en) Persistent memory for processor main memory
US10983921B2 (en) Input/output direct memory access during live memory relocation
US20100325374A1 (en) Dynamically configuring memory interleaving for locality and performance isolation
JP7228528B2 (en) Silent active page transition failure
US20170091099A1 (en) Memory controller for multi-level system memory having sectored cache
US10467138B2 (en) Caching policies for processing units on multiple sockets
CN108694133B (en) Apparatus, method and system for immediate cache associativity
JP2019531546A (en) Method and apparatus for bypassing the internal cache of an advanced DRAM memory controller
CN114270317A (en) Hierarchical memory system
US9558121B2 (en) Two-level cache locking mechanism
US20190042415A1 (en) Storage model for a computer system having persistent system memory
CN114258528A (en) Hierarchical memory device
CN114341816B (en) Three-layer hierarchical memory system
US10705745B2 (en) Using a memory controller to mange access to a memory based on a memory initialization state indicator
US12086447B2 (en) Systems and methods for reducing instruction code memory footprint for multiple processes executed at a coprocessor
US11526448B2 (en) Direct mapped caching scheme for a memory side cache that exhibits associativity in response to blocking from pinning
CN114341817A (en) Hierarchical memory system
KR20260004996A (en) Memory device and operating methods thereof for securing data
TW202441385A (en) Detecting and preventing virtual address aliasing to the same physical address
CN114270324A (en) Hierarchical memory system
CN114258534A (en) Hierarchical memory system
CN114270442A (en) Hierarchical memory system

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20170925

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

A4 Supplementary search report drawn up and despatched

Effective date: 20180319

RIC1 Information provided on ipc code assigned before grant

Ipc: G06F 13/16 20060101AFI20180312BHEP

Ipc: G06F 12/02 20060101ALI20180312BHEP

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20200214

REG Reference to a national code

Ref country code: DE

Ref legal event code: R003

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20220407