CN114840356B - Data processing method, data processing system and related device - Google Patents
Data processing method, data processing system and related device Download PDFInfo
- Publication number
- CN114840356B CN114840356B CN202210785891.0A CN202210785891A CN114840356B CN 114840356 B CN114840356 B CN 114840356B CN 202210785891 A CN202210785891 A CN 202210785891A CN 114840356 B CN114840356 B CN 114840356B
- Authority
- CN
- China
- Prior art keywords
- data
- shared
- mapping
- multidimensional
- establishing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/445—Program loading or initiating
- G06F9/44557—Code layout in executable memory
- G06F9/44563—Sharing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/544—Buffers; Shared memory; Pipes
Abstract
The application provides a data processing method, a data processing system and a related device, which relate to the field of data processing and comprise the following steps: acquiring shared data with at least a preset length; loading shared data into a shared area of a multidimensional data space; establishing multidimensional data mapping of shared data in a shared area so that each process can construct a shared data access linked list for the multidimensional data mapping; monitoring the updating request of each process to the multi-dimensional data mapping, and generating a change preprocessing queue in the process; judging whether the updating request can be completed by changing the coordinate mapping; if yes, the updating request is completed by changing the shared data access linked list; if not, rejecting the update request, newly building a local variable in the process, and temporarily storing the update request in the update queue. The method and the device can be operated simultaneously based on different dimensions, so that occupation conflict of shared data is avoided, and encryption strength and logic processing capacity of the data are improved.
Description
Technical Field
The present application relates to the field of data processing, and in particular, to a data processing method, a data processing system, and a related apparatus.
Background
In the traditional computer programming process, occupation of computer resources is often exclusive, that is, if a resource is occupied by a process, it will be occupied by the process until the process finishes operating and releases occupation. This is so designed, on the one hand, because multiple processes operating on the same resource at the same time may cause a problem of content conflict, and on the other hand, because the uniqueness of the data value does not allow it to exhibit multiple state characteristics at the same time, and unless a copy of it is used for separate operations, the uniqueness principle is bound to be exclusive. That is, while the A resource is in the modifying state, it cannot have a modifying state in another process at the same time because the modifying state and the writing state are conflicting. The later modified resource may overwrite the previous write operation, causing corruption of the resource file.
In more and more complex computer structures, the principle of exclusivity of resources often causes unnecessary waiting time, so that many processes capable of performing parallel processing have to be always limited to the process of single-line operation. Especially, when the multi-user collaboration mode and the cloud mode are gradually and widely applied, the resource conflict problem becomes more frequent and serious, and even becomes a main bottleneck.
Disclosure of Invention
An object of the present application is to provide a data processing method, a data processing system, a computer-readable storage medium, and an electronic device, which can enhance data versatility while keeping a data length unchanged.
In order to solve the above technical problem, the present application provides a data processing method, which has the following specific technical scheme:
acquiring shared data with at least a preset length;
loading the shared data into a shared area of a multidimensional data space;
establishing multidimensional data mapping of the shared data in the shared area so that each process can construct a shared data access linked list for the multidimensional data mapping according to the requirement of each process;
monitoring the updating request of each process to the multidimensional data mapping, and generating a change preprocessing queue in the process;
judging whether the updating request can be completed by changing the coordinate mapping;
if yes, the updating request is completed by changing the shared data access linked list;
if not, rejecting the updating request, newly building a local variable in the process, and temporarily storing the updating request in an updating queue.
Optionally, before loading the shared data into the shared area of the multidimensional data space, the method further includes:
a shared data region is established in a multidimensional data space.
Optionally, the establishing the multidimensional data mapping of the shared data includes:
establishing three-dimensional data mapping of the shared data;
the three-dimensional data mapping comprises data left and right combination, data up and down combination and data front and back combination.
Optionally, after the update request is temporarily stored in the update queue, the method further includes:
determining the processing state of each update request in the update queue; the processing state includes completed and rejected.
Optionally, the method further includes:
determining a rejected update request;
directing each of the rejected update requests to the local variable in a local access list.
The present application also provides a data processing system, comprising:
the data acquisition module is used for acquiring shared data with at least a preset length;
the data loading module is used for loading the shared data into a shared area of the multidimensional data space;
the data mapping module is used for establishing multidimensional data mapping of the shared data in the shared area so as to facilitate each process to establish a shared data access linked list for the multidimensional data mapping according to the requirement of the process;
the request monitoring module is used for monitoring the updating request of each process to the multidimensional data mapping and generating a change preprocessing queue in the process;
the judging module is used for judging whether the updating request can be completed by changing the coordinate mapping;
the updating module is used for finishing the updating request by changing the shared data access linked list when the judgment result of the judging module is yes;
and the request rejection module is used for rejecting the updating request when the judgment result of the judgment module is negative, newly building a local variable in the process, and temporarily storing the updating request in an updating queue.
Optionally, the method further includes:
and the shared area construction module is used for establishing a shared data area in the multidimensional data space.
Optionally, the data mapping module includes:
the mapping establishing unit is used for establishing three-dimensional data mapping of the shared data; the three-dimensional data mapping comprises data left and right combination, data up and down combination and data front and back combination.
The present application also provides a computer-readable storage medium having stored thereon a computer program which, when being executed by a processor, carries out the steps of the method as set forth above.
The present application further provides an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the method described above when calling the computer program in the memory.
The application provides a data processing method, which comprises the following steps: acquiring shared data with at least a preset length; loading the shared data into a shared area of a multidimensional data space; establishing multidimensional data mapping of the shared data in the shared area so that each process can construct a shared data access linked list for the multidimensional data mapping according to the requirement of the process; monitoring the updating request of each process to the multidimensional data mapping, and generating a change preprocessing queue in the process; judging whether the updating request can be completed by changing the coordinate mapping; if yes, the updating request is completed by changing the shared data access linked list; if not, rejecting the update request, newly building a local variable in the process, and temporarily storing the update request in an update queue.
According to the method, for the shared data, multidimensional data mapping of the shared data is established in a shared area, on the premise that the data length is not changed, the shared data has multidimensional angles, and each process is enabled to construct a shared data access linked list.
The present application further provides a data processing system, a computer-readable storage medium, and an electronic device, which have the above-mentioned advantages and are not described herein again.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of a data processing method according to an embodiment of the present application;
FIG. 2 is a process diagram of multidimensional data mapping of shared data according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a data processing system according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Referring to fig. 1, fig. 1 is a flowchart of a data processing method according to an embodiment of the present application, where the method includes:
s101: acquiring shared data with at least a preset length;
this step is intended to obtain at least a preset length of the shared data, and the preset length is not limited in particular, and may be a number of bytes or other units that can indicate the length of the data. The preset length can be set differently according to different types of data.
S102: loading the shared data into a shared area of a multidimensional data space;
this step is intended to load the shared data into a shared area, which is an area for implementing multidimensional data mapping of the shared data, which may be a designated data storage space.
It will be readily appreciated that prior to this step, the shared data region may be established in the multidimensional data space. The shared data area can be accessed by each process, and if a plurality of shared data exist in the shared area, each shared data in the shared area should have an access address or an access mark which can be identified by the process, so that the process can accurately access the shared data.
S103: establishing multidimensional data mapping of the shared data in the shared area so that each process can construct a shared data access linked list for the multidimensional data mapping according to the requirement of each process;
the step aims to establish multidimensional data mapping of shared data, and the purpose of establishing the multidimensional data mapping is to perform multidimensional processing on the shared data, so that the shared data can only express data with a single numerical value originally and can be regarded as a combination of different numerical values under the condition of inconvenient length, and polymorphism of the shared data is presented.
Referring to fig. 2, fig. 2 is a schematic diagram of a process of mapping multidimensional data of shared data according to an embodiment of the present application, where a three-dimensional data mapping of the shared data may be established, and the three-dimensional data mapping includes a data left-right combination, a data top-bottom combination, and a data front-back combination.
In fig. 2, a segment of binary data 0000 0101 with a length of 8 bits can be naturally decomposed into the following combination of independent values after being substituted into a three-dimensional geometry:
left and right combinations, abbreviated as LR: L0000R 0101
Upper and lower combination, abbreviated as UD: U0001D 0010
Front and back combination, abbreviated FB: F0010B 0001
The data can express the necessary characteristics along with different data combinations, and the change is not only lossless but also reversible, thereby playing an important role in the sharing problem of data resources.
After the multidimensional data mapping is established, each process needs to establish a shared data access linked list according to the access requirement of the process, wherein the access requirement refers to establishing the shared data access linked list for the access requirement of a certain dimension or a plurality of dimensions in the multidimensional data mapping, and the shared data access linked list at least needs to contain the access request of the process for the multidimensional data mapping and the front and back sequence of each access request.
Certainly, the shared data access linked list does not need to be constructed immediately, the linked list may be configured first, and when an access request is subsequently received, the access request is added to the shared data access linked list.
S104: monitoring the updating request of each process to the multidimensional data mapping, and generating a change preprocessing queue in the process;
this step is intended to monitor an update request, which refers to an update to the multidimensional data mapping, for example, if the data to be accessed is changed and the multidimensional data mapping does not include the data to be accessed, the corresponding multidimensional data mapping may be changed.
The process internally generates a change preprocessing queue for storing the update request.
S105: judging whether the updating request can be completed by changing the coordinate mapping; if yes, entering S106; if not, entering S107;
s106: completing the updating request by changing the shared data access linked list;
s107: and refusing the updating request, newly building a local variable in the process, and temporarily storing the updating request in an updating queue.
Because there may be multiple access requests in the shared data access linked list, if some of the access requests are update requests, it is necessary to further determine whether the update requests can be completed by changing the coordinate mapping. E.g., from UD at address 1 to FB at address 2, and if so, by changing the access list. If the coordinate mapping cannot be completed by changing the coordinate mapping, the updating request can be refused firstly, so that a local variable is newly built in the process, and the updating request is temporarily stored. This is to avoid previous update requests affecting access to the multidimensional data map by subsequent access requests in the shared data access linked list.
According to the embodiment of the application, multi-dimensional data mapping of shared data is established in a shared area aiming at the shared data, on the premise that the data length is not changed, the shared data has a multi-dimensional angle, and the shared data access linked list is established by each process, so that when the shared data is operated by multiple processes at the same time, the shared data can be operated at the same time based on different dimensions, occupation conflict of the shared data cannot occur, the data volume is reduced, the encryption intensity and the logic processing capacity of the data are greatly improved, and necessary conditions are provided for establishing a multi-dimensional parallel intelligent processing system.
Based on the foregoing embodiment, as a preferred embodiment, after the temporarily storing the update request in the update queue, the method further includes:
determining a processing state of each update request in the update queue; the processing state includes completed and rejected.
For the update queue, the processing state of the update request therein can be determined in time. The rejected update request can be further directed to the local variable from the local access list for the rejected update request.
In addition, in determining the processing state, different states may be set for the update request that has been completed and the update request that has been rejected,
referring to fig. 3, a data processing system provided in an embodiment of the present application is described below, and the data processing system described below and the data processing method described above may be referred to correspondingly.
The present application also provides a data processing system, comprising:
the data acquisition module is used for acquiring shared data with at least a preset length;
the data loading module is used for loading the shared data into a shared area of the multidimensional data space;
the data mapping module is used for establishing multidimensional data mapping of the shared data in the shared area so as to facilitate each process to establish a shared data access linked list for the multidimensional data mapping according to the requirement of the process;
the request monitoring module is used for monitoring the updating request of each process for the multidimensional data mapping and generating a change preprocessing queue in the process;
the judging module is used for judging whether the updating request can be completed by changing the coordinate mapping;
the updating module is used for finishing the updating request by changing the shared data access linked list when the judgment result of the judging module is yes;
and the request rejection module is used for rejecting the updating request when the judgment result of the judgment module is negative, newly building a local variable in the process, and temporarily storing the updating request in an updating queue.
Based on the above embodiment, as a preferred embodiment, the method further includes:
and the shared area construction module is used for establishing a shared data area in the multidimensional data space.
Based on the above embodiment, as a preferred embodiment, the data mapping module includes:
the mapping establishing unit is used for establishing three-dimensional data mapping of the shared data; the three-dimensional data mapping comprises data left and right combination, data up and down combination and data front and back combination.
The present application also provides a computer readable storage medium having stored thereon a computer program which, when executed, may implement the steps provided by the above-described embodiments. The storage medium may include: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The present application further provides an electronic device, which may include a memory and a processor, where the memory stores a computer program, and when the processor calls the computer program in the memory, the steps provided in the foregoing embodiments may be implemented. Of course, the electronic device may also include various network interfaces, power supplies, and the like.
The embodiments are described in a progressive manner in the specification, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. For the system provided by the embodiment, the description is relatively simple because the system corresponds to the method provided by the embodiment, and the relevant points can be referred to the description of the method part.
The principles and embodiments of the present application are explained herein using specific examples, which are provided only to help understand the method and the core idea of the present application. It should be noted that, for those skilled in the art, without departing from the principle of the present application, the present application can also make several improvements and modifications, and those improvements and modifications also fall into the protection scope of the claims of the present application.
It is further noted that, in the present specification, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrases "comprising one of 8230; \8230;" 8230; "does not exclude the presence of additional like elements in a process, method, article, or apparatus that comprises the element.
Claims (8)
1. A data processing method, comprising:
acquiring shared data with at least a preset length;
loading the shared data into a shared area of a multidimensional data space;
establishing multidimensional data mapping of the shared data in the shared area so that each process can construct a shared data access linked list for the multidimensional data mapping according to the requirement of each process;
monitoring the updating request of each process to the multidimensional data mapping, and generating a change preprocessing queue in the process;
judging whether the updating request can be completed by changing the coordinate mapping;
if yes, the updating request is completed by changing the shared data access linked list;
if not, rejecting the updating request, newly building a local variable in the process, and temporarily storing the updating request in an updating queue;
before loading the shared data into the shared area of the multidimensional data space, the method further includes:
establishing a shared data area in a multidimensional data space;
wherein establishing a multidimensional data mapping of the shared data comprises:
and establishing three-dimensional data mapping of the shared data, wherein the three-dimensional data mapping comprises data left and right combination, data up and down combination and data front and back combination.
2. The data processing method of claim 1, wherein establishing the multidimensional data mapping of the shared data comprises:
establishing three-dimensional data mapping of the shared data;
the three-dimensional data mapping comprises data left and right combination, data up and down combination and data front and back combination.
3. The data processing method of claim 1, further comprising, after temporarily storing the update request in an update queue:
determining the processing state of each update request in the update queue; the processing state includes completed and rejected.
4. The data processing method of claim 3, further comprising:
determining a rejected update request;
directing each of the rejected update requests to the local variable in a local access list.
5. A data processing system, comprising:
the data acquisition module is used for acquiring shared data with at least a preset length;
the data loading module is used for loading the shared data into a shared area of the multidimensional data space;
the data mapping module is used for establishing multidimensional data mapping of the shared data in the shared area so as to facilitate each process to establish a shared data access linked list for the multidimensional data mapping according to the requirement of the process;
the request monitoring module is used for monitoring the updating request of each process for the multidimensional data mapping and generating a change preprocessing queue in the process;
the judging module is used for judging whether the updating request can be completed by changing the coordinate mapping;
the updating module is used for finishing the updating request by changing the shared data access linked list when the judgment result of the judging module is yes;
the request rejection module is used for rejecting the updating request when the judgment result of the judgment module is negative, newly building a local variable in the process and temporarily storing the updating request in an updating queue;
the shared area construction module is used for establishing a shared data area in the multidimensional data space;
the data mapping module comprises a three-dimensional data mapping for establishing the shared data, and the three-dimensional data mapping comprises units of data left and right combination, data up and down combination and data front and back combination.
6. The data processing system of claim 5, wherein the data mapping module comprises:
the mapping establishing unit is used for establishing three-dimensional data mapping of the shared data; the three-dimensional data mapping comprises data left and right combination, data up and down combination and data front and back combination.
7. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the data processing method according to any one of claims 1 to 4.
8. An electronic device, comprising a memory in which a computer program is stored and a processor which, when calling the computer program in the memory, implements the steps of the data processing method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210785891.0A CN114840356B (en) | 2022-07-06 | 2022-07-06 | Data processing method, data processing system and related device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210785891.0A CN114840356B (en) | 2022-07-06 | 2022-07-06 | Data processing method, data processing system and related device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114840356A CN114840356A (en) | 2022-08-02 |
| CN114840356B true CN114840356B (en) | 2022-11-01 |
Family
ID=82575284
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210785891.0A Active CN114840356B (en) | 2022-07-06 | 2022-07-06 | Data processing method, data processing system and related device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114840356B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102662773A (en) * | 2012-03-13 | 2012-09-12 | 中冶南方工程技术有限公司 | Structured document communication system between multiple processes |
| CN104268225A (en) * | 2014-09-26 | 2015-01-07 | 山西达鑫核科技有限公司 | File system architecture for addressing in multidimensional degree of freedom, as well as generating and accessing mode thereof |
| CN110334069A (en) * | 2019-07-10 | 2019-10-15 | 中国民航信息网络股份有限公司 | Data sharing method and relevant apparatus between multi-process |
| CN110399227A (en) * | 2018-08-24 | 2019-11-01 | 腾讯科技（深圳）有限公司 | A kind of data access method, device and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10593042B1 (en) * | 2017-04-11 | 2020-03-17 | Zoox, Inc. | Perspective conversion for multi-dimensional data analysis |
| CN108460152A (en) * | 2018-03-26 | 2018-08-28 | 王智华 | A kind of the space-filling curve method, apparatus and computer readable storage medium of data |
-
2022
- 2022-07-06 CN CN202210785891.0A patent/CN114840356B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102662773A (en) * | 2012-03-13 | 2012-09-12 | 中冶南方工程技术有限公司 | Structured document communication system between multiple processes |
| CN104268225A (en) * | 2014-09-26 | 2015-01-07 | 山西达鑫核科技有限公司 | File system architecture for addressing in multidimensional degree of freedom, as well as generating and accessing mode thereof |
| CN110399227A (en) * | 2018-08-24 | 2019-11-01 | 腾讯科技（深圳）有限公司 | A kind of data access method, device and storage medium |
| CN110334069A (en) * | 2019-07-10 | 2019-10-15 | 中国民航信息网络股份有限公司 | Data sharing method and relevant apparatus between multi-process |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114840356A (en) | 2022-08-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108572876B (en) | Method and device for realizing read-write lock | |
| US9563477B2 (en) | Performing concurrent rehashing of a hash table for multithreaded applications | |
| CN109491928B (en) | Cache control method, device, terminal and storage medium | |
| CN110473100B (en) | Transaction processing method and device based on blockchain system | |
| DE102012206019A1 (en) | Assignment of counters from a population of counters to control logical register mappings to physical registers for execution of instructions initiated by an allocation unit | |
| CN106802939B (en) | Method and system for solving data conflict | |
| CN107992577B (en) | Hash table data conflict processing method and device | |
| CN109379398B (en) | Data synchronization method and device | |
| CN109634974A (en) | A kind of data processing method, system and associated component | |
| US11100047B2 (en) | Method, device and computer program product for deleting snapshots | |
| CN105843819A (en) | Method and device for exporting data | |
| US11720607B2 (en) | System for lightweight objects | |
| CN110704199A (en) | Data compression method and device, computer equipment and storage medium | |
| CN114840356B (en) | Data processing method, data processing system and related device | |
| CN111736751B (en) | Stroke redrawing method, device and readable storage medium | |
| CN104391935A (en) | Implementation method and device of range lock | |
| CN109992526A (en) | A kind of read-write management method and relevant apparatus | |
| CN107391041B (en) | Data access method and device | |
| CN112799832A (en) | Memory allocation control method, device, equipment and storage medium | |
| CN113157600A (en) | Space allocation method of shingled hard disk, file storage system and server | |
| CN109711193B (en) | Storage space sharing method and device | |
| CN116263646A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN110852603A (en) | High-throughput wind control data processing method, device, equipment and storage medium | |
| CN105490956A (en) | Network request processing method and network request processing device | |
| CN113067912B (en) | Method, system and device for allocating resource addresses of PCI (peripheral component interconnect) equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |