KR20170122088A - Method and apparatus for processing memory object on non-volatile memory - Google Patents

Abstract

Disclosed are a method and apparatus for processing a memory object on a nonvolatile memory. The disclosed method for processing a memory object includes the steps of: checking a memory cache list stored in the nonvolatile memory based on an allocation request for the memory object; checking a first structure which is connected to the memory cache list and is included in a first page; and determining whether the allocation of the memory object is possible in a second page corresponding to a second structure by checking the second structure included in the first page based on the first structure. And, the first page and the second page are stored in the nonvolatile memory. Accordingly, the present invention can persistently store the memory object in the nonvolatile memory.

Description

[0001] METHOD AND APPARATUS FOR PROCESSING MEMORY OBJECT ON NON-VOLATILE MEMORY [0002]

The following description relates to a memory object processing method and a memory object processing apparatus on a nonvolatile memory, and more particularly, to a memory object processing method and a memory object processing apparatus using a page including one or more structures allocated on a nonvolatile memory and a page including one or more memory objects To a method and apparatus capable of processing a memory object on a non-volatile memory.

The computing system preallocates and uses memory objects that are frequently allocated or released in units of pages. These computing systems use slap memory allocators to cache memory objects.

However, in the slap memory allocator, a memory object to be cached and a structure of metadata for managing the memory object are located in the volatile memory. In the conventional memory object caching technique, the slap memory allocator can not be used when the memory object is cached in the nonvolatile memory.

If allocation or freeing of a frequent memory object occurs and the memory object that the data should hold even after the system is rebooted is cached in the volatile memory, persistence to the memory object can not be guaranteed. Accordingly, there is a demand for a method that can easily perform caching of a memory object while guaranteeing the durability of the memory object.

The present invention provides a method and system for caching a memory object in a non-volatile memory by using a page containing one or more structures and a page containing one or more memory objects to cache memory objects in non-volatile memory, The object can be persistently stored in non-volatile memory.

The present invention can efficiently cache data objects in a nonvolatile memory by processing a memory object using a bitmap instead of an existing slab cache allocation scheme.

The present invention relates to an apparatus and a method for allocating or releasing a memory object frequently in a nonvolatile memory area, software that requires memory object management to maintain a memory object even when the system is restarted, A memory object caching technique can be implemented.

The present invention enables persistent storage of persistent data objects even if the system is restarted by persisting the structure for managing data objects in a form suitable for non-volatile memory.

A method of processing a memory object according to an exemplary embodiment includes: checking a memory cache list stored in a non-volatile memory based on an allocation request for a memory object; Identifying a first structure associated with the memory cache list and included in a first page; And determining whether allocation of the memory object to a second page corresponding to the second structure is possible by checking a second structure included in the first page based on the first structure, The first page and the second page may be stored in the nonvolatile memory.

In a method of processing a memory object according to an embodiment, the first structure includes data for the second structure on the first page, and the second structure includes data on one or more memory objects And may include data for the included page.

The memory object processing method according to an embodiment updates a bitmap of the second structure indicating a free space of a second page to which the memory object is to be allocated when the memory object can be allocated to the second page, And returning an address for the space.

The memory object processing method according to an embodiment may further include storing the memory object in the free space of the second page.

The method may further include allocating a third page to the non-volatile memory, the third page being capable of storing one or more memory objects if the second page is not allocatable to the memory object; And returning an address of the free space of the third page to which the memory object is to be allocated.

The method of processing a memory object according to an embodiment may include allocating a third structure for managing the third page to the first page and updating the bitmap of the first structure based on the space allocated for the third structure Step < / RTI >

The memory object processing method according to an embodiment allocates, to the non-volatile memory, a fourth page capable of storing one or more structures when a third structure for managing the third page can not be allocated to the first page step; And assigning the third structure to the fourth page and updating the bitmap of the fourth structure included first in the fourth page based on the space allocated by the third structure have.

In the method of processing a memory object according to an exemplary embodiment, the first structure included first in the first page and the fourth structure included first in the fourth page may be connected to each other through the memory cache list.

In a method of processing a memory object according to an embodiment, the memory cache list may be stored in a super block of the non-volatile memory.

In a method of processing a memory object according to an embodiment, the first structure may include a type of a second structure stored in the first page, an address of the first page in the non-volatile memory, and a second structure stored in the first page, And a bitmap.

