RU2666334C2 - Method of data processing - Google Patents

Abstract

FIELD: computer equipment.SUBSTANCE: invention relates to the computer equipment. data processing method for the intermediate data processing created during the computer software execution, which processes the data set, including: allocating space in memory on the computer device to the data set processing completion; data set processing using the computer software first instance; processing interruption until the data set processing completion; determining the allocated memory first area, which contains the changed memory address space, reflecting the data set first part processing, and the second area of allocated memory, which contains the unmodified memory address space, reflecting the unprocessed data set second part; transmitting the second area to the computer software second instance for the second area processing; obtaining the modified memory address space corresponding to the data set second part processing; combining the obtained changed memory address space with the first area for further processing by the computer software first instance.EFFECT: technical result consists in enabling of efficient data processing.19 cl, 3 dwg

Description

FIELD OF TECHNOLOGY

The present technology describes a method for transmitting intermediate data created during the execution of a computer program from the first process to the second.

State of the art

There are many cases where it may be desirable to transfer intermediate data encapsulated in a program object from one copy of a computer program to another. For example, it may be desirable to transfer data processing from one computer to another in order to distribute the load between a group or cluster of computers. Alternatively, after processing the client’s request over the network, the server, for example, the database server, may send the program object back to the client to allow the client to continue processing the program object.

Software objects may be a combination of executable code and data, and, therefore, may perform processing on their own and / or provide data for processing by other program objects. For example, a program object, such as a function or subroutine, can be created by the parent object or even the main program to perform some processing on behalf of the calling parent object or main program. Object data can be of various types, for example: primitive data types, such as integers, real numbers, Boolean numbers, signs; and structured or abstract data types, such as arrays or lists, as well as certain data types, each of which includes multiple instances of data or combinations of data types. The program data can either be stored directly in the memory of the program object, or indexed with pointers that contain the addresses of other program objects or data. Transferring program objects, including pointers, can be problematic, especially when trying to move a program object from a program or process that runs within the same memory address space on a computer to another program or process that potentially runs in another memory address space.

D.M. Damder in "Operating Systems: A Concept-Based Approach", ISBN: 0070611947, 2006, describes a general approach to allocating memory at the computer operating system (OS) level.

Patent application US 8,458,433, "Management of persistent memory in a multi-node computer system" describes the creation and use of energy-resistant memory in a multi-node computer system. Managing energy-resistant memory involves using energy-resistant memory to load applications to safely transfer data from one application to another.

Patent application US 5,987,495 describes restoring the context of a user program, including a program status word (PSW) and processor register contents, after asynchronous interruptions.

Known solutions include switching absolute addressing of data to relative addressing to avoid problems when transferring data from the first computer (or process) to another computer (or process). However, such solutions may require memory management tools that are able to analyze the contents and associate it with the process. This analysis can be especially burdensome if there is no a priori knowledge about the nature of the processed object.

In US application US 8,566,536, a description is given of the direct access partitioning of physical memory between processes. The memory address space is associated with each process by populating the first entry in the high-level virtual address table for each process. Each address space is created and associated with this process, the main core initiates the creation of a main list of entries in the table of high-level virtual addresses of each address space for each process. Thus, the address space of each process is mutually connected with each process by filling in one or more consecutive entries in the table of high-level virtual addresses with the first entry in the table of high-level virtual addresses of other processes. This technology, however, depends on the functionality provided by the processor core.

Therefore, there is still a need for efficient data processing.

SUMMARY OF THE INVENTION

The first object of this technology is a data processing method that allows you to process intermediate data created at the time of execution of a computer program. More specifically, the present description relates to a data processing method for transmitting intermediate data created at the time of execution of a computer program from a first process or application to a second process or application. In the context of the present description, a process can be considered to include the execution context of the application, for example, the first process is the execution context of the first application, and the second process is the execution context of the second application, which can run on the same computer or another computer.

