US20070067604A1 - Hardware support for superpage coalescing - Google Patents

Abstract

A method of assigning virtual memory to physical memory in a data processing system allocates a set of contiguous physical memory pages for a new page mapping, instructs the memory controller to move the virtual memory pages according to the new page mapping, and then allows access to the virtual memory pages using the new page mapping while the memory controller is still copying the virtual memory pages to the set of physical memory pages. The memory controller can use a mapping table which temporarily stores entries of the old and new page addresses, and releases the entries as copying for each entry is completed. The translation look aside buffer (TLB) entries in the processor cores are updated for the new page addresses prior to completion of copying of the memory pages by the memory controller. The invention can be extended to non-uniform memory array (NUMA) systems. For systems with cache memory, any cache entry which is affected by the page move can be updated by modifying its address tag according to the new page mapping. This tag modification may be limited to cache entries in a dirty coherency state. The cache can further relocate a cache entry based on a changed congruence class for any modified address tag.

Description

BACKGROUND OF THE INVENTION
• 1. Field of the Invention
• The present invention generally relates to computer systems, specifically to memory subsystems for computers, and more particularly to a method of providing efficient mappings between virtual memory and physical memory.
• 2. Description of the Related Art
• The basic structure of aconventional computer system10 is shown inFIG. 1.Computer system10 may have one or more processing units, two of which12aand12bare depicted, which are connected to various peripheral devices, including input/output (I/O) devices14 (such as a display monitor, keyboard, and permanent storage device), memory device16 (such as random access memory or RAM) that is used by the processing units to carry out program instructions, and firmware18 whose primary purpose is to seek out and load an operating system from one of the peripherals (usually the permanent memory device) whenever the computer is first turned on. Processing units12aand12bcommunicate with the peripheral devices by various means, including a generalized interconnect or bus20.Computer system10 may have many additional components which are not shown, such as serial, parallel and universal bus ports for connection to, e.g., modems or printers. Those skilled in the art will further appreciate that there are other components that might be used in conjunction with those shown in the block diagram ofFIG. 1; a display adapter might be used to control a video display monitor, a memory controller can be used to accessmemory16, etc. Also, instead of connecting I/O devices14 directly to bus20, they may be connected to a secondary (I/O) bus which is further connected to an I/O bridge to bus20. The computer can have more than two processing units.
• In a symmetric multi-processor (SMP) computer, all of the processing units are generally identical, that is, they all use a common set or subset of instructions and protocols to operate, and generally have the same architecture. A typical architecture is shown inFIG. 1. A processing unit includes aprocessor core22 having a plurality of registers and execution units, which carry out program instructions in order to operate the computer. An exemplary processing unit includes the PowerPC™ processor marketed by International Business Machines Corp. The processing unit can also have one or more caches, such as an instruction cache24 and a data cache26, which are implemented using high speed memory devices. Caches are commonly used to temporarily store values that might be repeatedly accessed by a processor, in order to speed up processing by avoiding the longer step of loading the values frommemory16. These caches are referred to as “on-board” when they are integrally packaged with the processor core on a single integrated chip28. Each cache is associated with a cache controller (not shown) that manages the transfer of data between the processor core and the cache memory.
• A processing unit12 can include additional caches, such ascache30, which is referred to as a level 2 (L2) cache since it supports the on-board (level 1) caches24 and26. In other words, cache30 acts as an intermediary betweenmemory16 and the on-board caches, and can store a much larger amount of information (instructions and data) than the on-board caches can, but at a longer access penalty. For example,cache30 may be a chip having a storage capacity of 256 or 512 kilobytes, while the processor may be an IBM PowerPC™ 604-series processor having on-board caches with 64 kilobytes of total storage.Cache30 is connected to bus20, and all loading of information frommemory16 intoprocessor core22 usually comes throughcache30. AlthoughFIG. 1 depicts only a two-level cache hierarchy, multi-level cache hierarchies can be provided where there are many levels of interconnected caches. The main memory can further be distributed among many processor clusters in a non-uniform memory array (NUMA).
• A cache has many blocks which individually store the various program instruction and operand data values. The blocks in any cache are divided into groups of blocks called sets or congruence classes. A set is the collection of cache blocks that a given memory block can reside in. For any given memory block, there is a unique set in the cache that the block can be mapped into, according to preset mapping functions. The number of blocks in a set is referred to as the associativity of the cache, e.g. 2-way set associative means that for any given memory block there are two blocks in the cache that the memory block can be mapped into; however, several different blocks in main memory can be mapped to any given set. A 1-way set associate cache is direct mapped, that is, there is only one cache block that can contain a particular memory block. A cache is said to be fully associative if a memory block can occupy any cache block, i.e., there is one congruence class, and the address tag is the full address of the memory block.
• An exemplary cache line (block) includes an address tag field, a state bit field, an inclusivity bit field, and a value field for storing the program instruction or operand data. The state bit field and inclusivity bit fields are used to maintain cache coherency in a multiprocessor computer system (to indicate the validity of the value stored in the cache). For example, a coherency state can be used to indicate that a cache line is valid but not necessarily consistent with main memory, i.e., when a process has written a value to that cache line but the value has not yet migrated down the memory hierarchy to “system” memory (such a cache line is referred to as “dirty”). The address tag is a subset of the full address of the corresponding memory block. A compare match of an incoming address with one of the tags within the address tag field indicates a cache “hit.” The collection of all of the address tags in a cache (and sometimes the state bit and inclusivity bit fields) is referred to as a directory, and the collection of all of the value fields is the cache entry array.
• When all of the blocks in a congruence class for a given cache are full and that cache receives a request, whether a read or write, to a memory location that maps into the full congruence class, the cache must evict one of the blocks currently in the class. The cache chooses a block by one of a number of means known to those skilled in the art (least recently used (LRU), random, pseudo-LRU, etc.) to be evicted. If the data in the chosen block is modified, that data is written to the next lowest level in the memory hierarchy which may be another cache (in the case of the L1 or on-board cache) or main memory (in the case of an L2 cache, as depicted in the two-level architecture ofFIG. 1). By the principle of inclusion, the lower level of the hierarchy will already have a block available to hold the written modified data. However, if the data in the chosen block is not modified, the block is simply abandoned and not written to the next lowest level in the hierarchy. This process of removing a block from one level of the hierarchy is known as an eviction. At the end of this process, the cache no longer holds a copy of the evicted block.
• Memory is utilized by program applications as illustrated inFIG. 2. A program application is compiled using relative memory addresses, referred to as virtual memory, that correspond to locations in physical memory. For example, two processes32a,32bmight each utilize virtual memory addresses from zero to four gigabytes (GB), but these virtual addresses map to different physical addresses inmemory16, which may provide a total physical memory of 64 GB. The memory for a process is divided into multiple “pages” to make more efficient use of physical memory, since a process usually does not need access to all virtual memory space at any given time. Virtual memory mapping allows multiple processes to share a given physical page of memory, as indicated atphysical page34. The virtual-to-physical memory mapping is handled inprocessor core22 by providing a translation look aside buffer (TLB)29 whose entries keep track of current virtual-to-physical address assignments.
• Many computer architectures support multiple virtual page sizes. Large pages (larger than the smallest virtual page size) are sometimes referred to as “superpages,” and these virtual superpages map to similarly sized “super” physical pages. Thus, in a system where the page size is 4 kilobytes (KB), a virtual superpage of 64 KB maps to16 contiguous 4-KB physical pages making up 64 KB. Superpages typically have alignment requirements both in the virtual and physical address spaces. Thus a 64 KB virtual superpage would typically have to be aligned on a 64 KB boundary. Similarly, the 64 KB of physical page to which it maps would also have to be aligned on a 64 KB boundary. However, the use of superpages gives rise to a tradeoff. While superpages can improve the TLB hit rate by reducing the number of entries that need to be concurrently maintained in the TLB, they can also lead to underutilization of the physical memory if the application does not use the entire superpage.
• This tradeoff can be resolved by providing the ability to dynamically vary the superpage size based on an application's needs. The notion of dynamically varying the superpage size based on application execution characteristics is known in the art; see, e.g., the article entitled “Reducing TLB and Memory Overhead Using Online Superpage Promotion,” by Romer et al. (22nd Annual Proceedings of the International Symposium on Computer Architecture, 1995). That solution resorts to software-directed memory copying in order to make a contiguous set of physical pages hold the application data. This approach, however, still has drawbacks. When the operating system (OS) determines that two or more (super)pages have to be coalesced into a larger superpage, it first sets aside a sufficiently large contiguous set of physical pages to map the larger superpage, and flushes any dirty lines from the caches. It next uses the processor to copy data from the original set of physical pages to the physical pages forming the superpage. Only after the copying is completed can the superpage be formed by coalescing page table entries. During this time, the application continues to suffer from poor TLB behavior.
• An alternative method of handling this tradeoff uses a hardware approach, as discussed in the article entitled “Reevaluating Online Superpage Promotion with Hardware Support,” by Fang et al. (Proceedings of the Seventh International Symposium on High Performance Computer Architecture, pp. 63-72, January 2001). The Impulse approach does not actually copy the pages over into new physical locations, but instead provides an extra level of address remapping at the main memory controller. The remapped addresses are inserted into the TLB as mappings for the virtual addresses. The memory controller maintains its own page tables for these “shadow” memory mappings. Impulse also has its drawbacks. First of all, the physical superpage is not contiguous. Secondly, the size of the memory controller page tables limits the availability of remapped superpages, and the mapping table can quickly grow. In a typical 4 GB application with 4 KB pages, the mapping table could easily require more than one million entries. Finally, this lookup procedure is on the critical path to memory access. These limitations are exacerbated in NUMA systems having multiple memory controllers.
• In light of the foregoing, it would be desirable to devise an improved method of superpage coalescing which is not limited by the size of hardware tables, but still allows the application TLB behavior to improve immediately, i.e., without waiting on software-directed copying. It would be further advantageous if the method were easily adapted for use with NUMA systems.
SUMMARY OF THE INVENTION
• It is therefore one object of the present invention to provide an improved method of superpage coalescing in a data processing system.
• It is another object of the present invention to provide such a method which facilitates efficient superpage coalescing while reducing latentcies associated with page copying.
• It is yet another object of the present invention to provide a hardware-supported method of migrating virtual-to-physical memory mappings in a memory hierarchy which includes one or more cache levels.
• The foregoing objects are achieved in a method of assigning virtual memory to physical memory in a data processing system, generally comprising the steps of allocating a set of aligned, contiguous physical memory pages for a new virtual superpage, instructing a memory controller to move a plurality of physical memory pages corresponding to the old mapping to the set of potentially different physical memory pages corresponding to the new page mapping, and then accessing the virtual memory pages making up the superpage using the new page mapping while the memory controller is still copying the old physical memory pages to the new physical memory pages. In one embodiment, the memory controller uses a mapping table which temporarily stores entries of the old and new page addresses, and releases the entries in the mapping table as copying for each entry is completed. During copying, accesses to the affected pages are handled as follows. Any read operation for an address of the new page mapping which is currently being copied is directed to the corresponding address of the old page mapping. Any write operation for an address of the new page mapping which is currently being copied is directed to both the address of the new page mapping and the corresponding address of the old page mapping. Any write operation for an address of the new page mapping which has not yet been copied is directed only to the corresponding address of the old page mapping. The translation look aside buffer (TLB) entries in the processor cores are updated for the new page addresses prior to completion of copying of the memory pages by the memory controller. The invention can be extended to non-uniform memory array (NUMA) systems by allowing entries in one memory controller to point to physical pages in the new page mapping that are located in remote memory arrays controlled by other memory controllers.
• For systems with cache memory, any cache entry which is affected by the page move is updated by modifying its address tag according to the new page mapping. This tag modification may be limited to cache entries in a dirty coherency state, that is, only for those entries containing a valid value which is not present elsewhere in the memory hierarchy. The cache can further relocate a cache entry based on a changed congruence class for the modified address tag.
• The above as well as additional objectives, features, and advantages of the present invention will become apparent in the following detailed written description.
BRIEF DESCRIPTION OF THE DRAWINGS
• The present invention may be better understood, and its numerous objects, features, and advantages made apparent to those skilled in the art by referencing the accompanying drawings.
• FIG. 1 is a block diagram of a conventional computer system, depicting a memory hierarchy which includes a main memory device and multiple memory caches;
• FIG. 2 is a pictorial representation of a conventional technique for virtual-to-physical memory mapping in a computer system such as that shown inFIG. 1;
• FIG. 3 is a block diagram of one embodiment of a memory subsystem constructed in accordance with the present invention having a memory controller which allows a computer system to quickly use newly mapped superpage addresses while copying of the constituent pages is still underway;
• FIG. 4 is a block diagram of one embodiment of a multiprocessor computer system having a non-uniform memory array which may advantageously implement the present invention using multiple memory controllers similar to the memory controller ofFIG. 3;
• FIG. 5 is a block diagram of one embodiment of a cache memory constructed in accordance with the present invention which updates address tag information based on newly mapped virtual-to-physical memory locations and relocates a cache line with a changed associativity; and
• FIG. 6 is a chart illustrating the logical flow according to one implementation of the present invention.
• The use of the same reference symbols in different drawings indicates similar or identical items.
DESCRIPTION OF THE PREFERRED EMBODIMENT(S)
• With reference now to the figures, and in particular with reference toFIG. 3, there is depicted oneembodiment40 of a memory subsystem constructed in accordance with the present invention.Memory subsystem40 is generally comprised of amemory controller42 and a system ormain memory array44, and is adapted to facilitate superpage coalescing for an operating system which controls virtual-to-physical page mappings in a data processing system. The operating system (OS) may have many conventional features including appropriate software which determines page mappings, and decides when it is desirable to coalesce pages into a larger (super)page; such details are beyond the scope of the present invention but will become apparent to those skilled in the art.
• Memory subsystem40 provides a hardware solution to superpage coalescing which reduces or eliminates the poor TLB behavior that occurs during the prior art software-directed copying solution. In the present invention, the OS can immediately change its mappings for the constituent pages into one mapping for the new superpage, with close to zero delay and without waiting for completion of the actual page copying. The OS can use the new mappings right away because the memory controller maintains a temporary mapping from the new physical pages back to the old physical pages until the new physical pages are brought up to date. As a result, the application TLB behavior improves immediately.
• Memory controller42 has an input which receives read and write instructions from a generalized interconnect or system bus, and processes those instructions by accessingmain memory array44 in a known manner.Memory controller42 also receives memory management instructions, including instructions regarding superpage coalescing. In particular,memory controller42 can receive instructions from the operating system which define a set of pages to be copied to new physical memory locations as part of the coalescing process. The old and new physical page addresses are stored temporarily in a mapping table46. Mapping table46 maintains the mapping information while the page-to-page copying is underway. Although the number of entries in mapping table46 is limited, they are reusable since they are not needed once the copying is complete, so repeated superpage formation is unlimited. The number of entries in mapping table46 may vary depending upon the particular operating system and page sizes involved, but a table having32 slots is considered exemplary.
• Memory controller42 may utilize astate engine48 to step through the copy process.State engine48 sequentially reads the paired FROM (old) and TO (new) addresses in mapping table46 and controls a direct-memory access (DMA) engine50 that is hidden from the operating system to carry out the copying. DMA engine50 runs in the background, that is, without interrupting program processing. As copying of a given page in mapping table46 is lazily completed, that entry is vacated bystate engine48, i.e., it is taken out of the temporary mapping function, and no mapping remains once all copying is complete. The OS can accordingly use the new superpage mappings immediately without waiting for actual copying of the physical pages, and read/write instructions to those pages can be handled bymemory controller42 by referring back to the old physical page addresses until the new physical pages are brought up to date.
• Referring now toFIG. 4, there is depicted one embodiment of amultiprocessor computer system52 having a non-uniform memory array (NUMA), which may advantageously utilize the present invention for page migration.Computer system52 has a plurality ofprocessing clusters54a,54b. While only two processing clusters are depicted, the system could have more. A given processing cluster includes two or more processing units56 each comprised of a processor core and one or more cache levels which are interconnected by asystem bus58 tomemory controller42,local memory array44, and anetwork interface60. The processing clusters can interact by means of aninter-processor communications bus62 which interconnects two of the network interfaces60.
• Computer system52 does not have a centralized main memory, but rather distributes main memory across the manylocal memory arrays44 found in the different processing clusters, and uses multiple memory controllers which have the same ability to maintain temporary mappings for a superpage coalescing procedure. Pointers in the mapping tables of the memory controllers can straddle memory controller boundaries, that is, they can map to physical locations anywhere in the total amount of available memory, not just to those physical locations controlled by that controller in its corresponding local memory array. In this manner, a virtual page can easily migrate from an old physical location in one processing cluster to a new physical location in a second processing cluster, for example, to bring a data set closer to a processing cluster that is using the data.
• For data processing systems such ascomputer system52 that utilize caches, page migration/coalescing must take into consideration any current (valid) cache entries whose page mappings change. One way to address this concern is by simply flushing all cache blocks in the old page mappings (i.e., writing the cached values back to system memory and invalidating the cache lines). Flushing of any affected cache lines can be performed by the operating system using standard cache instructions, but this approach introduces additional delays. An alternative approach is to provide a cache in which the address tag for an affected data line can be modified without having to move the data to or from main memory.FIG. 5 illustrates one embodiment of such a cache memory70 constructed in accordance with the present invention which updates address tag information based on newly mapped virtual-to-physical memory locations.
• Cache70 includes acache controller72, adata array74 and atag array76 whose entries correspond respectively with the values indata array74.Cache controller72 receives cache instructions and accessesdata array74 andtag array76 in a known manner to carry out read and write operations.Cache controller72 also receives page coalescing/migration instructions from the OS, which can be broadcast to all caches in the computer system.Cache controller72 passes on the page mapping information to astate machine78.State machine78 examines each of the entries intag array76 to determine if any current cache lines are affected by the remapping. If any valid tag is within a remapped address range, its coherency state is additionally examined to determine the appropriate action. For a “clean” coherency state (meaning that the corresponding cached value is valid and is stored elsewhere in the memory hierarchy), the cache tag can be rewritten based on the new mapping in order to incur no further latency when accessed through the new mapping. For a “dirty” coherency state (meaning that the corresponding cached value is valid but is not stored elsewhere in the memory hierarchy), the tag can be rewritten based on the new mapping. The dirty coherency state is maintained for that line, so this tag switch advantageously permits the dirty data to stay in the cache. In either case (clean or dirty) there is no need to write any data to or read any data from system memory, and all remaining valid tags are guaranteed to be consistent with the new mapping.
• For set associative caches, consideration must also be given to the appropriate congruence class for any dirty cache line whose tag is modified.State machine78 determines the congruence class of the modified tag and, if different from the congruence class of the old tag, instructscache controller72 to re-locate the affected cache line.Cache controller72 handles this instruction similar to a standard write instruction, searching for an available cache line (clean or invalid) in the appropriate set and rewriting the data, as indicated at80. The old cache line is then invalidated. If no cache line in the new set is available, the default eviction process (e.g., least recently used) is preferably employed to make a line available and the data is rewritten to that line. Alternatively, if no clean or invalid entry is found for the new set,cache controller72 could be programmed to flush the affected cache line to a lower level of the memory hierarchy.
• The depicted embodiment of cache70 locally controls the tag remapping usingstate machine78, but the procedure could instead be remotely controlled by its associated processor core.
• The present invention may be further understood with reference to the flow chart ofFIG. 6. The process begins when the OS decides that is it desirable to coalesce a set of pages into a larger superpage (90). In this regard, those skilled in the art will appreciate that the term “superpage” is not to be construed in a limiting sense, i.e., with regard either to the actual size of the page or to the number of smaller pages that are coalesced. The OS allocates the pages (92) by setting aside a contiguous set of physical pages to map the new superpage, and informs the memory controller of the new mapping (94). The memory controller creates the temporary mapping table and the OS immediately begins using the new mapping (96). No entry is needed for any identical mappings, i.e., when the superpage coalescing results in a page copy instruction whose new physical address is the same as the old address. For coherency, the OS stalls write operations at the processor TLBs using protection bits (98) while the caches are updated (100). The TLB entries are thereafter changed to reflect the larger superpage (102). The memory controller copies the pages while the new mappings are being used (104). While the copying proceeds, read operations to the new superpage can be handled by presenting the operations to the memory controller using the new page mapping, and the memory controller will divert the read to the old page. A write operation directed to a memory location that is currently being copied is written to both the old and new pages. A write operation directed to a memory location that is in the memory controller mapping but is not yet being copied is written only to the old page. As pages are copied, the memory controller gradually removes the temporary mappings, until all of the page copying is complete (106). The invention permits the creation of superpages made up from more (super)pages than there are slots in table46 ofmemory controller42 inFIG. 3. This is achieved by using an iterative process to create the superpages.
• Although the invention has been described with reference to specific embodiments, this description is not meant to be construed in a limiting sense. Various modifications of the disclosed embodiments, as well as alternative embodiments of the invention, will become apparent to persons skilled in the art upon reference to the description of the invention. It is therefore contemplated that such modifications can be made without departing from the spirit or scope of the present invention as defined in the appended claims.