In a method of processing a memory object according to an embodiment, the second structure includes a type of a data object stored in the second page, an address of a second page in the nonvolatile memory, and a bitmap Or the like.

According to one embodiment, a memory object processing apparatus includes a processor for processing a memory object, the processor for identifying a memory cache list stored in a non-volatile memory based on an allocation request for the memory object, Identifying a first structure included in the first page linked to the first page and identifying a second structure included in the first page based on the first structure, , And the first page and the second page may be stored in the nonvolatile memory.

In the apparatus for processing a memory object according to an embodiment, the first structure includes data for the second structure on the first page, and the second structure is divided from the first page and includes one or more memory objects And may include data for the included page.

In a memory object processing apparatus according to an embodiment, when the memory object is allocatable to the second page, the processor allocates a bitmap of the second structure indicating a free space of a second page to which the memory object is allocated And can return an address for the free space.

In a memory object processing apparatus according to an embodiment, the processor may permanently store the memory object in the free space of the second page.

In a memory object processing apparatus according to an embodiment, the processor allocates to the non-volatile memory a third page capable of storing one or more memory objects when allocation of the memory object to the second page is not possible, The address of the free space of the third page to which the memory object is to be allocated.

According to one embodiment, by using a page containing one or more structures and a page containing one or more memory objects to cache memory objects in non-volatile memory, a slab allocator for caching of memory objects on non- Memory objects can be stored persistently in non-volatile memory.

According to one embodiment, software that frequently needs to be allocated or released for a memory object in a non-volatile memory area, memory object management that maintains memory objects even when the system is restarted, and software that requires such allocators to use slabs and files It is possible to implement a memory object caching technique.

According to one embodiment, persistence of a structure for managing a data object in a form suitable for non-volatile memory allows access to persistently stored data objects even when the system is restarted.

According to an exemplary embodiment, a data object can be effectively cached in a non-volatile memory through a method of processing a memory object using a bitmap instead of an allocation method using an existing slab cache.

1 is a diagram for explaining a structure of a nonvolatile memory according to an embodiment.
FIG. 2 is a view for explaining a memory cache list according to an embodiment.
3 is a diagram for describing a second structure for managing a page including a memory object according to an embodiment.
4 is a diagram illustrating a process of allocating a memory object to a new page according to an embodiment of the present invention.
5 is a diagram illustrating a process of allocating a memory object to a new page according to another embodiment of the present invention.
FIG. 6 illustrates a method of processing a memory object according to an exemplary embodiment. Referring to FIG.

Specific structural or functional descriptions of embodiments are set forth for illustration purposes only and may be embodied with various changes and modifications. Accordingly, the embodiments are not intended to be limited to the particular forms disclosed, and the scope of the disclosure includes changes, equivalents, or alternatives included in the technical idea.

The terms first or second, etc. may be used to describe various elements, but such terms should be interpreted solely for the purpose of distinguishing one element from another. For example, the first component may be referred to as a second component, and similarly, the second component may also be referred to as a first component.

It is to be understood that when an element is referred to as being "connected" to another element, it may be directly connected or connected to the other element, although other elements may be present in between.

The singular expressions include plural expressions unless the context clearly dictates otherwise. In this specification, the terms "comprises ", or" having ", and the like, are used to specify one or more of the described features, numbers, steps, operations, elements, But do not preclude the presence or addition of steps, operations, elements, parts, or combinations thereof.

Unless otherwise defined, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art. Terms such as those defined in commonly used dictionaries are to be interpreted as having a meaning consistent with the meaning of the context in the relevant art and, unless explicitly defined herein, are to be interpreted as ideal or overly formal Do not.

The embodiments described below can be used to process memory objects. The operations to process a memory object may include at least one of allocating a memory object, freeing a memory object, and caching a memory object. Embodiments may be implemented in a variety of products, such as personal computers, laptop computers, tablet computers, smart phones, wearable devices, smart home appliances, and intelligent automobiles. For example, embodiments may be applied to processing memory objects in personal computers, laptop computers, smart phones, and the like. Hereinafter, embodiments will be described in detail with reference to the accompanying drawings. Like reference symbols in the drawings denote like elements.

1 is a diagram for explaining a structure of a nonvolatile memory according to an embodiment.

There are volatile memory and nonvolatile memory as types of memory that can store data. Volatile memory is a memory that requires continuous power supply to maintain stored data. On the other hand, non-volatile memory is a memory that does not require continuous power supply, and can retain stored data even if the power supply is interrupted. That is, the nonvolatile memory can maintain the stored data even if the system is shut down or restarted, but in the case of volatile memory, the stored data is lost when the system is shut down or restarted.