Intermediate data may be the result of incomplete processing of the data set, which may occur, for example, as a result of the suspension or termination of the computer program before the completion of the processing of the data set. Before starting the computer program with the first application, a sufficient memory area is allocated to simplify the processing of the data set. If execution is interrupted before processing is completed, the first part of the allocated memory contains modified addresses that reflect the processed data within the allocated memory, and the second part of the allocated memory contains addresses that remain unchanged. In accordance with the present description, the first part of the memory is stored by the first application and only the second part of the memory is allocated to the second application for further processing. After completing the subsequent processing, the modified second part of the memory is returned to the first application to complete the processing. Due to the fact that only the second part of the memory is transferred between the first and second applications, the amount of memory that needs to be transferred between applications is reduced and / or the load on computing power is reduced.

In order to efficiently transfer an object from the first process to the second, the present technology describes the initial allocation of a memory region in the form of an adjacent memory block within the first memory address space. After processing is interrupted, the adjacent memory block is copied to read-only memory. This block is analyzed and divided into changed and unchanged areas. The first part of the memory stored by the first application occupies the first adjacent region of the memory address space, and a copy of the unchanged second part of the memory, which occupies the second adjacent region of the memory address space, is transferred to the second process and the second memory address for further processing. After completing this processing, the second adjacent region, which includes the changed memory region, is returned to the first process to replace the unchanged second adjacent region of the first memory space.

Since the first process has a first memory address space and the second process has a second memory address space, for compatibility between the part of the memory that is transferred from the first process to the second, for each memory area from the first part and second part, the corresponding values are stored and used to check that the memory space used for the first and second processes is compatible. This step may include storing dynamic variables in the dynamic memory of programs and using dynamic variables or their indexed versions for each of the first process and second process.

Some embodiments of the present technology are implemented with a serialization function that performs the indicated steps of the method in response to a call to the parent to transmit the specified second part.

In some cases, said first process is instantiated on a first computer device, and a second process is instantiated on a second, different computer device.

Alternatively, said first process is instantiated on a first computer device, and a second process is instantiated on a first computer device later.

Both said first and second memory address space may be a virtual memory address space.

The second subject of this technology is a data processing method for transferring an object from a first process to a second process, the first process having a first address space and the second process having a second address space. The method is performed by a processor of a computing device that performs the second process, and includes obtaining a copy of the unchanged memory area, including data that has not yet been processed by the first process, processing this data in such a way as to maintain the changed memory area and return the adjacent copy areas of modified memory to the first process.

Some embodiments of the present technology comprise obtaining the size of said adjacent region of unchanged memory and allocating an adjacent region of memory of at least a specified size in said second memory address space.

Some embodiments of the present technology are implemented with a deserialization function that performs the indicated steps of the method in response to a call to the parent object to obtain the specified object.

Another object is a computer software product that includes executable instructions that are stored on a computer-readable medium, and when executed, the computer device is configured to perform the above methods.

An additional object is a data processing system comprising a first computer device connected to a second computer device, each configured to perform the above methods.

Accordingly, a method is provided which is defined in each of the independent claims. A system and computer software product are also offered. Advantageous characteristics are presented in the independent claims.

BRIEF DESCRIPTION OF THE DRAWINGS

Various examples of technology embodiments will now be described with reference to the relevant drawings, wherein:

in FIG. 1 schematically shows a system for providing intermediate data generated during execution of a computer program from a first process to a second process, the system being made in accordance with non-limiting embodiments of the present technology;

In FIG. 2 shows a data processing method executable in the system of FIG. one; and

In FIG. 3 shows a data processing method executable in the system of FIG. one; and

DESCRIPTION OF TECHNOLOGY

1 is a diagram of a system 100 including a first computer device 20 and a second computer device 201. It is important to keep in mind that ranking server 100 is only one embodiment of the present technology. Thus, the entire following description is presented only as a description of an illustrative example of the present technology. This description is not intended to determine the scope or scope of this technology. Some useful examples of modifications to the system 100 may also be covered by the following description.

The purpose of this is also solely assistance in understanding, and not defining the scope and boundaries of this technology. These modifications are not an exhaustive list, and it will be understood by those skilled in the art that other modifications are possible. In addition, this should not be interpreted so that where it has not yet been done, i.e. where examples of modifications have not been set forth, no modifications are possible, and / or that what is described is the only embodiment of this instance of the present technology. As will be clear to a person skilled in the art, this is most likely not the case. In addition, it should be borne in mind that the system 100 is in some specific manifestations a fairly simple embodiment of the present technology, and in such a case is presented here in order to facilitate understanding. As will be clear to a person skilled in the art, many embodiments of the present technology will have much greater complexity.

