WO2017188484A1

WO2017188484A1 - Memory management method, computer program therefor, and rrecording medium therefor

Info

Publication number: WO2017188484A1
Application number: PCT/KR2016/004524
Authority: WO
Inventors: 김대현
Original assignee: 주식회사 울프슨랩
Priority date: 2016-04-29
Filing date: 2016-04-29
Publication date: 2017-11-02

Abstract

The present invention relates to a memory management method, a computer program therefor, and a recording medium therefor. According to one aspect of the present invention, disclosed is a memory management method by which a computing means manages a memory state change involved in the performance of a transaction of an application program, comprising the steps of; 1) storing, in a first file of an auxiliary memory device, at least one memory page allocated for an object and keeping data on a location reference of the first file as a transaction record; 2) performing a first transaction for the object; 3) comparing a second hash code, generated for each memory page after performing the first transaction, with a first hash code generated for each memory page stored in the first file, so as to detect a memory page having a changed memory state; 4) generating conversion data for the memory page detected, in step 3), as having a changed memory state, storing the generated conversion data in a second file of the auxiliary memory device, and keeping data on a location reference of the second file as a transaction record; and 5) updating and storing, in the first file of the auxiliary memory device, the memory page detected, in step 3), as having a changed memory state.

Description

Memory management method, computer program, recording medium therefor

The present invention relates to a memory management method, a computer program for the same, and a recording medium thereof, wherein the memory management associated with performing various transactions when the application program is executed using a computing means is performed in association with an auxiliary storage device. The present invention relates to a memory management method configured to reduce the use of memory resources required for providing an undo and redo function, a computer program therefor, and a recording medium thereof.

When an application program for an authoring tool, such as CAD, is executed on a computing means, the computing means writes the data of the authored object into memory and the object's attributes (e.g., shape, size, position, orientation, etc.) When the data is changed (eg, generated, modified, or deleted) in response to the computing means, the data recorded in the memory is changed and managed.

For example, when drawing a circle as an object through a CAD operation, the center coordinates and the radius data are recorded in the memory for the first drawn circle, and the center coordinates or the radius by the user's manipulation input. In the event that a change occurs, the recorded data is changed and managed.

Such application programs for authoring tools are generally provided with user interfaces such as undo and redo functions for user convenience.

In order to provide an undo and redo function, a user operation input stored before and after the execution of the undo or redo function is conventionally used to perform reverse execution, or Techniques for remembering and using memory state changes before and after executing an undo or redo function have been proposed in a memory in which data about an object is stored.

For example, US Patent No. 6,618,851 (Registration Date 2003.09.09.) Proposes a configuration that stores and uses memory state changes before and after a transaction in order to provide an undo and redo function. It was.

In the above-described conventional technology, the memory area is protected and a change in the memory state is detected by using an exception handler provided by the OS to determine whether a change in the memory area occurs.

However, in the above-described conventional technology, since the detection of the memory state change according to the transaction execution is executed at the OS level instead of the application program level, it is complicated to implement the API for the OS in the process of implementing the function for detecting the memory state change. There was a limitation that the interworking process is required.

Meanwhile, an object generated by an application program for an authoring tool such as CAD is defined as a modeling object in two or three dimensions, and a large amount of data is required to define or change a single object.

As a result, when undo and redo functions are executed, a large amount of memory resources are required in the process of writing the difference data before and after the change of an object to memory, thereby providing an undo / redo. There were many constraints on increasing the number of times.

SUMMARY OF THE INVENTION The present invention has been made in view of the above-described problems, and by undoing and resuming the memory management associated with execution of various transactions at the time of execution of an application program using a computing means to be performed in conjunction with an auxiliary storage device, It is an object of the present invention to provide a memory management method, a computer program, and a recording medium configured to reduce the use of memory resources required for providing a redo function.

According to an aspect of the present invention for achieving the above object, a method for managing a memory state change associated with the execution of a transaction of the application program in the computing means, 1) the at least one memory page allocated to the object auxiliary storage device Storing in a first file of the data file a transaction record, the data relating to a location reference of the first file; 2) performing a first transaction on the object; 3) a memory in which a memory state is converted by comparing a second hash code generated for each memory page after execution of the first transaction with a first hash code generated for each memory page stored in the first file. Detecting a page; 4) Generates converted data for the memory page detected as having changed the memory state in step 3), and stores the converted data in a second file of the auxiliary storage device, and stores data regarding a location reference of the second file as a transaction record. Doing; And 5) updating and storing the memory page detected as having been changed in the memory state in the first file of the auxiliary storage device in step 3).