Claims (19)

1-20. (canceled)

21. A cache memory for a processing unit, comprising:

a data array which stores values associated with respective locations in system memory;

a tag array which stores address tags corresponding to the values in said data array;

a cache controller which receives cache instructions and accesses said data array and said tag array to carry out read and write operations; and

a state machine which modifies an address tag for a cache entry based on a new memory mapping for an associated memory location of the cache entry.

22. The cache memory ofclaim 21 wherein said state machine modifies the address tag in response to a determination that the cache entry has a dirty coherency state.

23. The cache memory ofclaim 21 wherein said cache controller relocates the cache entry based on a changed congruence class for the modified address tag.

24. The cache memory ofclaim 23 wherein said cache controller makes a determination that there is no available cache line in the changed congruence class for the modified address tag, and evicts another cache entry in the changed congruence class to make that entry available.

25. The cache memory ofclaim 21 wherein said state machine modifies the address tag in response to a determination that the cache entry has a clean coherency state.

26. The cache memory ofclaim 21 wherein said state machine examines each of the address tags in said tag array to determine that the address tag for the cache entry is affected by the new memory mapping.

27. A method of updating a cache memory of a computer system, comprising:

receiving migration instructions having a new memory mapping;

examining address tags in a tag array of the cache memory to determine that at least one address tag having an associated cache entry is affected by the new memory mapping; and

modifying the address tag for the cache entry based on the new memory mapping.

28. The cache memory ofclaim 27 wherein the address tag for the cache entry is modified in response to a determination that the cache entry has a dirty coherency state.

29. The cache memory ofclaim 27 wherein the address tag for the cache entry is modified in response to a determination that the cache entry has a clean coherency state.

30. The cache memory ofclaim 27 further comprising relocating the cache entry based on a changed congruence class for the modified address tag.

31. The cache memory ofclaim 30 further comprising:

determining that there is no available cache line in the changed congruence class for the modified address tag; and

evicting another cache entry in the changed congruence class to make that entry available.

32. A computer system comprising:

a processing unit;

a memory array storing program instructions which are processed by said processing unit; and

a cache memory having

a data array which stores values associated with respective locations in said memory array,

a tag array which stores address tags corresponding to the values in said data array,

a cache controller which receives cache instructions and accesses said data array and said tag array to carry out read and write operations, and

a state machine which modifies an address tag for a cache entry based on a new memory mapping for an associated memory location of the cache entry.

33. The computer system ofclaim 32 wherein said state machine modifies the address tag in response to a determination that the cache entry has a dirty coherency state.

34. The computer system ofclaim 32 wherein said state machine modifies the address tag in response to a determination that the cache entry has a clean coherency state.

35. The computer system ofclaim 32 wherein said state machine examines each of the address tags in said tag array to determine that the address tag for the cache entry is affected by the new memory mapping.

36. The computer system ofclaim 32 wherein:

said cache memory is one of a plurality of cache memories in the computer system; and

the program instructions include an operating system which broadcasts migration instructions having the new memory mapping to all of said cache memories.

37. The computer system ofclaim 32 wherein said cache controller relocates the cache entry based on a changed congruence class for the modified address tag.

38. The computer system ofclaim 37 wherein said cache controller makes a determination that there is no available cache line in the changed congruence class for the modified address tag, and evicts another cache entry in the changed congruence class to make that entry available.

Images