In a first embodiment of the present technology, the first computer device 20 is operatively connected to a data storage device 30 that stores program code 10. The data storage device 30 may be a memory device such as a hard disk drive integrated in the first computer device 20, or the data storage device 30 may be connected to the first computer device 20 via a network (not shown) or by any suitable wired or wireless connection. In the context of the present description, unless specifically indicated otherwise, “computer device” means a hardware device capable of working with software suitable for solving the corresponding problem. Thus, some examples of electronic devices (among other things) include universal personal computers (desktop computers, laptops, netbooks, etc.), mobile computer devices, smartphones, tablets, and network equipment such as routers, switches, and gateways . It should be borne in mind that a device behaving like a computer device in the present context can behave like a server in relation to other electronic devices. The use of the expression “computer device” does not exclude the possibility of using multiple electronic devices to receive / send, execute, or initiate the execution of any task or request, or the consequences of any task or request, or the steps of any method described above.

The instance 101 of the program 10 is loaded into the address space of the memory 16 of the first computer device 20. The memory 16 may include a virtual memory system with physical memory separate from the address space, but for the sake of simplification, the memory is shown in FIG. 1 as a simple block 16. A memory block 16 may be a first memory address space.

The program instance 101 is configured to allocate a first adjacent memory region 12 in the memory 16 for storing dynamic program variables — dynamic memory regions. Instance 101 is further configured to process data from a data set and store dynamic variables within the first allocated contiguous memory region associated with a particular program. This instance 101 of the program can be considered the first process or application and, in accordance with the present description, a method is proposed in which intermediate data resulting from the incomplete processing of the data set by the first process is transferred to the second instance 1001 of the computer program. The second instance 1001 may be considered a second process or application.

Intermediate data may be the result of incomplete processing of the data set, which may occur, for example, as a result of the suspension or termination of the computer program before the completion of the processing of the data set. As described in detail above, before starting the computer program with the first application, a sufficient memory area is allocated to simplify the processing of the data set. If execution is interrupted before processing is completed, for example, in response to the first instance 101 of a computer program stopping data processing, the present technology describes the transfer of raw data to a second instance 1001 of a computer program.

In order to efficiently transfer the raw data from the first instance 101 to the second instance 1001 (from the first process to the second), the present technology describes the initial allocation of the memory area 12 as a continuous memory unit within the first memory address space. After interruption of processing, the continuous memory block is copied to the permanent memory. This energy-resistant memory may be a separate memory unit or the same previously allocated memory area. This memory block is analyzed and divided into a first part, which includes a changed memory area 12-1, and a second part, which includes an unchanged memory area 12-2. The first part 12-1 of the allocated memory region 12 has changed memory addresses that reflect processed data within the memory space, and the second part 12-2 of the allocated memory region has unchanged memory addresses that reflect the fact that this data is raw.

In this case, the first part of the memory to be stored by the first application includes a modified part 12-1, which occupies the first adjacent area of the first address space of the memory. A copy of the second part includes the unchanged memory part 12-2, which occupies the second adjacent part of the first memory address space, is transferred to the second process, which is supported by the second instance 1001 and the second memory address 1201 within the second memory block 1601 for subsequent processing.

After completing this processing, the second memory address 1201, which also defines the adjacent memory block, includes a memory block defining the changed memory address space, and a copy of this region 1201 is returned to the first instance 101 or the first process to replace the unchanged second adjacent region 12-2 the first space 12 of the memory.

In this case, as part of the intermediate data processing, the first memory part 12-1 is stored by the first instance 101 and only the second memory part 12-2 is allocated to the second instance 1001 or the second application for further processing. After completion of the subsequent processing, the modified second memory part 1201 is returned to the first application to complete the processing. Due to the fact that only the second part of the memory is transferred between the first and second applications, the amount of memory that needs to be transferred between applications is reduced and / or the load on computing power is reduced.