Preferably, in the present invention, 6) when a request for returning to the state before the execution of the first transaction is input, the second file is read with reference to the transaction record, and the memory is based on the converted data stored in the second file. Returning a page to a memory state equivalent to that before the first transaction; And 7) updating and storing the memory page in which the memory state is returned in step 6) in a first file of the auxiliary storage device.

Preferably, before the step 1), when the PS1) object creation request is input, allocating at least one memory page for the requested object; further comprises.

Preferably, the hash code and the transaction record is kept in memory.

Preferably, the transaction is performed by a user input to the application program or a response of the application program accordingly.

Preferably, in step 4), the converted data is page difference data between data written in the memory page before conversion and data written in the memory page after conversion.

Preferably, in step 4), the converted data is stored in the second file in a compressed state.

Preferably, the present invention further comprises: 8) re-performing the first transaction for the object based on the re-execution request, further comprising the steps 3) to 5) based on the re-executed first transaction. It is characterized by executing.

Preferably, the present invention further includes, after step 5) or step 7), 9) additionally performing at least one transaction for the object, based on the additionally performed transaction; And at least one of step 5), or steps 6) to 7), or step 8).

Preferably, the second file stores and manages each converted data generated as a result of each transaction in a stack structure based on a transaction execution order.

The second file is to delete-manage the converted data located above the current pointer among the converted data stored and managed in the stack structure. The current pointer is directly required to return the memory page of the most recently performed transaction. Indicates the location of the data.

Advantageously, said transaction record further comprises: an address of said first file or second file in auxiliary storage, offset data of converted data stored in a memory page or second file stored in said first file, and And at least one of a memory page stored in the first file or a size of the converted data stored in the second file.

Preferably, the application program is a CAD program, and the object is characterized in that one geometric unit object or a combination object combined with one or more unit objects generated by the execution of the CAD program.

Preferably, the first hash code is generated in step 1) or step 3).

Preferably, the auxiliary memory device is a memory device using a semiconductor memory element.

According to another aspect of the present invention, a computer program stored in a recording medium in combination with hardware to execute the memory management method is disclosed.

According to yet another aspect of the present invention, a computer-readable recording medium having a computer program recorded thereon for executing the memory management method is disclosed.

The present invention has the advantage of reducing the use of memory resources required to provide the undo and redo functions when executing the application program using the computing means.

In particular, the present invention provides a method for undoing and redoing a transaction in an authoring tool in which a large amount of memory resources are used for object modeling, such as CAD, by reducing the use of memory resources. The advantage is that the number of provisions can be greatly increased.

In addition, since the present invention uses a hash function generated from a memory page to detect a change in memory state according to a transaction, a complex interworking process such as OS level function call or API interworking is not required. have.

1 is a block diagram of a computing means for executing an application program according to an embodiment of the present invention,

2 is a schematic diagram for explaining the concept of a transaction according to an embodiment of the present invention,

3 is a flowchart of a memory management method according to an embodiment of the present invention;

4 is a view for explaining a memory and file state change in accordance with the flow of the memory management method according to an embodiment of the present invention;

FIG. 5 is a diagram illustrating a memory and file state change according to a flow of a memory management method according to another exemplary embodiment of the present invention.

The present invention can be embodied in many other forms without departing from the spirit or main features thereof. Therefore, the embodiments of the present invention are merely examples in all respects and should not be interpreted limitedly.

Terms such as first and second may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another. For example, without departing from the scope of the present invention, the first component may be referred to as the second component, and similarly, the second component may also be referred to as the first component. The term and / or includes a combination of a plurality of related items or any item of a plurality of related items.

When a component is referred to as being "connected" or "connected" to another component, it may be directly connected to or connected to that other component, but it may be understood that other components may be present in between. Should be. On the other hand, when a component is said to be "directly connected" or "directly connected" to another component, it should be understood that there is no other component in between.

The terminology used herein is for the purpose of describing particular example embodiments only and is not intended to be limiting of the present invention. Singular expressions include plural expressions unless the context clearly indicates otherwise. In this application, the terms "comprise", "comprise", "have", and the like are intended to indicate that there is a feature, number, step, operation, component, part, or combination thereof described in the specification. Or other features or numbers, steps, operations, components, parts or combinations thereof in any way should not be excluded in advance.

