Abstract:
Embodiments of the present invention provide a memory resource optimization method and apparatus, relate to the computer field, solve a problem that existing multi-level memory resources affect each other, and optimize an existing single partitioning mechanism. A specific solution is: obtaining performance data of each program in a working set by using a page coloring technology, obtaining a category of each program in light of a memory access frequency, selecting, according to the category of each program, a page coloring-based partitioning policy corresponding to the working set, and writing the page coloring-based partitioning policy to an operating system kernel, to complete corresponding page coloring-based partitioning processing. The present invention is used to eliminate or reduce mutual interference of processes or threads on a memory resource in light of a feature of the working set, thereby improving overall performance of a computer.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
       [0001]    This application is a continuation of International Application No. PCT/CN2014/089194, filed on Oct. 22, 2014, which claims priority to Chinese Patent Application No. 201310503238.1, filed on Oct. 23, 2013, both of which are hereby incorporated by reference in their entireties. 
     
    
     TECHNICAL FIELD 
       [0002]    The present invention relates to the computer field, and in particular, to a memory resource optimization method and apparatus. 
       BACKGROUND 
       [0003]    Currently, a multi-core high performance computer (Multi-core High Performance Computer) is applied more widely. Moreover, as a quantity of calculating units (cores) on a processor continues to increase, a memory access contention phenomenon among multiple cores further complicates a problem. In any time period of concurrent execution, memory access requests from different cores may contend for memory access to global memory resources, further triggering a conflict over resources such as a memory controller (Memory Controller, MC), bandwidth (Bandwidth), and a dynamic random access memory bank (DRAM Bank); as a result, resource utilization is affected. 
         [0004]    Access to a main memory is used as an example. Usually, a single transistor is used as a storage unit, N*M storage units form a storage matrix, and several storage matrices constitute a bank (Bank). Each Bank has a row-buffer (Row-Buffer); when data is to be accessed, data in a target row can be read only after the data is moved to the row-buffer. A modern DRAM system usually uses multiple Banks, and respective memory access requests are processed independently at the same time. However, if two memory access requests that are from different processes or threads access different rows of a same DRAM Bank, a conflict (or referred to as a row-buffer conflict) on the DRAM Bank may be generated, and a memory access delay is increased. A cache (Cache) is used to alleviate a gap between a calculating unit and a main memory. Because the cache is closer to the calculating unit than the main memory, the cache affects calculation performance more easily. Existing processors basically use a structure of sharing a last level cache (Last Level Cache, LLC) among multiple cores. However, the LLC is also intensely contended for among multiple concurrent programs or threads. If no proper management policy is used, it is very easy to cause serious performance deterioration. 
         [0005]    In the prior art, the LLC or the DRAM Bank is partitioned by using page coloring (Page-Coloring). Regarding page coloring-based LLC partitioning, a Cache resource is partitioned into several independent parts in a manner of performing page coloring on index bits of a cache set (Cache Set) in a physical address, and the parts are assigned to different threads separately. Therefore, inter-thread contention due to sharing of a Cache disappears. Similar to the LLC partitioning, index bits of the DRAM Bank can also be reflected in a physical address, and the DRAM Bank can also be partitioned into several independent groups by performing coloring according to these address bits; therefore, inter-program contention on the DRAM Bank disappears. For some working sets, a relatively good performance improvement effect can be achieved. 
         [0006]    However, when a conventional page coloring technology is used to partition a resource at a level, a negative impact is caused on utilization of a resource at another level. For example, work related to the LLC partitioning has a restriction on performance improvement of a DRAM Bank resource; similarly, work related to the DRAM Bank partitioning also affects performance of an LLC resource. In addition, because running of a modern computer system requires various working sets, an existing page coloring-based partitioning mechanism for a resource at a level is difficult to match up with features of different working sets; as a result, an optimum partitioning effect cannot be achieved, and overall performance improvement of the computer is limited. 
       SUMMARY 
       [0007]    Embodiments of the present invention provide a memory resource optimization method and apparatus, provide a collaborative partitioning policy between an LLC and a DRAM Bank, where the policy is combined with a feature of a working set, and can solve a problem that processes or threads mutually affect each other when sharing memory resources, so that overall performance of a computer is improved. 
         [0008]    To achieve the foregoing objectives, the following technical solutions are used in the embodiment of the present invention: 
         [0009]    According to a first aspect, a memory resource optimization method is provided, where the method includes: 
         [0010]    acquiring performance data of each program in a working set, and categorizing each program by comparing the performance data of each program and a memory access frequency, obtained by means of statistics collection, of each program with a preset threshold, where the performance data of each program is a variation that is generated when a preset performance indicator of each program varies with a capacity of an allocated last level cache LLC resource; 
         [0011]    selecting, in light of categorization of each program in the working set and a preset decision policy, a page coloring-based partitioning policy corresponding to the working set, where the page coloring-based partitioning policy includes a page coloring-based collaborative partitioning policy for performing page coloring-based partitioning on both the LLC and the dynamic random access memory bank DRAM Bank; and 
         [0012]    writing the page coloring-based partitioning policy corresponding to the working set to an operating system kernel, where the operating system kernel performs corresponding page coloring-based partitioning processing. 
         [0013]    With reference to the first aspect, in a first implementation manner, the acquiring performance data of each program in a working set includes: 
         [0014]    partitioning the LLC resource into N portions by using a page coloring technology, taking 1/N of a maximum capacity of the LLC resource as one level, allocating the maximum capacity of the LLC resource to each program at the beginning, and decreasing the capacity of the LLC resource allocated to each program by one level in each adjustment, until the capacity is decreased to 1/N of the maximum capacity of the LLC resource; and 
         [0015]    monitoring a variation that is generated when the preset performance indicator of each program varies with the capacity of the allocated LLC resource in an adjustment process, and using the variation as the performance data of each program, where the preset performance indicator is a speed-up ratio of each program. 
         [0016]    With reference to the first aspect or the first possible implementation manner of the first aspect, in a second possible implementation manner, the categorizing each program by comparing the performance data of each program and a memory access frequency, obtained by means of statistics collection, of each program with a preset threshold includes: 
         [0017]    counting a quantity of times that each program accesses a main memory in a preset stage of a running process, to obtain the memory access frequency of each program; 
         [0018]    comparing the performance data of each program and the memory access frequency, obtained by means of statistics collection, of each program with the preset threshold, where the preset threshold includes a first threshold, a second threshold, and a third threshold, the first threshold and the second threshold are performance data thresholds, and the third threshold is a memory access frequency threshold; and 
         [0019]    if performance data of a program is greater than the first threshold, categorizing the program as a high demand type;
       if performance data of a program is less than the first threshold and greater than the second threshold, categorizing the program as a medium demand type; or       
 
         [0021]    if performance data of a program is less than the second threshold and a memory access frequency is greater than the third threshold, categorizing the program as a low demand and intensive type. 
         [0022]    With reference to the first aspect, in a third possible implementation manner, the preset decision policy is a partitioning policy decision tree in the operating system kernel, and the partitioning policy decision tree is implemented in the operating system kernel in algorithm form; and the selecting, in light of categorization of each program in the working set and a preset decision policy, a page coloring-based partitioning policy corresponding to the working set includes: 
         [0023]    updating the categorization of each program in the working set to the operating system kernel, and searching the partitioning policy decision tree in the operating system kernel for a corresponding node in light of a category of each program in the working set, to determine the page coloring-based partitioning policy corresponding to the working set. 
         [0024]    With reference to the third possible implementation manner of the first aspect, in a fourth possible implementation manner, the page coloring-based partitioning policy includes the page coloring-based collaborative partitioning policy and a page coloring-based non-collaborative partitioning policy; 
         [0025]    the page coloring-based collaborative partitioning policy is a partitioning policy of using overlapped index address bits O-bits as page coloring-based partitioning index bits, and the O-bits are overlapped address bits of index bits of the LLC and index bits of the DRAM Bank in a physical page frame, and are used to index page coloring-based partitioning for both the LLC and the DRAM Bank; and 
         [0026]    the page coloring-based collaborative partitioning policy includes: 
         [0027]    a category A multi-level memory collaborative partitioning policy A-MMCP, in which the O-bits are used as partitioning index bits, and the LLC and the DRAM Bank are partitioned into a same quantity of equal portions; 
         [0028]    a category B multi-level memory collaborative partitioning policy B-MMCP, in which the O-bits and an index bit of the DRAM Bank are used as partitioning index bits, the LLC and the DRAM Bank are partitioned into different quantities of equal portions, and a quantity of partitioned equal portions of the DRAM Bank is greater than a quantity of partitioned equal portions of the LLC; and 
         [0029]    a category C multi-level memory collaborative partitioning policy C-MMCP, in which the O-bits and an index bit of the LLC are used as partitioning index bits, the LLC and the DRAM Bank are partitioned into different quantities of equal portions, and a quantity of partitioned equal portions of the DRAM Bank is less than a quantity of partitioned equal portions of the LLC; and 
         [0030]    the page coloring-based non-collaborative partitioning policy is a partitioning policy in which the O-bits are not used and includes: 
         [0031]    a Cache-Only policy, in which coloring-based partitioning is performed on the LLC by using the index bit of the LLC, and coloring-based partitioning is not performed on the DRAM Bank; and 
         [0032]    a Bank-Only policy, in which coloring-based partitioning is performed on the DRAM Bank by using the index bit of the DRAM Bank, and coloring-based partitioning is not performed on the LLC. 
         [0033]    With reference to the third possible implementation manner of the first aspect or the fourth possible implementation manner of the first aspect, in a fifth possible implementation manner, the searching the partitioning policy decision tree in the operating system kernel for a corresponding node in light of a category of each program in the working set, to determine the page coloring-based partitioning policy corresponding to the working set includes: 
         [0034]    if each category to which each program in the working set belongs is the high demand type, selecting the Bank-Only policy; 
         [0035]    if there is the low demand and intensive type in a category to which each program in the working set belongs, further determining a quantity of programs in the working set; and if the quantity of programs is less than or equal to N, selecting the A-MMCP; otherwise, selecting the C-MMCP, where N is a quantity of cores of a processor; or 
         [0036]    if there is the medium demand type and there is no low demand and intensive type in a category to which each program in the working set belongs, further determining a quantity of programs in the working set; and if the quantity of programs is less than or equal to N, selecting the A-MMCP; otherwise, selecting the B-MMCP, where N is a quantity of cores of a processor. 
         [0037]    According to a second aspect, a memory resource optimization apparatus is provided, where the apparatus includes: 
         [0038]    a front end unit, configured to acquire performance data of each program in a working set, and categorize each program by comparing the performance data of each program and a memory access frequency, obtained by means of statistics collection, of each program with a preset threshold, where the performance data of each program is a variation that is generated when a preset performance indicator of each program varies with a capacity of an allocated last level cache LLC resource; 
         [0039]    a decision-making unit, configured to select, in light of categorization of each program in the working set and a preset decision policy, a page coloring-based partitioning policy corresponding to the working set, where the page coloring-based partitioning policy includes a page coloring-based collaborative partitioning policy for performing page coloring-based partitioning on both the LLC and the dynamic random access memory bank DRAM Bank; and 
         [0040]    a partitioning unit, configured to write the page coloring-based partitioning policy corresponding to the working set to an operating system kernel, where the operating system kernel performs corresponding page coloring-based partitioning processing. 
         [0041]    With reference to the second aspect, in a first implementation manner, the front end unit includes a data collecting unit, where the data collecting unit is specifically configured to: 
         [0042]    partition the LLC resource into N portions by using a page coloring technology, take 1/N of a maximum capacity of the LLC resource as one level, allocate the maximum capacity of the LLC resource to each program at the beginning, and decrease the capacity of the LLC resource allocated to each program by one level in each adjustment, until the capacity is decreased to 1/N of the maximum capacity of the LLC resource; and 
         [0043]    monitor a variation that is generated when the preset performance indicator of each program varies with the capacity of the allocated LLC resource in an adjustment process, and use the variation as the performance data of each program, where the preset performance indicator is a speed-up ratio of each program. 
         [0044]    With reference to the second aspect or the first possible implementation manner of the second aspect, in a second possible implementation manner, the front end unit further includes a categorizing unit, where the categorizing unit is specifically configured to: 
         [0045]    count a quantity of times that each program accesses a main memory in a preset stage of a running process, to obtain the memory access frequency of each program; 
         [0046]    compare the performance data of each program and the memory access frequency, obtained by means of statistics collection, of each program with the preset threshold, where the preset threshold includes a first threshold, a second threshold, and a third threshold, the first threshold and the second threshold are performance data thresholds, and the third threshold is a memory access frequency threshold; and 
         [0047]    if performance data of a program is greater than the first threshold, categorize the program as a high demand type; 
         [0048]    if performance data of a program is less than the first threshold and greater than the second threshold, categorize the program as a medium demand type; or 
         [0049]    if performance data of a program is less than the second threshold and a memory access frequency is greater than the third threshold, categorize the program as a low demand and intensive type. 
         [0050]    With reference to the second aspect, in a third possible implementation manner, the preset decision policy is a partitioning policy decision tree in the operating system kernel, and the partitioning policy decision tree is implemented in the operating system kernel in algorithm form, and the decision-making unit is specifically configured to: 
         [0051]    update the categorization of each program in the working set to the operating system kernel, and search the partitioning policy decision tree in the operating system kernel for a corresponding node in light of a category of each program in the working set, to determine the page coloring-based partitioning policy corresponding to the working set. 
         [0052]    With reference to the third possible implementation manner of the second aspect, in a fourth possible implementation manner, the page coloring-based partitioning policy includes the page coloring-based collaborative partitioning policy and a page coloring-based non-collaborative partitioning policy; 
         [0053]    the page coloring-based collaborative partitioning policy is a partitioning policy of using overlapped index address bits O-bits as page coloring-based partitioning index bits, and the O-bits are overlapped address bits of index bits of the LLC and index bits of the DRAM Bank in a physical page frame, and are used to index page coloring-based partitioning for both the LLC and the DRAM Bank; and 
         [0054]    the page coloring-based collaborative partitioning policy includes: 
         [0055]    a category A multi-level memory collaborative partitioning policy A-MMCP, in which the O-bits are used as partitioning index bits, and the LLC and the DRAM Bank are partitioned into a same quantity of equal portions; 
         [0056]    a category B multi-level memory collaborative partitioning policy B-MMCP, in which the O-bits and an index bit of the DRAM Bank are used as partitioning index bits, the LLC and the DRAM Bank are partitioned into different quantities of equal portions, and a quantity of partitioned equal portions of the DRAM Bank is greater than a quantity of partitioned equal portions of the LLC; and 
         [0057]    a category C multi-level memory collaborative partitioning policy C-MMCP, in which the O-bits and an index bit of the LLC are used as partitioning index bits, the LLC and the DRAM Bank are partitioned into different quantities of equal portions, and a quantity of partitioned equal portions of the DRAM Bank is less than a quantity of partitioned equal portions of the LLC; and 
         [0058]    the page coloring-based non-collaborative partitioning policy is a partitioning policy in which the O-bits are not used and includes: 
         [0059]    a Cache-Only policy, in which coloring-based partitioning is performed on the LLC by using the index bit of the LLC, and coloring-based partitioning is not performed on the DRAM Bank; and 
         [0060]    a Bank-Only policy, in which coloring-based partitioning is performed on the DRAM Bank by using the index bit of the DRAM Bank, and coloring-based partitioning is not performed on the LLC. 
         [0061]    With reference to the third possible implementation manner of the second aspect or the fourth possible implementation manner of the second aspect, in a fifth possible implementation manner, the decision-making unit is further specifically configured to: 
         [0062]    if each category to which each program in the working set belongs is the high demand type, select the Bank-Only policy; 
         [0063]    if there is the low demand and intensive type in a category to which each program in the working set belongs, further determine a quantity of programs in the working set; and if the quantity of programs is less than or equal to N, select the A-MMCP; otherwise, select the C-MMCP, where N is a quantity of cores of a processor; or 
         [0064]    if there is the medium demand type and there is no low demand and intensive type in a category to which each program in the working set belongs, further determine a quantity of programs in the working set; and if the quantity of programs is less than or equal to N, select the A-MMCP; otherwise, select the B-MMCP, where N is a quantity of cores of a processor. 
         [0065]    According to the memory resource optimization method and apparatus provided in the embodiments of the present invention, an LLC resource is partitioned by using a page coloring technology, performance data of each program in a working set is acquired, a category of each program is obtained in light of a memory access frequency, a page coloring-based partitioning policy corresponding to the working set is selected according to the category of each program, and the page coloring-based partitioning policy is written to an operating system kernel, to complete corresponding page coloring-based partitioning processing. In this way, a collaborative partitioning policy between the LLC and a DRAM Bank is implemented in light of a feature of the working set, and mutual interference of processes or threads on a memory resource can be reduced and even eliminated, thereby improving overall performance of a computer. 
     
    
     
       BRIEF DESCRIPTION OF DRAWINGS 
         [0066]    To describe the technical solutions in the embodiments of the present invention more clearly, the following briefly introduces the accompanying drawings required for describing the embodiments or the prior art. Apparently, the accompanying drawings in the following description show merely some embodiments of the present invention, and a person of ordinary skill in the art may still derive other drawings from these accompanying drawings without creative efforts. 
           [0067]      FIG. 1  is a schematic flowchart of a memory resource optimization method according to an embodiment of the present invention; 
           [0068]      FIG. 2  is a schematic flowchart of another memory resource optimization method according to an embodiment of the present invention; 
           [0069]      FIG. 3  is a schematic diagram of a program categorization effect according to an embodiment of the present invention; 
           [0070]      FIG. 4  is schematic structural diagram  1  of a memory resource optimization apparatus according to an embodiment of the present invention; 
           [0071]      FIG. 5  is schematic structural diagram  2  of a memory resource optimization apparatus according to an embodiment of the present invention; and 
           [0072]      FIG. 6  is schematic structural diagram  3  of a memory resource optimization apparatus according to an embodiment of the present invention. 
       
    
    
     DESCRIPTION OF EMBODIMENTS 
       [0073]    The following clearly and describes the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Apparently, the described embodiments are merely some but not all of the embodiments of the present invention. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention. 
         [0074]    An embodiment of the present invention provides a memory resource optimization method. As shown in  FIG. 1 , the method includes: 
         [0075]    S 101 : Acquire performance data of each program in a working set, and categorize each program by comparing the performance data of each program and a memory access frequency, obtained by means of statistics collection, of each program with a preset threshold, where the performance data of each program is a variation that is generated when a preset performance indicator of each program varies with a capacity of an allocated last level cache LLC resource. 
         [0076]    S 102 : Select, in light of categorization of each program in the working set and a preset decision policy, a page coloring-based partitioning policy corresponding to the working set, where the page coloring-based partitioning policy includes a page coloring-based collaborative partitioning policy for performing page coloring-based partitioning on both an LLC and a dynamic random access memory bank DRAM Bank. 
         [0077]    S 103 : Write the page coloring-based partitioning policy corresponding to the working set to an operating system kernel, where the operating system kernel performs corresponding page coloring-based partitioning processing. 
         [0078]    According to the memory resource optimization method provided in this embodiment of the present invention, performance data of each program in a working set is acquired, a category of each program is obtained in light of a memory access frequency, a page coloring-based partitioning policy of the working set is selected according to the category of each program, and the page coloring-based partitioning policy is written to an operating system kernel, to complete corresponding page coloring-based partitioning processing. In this way, a collaborative partitioning policy between an LLC and a DRAM Bank is implemented in light of a feature of the working set, and mutual interference of processes or threads on a memory resource can be reduced and even eliminated, thereby improving overall performance of a computer. 
         [0079]    In order to enable a person skilled in the art to understand the technical solutions provided by the embodiments of the present invention more clearly, the following describes another memory resource optimization method provided by an embodiment of the present invention in detail by using a specific example. As shown in  FIG. 2 , the method includes: 
         [0080]    S 201 : Acquire performance data of each program in a working set. 
         [0081]    Specifically, an LLC resource is partitioned by using a page coloring technology, the LLC resource is partitioned into N portions, and 1/N of a maximum capacity of the LLC resource is taken as one level. The maximum capacity of the LLC resource is allocated to each program at the beginning, and the capacity of the LLC resource allocated to each program is decreased by one level in each adjustment, until the capacity of the LLC resource allocated to each program is decreased to 1/N of the maximum capacity of the LLC resource; a variation that is generated when a preset performance indicator of each program varies with the capacity of the allocated LLC resource in an adjustment process is monitored, and the variation is used as the performance data of each program. 
         [0082]    Exemplarily, in a quad-core processor, N may be 8, ⅛ of a maximum capacity of an LLC resource is taken as one level, a capacity of the LLC resource allocated to each program in a working set is adjusted, and the capacity of the LLC resource allocated to each program in the working set is decreased by one level in each adjustment, until the capacity of the LLC resource allocated to each program is decreased to ⅛ of the maximum capacity of the LLC resource; a variation that is generated when a preset performance indicator of each program varies with the capacity of the allocated LLC resource in the foregoing adjustment process is monitored. 
         [0083]    The preset performance indicator of each program may be a normalization speed-up ratio, the variation that is generated when the normalization speed-up ratio of each program varies with the capacity of the allocated LLC resource in the entire adjustment process is acquired, and the variation is used as the performance data of each program. 
         [0084]    S 202 : Determine a category to which each program belongs in light of a memory access frequency, obtained by means of statistics collection, of each program in the working set. 
         [0085]    Specifically, a hardware performance counter is used to count a quantity of times that each program accesses a main memory in a preset stage or time period of a running process, to obtain the memory access frequency of each program. 
         [0086]    Then, the category to which each program belongs is determined in light of the performance data of each program and the memory access frequency of each program and according to a preset threshold. 
         [0087]    The preset threshold includes a first threshold, a second threshold, and a third threshold, where the first threshold and the second threshold are performance data thresholds, and the third threshold is a memory access frequency threshold. 
         [0088]    Exemplarily, the performance data is a variation that is generated when the normalization speed-up ratio of each program varies with the capacity of the LLC resource allocated to each program. In a process in which the capacity of the LLC allocated to each program is adjusted and decreased from the maximum capacity of the LLC to 1/N of the maximum capacity of the LLC, taking a quad-core computer as an example, where N is 8, as shown in  FIG. 3 , a curve in which the normalization speed-up ratio of each program varies with the capacity of the LLC resource allocated to each program is obtained. Therefore, it may be learned that a main categorization manner is as follows: 
         [0089]    if a normalization speed-up ratio of a program is greater than the first threshold, it can be known that deterioration in performance of such a program is very considerable when the capacity of the LLC resource decreases, that is, the performance of such a program is greatly affected by the capacity of the allocated LLC resource, and such a program is categorized as a high demand type  031 ; 
         [0090]    if a normalization speed-up ratio of a program is less than the first threshold and greater than the second threshold, it can be known that deterioration in performance of such a program is moderate when the capacity of the LLC resource decreases, that is, the performance of such a program is moderately affected by the capacity of the allocated LLC resource, and such a program is categorized as a medium demand type  032 ; or 
         [0091]    if a normalization speed-up ratio of a program is less than the second threshold and a memory access frequency is greater than the third threshold, it can be known that a variation range of performance of such a program is very small when the capacity of the LLC resource decreases, and that the memory access frequency of the program is high, that is, the performance of such a program is relatively slightly affected by the capacity of the allocated LLC resource, and the program is of a low demand type  033 ; however, because the performance of such a program is greatly affected by a capacity of the main memory, the program is of a memory access intensive type; therefore, such a program is categorized as a low demand and intensive type. 
         [0092]    Exemplarily, the foregoing high demand type  031  may further specifically include last level cache fitting (LLC Fitting, LLCF) and last level cache friendly (LLC Friendly, LLCFR); the foregoing medium demand type  032  may specifically include last level cache swing (LLC Swing, LLCS); the foregoing low demand type  033  may specifically include: core cache fitting (Core Cache Fitting, CCF) and LLC thrashing (LLC Thrashing, LLCT). 
         [0093]    S 203 : Select a page coloring-based partitioning policy corresponding to the working set according to the category to which each program in the working set belongs. 
         [0094]    Specifically, the category to which each program in the working set belongs is written to an operating system kernel, and then the page coloring-based partitioning policy corresponding to the working set is selected according to a preset decision policy. 
         [0095]    The category to which each program in the working set belongs may be written to the operating system kernel by using a/proc mechanism. The preset decision policy may be a partitioning policy decision tree in the operating system kernel, and the partitioning policy decision tree is implemented in the operating system kernel in algorithm form. 
         [0096]    Specifically, categorization of each program in the working set is written to the operating system kernel, the partitioning policy decision tree in the operating system kernel is searched for a corresponding node in light of the category of each program in the working set, so as to determine the page coloring-based partitioning policy corresponding to the working set. The page coloring-based partitioning policy includes a page coloring-based collaborative partitioning policy and a page coloring-based non-collaborative partitioning policy. 
         [0097]    The page coloring-based collaborative partitioning policy is a partitioning policy of using overlapped index address bits O-bits as page coloring-based partitioning index bits, and the O-bits are overlapped address bits of index bits of the LLC and index bits of a DRAM Bank in a physical page frame, and are used to index page coloring-based partitioning for both the LLC and the DRAM Bank. 
         [0098]    The page coloring-based collaborative partitioning policy includes: 
         [0099]    a category A multi-level memory collaborative partitioning policy A-MMCP, in which the O-bits are used as partitioning index bits, and the LLC and the DRAM Bank are partitioned into a same quantity of equal portions; 
         [0100]    a category B multi-level memory collaborative partitioning policy B-MMCP, in which the O-bits and an index bit of the DRAM Bank are used as partitioning index bits, the LLC and the DRAM Bank are partitioned into different quantities of equal portions, and a quantity of partitioned equal portions of the DRAM Bank is greater than a quantity of partitioned equal portions of the LLC; and 
         [0101]    a category C multi-level memory collaborative partitioning policy C-MMCP, in which the O-bits and an index bit of the LLC are used as partitioning index bits, the LLC and the DRAM Bank are partitioned into different quantities of equal portions, and a quantity of partitioned equal portions of the DRAM Bank is less than a quantity of partitioned equal portions of the LLC. 
         [0102]    The page coloring-based non-collaborative partitioning policy is a partitioning policy in which the O-bits are not used and includes: 
         [0103]    a Cache-Only policy, in which coloring-based partitioning is performed on the LLC by using the index bit of the LLC, and coloring-based partitioning is not performed on the DRAM Bank; and 
         [0104]    a Bank-Only policy, in which coloring-based partitioning is performed on the DRAM Bank by using the index bit of the DRAM Bank, and coloring-based partitioning is not performed on the LLC. 
         [0105]    Exemplarily, the overlapped index address bits O-bits of the LLC and the DRAM Bank may be the 14 th  and 15 th  bits in the physical page frame, and four colors, that is, 00, 01, 10, and 11, may be obtained by means of partitioning by using the two index bits. Further, the 16 th  17 th  and 18 th  index bits of the LLC and the 21 th  and 22 th  index bits of the DRAM Bank also exist in the physical page frame. 
         [0106]    In the A-MMCP, coloring-based partitioning is performed only by using the O-bits, that is, the 14 th  and 15 th  bits, the LLC may be partitioned into 4 equal portions, and the DRAM Bank may be partitioned into 4 equal portions. 
         [0107]    In the B-MMCP, coloring-based partitioning is performed by using the O-bits and one of the index bits of the DRAM Bank, that is, the 14 th , 15 th , and 21 st  bits, the LLC may be partitioned into 4 equal portions, and the DRAM Bank may be partitioned into 8 equal portions. 
         [0108]    In the C-MMCP, coloring-based partitioning is performed by using the O-bits and one of the index bits of the LLC, that is, the 14 th , 15 th , and 16 th  bits, the LLC may be partitioned into 8 equal portions, and the DRAM Bank may be partitioned into 4 equal portions. 
         [0109]    Specifically, that the partitioning policy decision tree is implemented in the operating system kernel in algorithm form includes: 
         [0110]    if each category to which each program in the working set belongs is the high demand type  031 , the Bank-Only policy is selected; 
         [0111]    if there is the low demand and intensive type in a category to which each program in the working set belongs, a quantity of programs in the working set is further determined; and if the quantity of programs is less than or equal to N, the A-MMCP is selected; otherwise, the C-MMCP is selected, where N is a quantity of cores of a processor; or 
         [0112]    if there is the medium demand type  032  and there is no low demand and intensive type in a category to which each program in the working set belongs, a quantity of programs in the working set is further determined; and if the quantity of programs is less than or equal to N, the A-MMCP is selected; otherwise, the B-MMCP is selected, where N is a quantity of cores of a processor. 
         [0113]    S 204 : Write the page coloring-based partitioning policy corresponding to the working set to an operating system kernel, where the operating system kernel performs corresponding page coloring-based partitioning processing. 
         [0114]    Specifically, the selected page coloring-based partitioning policy may be written to the operating system kernel by using the/proc mechanism, and a buddy system (Buddy System) in an operating system adjusts a memory allocation mechanism, to complete a coloring-based partitioning operation. 
         [0115]    Exemplarily, a management mechanism and a retrieval mechanism in the buddy system may complete management and retrieval on a page required for coloring; the buddy system may adjust the memory allocation mechanism, to enable the memory allocation mechanism to switch among various partitioning policies. 
         [0116]    According to the memory resource optimization method provided in this embodiment of the present invention, an LLC resource is partitioned by using a page coloring technology, performance data of each program in a working set is acquired, a category of each program is obtained in light of a memory access frequency, a page coloring-based partitioning policy of the working set is selected according to the category of each program, and the page coloring-based partitioning policy is written to an operating system kernel, to complete corresponding page coloring-based partitioning processing. In this way, a collaborative partitioning policy between an LLC and a DRAM Bank is implemented in light of a feature of the working set, and mutual interference of processes or threads on a memory resource can be reduced and even eliminated, thereby improving overall performance of a computer. 
         [0117]    An embodiment of the present invention provides a memory resource optimization apparatus  00 . As shown in  FIG. 4 , the apparatus includes: 
         [0118]    a front end unit  001 , configured to acquire performance data of each program in a working set, and categorize each program by comparing the performance data of each program and a memory access frequency, obtained by means of statistics collection, of each program with a preset threshold, where the performance data of each program is a variation that is generated when a preset performance indicator of each program varies with a capacity of an allocated last level cache LLC resource; 
         [0119]    a decision-making unit  002 , configured to select, in light of categorization of each program in the working set and a preset decision policy, a page coloring-based partitioning policy corresponding to the working set, where the page coloring-based partitioning policy includes a page coloring-based collaborative partitioning policy for performing page coloring-based partitioning on both an LLC and a dynamic random access memory bank DRAM Bank; and 
         [0120]    a partitioning unit  003 , configured to write the page coloring-based partitioning policy corresponding to the working set to an operating system kernel, where the operating system kernel performs corresponding page coloring-based partitioning processing. 
         [0121]    As shown in  FIG. 5 , the front end unit  001  may include a data collecting unit  0011  and a categorizing unit  0012 . 
         [0122]    Optionally, the data collecting unit  0011  is configured to partition the LLC resource into N portions by using a page coloring technology, take 1/N of a maximum capacity of the LLC resource as one level, allocate the maximum capacity of the LLC resource to each program at the beginning, and decrease the capacity of the LLC resource allocated to each program by one level in each adjustment, until the capacity is decreased to 1/N of the maximum capacity of the LLC resource; and 
         [0123]    monitor a variation that is generated when the preset performance indicator of each program varies with the capacity of the allocated LLC resource in an adjustment process, and use the variation as the performance data of each program, where the preset performance indicator is a speed-up ratio of each program. 
         [0124]    Optionally, the categorizing unit  0012  is configured to count a quantity of times that each program accesses a main memory in a preset stage of a running process, to obtain the memory access frequency of each program; 
         [0125]    compare the performance data of each program and the memory access frequency, obtained by means of statistics collection, of each program with the preset threshold, where the preset threshold includes a first threshold, a second threshold, and a third threshold, the first threshold and the second threshold are performance data thresholds, and the third threshold is a memory access frequency threshold; and 
         [0126]    if performance data of a program is greater than the first threshold, categorize the program as a high demand type; 
         [0127]    if performance data of a program is less than the first threshold and greater than the second threshold, categorize the program as a medium demand type; or 
         [0128]    if performance data of a program is less than the second threshold and a memory access frequency is greater than the third threshold, categorize the program as a low demand and intensive type. 
         [0129]    Optionally, the preset decision policy is a partitioning policy decision tree in the operating system kernel, and the partitioning policy decision tree is implemented in the operating system kernel in algorithm form; the decision-making unit  002  is specifically configured to: 
         [0130]    write the categorization of each program in the working set to the operating system kernel, and search the partitioning policy decision tree in the operating system kernel for a corresponding node in light of a category of each program in the working set, to determine the page coloring-based partitioning policy corresponding to the working set. 
         [0131]    Optionally, the page coloring-based partitioning policy includes the page coloring-based collaborative partitioning policy and a page coloring-based non-collaborative partitioning policy, where, specifically: 
         [0132]    the page coloring-based collaborative partitioning policy is a partitioning policy of using overlapped index address bits O-bits as page coloring-based partitioning index bits, and the O-bits are overlapped address bits of index bits of the LLC and index bits of the DRAM Bank in a physical page frame, and are used to index page coloring-based partitioning for both the LLC and the DRAM Bank, where the page coloring-based collaborative partitioning policy includes: 
         [0133]    a category A multi-level memory collaborative partitioning policy A-MMCP, in 
         [0134]    which the O-bits are used as partitioning index bits, and the LLC and the DRAM Bank are partitioned into a same quantity of equal portions; 
         [0135]    a category B multi-level memory collaborative partitioning policy B-MMCP, in which the O-bits and an index bit of the DRAM Bank are used as partitioning index bits, the LLC and the DRAM Bank are partitioned into different quantities of equal portions, and a quantity of partitioned equal portions of the DRAM Bank is greater than a quantity of partitioned equal portions of the LLC; and 
         [0136]    a category C multi-level memory collaborative partitioning policy C-MMCP, in which the O-bits and an index bit of the LLC are used as partitioning index bits, the LLC and the DRAM Bank are partitioned into different quantities of equal portions, and a quantity of partitioned equal portions of the DRAM Bank is less than a quantity of partitioned equal portions of the LLC; and 
         [0137]    the page coloring-based non-collaborative partitioning policy is a partitioning policy in which the O-bits are not used and includes: 
         [0138]    a Cache-Only policy, in which coloring-based partitioning is performed on the LLC by using the index bit of the LLC, and coloring-based partitioning is not performed on the DRAM Bank; and 
         [0139]    a Bank-Only policy, in which coloring-based partitioning is performed on the DRAM Bank by using the index bit of the DRAM Bank, and coloring-based partitioning is not performed on the LLC. 
         [0140]    Optionally, the decision-making unit  002  is further specifically configured to: 
         [0141]    if each category to which each program in the working set belongs is the high demand type, select the Bank-Only policy; 
         [0142]    if there is the low demand and intensive type in a category to which each program in the working set belongs, further determine a quantity of programs in the working set; and if the quantity of programs is less than or equal to N, select the A-MMCP; otherwise, select the C-MMCP, where N is a quantity of cores of a processor; or 
         [0143]    if there is the medium demand type and there is no low demand and intensive type in a category to which each program in the working set belongs, further determine a quantity of programs in the working set; and if the quantity of programs is less than or equal to N, select the A-MMCP; otherwise, select the B-MMCP, where N is a quantity of cores of a processor. 
         [0144]    According to the memory resource optimization apparatus provided in this embodiment of the present invention, an LLC resource is partitioned by using a page coloring technology, performance data of each program in a working set is acquired, a category of each program is obtained in light of a memory access frequency, a page coloring-based partitioning policy of the working set is selected according to the category of each program, and the page coloring-based partitioning policy is written to an operating system kernel, to complete corresponding page coloring-based partitioning processing. In this way, a collaborative partitioning policy between an LLC and a DRAM Bank is implemented in light of a feature of the working set, and mutual interference of processes or threads on a memory resource can be reduced and even eliminated, thereby improving overall performance of a computer. 
         [0145]    An embodiment of the present invention further provides a memory resource optimization apparatus  01 . As shown in  FIG. 6 , the memory resource optimization apparatus  01  includes: 
         [0146]    a bus  011 , and a processor  012 , a memory  013 , and an interface  014  connected to the bus  011 , where the interface  014  is configured to communicate with an external device. 
         [0147]    The memory  013  is configured to store an instruction. The processor  012  is configured to execute the instruction, and is configured to acquire performance data of each program in a working set, and categorize each program by comparing the performance data of each program and a memory access frequency, obtained by means of statistics collection, of each program with a preset threshold, where the performance data of each program is a variation that is generated when a preset performance indicator of each program varies with a capacity of an allocated last level cache LLC resource. 
         [0148]    The processor  012  executes the instruction, and is further configured to select, in light of categorization of each program in the working set and a preset decision policy, a page coloring-based partitioning policy corresponding to the working set, where the page coloring-based partitioning policy includes a page coloring-based collaborative partitioning policy for performing page coloring-based partitioning on both an LLC and a dynamic random access memory bank DRAM Bank. 
         [0149]    The processor  012  executes the instruction, and is further configured to write the page coloring-based partitioning policy corresponding to the working set to an operating system kernel, where the operating system kernel performs corresponding page coloring-based partitioning processing. 
         [0150]    In this embodiment of the present invention, optionally, the processor  012  executes the instruction, and may be specifically configured to: partition the LLC resource into N portions by using a page coloring technology, take 1/N of a maximum capacity of the LLC resource as one level, allocate the maximum capacity of the LLC resource to each program at the beginning, and decrease the capacity of the LLC resource allocated to each program by one level in each adjustment, until the capacity is decreased to 1/N of the maximum capacity of the LLC resource; and 
         [0151]    monitor a variation that is generated when the preset performance indicator of each program varies with the capacity of the allocated LLC resource in an adjustment process, and use the variation as the performance data of each program, where the preset performance indicator is a speed-up ratio of each program. 
         [0152]    In this embodiment of the present invention, optionally, the processor  012  executes the instruction, and may be specifically configured to: count a quantity of times that each program accesses a main memory in a preset stage of a running process, to obtain the memory access frequency of each program; 
         [0153]    compare the performance data of each program and the memory access frequency, obtained by means of statistics collection, of each program with the preset threshold, where the preset threshold includes a first threshold, a second threshold, and a third threshold, the first threshold and the second threshold are performance data thresholds, and the third threshold is a memory access frequency threshold; and 
         [0154]    if performance data of a program is greater than the first threshold, categorize the program as a high demand type; 
         [0155]    if performance data of a program is less than the first threshold and greater than the second threshold, categorize the program as a medium demand type; or 
         [0156]    if performance data of a program is less than the second threshold and a memory access frequency is greater than the third threshold, categorize the program as a low demand and intensive type. 
         [0157]    In this embodiment of the present invention, optionally, the preset decision policy is a partitioning policy decision tree in the operating system kernel, and the partitioning policy decision tree is implemented in the operating system kernel in algorithm form. The processor  012  executes the instruction, and may be specifically configured to: 
         [0158]    write the categorization of each program in the working set to the operating system kernel, and search the partitioning policy decision tree in the operating system kernel for a corresponding node in light of a category of each program in the working set, to determine the page coloring-based partitioning policy corresponding to the working set. 
         [0159]    In this embodiment of the present invention, optionally, the page coloring-based partitioning policy includes the page coloring-based collaborative partitioning policy and a page coloring-based non-collaborative partitioning policy, where, specifically: 
         [0160]    the page coloring-based collaborative partitioning policy is a partitioning policy of using overlapped index address bits O-bits as page coloring-based partitioning index bits, and the O-bits are overlapped address bits of index bits of the LLC and index bits of the DRAM Bank in a physical page frame, and are used to index page coloring-based partitioning for both the LLC and the DRAM Bank, where 
         [0161]    the page coloring-based collaborative partitioning policy includes: 
         [0162]    a category A multi-level memory collaborative partitioning policy A-MMCP, in which the O-bits are used as partitioning index bits, and the LLC and the DRAM Bank are partitioned into a same quantity of equal portions; 
         [0163]    a category B multi-level memory collaborative partitioning policy B-MMCP, in which the O-bits and an index bit of the DRAM Bank are used as partitioning index bits, the LLC and the DRAM Bank are partitioned into different quantities of equal portions, and a quantity of partitioned equal portions of the DRAM Bank is greater than a quantity of partitioned equal portions of the LLC; and 
         [0164]    a category C multi-level memory collaborative partitioning policy C-MMCP, in which the O-bits and an index bit of the LLC are used as partitioning index bits, the LLC and the DRAM Bank are partitioned into different quantities of equal portions, and a quantity of partitioned equal portions of the DRAM Bank is less than a quantity of partitioned equal portions of the LLC; and 
         [0165]    the page coloring-based non-collaborative partitioning policy is a partitioning policy in which the O-bits are not used and includes: 
         [0166]    a Cache-Only policy, in which coloring-based partitioning is performed on the LLC by using the index bit of the LLC, and coloring-based partitioning is not performed on the DRAM Bank; and 
         [0167]    a Bank-Only policy, in which coloring-based partitioning is performed on the DRAM Bank by using the index bit of the DRAM Bank, and coloring-based partitioning is not performed on the LLC. 
         [0168]    In this embodiment of the present invention, optionally, the processor  012  executes the instruction, and may be specifically configured to: 
         [0169]    if each category to which each program in the working set belongs is the high demand type, select the Bank-Only policy; 
         [0170]    if there is the low demand and intensive type in a category to which each program in the working set belongs, further determine a quantity of programs in the working set; and if the quantity of programs is less than or equal to N, select the A-MMCP; otherwise, select the C-MMCP, where N is a quantity of cores of a processor; or 
         [0171]    if there is the medium demand type and there is no low demand and intensive type in a category to which each program in the working set belongs, further determine a quantity of programs in the working set; and if the quantity of programs is less than or equal to N, select the A-MMCP; otherwise, select the B-MMCP, where N is a quantity of cores of a processor. 
         [0172]    According to the memory resource optimization apparatus provided in this embodiment of the present invention, an LLC resource is partitioned by using a page coloring technology, performance data of each program in a working set is acquired, a category of each program is obtained in light of a memory access frequency, a page coloring-based partitioning policy of the working set is selected according to the category of each program, and the page coloring-based partitioning policy is written to an operating system kernel, to complete corresponding page coloring-based partitioning processing. In this way, a collaborative partitioning policy between an LLC and a DRAM Bank is implemented in light of a feature of the working set, and mutual interference of processes or threads on a memory resource can be reduced and even eliminated, thereby improving overall performance of a computer. 
         [0173]    In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the described apparatus embodiments are merely exemplary. For example, the module division is merely logical function division, and there may be other division manners in actual implementation. In addition, the displayed or discussed connections between modules may be implemented by using some interfaces, and may be implemented in electronic, mechanical, or other forms. 
         [0174]    The modules may or may not be physically separate, and may or may not be physical units. Some or all of the modules may be selected according to actual requirements to achieve the objectives of the solutions of the embodiments. 
         [0175]    In addition, functional modules in the embodiments of the present invention may be integrated into one processing module, or each of the modules may exist alone physically, or two or more modules are integrated into one module. The integrated module may be implemented in a form of hardware, or may be implemented in a form of hardware in addition to a software functional module. 
         [0176]    When the foregoing integrated module is implemented in a form of a software functional unit, the integrated unit may be stored in a computer-readable storage medium. The software functional module is stored in a storage medium and includes several instructions for instructing a computer device (which may be a personal computer, a server, or a network device) to perform some of the steps of the methods described in the embodiments of the present invention. The foregoing storage medium includes: any medium that can store program code, such as a USB flash drive, a removable hard disk, a read-only memory (Read-Only Memory, ROM), a random access memory (Random Access Memory, RAM), a magnetic disk, or an optical disc. 
         [0177]    The foregoing descriptions are merely specific implementation manners of the present invention, but are not intended to limit the protection scope of the present invention. Any variation or replacement readily figured out by a person skilled in the art within the technical scope disclosed in the present invention shall fall within the protection scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.