As part of the transfer of intermediate data between the first and second instances of the program 10, the data can be recorded in a buffer 60, which can either be stored on a non-volatile medium, for example, a storage device 30, or transmitted using an Internet connection 30 for later use by the second instance 1001 programs. Processing can be carried out by transferring the data object either directly, that is, by transferring the entire object, or by reference, that is, using a pointer to the data object.

It is important to keep in mind that another instance of the program may be a second instance 1001 of program 10 running on another computer device 201; the instance may be a later instance of the program 10 running on the same computer device 20, some time after the first instance 101 of the program has finished processing; or the second instance may be an instance of another program other than program 10. FIG. 1, another instance of program 1001 is shown for simplicity as a separate program running on a second computer device 201 connected to the first computer device 20, but this should not be taken as a limitation of the present technology.

In FIG. 2 shows the steps involved in processing a data set in accordance with the present description. Within the framework of this example, the described data processing is one of the image processing, and intermediate data can be obtained from visualization of the processing of the data set that defines the image, while applying the “sharpness” filter to the image in a graphics editor. The user can start the first graphical editor - the first instance 101 of the computer program described above with reference to FIG. 1st first application can start applying a filter to an image. The application allocates enough memory to execute. When executing the image, the user can pause or stop the procedure at the time of execution, for example, at the time when the first application applied the filter to only half of the image. In this case, the data set will only be partially processed.

At the time the filter is applied to the image, the first application creates changes in only half of the memory addresses associated with image files (the first part of the corresponding memory). The execution context can be transferred to another instance 1001 — for example, a second editor (and / or continue applying the filter on another computer), which can receive data from the first editor and continue execution.

The first application, based on user intent, can divide the image memory into two parts: the first part with the changed memory addresses - the memory areas with the filter applied (not changeable on another device), and the second part (changeable on the other device) with memory addresses that do not have changes. It should be borne in mind that this allocation of the first and second memory areas can be carried out after interrupting the execution of the program in such a way that if the interruption did not occur, this processing may not be necessary. The first application splits the image based on memory areas that were changed / not changed at the time the image filter was applied.

Despite the fact that in the art it is known to interrupt the execution of a program and transfer the entire memory block, which determines the entire data set, to another instance of the computer program for execution, in accordance with the present description, only the second part of the memory is transferred to the second instance, which can be located on the second computer, and the first part of the memory remains on the first computer. After receiving this part of all the memory that was originally allocated for processing the data set, the second computer executes the program code for the second application, which in this example is the second image editor). The second application uses the execution context of the first application and applies an image filter to the second part of the memory addresses. The second application may terminate the filter and send the execution context (including the second memory address areas, which are changes) to the first application.

As will be understood further, such cascading processing between instances of a computer program can be carried out using any number of iterations, for example, two or more, which are used in processing a single data set, and each instance will process only part of the data from the original data set. In such configurations, it is important to take into account the fact that there are specific instances in which many sequential or parallel processing steps can be performed, but there are other instances in which the work associated with restoring the original selected data set will be expensive, which eliminates the benefit, which can be extracted from distributed processing. For example, some advantages can be achieved if the memory is divided into two parts, and each of them represents 50% of the initial data set that needs to be processed. Given the processing of both parts, restoring a combination of processed memory blocks will require a certain level of processing, but the application for changing the combination will require less time than processing either of these two parts. In the other case, the memory is divided into 100 parts, each of which represents 1% of the initial data set, and restoring the combination of processed parts will be a complex and difficult task that eliminates all the benefits of distributed processing.

However, it should be borne in mind that the possibilities of distributed processing between individual machines or processing elements can contribute to the most efficient use of the characteristics of individual machines. For example, if a particular machine or processing server is specifically suitable for processing data by applying black and white filters to an image, and another machine or server can only crop the edges of the image, then the process in accordance with the present description can be used to highlight the processing of specific tasks for specific machines that they fit. After each of the machines completes its individual task, in accordance with the present description, a memory block of the entire processed data set can be restored.