Unless defined otherwise, 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 the commonly used dictionaries should be construed as having meanings consistent with the meanings in the context of the related art, and are not construed in ideal or excessively formal meanings unless expressly defined in this application. Do not.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings, and the same or corresponding components will be denoted by the same reference numerals regardless of the reference numerals and redundant description thereof will be omitted. In the following description of the present invention, if it is determined that the detailed description of the related known technology may obscure the gist of the present invention, the detailed description thereof will be omitted.

1 is a block diagram of a computing means for executing an application program according to an embodiment of the present invention, Figure 2 is a schematic diagram for explaining the concept of a transaction according to an embodiment of the present invention, Figure 3 is an embodiment of the present invention 4 is a flowchart illustrating a memory management method according to an embodiment of the present disclosure. FIG. 4 is a diagram illustrating a memory and file state change according to the flow of the memory management method according to an embodiment of the present invention. FIG. 5 is a diagram illustrating another embodiment of the present invention. FIG. 10 is a diagram illustrating memory and file state changes according to a flow of a memory management method.

In the present embodiment, the computing means is a central processing unit (CPU), memory (RAM), auxiliary storage (e.g., hard disk, SSD), input / output means (e.g., display, keyboard, Mouse), an external connection interface, and the like, as understood by conventional computing means.

In the present embodiment, the application program may be understood as an application program for an authoring tool such as CAD, which has a general operation input function including an undo and redo function. It can also be a tool for creating images and multimedia files.

When the application program of the present embodiment is understood as a CAD program, an object is a combination of one geometric unit object (eg, circle, triangle, rectangle, triangle column, sphere, etc.) or one or more unit objects generated by execution of the CAD program. Can be understood as a combination object.

In the present embodiment, a transaction may be a user input to an application program (eg, a drawing command for a specific object, a coordinate setting, a size setting, etc.) or a response of an application program (eg, an object according to a user input command) accordingly. Display execution, automatic drawing function by preset logic, etc.), and may be understood as a program processing process involving a state change of a memory. As illustrated in FIG. 2, one transaction includes at least one event (or task), and a series of events are organically combined to form one transaction.

In the present embodiment, the memory may be understood as a normal RAM, and from a logical point of view, a plurality of memory pages may be allocated to regions of the memory to define positions and sizes of each page, and data may be stored for each memory page. have. The allocation of memory pages, management of location and size, and management of memory state changes may be performed by a memory management module provided in the computing means.

In the present embodiment, it can be understood that the memory state change is caused by a change (eg, deletion, addition, substitution, etc.) of data stored or recorded in each memory page (eg, binary or hexa-data). .

In the following description, the application program is a CAD program having an undo and redo function, and the object is a geometric unit object (eg, circle, triangle, square) created by execution of the CAD program. , Triangular pillars, spheres, curved surfaces, etc.) or a combination thereof, and the computing means is exemplarily understood as a case of a normal PC running a CAD program.

The computing means 100 of the present embodiment includes a user input module 102 that receives and provides an operation input of a user, an object management module 104 that creates, modifies, deletes, and stores an object by operation input, and a transaction processing. A transaction processing module 106 for performing the operation, a memory management module 108 for managing memory page allocation for object creation and changes in each memory page state before and after executing a transaction, and control necessary for executing the overall functions of each module. The control module 110, the auxiliary memory device 120, and the memory 130 are provided. Each module may be understood as a module in terms of a function according to execution of an application program, and may be understood in terms of a software, but may be provided in a combined state of hardware.

Preferably, the auxiliary memory device 120 is a memory device using a semiconductor memory element, for example, may be a conventional solid state disk (SSD). Since a memory device using a semiconductor memory device provides improved functions in terms of data writing and access speed compared with a conventional hard disk, it is possible to provide a high speed when storing and accessing a first file or a second file which will be described later.

3 to 5, a memory management method according to an embodiment of the present invention will be described.

The following describes memory page allocation and transaction execution for object creation.

In the PS1 stage, when the object generation request is input, the computing means allocates at least one memory page to the object for which creation is requested. For example, memory page allocation requests memory to the memory management module through the Alloc function, and the memory management module allocates memory from the computing means in units of pages and puts it in a free list, and within the free list. This can be done by truncating the requested memory page size and returning it to the user and managing the free list. The memory is generally managed in units of pages (eg, 4096 bytes), and the present embodiment may manage memory pages in a similar manner.

In step S1, the computing means stores at least one memory page allocated for the object in a first file of auxiliary storage, and stores data relating to a location reference of the first file as a transaction record. The data regarding the location reference of the file may be, for example, the location of the file itself in the auxiliary storage device, the page location of the memory page stored in the file, the size of the file or the memory page, and the like.

For example, the transaction record may include an address of the first file or a second file, which will be described later, and offset data of the converted data stored in the memory page or the second file stored in the first file. At least one of a memory page stored in the first file or a size of the converted data stored in the second file. The offset data means a distance from a start position of a file to a memory page or translation data. The transaction record is kept in memory, preferably in a stack structure.

As described above, since a large memory page is stored in a first file of the auxiliary storage device, and a transaction record having a small capacity is stored in a memory, the memory management method of the present embodiment can be implemented with a small memory resource. Store and manage large memory pages. In addition, when using a memory device using a semiconductor memory element, such as SSD as an auxiliary memory device, there is an advantage that can provide a substantially high speed in terms of data access speed.

In the step S2, the computing means performs a first transaction on the object. For example, the first transaction may draw a circle object having a specific radius around a specific coordinate.

In step S3, the computing means compares the second hash code generated for each memory page after the execution of the first transaction with the first hash code generated for each memory page stored in the first file. Detects a memory page whose state has been translated. Whether or not the memory state is converted may be determined by comparing the first hash code and the second hash code for each memory page, and detecting that the memory pages having different code values are the memory pages of which the state is converted.

Preferably, the first hash code is generated in step S1 or S3, and the second hash code is generated in step S3. Each hash code (eg, 64 bit) may be obtained one by one for each memory page by applying a normal hash function to each memory page. As the hash function, for example, a known hash function including cityHash and crc (cyclic redundency checksum) can be used. The hash code may be managed, for example, in the form of a table containing a page address and a hash key value. Each hash code is kept in memory.

In the step S4, the computing means generates the converted data for the memory page detected as having the memory state changed in the step S3, stores the converted data in the second file of the auxiliary storage device, and stores the data regarding the location reference of the second file. Keep a record of the transaction. The data relating to the location reference of the file may be, for example, the location of the file itself in the auxiliary storage device, the data location of the conversion data stored in the file, the size of the file or data block, and the like.

Preferably, the converted data may be page difference data between data written in a memory page before conversion and data written in a memory page after conversion. The page difference data may be understood as data in which only the data difference is recorded by comparing before and after state transition of a memory page by a transaction. As another example, the data of the memory page before conversion may be used as the conversion data in the post-conversion state, or vice versa.

When using page difference data as conversion data, there is an advantage that the amount of conversion data to be stored may be smaller than when using the data of the memory page before conversion as the conversion data.

Also, preferably, the converted data may be stored in the second file in a compressed state. In this compression process, there is an advantage that the amount of converted data can be further reduced. Since the compression processing algorithm can selectively use a known compression algorithm (eg, Lossless LZ4 method), detailed description thereof will be omitted.

In step S5, the computing means updates and stores the memory page detected as having changed in the memory state in step S3 in the first file of the auxiliary storage device.

In the above process, the first file stores a memory page updated to the most recent state, the second file stores the converted data of the memory page in a stack structure, and the transaction file records the first file and the second file. It may be understood to record data relating to a location reference of a. The first file and the second file are stored in auxiliary storage, and transaction records are stored and managed in memory.

Hereinafter, a undo execution process after executing a transaction on an object will be described.

In operation S6, when a return request to the state before the execution of the first transaction is input, the computing means reads the second file with reference to the transaction record, and stores a memory page based on the converted data stored in the second file. Return to the same memory state as before the first transaction.

In step S7, the computing means updates and stores the memory page in which the memory state is returned in the step S6 in the first file of the auxiliary storage device.

Hereinafter, the execution process of the redo function after undoing an object will be described.

In step S8, the computing means re-performs the first transaction for the object based on the re-execute (redo) request.

Subsequently, steps S3 to S5 are further executed based on the retransmitted first transaction.

Hereinafter, a process of performing a transaction on an object two or more times in succession will be described.

After the step S5 (end of the first transaction) or the step S7 (end of the reversion), in step S9, the computing means further performs at least one or more transactions on the object. Further execution of the transaction may be accomplished by the user's further operation input or preset transaction logic.

Thereafter, at least one of the steps S3 to S5 (transaction), the steps S6 to S7 (revert), or the step S8 (reexecute) is further executed based on the additionally performed transaction.

As described above, in a process in which transaction execution is continuously performed two or more times, the second file stores and manages each converted data generated as a result of each transaction in a stack structure based on the transaction execution order. From the illustrated example of the second file of FIG. 4 or 5, the form in which the converted data (page difference data) is stored and managed in a stack structure can be exemplarily understood.

In particular, the second file preferably deletes and manages the converted data located above the current pointer among the converted data stored and managed in the stack structure. The current pointer indicates the location of the translation data directly needed to return the memory page of the most recently performed transaction. The lateral arrow displayed next to the second file shown in FIG. 4 or 5 may be understood as an example of the current pointer. Referring to FIG. 5, after the second transaction ends, the current point is located in the transform data corresponding to [6'-6], but after the revert command for the converted data corresponding to [6'-6] [ For example, it may be understood that a current point is located in the converted data corresponding to 2'-2] + [4'-4]. For example, in a state in which the redo command is executed later, the converted data corresponding to [6'-6] is added to the top of the converted data stored and managed in the stack structure, and the current point is located there.

Embodiments of the present invention include a program for performing various computer-implemented operations and a computer readable medium recording the same. The computer readable medium may include program instructions, data files, data structures, etc. alone or in combination. The media may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well-known and available to those having skill in the computer software arts. Examples of computer readable recording media include magnetic media such as hard disks, floppy disks and magnetic tape, optical recording media such as CD-ROM, DVD, USB drives, magnetic-optical media such as floppy disks, and ROM, RAM, Hardware devices specifically configured to store and execute program instructions, such as flash memory, are included. The medium may be a transmission medium such as an optical or metal wire, a waveguide, or the like including a carrier wave for transmitting a signal specifying a program command, a data structure, or the like. Examples of program instructions include not only machine code generated by a compiler, but also high-level language code that can be executed by a computer using an interpreter or the like.

Claims

A method of managing, by computing means, changes in memory state associated with transaction execution of an application program,

1) storing at least one memory page allocated for an object in a first file of auxiliary storage, and storing data relating to a location reference of the first file as a transaction record;

2) performing a first transaction on the object;

3) a memory in which a memory state is converted by comparing a second hash code generated for each memory page after execution of the first transaction with a first hash code generated for each memory page stored in the first file. Detecting a page;

4) Generates converted data for the memory page detected as having changed the memory state in step 3), and stores the converted data in a second file of the auxiliary storage device, and stores data regarding a location reference of the second file as a transaction record. Doing; And

5) updating and storing the memory page detected as having been changed in the memory state in the first file of the auxiliary storage device in step 3).
The method of claim 1,

6) When a request to return to the state before the execution of the first transaction is input, the second file is read with reference to the transaction record, and a memory page is read based on the converted data stored in the second file. Returning to a memory state equivalent to that before the execution; And

7) updating and storing the memory page of which the memory state has been returned in step 6) in a first file of the auxiliary storage device.
The method of claim 1,

Before step 1) above,

PS1) if an object creation request is input, allocating at least one memory page for the object requested to be created; memory management method further comprises.
The method of claim 1,

The hash code and the transaction record is stored in memory, characterized in that the memory management method.
The method of claim 1,

And wherein the transaction is performed by a user input to an application program or a response of the application program accordingly.
The method of claim 1,

In step 4),

And the converted data is page difference data between data written in a memory page before conversion and data written in the memory page after conversion.
The method of claim 1,

In step 4),

And the converted data is stored in the second file in a compressed state.
The method of claim 2,

8) re-executing a first transaction for the object based on the re-execution request;

And executing steps 3) to 5) based on the retransmitted first transaction.
The method of claim 8,

After step 5) or step 7),

9) further performing at least one transaction for the object;

And at least one of steps 3) to 5), or steps 6) to 7), or step 8) based on the additionally performed transaction.
The method of claim 9,

And the second file stores and manages each converted data generated as a result of each transaction in a stack structure based on a transaction execution order.
The method of claim 10,

The second file is to delete-manage the converted data located above the current pointer among the converted data stored and managed in the stack structure. The current pointer is directly required to return the memory page of the most recently performed transaction. Memory management method characterized by indicating the location of data.
The method of claim 1,

The transaction record,

An address of the first file or the second file in the auxiliary storage;

Offset data of the converted data stored in the memory page or the second file stored in the first file,

And at least one of a memory page stored in the first file or a size of the converted data stored in the second file.
The method of claim 1,

The application program is a CAD program,

Wherein the object is one geometric unit object or a combination object in which one or more unit objects are created by execution of a CAD program.
The method of claim 1,

Wherein the first hash code is generated in step 1) or step 3).
The method of claim 1,

And the auxiliary memory device is a memory device using a semiconductor memory element.
A computer program stored in a recording medium in combination with hardware to execute a memory management method according to any one of claims 1 to 15.
A computer-readable recording medium having recorded thereon a computer program for executing a memory management method according to any one of claims 1 to 15 on a computer.