The memory object may contain data generated by a user application program. In general, these memory objects may be allocated or freed frequently. Therefore, when such a memory object is allocated to a non-volatile memory other than a volatile memory, there is no possibility that the allocated memory object is lost even if the system is shut down or restarted, and the allocated memory object can be maintained even if the power supply is interrupted .

A process of allocating a memory object to a nonvolatile memory will be described with reference to FIG.

Referring to FIG. 1, a non-volatile memory 100 including one or more pages 120, 130, 150 is shown.

The non-volatile memory 100 may include a memory object list 110, a plurality of pages 120, 130 and 150 as a memory capable of holding stored data even if the power supply is interrupted as described above . In FIG. 1, which is illustratively shown, volatile memory is not directly shown, but may be used with non-volatile memory 100, or may only process memory objects using non-volatile memory 100.

First, when an allocation request for a memory object occurs, the memory object list 110 included in the nonvolatile memory 100 can be referred to.

The memory object list 110 may be stored in non-volatile memory 100 and may be linked to a page containing one or more structures. The memory object list 110 may be included in a superblock of the nonvolatile memory 100. [ Superblock is a root data structure for persistent object management in the kernel area. It can access all data structures that manage persistent objects. The super block according to an embodiment may be fixedly allocated to the first page of the non-volatile memory 100. [

Through the memory object list 110, to a page containing one or more structures.

Non-volatile memory 100 may include a page (e.g., page 120, page 150, etc. in Figure 1) and one or more pages that contain one or more data objects Second page 130, etc.) may be included.

Referring to FIG. 1, which is illustratively shown, a first page 120 and a fourth page 150 are illustrated as pages comprising one or more structures. Hereinafter, for convenience of explanation, the first page 120 will be mainly described. However, the description of the first page 120 may be applied to the fourth page 150 without limitation.

The structure contained in the first page 120 may include, for example, data for another structure or data for a page including one or more memory objects as metadata. In other words, there is a structure in the structure that manages another structure, and a structure that manages pages that contain one or more memory objects.

Based on such a structure, the first page 120 may be divided into a first structure and a remaining structure (e.g., a second structure, a third structure, etc.).

Here, the first structure may be the first structure included in the first page 120, and may include data on the remaining structures included in the first page 120. The first structure may be used when assigning or releasing a structure to the first page 120. For example, the first structure may include the type of the remaining structure in which the first page 120 is stored, the address of the first page 120 in the non-volatile memory 100, and the bit for the remaining structure stored in the first page 120, And a map.

The remaining structures are structures stored in the first page 120, excluding the first structure, and may include data for pages including one or more memory objects. Each of the remaining structures may uniquely correspond to a page containing one or more memory objects and may contain data for a corresponding page. For example, each of the remaining spheres may include at least one of a type of a data object contained in a corresponding page, an address of a corresponding page, and a bitmap for a memory object stored in a corresponding page. In other words, one page containing one or more memory objects may be managed by one structure.

For example, the second structure included in the first page 120 corresponds to the second page 130, which includes one or more memory objects, and may include data for the second page 130. [ In addition, the third structure corresponds to another page including one or more memory objects, and may include data for the page.

Second page 130 is a page containing one or more data objects, for example one or more memory objects of the same type may be included. The data objects contained in the second page 130 may be allocated or released on request.

Fourth page 150 represents a page comprising one or more structures. Likewise, the fourth structure, which is included first in the fourth page 150, may include data for the remaining structures included in the fourth page 150. That is, the fourth structure may manage the remaining structures included in the fourth page 150. [ The rest of the structure uniquely corresponds to the page containing the one or more data objects, and may include data for the corresponding page.

Here, each of the first structure and the fourth structure is a structure including data on the remaining structures included in the page, and may be connected to each other. For example, the first structure and the fourth structure may be connected to each other through the memory cache list 110. By connecting the structures including the data for the remaining structures to each other, the memory object list 110 can access all the structures including the data for the remaining structures stored in the non-volatile memory 100, It is possible to access the remaining structures including the data on the page including the data object, and furthermore, it is possible to access the data object included in the page.

According to one embodiment, a page containing one or more structures assigned to the non-volatile memory 100 and a page containing one or more object data are prohibited from being reallocated to the page so that they can not be used for other purposes even if the system is restarted . Thus, a page that permanently stores a memory object or a page that permanently stores a structure may hold a memory object or structure stored in the page until the page is released.

For example, when a system (e.g., operating system) is started, the super block stored in the first page of non-volatile memory 100 may be identified. Through the magic number of the superblock, it can be confirmed whether or not the object management data structure exists. If the object management data structure exists, the process of initializing the data structure is not performed. Then, by checking the pages where the data structure is stored, the pages can be removed from the free page list so that they are not reassigned. The above-described series of operations can be performed by a Heap-based persistent object store (HEAPO).

More specifically, the process of allocating a data object to the nonvolatile memory 100 having the above-described structure can be performed as follows.

When an allocation request for a data object occurs according to an embodiment, the memory object list 110 included in the nonvolatile memory 100 can be identified. Then, through the memory object list 110, the first structure of the first page 120 including one or more structures can be identified. It is also possible to determine whether a data object can be allocated to a page including one or more data objects corresponding to each of the remaining structures included in the first page 120 through the first structure.

For example, referring to the second structure included in the first page 120, it can be determined whether or not the allocation of the data object to the second page 130 corresponding to the second structure is possible. If it is not possible to allocate a data object to the second page 130, it can additionally determine whether the allocation of the data object to the page corresponding to the third structure is possible by referring to the third structure.

Conversely, if it is possible to allocate a data object to the second page 130, the bitmap of the second structure indicating the free space of the second page 130 to which the memory object is to be allocated is updated, Addresses for free space can be returned.

The memory object may then be permanently stored in the free space of the second page 130 based on the returned address.

FIG. 2 is a view for explaining a memory cache list according to an embodiment.

Referring to FIG. 2, an example of a memory cache list is shown.

The memory cache list may include a header associated with the first structure of a page containing one or more structures. The header of the memory cache list is included in the super block, where the header may be concatenated with the first structure of the first page 120. The header consists of an array ([0], [1], [2], ..., [n-1]). Elements of each array can correspond to different types of memory object list headers.

The memory cache list can access all the pages where the structure is stored by traversing the elements of the array one by one through the header. You can find the elements of the array where there is free space available to allocate memory objects within the corresponding page by checking the bitmap while traversing the elements of the array.

3 is a diagram for describing a second structure for managing a page including a memory object according to an embodiment.

Referring to Figure 3, an example of a second structure is shown.

The second structure is a structure included in the first page 120, which is illustratively shown in FIG. 1, and may include data for a second page 130 that includes one or more memory objects. For example, in the second structure, at least one of the type of the data object included in the second page 130, the address of the corresponding second page 130, and the bitmap for the memory object stored in the second page 130 . ≪ / RTI >

In particular, the bitmap included in the second structure may indicate whether or not the memory object is stored in the space included in the second page 130. For example, '1' in the bitmap indicates that a memory object is allocated in the corresponding space, and '0' indicates that no memory object is allocated in the corresponding space. Thus, by checking the bitmap of the second structure, it is easy to know whether or not a new data object can be allocated to the second page 130 managed by the second structure. In other words, the allocation and release of a memory object for a page containing one or more data objects can be performed through a bitmap of the structure that manages the page.

4 is a diagram illustrating a process of allocating a memory object to a new page according to an embodiment of the present invention.

Referring to FIG. 4, there is shown an example of a process of allocating a memory object to a new page when there is no space available for allocating a memory object to an existing page.

When an allocation request for a data object occurs according to an embodiment, the memory object list 110 included in the nonvolatile memory 100 can be identified. By searching the headers contained in the memory object list 110, one or more structures can be linked to the first structure of the included page. For example, the first structure contained in the first page 120, which is connected from the memory object list 110, can be identified. It can be determined whether allocation to the data object is possible on the page corresponding to the remaining structure (for example, the second structure, the third structure, etc.) included in the first page 120 through the first structure.

If allocation for a data object is not possible, a third page 140, which may store one or more memory objects, may be allocated to the non-volatile memory 100. An address for the free space of the third page 140 is then returned, and the memory object may be stored persistently in the third page 140 accordingly.

A third structure including data for the newly allocated third page 140 may be assigned to the first page 120. [ As the third structure is newly allocated to the first page 120, data for the third structure may be added to the first structure of the first page 120. [ In other words, the bitmap of the first structure may be updated based on the space allocated to the third structure.

5 is a diagram illustrating a process of allocating a memory object to a new page according to another embodiment of the present invention.

Referring to FIG. 5, another example of a process of allocating a memory object to a new page when there is no free space to allocate a memory object to an existing page is shown.

As in the case of FIG. 4, a third page 140 may be allocated to the non-volatile memory 100 based on an allocation request for a data object, according to one embodiment. An address for the free space of the third page 140 is then returned, and the memory object may be stored persistently in the third page 140 accordingly.

However, if there is no space available for allocating the third structure including the data for the third page 140 newly allocated to the first page 120, the fourth page 150 including one or more structures may be used as the non- Volatile memory 100 as shown in FIG. A fourth structure including data on another structure to be included in the fourth page 150 may be allocated to the fourth page 150. [ In other words, a fourth structure that manages another structure to be included in the fourth page 150 may be allocated to the fourth page 150. [ Here, the fourth structure, which is included first in the fourth page 150, may be connected to the first structure included in the first page 120 first. Thus, the memory object list may also be concatenated into the fourth structure of the newly allocated fourth page 150.

Then, a third structure including data for the third page 140 is allocated to the fourth page 150, and the fourth structure may be updated based on the allocation of the third structure. The bitmap of the fourth structure may be updated based on the space allocated to the third structure.

FIG. 6 illustrates a method of processing a memory object according to an exemplary embodiment. Referring to FIG.

Referring to FIG. 6, a method of processing a memory object performed by a processor of a memory object processing apparatus according to an embodiment is shown.

In step 610, the memory object processing device checks the memory cache list stored in the non-volatile memory based on the allocation request for the memory object. The memory cache list may be stored in a super block of non-volatile memory.

At step 620, the memory object processing device concatenates with the memory cache list and identifies the first structure contained in the first page.

In step 630, the memory object processing apparatus determines whether allocation of the memory object to the second page corresponding to the second structure is possible by checking the second structure included in the first page based on the first structure.

The first structure may include data for a second structure on a first page and the second structure may include data for a page that is distinct from the first page and includes one or more memory objects. The first structure may include at least one of a type of the second structure stored in the first page, an address of the first page in the nonvolatile memory, and a bitmap for the second structure stored in the first page. The second structure may include at least one of a type of the data object stored in the second page, an address of the second page in the non-volatile memory, and a bit map for the memory object stored in the second page.

If it is possible to allocate a memory object to the second page, then in step 640 the memory object processing device may persistently store the memory object in the free space of the second page. The memory object processing apparatus can update the bitmap of the second structure indicating the free space of the second page to which the memory object is to be allocated and return the address for the free space when the memory object can be allocated to the second page.

If it is not possible to allocate a memory object to the second page, then in step 650 the memory object processing apparatus may allocate to the non-volatile memory a third page capable of storing one or more memory objects. Then, the memory object processing apparatus can return the address of the free space of the third page to which the memory object is to be allocated. Then, the memory object processing apparatus can allocate the third structure for managing the third page to the first page, and update the bitmap of the first structure based on the allocated space of the third structure.

If the third structure managing the third page can not be allocated to the first page, the memory object processing apparatus can allocate to the nonvolatile memory a fourth page capable of storing one or more structures. Then, the memory object processing apparatus can allocate the third structure to the fourth page, and update the bitmap of the fourth structure included in the fourth page based on the allocated space of the third structure.

The first structure included first on the first page and the fourth structure included first on the fourth page may be connected to each other through the memory cache list.

The steps described above with reference to FIGs. 1 through 5 are applied to each step shown in FIG. 6 as it is, and a detailed description will be omitted.

The embodiments described above may be implemented in hardware components, software components, and / or a combination of hardware components and software components. For example, the devices, methods, and components described in the embodiments may be implemented within a computer system, such as, for example, a processor, a controller, an arithmetic logic unit (ALU), a digital signal processor, such as an array, a programmable logic unit (PLU), a microprocessor, or any other device capable of executing and responding to instructions. The processing device may execute an operating system (OS) and one or more software applications running on the operating system. The processing device may also access, store, manipulate, process, and generate data in response to execution of the software. For ease of understanding, the processing apparatus may be described as being used singly, but those skilled in the art will recognize that the processing apparatus may have a plurality of processing elements and / As shown in FIG. For example, the processing unit may comprise a plurality of processors or one processor and one controller. Other processing configurations are also possible, such as a parallel processor.

The software may include a computer program, code, instructions, or a combination of one or more of the foregoing, and may be configured to configure the processing device to operate as desired or to process it collectively or collectively Device can be commanded. The software and / or data may be in the form of any type of machine, component, physical device, virtual equipment, computer storage media, or device , Or may be permanently or temporarily embodied in a transmitted signal wave. The software may be distributed over a networked computer system and stored or executed in a distributed manner. The software and data may be stored on one or more computer readable recording media.

The method according to an embodiment may be implemented in the form of a program command that can be executed through various computer means and recorded in a computer-readable medium. The computer-readable medium may include program instructions, data files, data structures, and the like, alone or in combination. The program instructions to be recorded on the medium may be those specially designed and configured for the embodiments or may be available to those skilled in the art of computer software. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape; optical media such as CD-ROMs and DVDs; magnetic media such as floppy disks; Magneto-optical media, and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those produced by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like. The hardware devices described above may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.

Although the embodiments have been described with reference to the drawings, various technical modifications and variations may be applied to those skilled in the art. For example, it is to be understood that the techniques described may be performed in a different order than the described methods, and / or that components of the described systems, structures, devices, circuits, Lt; / RTI > or equivalents, even if it is replaced or replaced.

100: Nonvolatile memory
110: Memory object list
120: 1st page
130: Page 2
150: Page 3

Claims (16)

Identifying a memory cache list stored in a non-volatile memory based on an allocation request for the memory object;
Identifying a first structure associated with the memory cache list and included in a first page; And
Determining whether allocation of the memory object to a second page corresponding to the second structure is possible by identifying a second structure included in the first page based on the first structure
Lt; / RTI >
Wherein the first page and the second page are stored in the non-volatile memory. The method according to claim 1,
Wherein the first structure includes data for the second structure on the first page,
The second structure may include:
And data for the page separated from the first page and comprising one or more memory objects. The method according to claim 1,
Updating a bitmap of the second structure indicating a free space of a second page to which the memory object is to be allocated and returning an address for the free space when the memory object can be allocated to the second page
Further comprising the steps of: The method of claim 3,
Permanently storing the memory object in the free space of the second page
Further comprising the steps of: The method according to claim 1,
Assigning to the non-volatile memory a third page capable of storing one or more memory objects if the second page is not allocatable to the memory object; And
Returning an address for a free space of a third page to which the memory object is to be allocated
Further comprising the steps of: 6. The method of claim 5,
Allocating a third structure for managing the third page to the first page and updating a bitmap of the first structure based on the space allocated for the third structure
Further comprising the steps of: 6. The method of claim 5,
Allocating to the non-volatile memory a fourth page capable of storing one or more structures when the third structure managing the third page can not be allocated to the first page; And
Assigning the third structure to the fourth page, and updating the bitmap of the fourth structure included first in the fourth page based on the space allocated by the third structure
Further comprising the steps of: 8. The method of claim 7,
Wherein a first structure included first in the first page and a fourth structure included first in the fourth page are connected to each other through the memory cache list. The method according to claim 1,
Wherein the memory cache list is stored in a super block of the non-volatile memory. The method according to claim 1,
The first structure may include:
The type of the second structure stored in the first page, the address of the first page in the non-volatile memory, and the bitmap for the second structure stored in the first page. The method according to claim 1,
The second structure may include:
A type of data object stored in the second page, an address of a second page in the non-volatile memory, and a bit map for a memory object stored in the second page. Processor for processing memory objects
Lt; / RTI >
The processor comprising:
Identifying a memory cache list stored in a non-volatile memory based on an allocation request for the memory object, identifying a first structure associated with the memory cache list and included in a first page, Determining whether allocation of the memory object is possible to a second page corresponding to the second structure by checking the second structure included in the first page,
Wherein the first page and the second page are stored in the non-volatile memory. 13. The method of claim 12,
Wherein the first structure includes data for the second structure on the first page,
The second structure may include:
And data for the page separated from the first page and comprising one or more memory objects. 13. The method of claim 12,
The processor comprising:
Updating a bitmap of the second structure indicating a free space of a second page to which the memory object is to be allocated and returning an address for the free space when the memory object can be allocated to the second page, Processing device. 15. The method of claim 14,
The processor comprising:
And permanently stores the memory object in the free space of the second page. 13. The method of claim 12,
The processor comprising:
Allocating to the non-volatile memory a third page capable of storing one or more memory objects if the allocation of the memory object to the second page is not possible,
And returns an address for free space of a third page to which the memory object is to be allocated.

Images