It should be borne in mind that, despite the fact that the method has been described as a sequence of processing steps, the present technology can be implemented in the form of parallel implementation of individual processing. Parallel execution is particularly suitable for data processing examples in which the processing sequence is not critical in the context of the overall processing. For example, if the desired processing of an image data set requires the application of a first filter and, based on the applied filter, the subsequent change in the colors defined by the image and subsequent cropping of the image, then the distribution of the three processing steps into three parallel tasks will not help to achieve the desired effect, and will not applied.

The addresses of the second modified memory area are then returned to the first instance 101 and combined with the stored addresses of the first memory area, which allows the first instance 101 to continue working on completing the image file area in the computer program memory 12.

In a first step 200, which is executed by the first instance 101 of the application, a first adjacent memory area for storing dynamic program variables — dynamic memory areas — is allocated for processing the data set. It is important to keep in mind that memory allocation is a normal phase of program execution and, therefore, pre-processing will be performed before interrupting the processing steps. This includes the mentioned program code in the first instance 101, which processes the data to the desired state before being sent to another program for further processing. So, for example, when the program instance 101 is a program for applying filters to images, this preparation can determine the available space in the memory 16 of the computer in which the program is running, and a portion 12 of the memory 16 for this data set is allocated.

As described in the description of FIG. 2, the present description can be used with any other of many different types of data sets. In this context, the use of the described techniques should not be limited to the processing of image data. For example, the present description may be used for applications that require completion of database structures. In such an application, the first instance of the application may initiate populating or populating with data structure elements as defined in the database. At a certain point in time after the initial filling, the process is interrupted or stopped. At this point in time, similar to what is described with reference to the processing of image data, the memory unit can be analyzed and divided into processed and unprocessed parts. Unprocessed parts can be transferred for processing as an adjacent block to another instance of the program. After completion of this process, the processed part is returned and combined with the initially processed data, and the process ends. In this case, the second instance of the application or process can populate the database with data, and after that, return data to the first instance. The way data is populated may vary. For example, the data in the database can vary or be changed using various processing operations, such as changing rows and columns, providing calculations, summing numbers from row “A” with numbers from row “B”, importing data from other data structures, etc. .d.

In this case, it should be borne in mind that a set of data, which can be, for example, image data that are awaiting image processing, or a data structure that is awaiting completion, can be considered a software object. As will be understood, a program object can be stored either in dynamic memory (heap) or in the software stack (stack). Dynamic memory is a memory area of a computer whose distribution is not automatically controlled by the operating system that stores the program. This free space is usually larger than the stack. To allocate the memory of variables in dynamic memory in a C program, the built-in C memory allocation functions malloc () or calloc () are used. In C ++, the new () and delete () functions are equivalent; in other languages, similar functions are used.

For variables allocated in dynamic memory, the C free () function or the C ++ delete () function can be used to deselect this memory after this amount of memory is no longer required. Failure to complete this procedure may result in a memory leak when dynamic memory is still allocated and inaccessible to other processes.

Since multiple allocations and cancellations of dynamic memory allocations at the time of the program in virtual memory systems are possible, dynamic memory variables can be stored in non-adjacent areas of virtual memory or physical memory.

Thus, unless otherwise provided, it cannot be assumed that any program object, after allocating memory space, is transferred (either directly or by reference) for storage in an adjacent memory area. A user memory allocator provides data distribution for processing in respective adjacent memory areas that has been allocated for the function in step 200.

For programs written in C or C ++, control over the allocation of program dynamic memory can be achieved by overloading the malloc (), calloc (), and new () functions in such a way that as new variables are declared and allocated during program execution , they are written to adjacent memory areas instead of being allocated to non-adjacent memory locations - virtual or physical. Similar techniques can be applied to programs written in other languages; or other techniques may be applied to achieve the same results in accordance with the program operating system environment.

In specific cases, a memory allocator that allocates nonadjacent memory areas to objects is used by default within program instance 101 such that the use of copies of a data set located in an adjacent area is optional.

When the memory is allocated, the program instance 101 initiates the processing of the data set in step 202. At some point after this initiation, the program is interrupted in step 204. Given the present description, this interruption is performed until the processing of the data set is completed. After the interruption, the memory is integrated (step 206) to check for areas that relate to processed data, i.e., changed memory, or areas that relate to unchanged memory, i.e., raw data.

The unmodified memory or its copy or pointers to it are transmitted in the form of an adjacent block to the second instance 1001 of the program at step 208.

At some point in time after, the first instance 101 obtains a copy of the changed memory in step 210, which corresponds to the originally provided unchanged region 12-2. Since the returned memory block is also defined as an adjacent memory region that corresponds to the originally provided unchanged adjacent region, the first instance 101 is able to replace the original unchanged region with a modified version, thereby providing a complete memory block that includes the changed or processed data. This data set may be further processed in step 212 to complete the action required by the application.

In FIG. 3 shows an example of a process from the point of view of the second instance 1001, which reflects the processing of the result of obtaining an unchanged memory block. At step 300, the second instance 1001 obtains a memory block for processing. The second instance allocates an adjacent memory region for this processing - at step 302. The data in this memory is further processed at step 302. After completion, the block of adjacent memory is returned to the first instance for subsequent processing at step 306.

In the context of the present description, unless specifically indicated otherwise, the term "data" includes any information that may be stored, for example, in a database, or may be transmitted in electronic form, for example, by stream. Thus, data includes, but is not limited to, audiovisual works (images, videos, sound recordings, presentations, etc.), location data, digital data, etc., text (opinions, comments, questions, messages and etc.), documents, tables, etc.

In the context of the present description, unless specifically indicated otherwise, the term "database" means any structured data set that is independent of the specific structure, database management software, hardware of the computer on which data is stored, used, or otherwise are available for use. The database may reside on the same hardware that runs the process that stores or uses the information stored in the database, or it may reside on separate hardware, such as a dedicated server or multiple servers.

It will be understood that although the above method has been described for the purpose of an example with a specific sequence of steps, the various steps may be arranged in a different order, where possible, to achieve the same result.

Embodiments of the present technology find particular application, for example, in the distribution of software objects between devices; providing processing in virtual machines, where, for example, processing and / or decision-making can be moved between the remote server and local processors; backup \ virtualization systems; and in compilers and code execution applications.

In the context of the present description, unless specifically indicated otherwise, “server” means a computer program running on appropriate equipment that is able to receive requests (for example, from computer devices) over the network and to fulfill these requests or initiate the execution of these requests. The equipment may be one physical computer or one physical computer system, but neither one nor the other is mandatory for this technology. In the context of this technology, the use of the expression “server” does not mean that every task (for example, received commands or requests) or any specific task will be received, executed or initiated to be executed by the same server (that is, by the same software software and / or hardware); this means that any number of software elements or hardware devices can be involved in receiving / transmitting, executing or initiating the execution of any request or the consequences of any request associated with the client device, and all this software and hardware can be one server or several servers , both options are included in the expression “at least one server”.

In the context of the present description, unless specifically indicated otherwise, the term “computer-supported computer information medium” means a medium of absolutely any type and nature, including RAM, ROM, disks (CDs, DVDs, diskettes, hard drives, etc.). e.), USB flash drives, solid state drives, tape drives, etc.

In the context of the present description, unless specifically indicated otherwise, the words "first", "second", "third", etc. used in the form of adjectives solely to distinguish the nouns to which they relate from each other, and not for the purpose of describing any specific relationship between these nouns. So, for example, it should be borne in mind that the use of the terms “first device” and “third device” does not imply any ordering, chronology, hierarchy or ranking (for example) of devices / between devices, as well as their use (in itself) does not imply that a certain “second device” must exist in a given situation. Hereinafter, as indicated here in other contexts, reference to the “first” element and the “second” element does not exclude the possibility that it is one and the same actual real element. So, for example, in some cases, the “first” device and the “second” device can be the same software and / or hardware, and in other cases they can be different software and / or hardware.

Each embodiment of the present technology pursues at least one of the aforementioned objectives and / or objects, but all are not required. It should be borne in mind that some objects of this technology, obtained as a result of attempts to achieve the aforementioned goal, may not satisfy this goal and / or may satisfy other goals not specifically indicated here.

Additional and / or alternative characteristics, aspects and advantages of embodiments of the present technology will become apparent from the following description, the attached drawings and the attached claims.

Those skilled in the art will understand that in the present description, the expression “receiving data” from a user means receiving by the computer device data from the user in the form of an electronic (or other) signal. In addition, those skilled in the art will understand that displaying data to a user through a graphical user interface (for example, a screen of a computer device and the like) may include transmitting a signal to the graphical user interface, this signal contains data that can be processed, and at least a portion of this data may be displayed to the user via a graphical user interface.

Some of these steps, as well as signal transmission-reception, are well known in the art and, therefore, have been omitted in specific parts of this description for simplicity. Signals can be transmitted-received using optical means (for example, optical connection), electronic means (for example, wired or wireless connection) and mechanical means (for example, based on pressure, temperature or other suitable parameter).

Modifications and improvements to the above-described embodiments of the present technology will be apparent to those skilled in the art. The preceding description is provided as an example only and is not subject to any restrictions. Thus, the scope of the present technology is limited only by the scope of the attached claims.

The present description may also extend to the characteristics of one or more of the following numbered paragraphs:

1. A data processing method for processing intermediate data generated during the execution of a computer program that processes a data set, the method includes:

Allocation of space (12) in memory on a computer device (20) to complete processing of the data set;

Processing a data set using the first copy (101) of a computer program (10);

Interruption of processing until completion of processing the data set;

The definition of the first region (12-1) of the allocated memory, which contains the changed memory address space, reflecting the processing of the first part of the data set, and the second region (12-2) of the allocated memory, which contains the unchanged memory address space, which reflects the unprocessed second part of the data set;

Transferring the second region (12-2) to the second copy (1001) of the computer program (10) for processing the second region;

Getting the changed address space (1201) of the memory corresponding to the processing of the second part of the data set;

Combining the resulting modified address space (1201) of the memory with the first region (12-1) for further processing by the first copy of the computer program.

2. The method according to claim 1, wherein the first region (12-1) and the second region (12-2) are each located in adjacent memory regions within the allocated memory.

3. The method according to claim 1 or 2, in which the allocation of memory space includes allocating a first adjacent region of dynamic memory for storing dynamic variables.

4. The method according to claim 3, in which the processing of the data set using the first instance (101) of the computer program (10) includes storing dynamic variables in dynamic memory.

5. The method according to any one of the preceding paragraphs, including, in response to interruption of processing until the processing of the data set is completed, copying the first adjacent area (12-1) into an energy-resistant memory.

6. The method according to any one of the preceding paragraphs, in which the determination includes a memory block in an energy-resistant memory for dividing the block into a changed (12-1) and unchanged (12-2) area.

7. The method according to claim 6, in which the changed area reflects the processing of the first part of the data set and occupies the first adjacent area of the allocated memory, and in which the unchanged part reflects the unprocessed second part of the data set and occupies the second adjacent area of the allocated memory, optionally in which the second the area to the second instance of the computer program for processing the second area includes transmitting a copy of the second adjacent area and, optionally, optionally combining the received modified address address The memory space with the first region for further processing by the first copy of the computer program includes replacing the second adjacent region (12-2) with the obtained changed address space (1201).

8. The method according to any one of the preceding paragraphs, which includes storing dynamic variables in the dynamic memory of programs and using dynamic variables or their indexed versions, for processing by each of the first instance and second instance.

9. A method according to any one of the preceding paragraphs, wherein said first instance (101) is instantiated on a first computer device (20) and the second instance (1001) is instantiated on a second excellent computer device (201) or in which said first instance (10) is instantiated on the first computer device (20), and the second instance (1001) is instantiated on the first computer device (101) later.

10. The method according to any one of the preceding paragraphs, in which the allocated memory space (12) includes virtual address memory spaces.

11. The method of claim 7, wherein transmitting a copy of the second adjacent region (12-2) includes providing said copy of said second adjacent region (12-2) and an index identifying locations within said second adjacent region that relate to the specified first adjacent area and optionally further includes recording the specified copy and the specified location index on energy-resistant memory, and optionally in which a memory or non-volatile memory is available for each of the specified first and second instance.

