CN114297294A - Data access method and device in heterogeneous network and related products - Google Patents
Data access method and device in heterogeneous network and related products Download PDFInfo
- Publication number
- CN114297294A CN114297294A CN202111591153.4A CN202111591153A CN114297294A CN 114297294 A CN114297294 A CN 114297294A CN 202111591153 A CN202111591153 A CN 202111591153A CN 114297294 A CN114297294 A CN 114297294A
- Authority
- CN
- China
- Prior art keywords
- data access
- data
- heterogeneous network
- subtask
- access request
- 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.)
- Pending
Links
Images
Abstract
The application discloses a data access method, a device and a related product in a heterogeneous network, wherein the data access method in the heterogeneous network comprises the following steps: acquiring a data access request in a heterogeneous network to generate a data access subtask; determining data nodes which can respond to the data access request in the heterogeneous network, and forming a resource pool based on the determined data nodes; calculating the distribution index value of each data node in the resource pool; establishing an index relationship between the data nodes and the subtasks, such that each data access subtask is responded to by at least one data node based on the index relationship; and summarizing the response results of all the data access subtasks to form a response aiming at the data access request in a splicing manner, so that the difficulty of data access in the heterogeneous network is reduced.
Description
Technical Field
The present application relates to the field of heterogeneous technologies, and in particular, to a method and an apparatus for accessing data in a heterogeneous network, and a related product.
Background
With the continuous development of the technology in the field of cloud computing, various cloud platform products are also continuously enriched, and different cloud service manufacturers provide their own basic community cloud platform products in the fields of private cloud, public cloud and community cloud. With more and more choices, more and more cloud computing users deploy own services to different cloud platforms, and the development trend of mixed cloud and multi-cloud deployment is presented. However, a multi-cloud deployment increases the difficulty of data access.
Disclosure of Invention
Based on the above problems, embodiments of the present application provide a method and an apparatus for accessing data in a heterogeneous network, and a related product.
The embodiment of the application discloses the following technical scheme:
a method of data access in a heterogeneous network, comprising:
acquiring a data access request in a heterogeneous network to generate a data access subtask;
determining data nodes which can respond to the data access request in the heterogeneous network, and forming a resource pool based on the determined data nodes;
calculating the distribution index value of each data node in the resource pool;
establishing an index relationship between the data nodes and the subtasks, such that each data access subtask is responded to by at least one data node based on the index relationship;
and summarizing the response results of all the data access subtasks to splice to form a response aiming at the data access request.
Optionally, the obtaining a data access request in a heterogeneous network to generate a data access subtask includes: and acquiring a data access request in the heterogeneous network according to a set polling time range through a set timing polling interface so as to generate a data access subtask.
Optionally, the obtaining a data access request in a heterogeneous network to generate a data access subtask includes: and adding the acquired data access requests in the heterogeneous network into a pre-established request queue, sequencing the data access requests in the request queue according to the priority of the data access requests, and allocating the priority of the response according to the sequencing order.
Optionally, the obtaining a data access request in a heterogeneous network to generate a data access subtask includes: and segmenting the data access request according to the set task segmentation step length to generate a data access subtask.
Optionally, the segmenting the data access request according to the set task segmentation step size to generate a data access subtask includes: and based on a set asynchronous slicer, the data access request is sliced according to a set task slicing step length to generate a data access subtask.
Optionally, the determining data nodes that can respond to the data access request in the heterogeneous network, and forming a resource pool based on the determined data nodes includes:
the method comprises the steps of obtaining data nodes with idle resources in a heterogeneous network, carrying out statistics on historical energy consumption and response time on the data nodes with the idle data resources to determine the data nodes which can respond to the data access request in the heterogeneous network, and forming a resource pool based on the determined data nodes.
Optionally, the calculating a split index value of each data node in the resource pool includes:
and calculating the distribution index value of each data node in the resource pool based on the shortest delay task response evaluation value, the connection stability evaluation value of each data node and the resource effectiveness evaluation value.
Optionally, the establishing an index relationship between the data nodes and the subtasks, so that each data access subtask is responded by at least one data node based on the index relationship, includes:
and establishing an index relationship between the data nodes and the subtasks by taking the data access request as a root node and the data nodes as branch nodes of a tree structure, and taking the subtasks with the index relationship as leaf nodes, so that each data access subtask is responded by at least one data node based on the index relationship.
Optionally, the aggregating the response results of all the data access subtasks to form a response to the data access request by concatenation includes: and taking the leaf node as a bifurcation node, taking a corresponding response result as a secondary leaf node of the leaf node to convert the tree result into a response result tree, and summarizing the response results of all the data access subtasks based on the response result tree so as to splice to form a response aiming at the data access request.
A data access device in a heterogeneous network, comprising:
the first processing unit is used for acquiring a data access request in a heterogeneous network to generate a data access subtask;
the second processing unit is used for determining data nodes which can respond to the data access request in the heterogeneous network and forming a resource pool based on the determined data nodes;
the third processing unit is used for calculating the distribution index value of each data node in the resource pool;
the fourth processing unit is used for establishing an index relationship between the data nodes and the subtasks, so that each data access subtask is responded by at least one data node based on the index relationship;
and the fifth processing unit is used for summarizing the response results of all the data access subtasks so as to splice and form a response aiming at the data access request.
Optionally, the first processing unit is specifically configured to: and acquiring a data access request in the heterogeneous network according to a set polling time range through a set timing polling interface so as to generate a data access subtask.
Optionally, the first processing unit is specifically configured to: and adding the acquired data access requests in the heterogeneous network into a pre-established request queue, sequencing the data access requests in the request queue according to the priority of the data access requests, and allocating the priority of the response according to the sequencing order.
Optionally, the first processing unit is specifically configured to: and segmenting the data access request according to the set task segmentation step length to generate a data access subtask.
Optionally, the first processing unit is specifically configured to: and based on a set asynchronous slicer, the data access request is sliced according to a set task slicing step length to generate a data access subtask.
Optionally, the second processing unit is specifically configured to:
the method comprises the steps of obtaining data nodes with idle resources in a heterogeneous network, carrying out statistics on historical energy consumption and response time on the data nodes with the idle data resources to determine the data nodes which can respond to the data access request in the heterogeneous network, and forming a resource pool based on the determined data nodes.
Optionally, the third processing unit is specifically configured to:
and calculating the distribution index value of each data node in the resource pool based on the shortest delay task response evaluation value, the connection stability evaluation value of each data node and the resource effectiveness evaluation value.
Optionally, the fourth processing unit is specifically configured to:
and establishing an index relationship between the data nodes and the subtasks by taking the data access request as a root node and the data nodes as branch nodes of a tree structure, and taking the subtasks with the index relationship as leaf nodes, so that each data access subtask is responded by at least one data node based on the index relationship.
Optionally, the fifth processing unit is specifically configured to: and taking the leaf node as a bifurcation node, taking a corresponding response result as a secondary leaf node of the leaf node to convert the tree result into a response result tree, and summarizing the response results of all the data access subtasks based on the response result tree so as to splice to form a response aiming at the data access request.
An electronic device, comprising: the device comprises a memory and a processor, wherein the memory is stored with a computer executable program, and the processor is used for executing the computer executable program to implement the method of any one of the embodiment of the application.
A computer storage medium having a computer-executable program stored thereon, the computer-executable program when executed performing the method of any one of the embodiments.
In the embodiment of the application, a data access request in a heterogeneous network is obtained to generate a data access subtask; determining data nodes which can respond to the data access request in the heterogeneous network, and forming a resource pool based on the determined data nodes; calculating the distribution index value of each data node in the resource pool; establishing an index relationship between the data nodes and the subtasks, such that each data access subtask is responded to by at least one data node based on the index relationship; and summarizing the response results of all the data access subtasks to form a response aiming at the data access request in a splicing manner, so that the difficulty of data access in the heterogeneous network is reduced.
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, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive exercise.
Fig. 1 is a schematic flowchart of a data access method in a heterogeneous network according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a data access apparatus in a heterogeneous network according to an embodiment of the present application;
FIG. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application;
fig. 4 is a schematic diagram of a hardware structure of an electronic device according to an embodiment of the present application.
Detailed Description
It is not necessary for any particular embodiment of the invention to achieve all of the above advantages at the same time.
In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the 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 invention.
In the embodiment of the application, a data access request in a heterogeneous network is obtained to generate a data access subtask; determining data nodes which can respond to the data access request in the heterogeneous network, and forming a resource pool based on the determined data nodes; calculating the distribution index value of each data node in the resource pool; establishing an index relationship between the data nodes and the subtasks, such that each data access subtask is responded to by at least one data node based on the index relationship; and summarizing the response results of all the data access subtasks to form a response aiming at the data access request in a splicing manner, so that the difficulty of data access in the heterogeneous network is reduced.
In the following embodiments of the present application, the execution subject of the method may be a server.
Fig. 1 is a schematic flowchart of a data access method in a heterogeneous network according to an embodiment of the present application;
as shown in fig. 1, it includes:
s101, acquiring a data access request in a heterogeneous network to generate a data access subtask;
optionally, the obtaining a data access request in a heterogeneous network to generate a data access subtask includes: and acquiring a data access request in the heterogeneous network according to a set polling time range through a set timing polling interface so as to generate a data access subtask.
In this embodiment, the timed polling interface is directly used as an API interface to quickly and easily implement acquisition of a data access request, so as to generate a data access subtask.
In this embodiment, the polling time range may be flexibly set according to the requirements of the application scenario.
In this embodiment, the obtaining a data access request in a heterogeneous network to generate a data access subtask includes: and adding the acquired data access requests in the heterogeneous network into a pre-established request queue, sequencing the data access requests in the request queue according to the priority of the data access requests, and allocating the priority of the response according to the sequencing order.
Therefore, the management of the data access request, particularly the management of the priority, is realized through the request queue, so that the response priority of the data access request can be dynamically adjusted according to the real-time condition of the heterogeneous network, the generalization performance and the real-time performance of the data access are improved, and the data access is prevented from being wrongly refused.
Optionally, the obtaining a data access request in a heterogeneous network to generate a data access subtask includes: and segmenting the data access request according to the set task segmentation step length to generate a data access subtask.
Specifically, the segmenting the data access request according to the set task segmentation step size to generate the data access subtask includes: and based on a set asynchronous slicer, the data access request is sliced according to a set task slicing step length to generate a data access subtask.
Specifically, in this embodiment, the asynchronous partitioner may perform the partitioning one by one according to the priority of the data access request in the request queue, for this reason, the granularity partitioned by the asynchronous partitioner is a single data access request, and when a single data access request is partitioned, the asynchronous partitioner performs the partitioning with a set task partitioning step as the granularity, so that the accuracy and the efficiency of the partitioning are ensured.
In this embodiment, specifically, the single data access request may be allocated to multiple threads for execution, so as to implement the split.
S102, determining data nodes capable of responding to the data access request in the heterogeneous network, and forming a resource pool based on the determined data nodes;
in this embodiment, the determining the data nodes that can respond to the data access request in the heterogeneous network, and forming a resource pool based on the determined data nodes includes:
the method comprises the steps of obtaining data nodes with idle resources in a heterogeneous network, carrying out statistics on historical energy consumption and response time on the data nodes with the idle data resources to determine the data nodes which can respond to the data access request in the heterogeneous network, and forming a resource pool based on the determined data nodes.
In this embodiment, all data nodes in the heterogeneous network may be monitored to determine data nodes having idle resources in the heterogeneous network in real time.
In this embodiment, when the data nodes of the idle data resources are subjected to statistics of historical energy consumption and response time, the data nodes may be used as keys in key value pairs, and the historical energy consumption and the response time are used as values in the key value pairs, so that the data nodes of the idle data resources are conveniently managed, and when the data nodes of the idle data resources are subjected to statistics of historical energy consumption and response time, the historical energy consumption and the response time to be used are quickly obtained from the corresponding key value pairs.
Specifically, a data node that can respond to the data access request in the heterogeneous network is determined, for example, a data node whose average value of historical energy consumption and response time is greater than a corresponding set threshold is used as a data node that can respond to the data access request.
S103, calculating a distribution index value of each data node in the resource pool;
in this embodiment, the calculating the distribution index value of each data node in the resource pool includes: and calculating the distribution index value of each data node in the resource pool based on the shortest delay task response evaluation value, the connection stability evaluation value of each data node and the resource effectiveness evaluation value.
Specifically, different weights can be assigned to the shortest delay task response evaluation value, the connection stability evaluation value of each data node, and the resource availability evaluation value, and the weights and the corresponding evaluation values are multiplied and then summed to obtain a distribution index value of each data node, where the larger the value is, the better the distribution performance is, that is, the more the requirement for executing the subtasks can be satisfied.
S104, establishing an index relationship between the data nodes and the subtasks, so that each data access subtask is responded by at least one data node based on the index relationship;
in this embodiment, the establishing an index relationship between the data nodes and the subtasks, so that each data access subtask is responded by at least one data node based on the index relationship, includes: and establishing an index relationship between the data nodes and the subtasks by taking the data access request as a root node and the data nodes as branch nodes of a tree structure, and taking the subtasks with the index relationship as leaf nodes, so that each data access subtask is responded by at least one data node based on the index relationship.
In the embodiment, the tree structure is used for realizing the rapid construction of the corresponding relation between the data nodes and the subtasks, and the tree structure can be rapidly implemented during the subsequent execution of the subtasks, so that the efficiency of executing the scheme is improved.
And S105, summarizing the response results of all the data access subtasks to splice to form a response aiming at the data access request.
In this embodiment, the collecting response results of all the data access subtasks to form a response to the data access request by splicing includes: and taking the leaf node as a bifurcation node, taking a corresponding response result as a secondary leaf node of the leaf node to convert the tree result into a response result tree, and summarizing the response results of all the data access subtasks based on the response result tree so as to splice to form a response aiming at the data access request.
In this embodiment, on the basis of the tree structure in step S103, a response result tree is further generated, which simplifies the difficulty of algorithm design, and simultaneously increases the speed of executing step S103 and reduces the difficulty of algorithm execution.
Fig. 2 is a schematic structural diagram of a data access apparatus in a heterogeneous network according to an embodiment of the present application;
as shown in fig. 2, it includes:
the first processing unit is used for acquiring a data access request in a heterogeneous network to generate a data access subtask;
the second processing unit is used for determining data nodes which can respond to the data access request in the heterogeneous network and forming a resource pool based on the determined data nodes;
the third processing unit is used for calculating the distribution index value of each data node in the resource pool;
the fourth processing unit is used for establishing an index relationship between the data nodes and the subtasks, so that each data access subtask is responded by at least one data node based on the index relationship;
and the fifth processing unit is used for summarizing the response results of all the data access subtasks so as to splice and form a response aiming at the data access request.
Optionally, the first processing unit is specifically configured to: and acquiring a data access request in the heterogeneous network according to a set polling time range through a set timing polling interface so as to generate a data access subtask.
Optionally, the first processing unit is specifically configured to: and adding the acquired data access requests in the heterogeneous network into a pre-established request queue, sequencing the data access requests in the request queue according to the priority of the data access requests, and allocating the priority of the response according to the sequencing order.
Optionally, the first processing unit may include:
the adding unit is used for adding the acquired data access requests in the heterogeneous network into a pre-established request queue;
and the sequencing unit is used for sequencing the data access requests in the request queue according to the priority of the data access requests so as to distribute the priorities of the responses according to the sequencing sequence.
Optionally, the first processing unit is specifically configured to: and segmenting the data access request according to the set task segmentation step length to generate a data access subtask.
Optionally, the first processing unit is specifically configured to: and based on a set asynchronous slicer, the data access request is sliced according to a set task slicing step length to generate a data access subtask.
Optionally, the second processing unit is specifically configured to:
the method comprises the steps of obtaining data nodes with idle resources in a heterogeneous network, carrying out statistics on historical energy consumption and response time on the data nodes with the idle data resources to determine the data nodes which can respond to the data access request in the heterogeneous network, and forming a resource pool based on the determined data nodes.
Optionally, the second processing unit specifically includes:
the statistical unit is used for acquiring data nodes with idle resources in the heterogeneous network and carrying out historical energy consumption and response time statistics on the data nodes with the idle resources;
and the selecting unit is used for determining the data nodes which can respond to the data access request in the heterogeneous network and forming a resource pool based on the determined data nodes.
Optionally, the third processing unit is specifically configured to:
and calculating the distribution index value of each data node in the resource pool based on the shortest delay task response evaluation value, the connection stability evaluation value of each data node and the resource effectiveness evaluation value.
Optionally, the fourth processing unit is specifically configured to:
and establishing an index relationship between the data nodes and the subtasks by taking the data access request as a root node and the data nodes as branch nodes of a tree structure, and taking the subtasks with the index relationship as leaf nodes, so that each data access subtask is responded by at least one data node based on the index relationship.
Optionally, the fourth processing unit specifically includes:
the index establishing unit is used for establishing an index relationship between the data nodes and the subtasks by taking the data access request as a root node and the data nodes as branch nodes of a tree structure, and taking the subtasks with the index relationship as leaf nodes;
a response enabling unit, configured to enable each data access subtask to be responded to by at least one data node based on the index relationship.
Optionally, the fifth processing unit is specifically configured to: and taking the leaf node as a bifurcation node, taking a corresponding response result as a secondary leaf node of the leaf node to convert the tree result into a response result tree, and summarizing the response results of all the data access subtasks based on the response result tree so as to splice to form a response aiming at the data access request.
Optionally, the fifth processing unit specifically includes:
the node expansion unit is used for taking the leaf node as a bifurcation node and taking a corresponding response result as a secondary leaf node of the leaf node so as to convert the tree result into a response result tree;
and the summarizing unit is used for summarizing the response results of all the data access subtasks based on the response result tree so as to splice and form a response aiming at the data access request.
An embodiment of the present application further provides a computer storage medium, where a computer executable program is stored on the computer storage medium, and the computer executable program is executed to implement the method according to any one of the embodiments of the present application.
Embodiments of the present application further provide a computer program product, where a computer executable program is stored on the computer program product, and the computer executable program is executed to implement the method according to any one of the embodiments of the present application.
FIG. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application; as shown in fig. 3, it includes: a memory 301 having stored thereon a computer executable program and a processor 302 for executing the computer executable program to implement the method of any of the embodiments of the present application.
Fig. 4 is a schematic diagram of a hardware structure of an electronic device according to an embodiment of the present application; as shown in fig. 4, the hardware structure of the electronic device may include: a processor 401, a communication interface 402, a computer-readable medium 403, and a communication bus 404;
the processor 401, the communication interface 402, and the computer-readable medium 403 are configured to communicate with each other via a communication bus 404;
optionally, the communication interface 402 may be an interface of a communication module, such as an interface of a GSM module;
the processor 401 may be specifically configured to run an executable program stored in the memory, so as to perform all or part of the processing steps of any of the above-described method embodiments.
The electronic device of the embodiments of the present application exists in various forms, including but not limited to:
(1) mobile communication devices, which are characterized by mobile communication capabilities and are primarily targeted at providing voice and data communications. Such terminals include smart phones (e.g., iphones), multimedia phones, functional phones, and low-end phones, among others.
(2) The ultra-mobile personal computer equipment belongs to the category of personal computers, has calculation and processing functions and generally has the characteristic of mobile internet access. Such terminals include PDA, MID, and UMPC devices, such as ipads.
(3) Portable entertainment devices such devices may display and play multimedia content. Such devices include audio and video players (e.g., ipods), handheld game consoles, electronic books, as well as smart toys and portable car navigation devices.
(4) The server is similar to a general computer architecture, but has higher requirements on processing capability, stability, reliability, safety, expandability, manageability and the like because of the need of providing highly reliable services.
(5) And other electronic devices with data interaction functions.
It should be noted that, according to the implementation requirement, each component/step described in the embodiment of the present application may be divided into more components/steps, and two or more components/steps or partial operations of the components/steps may also be combined into a new component/step to achieve the purpose of the embodiment of the present application.
The above-described methods according to embodiments of the present application may be implemented in hardware, firmware, or as software or computer code storable in a recording medium such as a CD ROM, a RAM, a floppy disk, a hard disk, or a magneto-optical disk, or as computer code originally stored in a remote recording medium or a non-transitory machine-readable medium downloaded through a network and to be stored in a local recording medium, so that the methods described herein may be stored in such software processes on a recording medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware such as an ASIC or FPGA. It will be appreciated that the computer, processor, microprocessor controller or programmable hardware includes memory components (e.g., RAM, ROM, flash memory, etc.) that can store or receive software or computer code that, when accessed and executed by the computer, processor or hardware, implements the verification code generation methods described herein. Further, when a general-purpose computer accesses code for implementing the check code generation method shown herein, execution of the code converts the general-purpose computer into a special-purpose computer for executing the check code generation method shown herein.
Those of ordinary skill in the art will appreciate that the various illustrative elements and method steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the embodiments of the present application.
The above embodiments are only used for illustrating the embodiments of the present application, and not for limiting the embodiments of the present application, and those skilled in the relevant art can make various changes and modifications without departing from the spirit and scope of the embodiments of the present application, so that all equivalent technical solutions also belong to the scope of the embodiments of the present application, and the scope of patent protection of the embodiments of the present application should be defined by the claims.
Claims (10)
1. A method for accessing data in a heterogeneous network, comprising:
acquiring a data access request in a heterogeneous network to generate a data access subtask;
determining data nodes which can respond to the data access request in the heterogeneous network, and forming a resource pool based on the determined data nodes;
calculating the distribution index value of each data node in the resource pool;
establishing an index relationship between the data nodes and the subtasks, such that each data access subtask is responded to by at least one data node based on the index relationship;
and summarizing the response results of all the data access subtasks to splice to form a response aiming at the data access request.
2. The method of claim 1, wherein obtaining the data access request in the heterogeneous network to generate the data access subtask comprises: and acquiring a data access request in the heterogeneous network according to a set polling time range through a set timing polling interface so as to generate a data access subtask.
3. The method of claim 1, wherein obtaining the data access request in the heterogeneous network to generate the data access subtask comprises: and adding the acquired data access requests in the heterogeneous network into a pre-established request queue, sequencing the data access requests in the request queue according to the priority of the data access requests, and allocating the priority of the response according to the sequencing order.
4. The method of claim 1, wherein obtaining the data access request in the heterogeneous network to generate the data access subtask comprises: and segmenting the data access request according to the set task segmentation step length to generate a data access subtask.
5. An apparatus for data access in a heterogeneous network, comprising:
the first processing unit is used for acquiring a data access request in a heterogeneous network to generate a data access subtask;
the second processing unit is used for determining data nodes which can respond to the data access request in the heterogeneous network and forming a resource pool based on the determined data nodes;
the third processing unit is used for calculating the distribution index value of each data node in the resource pool;
the fourth processing unit is used for establishing an index relationship between the data nodes and the subtasks, so that each data access subtask is responded by at least one data node based on the index relationship;
and the fifth processing unit is used for summarizing the response results of all the data access subtasks so as to splice and form a response aiming at the data access request.
6. The apparatus of claim 5, wherein the first processing unit is specifically configured to: and acquiring a data access request in the heterogeneous network according to a set polling time range through a set timing polling interface so as to generate a data access subtask.
7. The apparatus of claim 5, wherein the first processing unit is specifically configured to: and adding the acquired data access requests in the heterogeneous network into a pre-established request queue, sequencing the data access requests in the request queue according to the priority of the data access requests, and allocating the priority of the response according to the sequencing order.
8. The apparatus of claim 5, wherein the first processing unit is specifically configured to: and segmenting the data access request according to the set task segmentation step length to generate a data access subtask.
9. An electronic device, comprising: a memory having stored thereon a computer-executable program, and a processor for executing the computer-executable program to implement the method of any one of claims 1-4.
10. A computer storage medium having stored thereon a computer-executable program which, when executed, implements the method of any of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111591153.4A CN114297294A (en) | 2021-12-23 | 2021-12-23 | Data access method and device in heterogeneous network and related products |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111591153.4A CN114297294A (en) | 2021-12-23 | 2021-12-23 | Data access method and device in heterogeneous network and related products |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114297294A true CN114297294A (en) | 2022-04-08 |
Family
ID=80970306
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111591153.4A Pending CN114297294A (en) | 2021-12-23 | 2021-12-23 | Data access method and device in heterogeneous network and related products |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114297294A (en) |
-
2021
- 2021-12-23 CN CN202111591153.4A patent/CN114297294A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109669774B (en) | Hardware resource quantification method, hardware resource arrangement method, hardware resource quantification device and hardware resource arrangement device and network equipment | |
| WO2019042180A1 (en) | Resource allocation method and related product | |
| WO2017166643A1 (en) | Method and device for quantifying task resources | |
| US20170185454A1 (en) | Method and Electronic Device for Determining Resource Consumption of Task | |
| CN112764920A (en) | Edge application deployment method, device, equipment and storage medium | |
| CN116431282A (en) | Cloud virtual host server management method, device, equipment and storage medium | |
| CN112134883A (en) | Method and device for quickly authenticating trust relationship between nodes based on trusted computing and related products | |
| CN112286930A (en) | Method, device, storage medium and electronic equipment for resource sharing of redis business side | |
| CN107277640A (en) | Interactive approach, device and storage medium based on live platform | |
| CN114297294A (en) | Data access method and device in heterogeneous network and related products | |
| CN111124669A (en) | Operation method, system, terminal and storage medium of distributed SaaS software | |
| CN109429282B (en) | Frequency point configuration method and device | |
| CN114338386B (en) | Network configuration method and device, electronic equipment and storage medium | |
| CN113568730A (en) | Constraint scheduling method and device for heterogeneous tasks and related products | |
| CN111181875A (en) | Bandwidth adjusting method and device | |
| CN114422511A (en) | Method and device for managing data nodes in heterogeneous network and related products | |
| CN113986132A (en) | Method, device and related product for sharing storage resources in heterogeneous network | |
| CN114565105A (en) | Data processing method and deep learning model training method and device | |
| CN113656046A (en) | Application deployment method and device | |
| CN109840135B (en) | Load balancing method and device and electronic equipment | |
| CN113612642B (en) | Method and device for describing heterogeneous tasks based on communication overhead and related products | |
| CN113608696A (en) | Automatic configuration method and device for shared storage resources in heterogeneous network and related products | |
| CN113992757B (en) | Storage resource sharing management method and device in heterogeneous network and related products | |
| CN113986498A (en) | Processing method and device for task mutual exclusion in heterogeneous network and related products | |
| CN113992572B (en) | Routing method, device and storage medium for shared storage resource path in heterogeneous network |
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 |