12. The method of claim 11, wherein said providing said copy of said second adjacent region (12-2) and an index defining locations within said second adjacent region that relates to said first adjacent region (12-1) includes transmitting the specified copy and the specified location index to the computer device via data line (40).

13. The method is performed by a processor of a computer device (20, 201), and includes:

obtaining a copy of the adjacent region (12-2) of unchanged memory, which includes data that has not yet been processed by the first process (10), the data is part of a data set,

the implementation of the processing of this data to provide an adjacent area of the modified memory (1201), and

Returning a copy of the adjacent region of modified memory to the first process (10).

14. The method of claim 13, including allocating memory in a second computer device (201) for copying an adjacent region of unchanged memory.

15. A computer program that, when executed on a computer device (20, 201), executes the method according to any one of paragraphs. 1-14.

16. A data processing system comprising a first computer device (20) connected to a second computer device (201), said first computer device (20) being configured to perform steps 1 through 12, and the second computer device ( 201) is configured to perform the steps of paragraph 14, optionally wherein said first and second computer devices are different devices.

Claims (26)

1. A data processing method for processing intermediate data generated during the execution of a computer program that processes a data set, the method includes: allocating space in memory on a computer device to complete processing of the data set; processing a data set using the first instance of a computer program; interruption of processing until completion of the processing of the data set; determining a first area of allocated memory that contains a changed memory address space reflecting processing of a first part of a data set, and a second area of allocated memory that contains an unmodified memory address space that reflects an unprocessed second part of a data set; transferring the second region to a second instance of a computer program for processing the second region; obtaining a modified memory address space corresponding to the processing of the second part of the data set; combining the resulting modified address space of the memory with the first region for further processing by the first instance of a computer program. 2. The method of claim 1, wherein the first region and the second region are each located in adjacent memory regions within the allocated memory. 3. The method according to p. 1, in which when allocating memory space, perform the allocation of the first adjacent region of dynamic memory to store dynamic variables. 4. The method according to p. 3, in which when processing a data set using the first instance of a computer program, dynamic variables are stored in dynamic memory. 5. The method according to claim 4, in which, in response to interruption of processing until the processing of the data set is completed, the first adjacent area is copied to an energy-resistant memory. 6. The method according to p. 1, in which when determining the first area of the allocated memory, an analysis of the memory block in energy-resistant memory is performed to divide the block into changed and unchanged regions. 7. The method according to claim 6, in which the changed area reflects the processing of the first part of the data set and occupies the first adjacent area of the allocated memory. 8. The method according to claim 7, in which the unchanged region reflects the unprocessed second part of the data set and occupies the second adjacent region of the allocated memory. 9. The method according to p. 8, in which when transmitting the second part to the second copy of the computer program for processing the second area, a copy of the second adjacent area is transmitted. 10. The method according to p. 9, in which when combining the received modified address space with the first region for subsequent processing by the first copy of the computer program, the second adjacent region is replaced with the obtained modified memory space. 11. The method according to p. 1, in which the storage of dynamic variables in the dynamic memory of programs and using dynamic variables or their indexed versions, for processing by each of the first instance and the second instance. 12. The method of claim 1, wherein said first instance is instantiated on a first computer device, and a second instance is instantiated on a second, different computer device. 13. The method of claim 1, wherein said first instance is instantiated on a first computer device, and a second instance is instantiated on a first computer device later. 14. The method of claim 1, wherein the allocated memory space includes virtual addressable memory spaces. 15. The method according to p. 9, in which when transmitting a copy of the second adjacent area perform the provision of the specified copy of the specified second adjacent area and an index identifying locations within the specified second adjacent area related to the specified first adjacent area. 16. The method according to p. 15, in which record the specified copy and the specified location index on an energy-resistant memory. 17. The method of claim 16, wherein the energy-resistant memory includes either a computer memory or a non-volatile memory available to both said first and said second instances. 18. The method according to p. 15, in which when the specified provision of the specified copy of the specified second adjacent area and the index defining the location within the specified second adjacent area, which refers to the specified first adjacent area, transmit the specified copy and the specified location index to the computer device via data transmission lines. 19. A data processing system including a computer device configured to perform steps 1.

Images