CN112351103A - Resource management method and device - Google Patents

Resource management method and device Download PDF

Info

Publication number
CN112351103A
CN112351103A CN202011249590.3A CN202011249590A CN112351103A CN 112351103 A CN112351103 A CN 112351103A CN 202011249590 A CN202011249590 A CN 202011249590A CN 112351103 A CN112351103 A CN 112351103A
Authority
CN
China
Prior art keywords
node
resource
simulation
packing
identifier
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.)
Granted
Application number
CN202011249590.3A
Other languages
Chinese (zh)
Other versions
CN112351103B (en
Inventor
王裕迪
李佳翰
牛福振
胡浩
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Bilibili Technology Co Ltd
Original Assignee
Shanghai Bilibili Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shanghai Bilibili Technology Co Ltd filed Critical Shanghai Bilibili Technology Co Ltd
Priority to CN202011249590.3A priority Critical patent/CN112351103B/en
Publication of CN112351103A publication Critical patent/CN112351103A/en
Application granted granted Critical
Publication of CN112351103B publication Critical patent/CN112351103B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/131—Protocols for games, networked simulations or virtual reality
    • A—HUMAN NECESSITIES
    • A63—SPORTS; GAMES; AMUSEMENTS
    • A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
    • A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
    • A63F13/60—Generating or modifying game content before or while executing the game program, e.g. authoring tools specially adapted for game development or game-integrated level editor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/30—Creation or generation of source code
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/60—Software deployment
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations
    • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/185—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with management of multicast group membership
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/34—Network arrangements or protocols for supporting network services or applications involving the movement of software or configuration parameters 

Abstract

The application provides a resource management method and a device, wherein the resource management method comprises the following steps: the method comprises the steps of obtaining a simulation packing result generated by simulation packing of resources to be processed, constructing a relation network of at least two simulation resource packages according to identification information of the at least two simulation resource packages generated by simulation packing and a dependency relation between the at least two simulation resource packages, contained in the simulation packing result, grouping the at least two simulation resource packages according to an incidence relation of each node in the relation network, and calling a packing interface to pack the resources to be processed corresponding to each grouping result.

Description

Resource management method and device
Technical Field
The present application relates to the field of computer technologies, and in particular, to a resource management method. One or more embodiments of the present application also relate to a resource management apparatus, a computing device, and a computer-readable storage medium.
Background
Unity is a multi-platform, comprehensive game development tool developed by Unity Technologies for creating types of interactive content such as three-dimensional video games, building visualizations, real-time three-dimensional animations, etc., and is a fully integrated professional game engine.
In view of the limitations of the operating platform and the Unity, the Unity resource is typically dynamically updated and loaded by being packaged as a resource package (AssetBundle). Unity resources refer to elements used to generate a scene and various objects in the scene, such as model map material, scene source files, plug-ins, and the like. Asset bundle is a function provided by UnityPro, and can pack a plurality of game objects or resource binary files into Asset bundle, and a method for packing and unpacking is provided.
For games with huge resources, the required resource types are large, and the processing of various dependencies among resources and the time consumption for packaging are great problems, so an effective method is needed to solve such problems.
Disclosure of Invention
In view of the above, the present application provides a resource management method. One or more embodiments of the present application also relate to a resource management apparatus, a computing device, and a computer-readable storage medium, so as to solve the technical defects of resource packing, time consuming, and resource redundancy in the prior art.
According to a first aspect of the present application, there is provided a resource management method, including:
acquiring a simulation packing result generated by performing simulation packing on a resource to be processed, wherein the simulation packing result comprises identification information of at least two simulation resource packages generated by the simulation packing and a dependency relationship between the at least two simulation resource packages;
constructing a relationship network of the at least two simulation resource packages according to the identification information and the dependency relationship, wherein nodes of the relationship network represent the at least two simulation resource packages;
and grouping the at least two analog resource packets according to the incidence relation of each node in the relational network, and calling a packaging interface to package the resources to be processed corresponding to each grouping result.
According to a second aspect of the present application, there is provided a resource management apparatus comprising:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is configured to acquire a simulation packing result generated by performing simulation packing on resources to be processed, and the simulation packing result comprises identification information of at least two simulation resource packages generated by the simulation packing and a dependency relationship between the at least two simulation resource packages;
a building module configured to build a relationship network of the at least two simulated resource packages according to the identification information and the dependency relationship, wherein a node of the relationship network characterizes the at least two simulated resource packages;
and the packing module is configured to group the at least two analog resource packages according to the incidence relation of each node in the relational network, and call a packing interface to pack the to-be-processed resource corresponding to each grouping result.
According to a third aspect of the application, there is provided a computing device comprising:
a memory and a processor;
the memory is for storing computer-executable instructions and the processor is for implementing the steps of the resource management method when executing the computer-executable instructions.
According to a fourth aspect of the present application, there is provided a computer-readable storage medium storing computer-executable instructions that, when executed by a processor, implement the steps of the resource management method.
According to one embodiment of the application, a simulation packing result generated by simulation packing of resources to be processed is obtained, a relation network of at least two simulation resource packages is constructed according to identification information of the at least two simulation resource packages generated by simulation packing and a dependency relation between the at least two simulation resource packages, the at least two simulation resource packages are grouped according to an incidence relation of each node in the relation network, and a packing interface is called to pack the resources to be processed corresponding to each grouping result;
the resource packages with the dependency relationship are divided into a group and packaged simultaneously in the mode, redundancy of resources in the game packages can be effectively avoided, the groups are integrated according to the packaging resource consumption values required by the grouping results, the packaging interfaces of different machines are called to package the to-be-processed resources corresponding to the grouping results in parallel, resource packaging time consumption is reduced, and therefore resource packaging efficiency is improved.
Drawings
FIG. 1 is a flow chart of a resource management method according to an embodiment of the present application;
FIG. 2 is a diagram of a resource management process provided by one embodiment of the present application;
FIG. 3 is a flowchart illustrating a process of a resource management method according to an embodiment of the present application;
FIG. 4 is a diagram of a resource management apparatus according to an embodiment of the present application;
fig. 5 is a block diagram of a computing device according to an embodiment of the present application.
Detailed Description
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present application. This application is capable of implementation in many different ways than those herein set forth and of similar import by those skilled in the art without departing from the spirit of this application and is therefore not limited to the specific implementations disclosed below.
The terminology used in the one or more embodiments of the present application is for the purpose of describing particular embodiments only and is not intended to be limiting of the one or more embodiments of the present application. As used in one or more embodiments of the present application and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used in one or more embodiments of the present application refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It will be understood that, although the terms first, second, etc. may be used herein in one or more embodiments of the present application to describe various information, these information should not be limited by these terms. These terms are only used to distinguish one type of information from another. For example, a first aspect may be termed a second aspect, and, similarly, a second aspect may be termed a first aspect, without departing from the scope of one or more embodiments of the present application. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
First, the noun terms to which one or more embodiments of the present application relate are explained.
Unity: unity3D is a comprehensive game development tool with multiple platforms that allows players to easily create types of interactive content such as three-dimensional video games, building visualizations, real-time three-dimensional animations, etc., and is a fully integrated professional game engine.
Asset Bundle resource package: a resource compact package in Unity contains resources such as models, maps, preforms, sounds, etc. that can be loaded while the game is running.
And searching the set: the union query set is a tree-type data structure used for processing the merging and query problems of some Disjoint Sets.
A connected graph: one concept of connectivity in graph theory. In an undirected graph G, if there is a path connection from vertex i to vertex j (of course there is always a path from j to i), i and j are said to be connected.
Adjacency list: in graph theory and computer science, an adjacency list (English: adjacency list) is a set that represents the set of edges adjacent to each vertex in a graph, where a set refers to an unordered set.
In the present application, a resource management method is provided, and the present application relates to a resource management apparatus, a computing device, and a computer-readable storage medium, which are described in detail in the following embodiments one by one.
Because the Unity game item includes a large amount of game resources, such as models, maps, prefabricated objects, sounds, and the like, generally, these resources are packaged into resource packages so as to be dynamically updated or loaded during game operation, and Unity provides an interface for generating these resource packages, but a large amount of resources are very time-consuming when packaged into resource packages for the first time, and often require several hours of packaging time, and because there may be interdependencies between resource packages, if there is a dependency resource that cannot be packaged in the same batch (or on the same machine), the same resource will be copied into two parts and packaged into two different resource packages, which results in resource redundancy and increases the volume of the game package.
Based on this, in the resource management method provided in the embodiment of the present application, a simulation packing result generated by performing simulation packing on a resource to be processed is obtained, where the simulation packing result includes identification information of at least two simulation resource packages generated by performing simulation packing and a dependency relationship between the at least two simulation resource packages, a relationship network of the at least two simulation resource packages is constructed according to the identification information and the dependency relationship, where a node of the relationship network represents the at least two simulation resource packages, the at least two simulation resource packages are grouped according to an association relationship of each node in the relationship network, and a packing interface is called to pack the resource to be processed corresponding to each grouping result;
the resource packages with the dependency relationship are divided into a group and packaged simultaneously in the mode, redundancy of resources in the game packages can be effectively avoided, the groups are integrated according to the packaging resource consumption values required by the grouping results, packaging interfaces of different machines are called to package the resources to be processed corresponding to the simulation resource package set generated by integration in parallel, resource packaging time consumption is reduced, and resource packaging efficiency is improved.
Fig. 1 shows a flowchart of a resource management method according to an embodiment of the present application, which includes steps 102 to 106.
102, acquiring a simulation packing result generated by performing simulation packing on the resource to be processed, wherein the simulation packing result comprises identification information of at least two simulation resource packages generated by the simulation packing and a dependency relationship between the at least two simulation resource packages.
Specifically, the resource management method provided by the embodiment of the present application can be applied to any field that requires packaging of resources to be processed, such as packaging of game resources in the game field, packaging of audio resources in the audio field, packaging of video resources in the video field, packaging of voice conversation resources in the communication field, and the like; for convenience of understanding, the embodiment of the present application takes the example that the resource management method is applied to packaging game resources in the field of games, but is not limited to this.
If the resource management method is applied to the field of games, the resources to be processed include, but are not limited to, models, maps, prefabricated bodies, sounds, renderers, networks, scenes and the like, and after the resources to be processed are determined, the resources to be processed can be simulated and packaged through an idle mode provided by Unity, and a simulated and packaged result is generated.
Specifically, the idle mode is actually realized through a parameter option DryRunBuild (trial run build) of the Unity packing interface, the idle mode is used for performing simulation packing on the resource to be processed, that is, the trial run build is performed on the simulation resource package without performing real build, and after the trial run build option is enabled, the resource package build engine still returns a resource package object, which contains the identification information of the effective simulation resource package and the dependency relationship between the simulation resource packages.
Specifically, analog resource packing may be performed according to the resource identifier, the resource type, the resource size, and other information of the resource to be processed, so as to generate an analog packing result, where the analog packing result includes identifier information of an analog resource packet generated by analog packing and a dependency relationship between the analog resource packets.
Further, the dependency relationship between the simulation resource packages may be determined by the dependency relationship of the resources to be processed included in the simulation resource packages, for example, if the resources to be processed in the simulation resource package 1 and the resources to be processed in the simulation resource package 2 have a dependency relationship, it is determined that the simulation resource package 1 and the simulation resource package 2 have a dependency relationship; in practical applications, the determination manner of the dependency relationship between the simulation resource packages may be determined by specific conditions, and is not limited herein.
The resource to be processed is simulated and packaged in the idle mode, and the simulated packaging result corresponding to the resource to be processed can be obtained without actual packaging operation on the resource to be processed, so that the dependency relationship among the resource packages in the project is automatically collected, the process that a developer inquires the dependency relationship among the resource packages through read-write operation is saved, the resource packaging time is reduced, and the resource packaging efficiency is improved.
And 104, constructing a relationship network of the at least two simulation resource packages according to the identification information and the dependency relationship, wherein the nodes of the relationship network represent the at least two simulation resource packages.
Specifically, after the analog packing result is obtained through the idle mode provided by the Unity, a dependency network (i.e., an adjacency list) of at least two analog resource packages can be constructed according to the identification information of the analog resource packages and the dependency between the analog resource packages included in the analog packing result.
In the embodiment of the present application, the relationship network is composed of a series of nodes and relationships, where the nodes are used for representing the at least two simulation resource packages, and the edges are used for representing the dependency relationships between the simulation resource packages, and since there may be interactions (dependencies) between the nodes, the relationships between the nodes appear, and the relationship network is derived from the relationships.
In addition, each node is used for representing the simulation resource package, and also comprises information such as a node ID corresponding to the simulation resource package, a resource package name, a required packaging resource consumption value, and other resource package names having a dependency relationship with the simulation resource package, and the information is stored in a form of a self-defined data structure, wherein the node ID is used for identifying the simulation resource package node in a parallel search algorithm, and the node name is used for inquiring the dependency relationship of the simulation resource package.
After the information contained in each node is determined, the node names of other nodes having dependency relationship with the node can be inquired according to the node name corresponding to each node, so that the connection relationship between the nodes is constructed according to the inquiry result to generate the relationship network.
If 6 simulation resource packages are generated through simulation packaging, namely the resource package 1, the resource package 2, the resource package 3, the resource package 4, the resource package 5 and the resource package 6, the constructed relational network comprises 6 nodes which are used for representing the 6 resource packages respectively; in addition, if it is determined that there is a dependency relationship between the resource packages 1 and 3, a dependency relationship between the resource packages 2 and 3, and a dependency relationship between the resource packages 4 and 5 according to the simulation packing result, the relationship network constructed according to the dependency relationships is shown in fig. 2, and the constructed relationship network has only three edges respectively used for representing the dependency relationships between the resource packages 1 and 3, between the resource packages 2 and 3, and between the resource packages 4 and 5.
And 106, grouping the at least two analog resource packets according to the incidence relation of each node in the relational network, and calling a packaging interface to package the to-be-processed resource corresponding to each grouping result.
Specifically, after a relational network of at least two analog resource packages is constructed, the at least two analog resource packages may be grouped according to an association relationship of each node in the relational network, each node in the relational network includes a node identifier, but since the node identifier is used to uniquely identify each node, the node identifiers of each node are different, and in order to improve the processing efficiency of grouping the nodes, a grouping identifier (the same grouping identifier is added to a node having a dependency relationship) needs to be added to each node, so as to group the nodes according to the grouping identifier, that is, the nodes with the same grouping identifier are directly grouped into a group.
In specific implementation, the at least two simulation resource packages are grouped according to the incidence relation of each node in the relational network, namely, a connected domain formed between each node in the relational network is divided by using a set merging and searching algorithm, and the at least two simulation resource packages are grouped according to the division result.
Specifically, the union set searching algorithm is used for processing the merging and query problems of some disjoint sets, and is mainly used for judging whether two nodes in a relational network are in the same connected domain, and grouping at least two analog resource packets, that is, dividing the nodes in the same connected domain into a group.
Judging whether the two nodes are in the same connected domain, wherein the specific implementation steps are as follows:
the method comprises the following steps: establishing a SUB-Make-set (x) group for each node;
step two: after the relation between the two nodes a and b is obtained, corresponding groups SUB-Union (a and b) are combined, and a connected domain is formed between the a and the b;
step three: selecting one representative element in each packet to identify the packet, that is, selecting representative elements of each packet, for example, the selected representative elements are SUB-Find-set (a) and SUB-Find-set (b), then judging whether the two representative elements are in the same connected domain, which is equivalent to judging whether SUB-Find-set (a) or SUB-Find-set (b) is true, if true, then dividing nodes a and b into a group.
And the grouping of each simulation resource packet is realized through a parallel-searching algorithm, so that the grouping efficiency is improved.
Further, grouping the at least two simulation resource packages according to the association relationship of each node in the relationship network may specifically be implemented in the following manner:
determining whether a first node in the relational network records a group identifier;
if the first node records a group identifier, determining whether the group identifier of the first node is consistent with the node identifier of the first node;
if not, modifying the node identifier of the first node based on the group identifier, wherein the modified node identifier of the first node is consistent with the group identifier of the first node;
if the first node in the relational network does not record the grouping identification, updating the grouping identification of the first node according to the node identification of the first node, wherein the updated grouping identification of the first node is consistent with the node identification of the first node.
Specifically, the first node is any one node in the relational network, and as described above, in the embodiment of the present application, the nodes are grouped according to the group identifier, so that, for any one node in the relational network, if it needs to be grouped, it needs to be determined whether the node records the group identifier first, and under the condition that it is determined that the group identifier is not recorded in the first node, the node identifier of the first node may be used as the group identifier of the first node;
if the first node records the group identifier, determining whether the node identifier of the first node is consistent with the group identifier, and if not, using the group identifier as the group number identifier of the first node, so that the group number identifier of the first node is consistent with the group identifier.
Taking the example of generating 6 analog resource packets by analog packaging, if the first node is the node 1 corresponding to the resource packet 1, and if it is determined that no group identifier is recorded in the node 1, the node identifier (number 1) of the node 1 may be used as the group identifier of the node 1 (the group identifier corresponding to the node 1, i.e., the group number, is 1);
if the node 1 records the grouping identifier, determining whether the node identifier of the node 1 is consistent with the grouping identifier, and if not, using the grouping identifier as the group number identifier of the node 1, so that the group number identifier of the node 1 is consistent with the grouping identifier.
If the grouping identifier of the node 1 is inconsistent with the node identifier thereof, the node identifier thereof needs to be modified based on the grouping identifier so as to ensure the searching speed of the node, thereby being beneficial to improving the resource management efficiency.
In addition, after the group identifier and the node identifier of the first node are processed to keep consistent, the same processing method is adopted for the second node having the association relationship with the first node, so that the node identifiers of the second node are kept consistent with the group identifier, which can be specifically realized by the following steps:
determining a second node in the relationship network, wherein the second node has an association relationship with the first node, and determining whether a group identifier is recorded in the second node;
if the second node records a group identifier, determining whether the group identifier of the second node is consistent with the node identifier of the second node;
if not, modifying the node identifier of the second node based on the group identifier of the second node, wherein the modified node identifier of the second node is consistent with the group identifier of the second node;
and if the second node in the relational network does not record the group identification, updating the group identification of the second node according to the node identification of the second node, wherein the updated group identification of the second node is consistent with the node identification of the second node.
Along the above example, if the first node is the node 1 corresponding to the resource package 1 and the second node having an association relationship with the resource package 1 has the resource package 3, therefore, the second node having an association relationship with the node 1 is the node 3 corresponding to the resource package 3, and if it is determined that no group identifier is recorded in the node 3, the node identifier (number 3) of the node 3 can be used as the group identifier of the node 3 (the group identifier corresponding to the node 3 is 3);
if the node 3 records the group identifier, determining whether the node identifier of the node 3 is consistent with the group identifier, and if not, using the group identifier as the group number identifier of the node 3, so that the group number identifier of the node 3 is consistent with the group identifier.
And path optimization is carried out on the basis of the parallel search set algorithm, namely the grouping identification of the nodes to be associated is modified to keep the grouping identification consistent, so that the searching and grouping speed is improved, and the resource management efficiency is improved.
Further, after the node identifiers and the group identifiers of the first node and the second node are determined, the group identifiers of the two nodes need to be modified according to the size relationship of the group identifiers of the first node and the second node, which can be specifically realized by the following method:
comparing the group identifier of the first node with the group identifier of the second node;
if the comparison is inconsistent, taking the smaller group identifier in the group identifiers of the first node and the second node as a target group identifier;
modifying the group identity of the first node or the second node based on the target group identity.
Specifically, since the nodes in the relational network are grouped according to the group identifiers, after the group identifiers of the first node and the second node are determined, in order to ensure the consistency of the group identifiers of the first node and the second node, the group identifier of the first node and the group identifier of the second node need to be compared, if the group identifiers of the first node and the second node are determined to be inconsistent according to the comparison result, the smaller group identifier of the group identifiers of the first node and the second node is used as a target group identifier, and the group identifier of the first node or the second node is modified based on the target group identifier.
Along the above example, the first node is node 1, the second node is node 3, the group identifier of node 1 is 1, the group identifier of node 3 is 3, and there is an association relationship between node 1 and node 3, but the group identifiers of node 1 and node 3 are not consistent, so that the group identifier 1 of node 1 is taken as the target group identifier, and the group identifier of node 3 is modified from 3 to 1.
And processing the group identification of the second node, so that after the group identification of the second node is consistent with the group identification of the first node, the second node can be used as the first node, and the step of determining the second node in the relationship network, which has an association relationship with the first node, and determining whether the second node records the group identification is repeated, so as to traverse the nodes in the relationship network, wherein the node identifications of all the nodes in the relationship network are consistent with the group identifications after the traversal, and the group identifications of the nodes in the relationship network are consistent.
Therefore, after the traversal is completed, the nodes can be grouped according to the grouping identifiers of the nodes, if 6 analog resource packages are generated through analog packaging, the grouping results obtained by grouping the nodes according to the grouping identifiers are shown in fig. 2, the resource package 1, the resource package 2 and the resource package 3 are divided into a group 1, the resource package 4 and the resource package 5 are divided into a group 2, and the resource package 6 is divided into a group 3.
By the method, the resource packages with the dependency relationship are divided into a group and packaged at the same time, so that redundancy caused by the fact that the resource packages with the dependency relationship in the project are packaged separately can be effectively avoided.
In specific implementation, after nodes used for representing the simulation resource package in the relational network are grouped, a packaging interface is called to package the to-be-processed resources corresponding to each grouping result, and the method can be specifically realized by the following steps:
respectively estimating the packing resource consumption value required by each grouping result;
and integrating the grouping results according to the estimated results to generate at least two analog resource packet sets, and calling a packaging interface to respectively package the resources to be processed corresponding to the at least two analog resource packet sets.
Specifically, after at least two analog resource packages in the relational network are grouped, because the number of the analog resource packages contained in different groups is different, the consumption values of the packaging resources required by different groups are different, and in order to ensure that the time length consumed by packaging is equal as much as possible in the process of packaging the resources to be processed corresponding to different grouping results by different packaging machines in parallel, after the pre-estimated value of the consumption of the packaging resources required by each grouping result is obtained, each grouping result can be integrated according to the pre-estimated result to generate at least two analog resource package sets.
Further, the packing resource consumption value required by each grouping result is estimated, which can be specifically realized by the following method:
and estimating the packaging resource consumption value required by each grouping result according to the file type and the file size of the file contained in the simulation resource package in each grouping result.
The resource consumption value of any one analog resource packet in the grouping result can be obtained through the following modes:
determining the file type and the file size of at least one file in the first simulation resource package;
determining packed resource consumption reference values corresponding to the at least one file respectively according to the file types, and taking the product of the file size of the at least one file and the packed resource consumption reference values corresponding to the at least one file respectively as the packed resource consumption value of the at least one file;
summing the packaging resource consumption values of the at least one file, and taking the summation result as a first packaging resource consumption value required by the first simulation resource package;
the first analog resource packet is any one of analog resource packets contained in any one of the grouping results.
Specifically, the packing resource consumption value may be a time length required to be consumed for resource packing, and the time lengths required to be consumed for packing are different due to different types and sizes of different resources, so that, in order to reduce the resource packing time length and improve the resource packing efficiency, in the embodiment of the present application, after the analog resource packages are grouped, the grouping results may be integrated according to the calculation result by calculating the packing resource consumption value required for each grouping result, and the resources to be processed corresponding to each integrated analog resource package set may be packed in a parallel processing manner.
In practical applications, the file type of the resource to be processed includes, but is not limited to, a sound type, a picture type, a material type, a scene type, a prefabricated body type, a text type, and the like, and the type of the resource to be processed can be specifically determined by a suffix of the file, for example, if the suffix is mp3, the file is a sound type file, if the suffix is jpg or png, the file is a picture type file, if the suffix is mat, the file is a material type file, if the suffix is txt, the file is a text type file, and if the suffix is unity, the file is a scene type file.
Because each grouping result comprises at least one analog resource packet, the packing resource consumption value required by each grouping result is pre-estimated, namely the packing resource consumption value required by the analog resource packet in each grouping result is pre-estimated; if one grouping result contains two or more than two analog resource packets, the required packing resource consumption value of the grouping result is the sum of the required packing resource consumption values of the two or more than two analog resource packets contained in the grouping result.
The calculation process of the packing resource consumption value required by any one first simulation resource package in each grouping result is taken as an example for illustrative explanation, and the calculation process of the packing resource consumption value required by other simulation resource packages is similar to the calculation process of the first simulation resource package.
Specifically, for any one first simulation resource package, firstly, the file type and the file size of at least one file in the first simulation resource package need to be determined, the file type can be determined according to a file suffix, the file size can be determined according to attribute information of the file, since different file types correspond to different packaging resource consumption reference values, for example, the packaging resource consumption reference value of a picture class file is 3s/kb, the packaging resource consumption reference value of a text class file is 1s/kb, and the packaging resource consumption reference value of a scene class file is 5s/kb, after the file type and the file size of the file are determined, the product of the packaging resource consumption reference value corresponding to the file type and the file size can be used as the packaging resource consumption value of the file, and the packaging resource consumption values of all the files in the first simulation resource package are summed up, namely, the first packing resource consumption value required by the first simulation resource pack is obtained.
Further, after the first packing resource consumption value required by each analog resource package in each grouping result is obtained through calculation, the first packing resource consumption values corresponding to at least one first analog resource package in each grouping result are summed, and the summed result is used as the packing resource consumption value.
Taking the resource package 4 and the resource package 5 included in the group 2 in fig. 2 as an example, the resource package 4 includes a picture class file and a text class file, and the sizes of the two are 10kb and 20kb, respectively, so that the packing resource consumption value required by the resource package 4 is 3s/kb × 10kb +1s/kb × 20kb ═ 50 s; the resource package 5 includes a text file and a scene file, and the sizes of the text file and the scene file are 10kb and 20kb, respectively, so that the packing resource consumption value required by the resource package 5 is 1s/kb × 10kb +5s/kb × 20kb ═ 110 s; therefore, the packing resource consumption value required for group 2 is 50s +110 s-160 s.
Because each grouping result comprises at least one analog resource packet, the packaging resource consumption values required by the analog resource packets in each grouping result are summed to obtain the packaging resource consumption value required by each grouping result, and then the grouping results are integrated according to the packaging resource consumption values required by each grouping result, so that the resources to be processed corresponding to the integrated results are packaged, the resource packaging duration is reduced, and the resource packaging efficiency is improved.
In specific implementation, the number of the generated simulation resource packet sets may be determined according to a packing batch (the number of machines), and specifically may be implemented in the following manner:
calculating the average packing capacity corresponding to each packing batch according to the estimation result and the preset packing batch;
and integrating the grouping results according to the average packaging capacity and the packaging resource consumption value required by each grouping result to generate the at least two analog resource package sets.
Specifically, at least two simulation resource packages in the relational network are grouped, and after the required packing resource consumption value is estimated, grouping results can be integrated according to the estimation results, so that different packing machines are called to pack the to-be-processed resources corresponding to the simulation resource package set generated by integration in parallel.
Along the above example, if the packing resource consumption value required for group 1 is 300s, the packing resource consumption value required for group 2 is 160s, and the packing resource consumption value required for group 3 is 120s, therefore, if the predetermined packing lot is 2 lots, calculating the average packing capacity corresponding to 2 packing batches to be (300s +160s +120s)/2 to 290s according to the estimated result of the packing resource consumption value required by each grouping result, therefore, the group 1 may be integrated into the set 1, the group 2 and the group 3 may be integrated into the set 2, and the packaging interfaces of the machine 1 and the machine 2 are called to respectively package the resources to be processed corresponding to the set 1 and the set 2, where a specific integration result and a schematic diagram of a packaging process are shown in fig. 2, the set 1 generated by the integration of the group 1 is packaged by the machine 1, and the set 2 generated by the integration of the group 2 and the group 3 is packaged by the machine 2.
And integrating the groups according to the packaging resource consumption values required by the grouping results, calling packaging interfaces of different machines and packaging the to-be-processed resources corresponding to the integrated simulation resource packet set, so that the resource packaging time consumption is reduced, and the resource packaging efficiency is improved.
In addition, the resource management method provided in the embodiment of the present application is only described for the case where at least two simulation resource packages are generated by simulation package, in practical applications, the number of simulation resource packages generated by simulation package completely depends on the number of resource packages defined in advance in a project, if the number of resource packages defined in the project is 0 or 1, the number of simulation resource packages generated by simulation package is 0 or 1, and for the two cases where the number of simulation resource packages is 0 or 1, processing by the resource management method is not required.
According to one embodiment of the application, a relation network of at least two simulation resource packages is constructed by obtaining a simulation packing result generated by performing simulation packing on resources to be processed, according to identification information of at least two simulation resource packages generated by performing simulation packing and a dependency relation between the at least two simulation resource packages, which are contained in the simulation packing result, grouping the at least two simulation resource packages according to an incidence relation of each node in the relation network, respectively estimating a packing resource consumption value required by each grouping result, integrating each grouping result according to the estimation result to generate at least two simulation resource package sets, and calling a packing interface to respectively pack the resources to be processed corresponding to the at least two simulation resource package sets;
the simulation resource packages with dependency relations are divided into a group and packaged simultaneously in the mode, redundancy caused by the fact that the resource packages with dependency relations in the project are packaged separately can be effectively avoided, the groups are integrated according to the packaging resource consumption values required by the grouping results, packaging interfaces of different machines are called to package the resources to be processed corresponding to the simulation resource package set generated by integration in parallel, resource packaging time consumption is reduced, and resource packaging efficiency is improved.
The resource management method is further described below with reference to fig. 3, taking an application of the resource management method provided in the present application in a game scene as an example. Fig. 3 shows a flowchart of a processing procedure of a resource management method according to an embodiment of the present application, and specific steps include step 302 to step 336.
Step 302, obtaining a simulation packaging result generated by simulation packaging for the game resource to be processed.
Specifically, the simulation packing result includes identification information of at least two simulation resource packages generated by simulation packing and a dependency relationship between the at least two simulation resource packages.
And step 304, constructing a relationship network of the two simulation resource packages according to the identification information and the dependency relationship.
Specifically, the nodes of the relational network characterize the at least two simulation resource packages.
Step 306, it is determined whether the first node in the relational network records the packet identifier.
If the first node records a group identifier, executing step 308; if the first node does not record the packet identifier, step 312 is executed.
Step 308, determining whether the group identifier of the first node is consistent with the node identifier of the first node;
if not, go to step 310; if so, go to step 314.
The node identification of the first node is modified based on the group identification, step 310.
Specifically, after modification, the node identifier of the first node is consistent with the group identifier of the first node.
Step 312, updating the group id of the first node according to the node id of the first node.
Specifically, the updated group identifier of the first node is consistent with the node identifier of the first node.
Step 314, determining a second node in the relationship network having an association relationship with the first node.
At step 316, it is determined whether the second node has a packet identifier recorded.
If the second node records a group identifier, execute step 318; if the second node does not record the packet identifier, go to step 322.
At step 318, it is determined whether the group identification of the second node is consistent with the node identification of the second node.
If not, go to step 320; if so, go to step 324.
At step 320, the node identification of the second node is modified based on the group identification of the second node.
Specifically, after modification, the node identifier of the second node is consistent with the group identifier of the second node.
Step 322, updating the group identifier of the second node according to the node identifier of the second node.
Specifically, the updated group identifier of the second node is consistent with the node identifier of the second node.
Step 324, comparing whether the group identifier of the first node is consistent with the group identifier of the second node.
If the comparison is not consistent, go to step 326; if the comparison is consistent, the second node is taken as the first node, and step 316 is continuously executed until the node identifier of each node in all the nodes in the relational network is consistent with the group identifier thereof, and then the process is ended.
In step 326, the smaller one of the group id of the first node and the group id of the second node is used as the target group id.
Step 328, the group identity of the first node or the second node is modified based on the target group identity.
Step 330, estimating the packing resource consumption value required by each grouping result according to the file type and the file size of the file included in the simulation resource package in each grouping result.
And 332, calculating the average packaging capacity corresponding to each packaging batch according to the estimation result and the preset packaging batch.
And 334, integrating the grouping results according to the average packaging capacity and the packaging resource consumption value required by each grouping result to generate at least two analog resource package sets.
And 336, calling a packaging interface to respectively package the game resources to be processed corresponding to the at least two simulation resource package sets.
The simulation resource packages with dependency relations are divided into a group and packaged simultaneously in the mode, redundancy caused by the fact that the resource packages with dependency relations in the project are packaged separately can be effectively avoided, the groups are integrated according to the packaging resource consumption values required by the grouping results, packaging interfaces of different machines are called to package game resources to be processed corresponding to the simulation resource package set generated by integration in parallel, time consumed by packaging of the game resources is reduced, and therefore packaging efficiency of the game resources is improved.
Corresponding to the above method embodiment, the present application further provides a resource management device embodiment, and fig. 4 shows a schematic diagram of a resource management device provided in an embodiment of the present application. As shown in fig. 4, the apparatus includes:
an obtaining module 402, configured to obtain a simulation packing result generated by performing simulation packing on a resource to be processed, where the simulation packing result includes identification information of at least two simulation resource packages generated by the simulation packing and a dependency relationship between the at least two simulation resource packages;
a building module 404 configured to build a relationship network of the at least two simulated resource packages according to the identification information and the dependency relationship, wherein a node of the relationship network characterizes the at least two simulated resource packages;
and the packing module 406 is configured to group the at least two analog resource packages according to the association relationship of each node in the relationship network, and call a packing interface to pack the to-be-processed resource corresponding to each grouping result.
Optionally, the packing module 406 includes:
and the first grouping submodule is configured to divide a connected domain formed between nodes in the relational network by using a parallel-searching algorithm, and group the at least two analog resource packets according to a division result.
Optionally, the packing module 406 includes:
a first determining submodule configured to determine whether a first node in the relational network records a group identifier;
if the operation result of the first determining submodule is that a grouping identifier is recorded in the first node, operating a second determining submodule;
the second determining submodule is configured to determine whether the group identification of the first node is consistent with the node identification of the first node;
if the operation result of the second determination submodule is inconsistent, operating a first modification submodule;
the first modification submodule is configured to modify the node identifier of the first node based on the group identifier, and the modified node identifier of the first node is consistent with the group identifier of the first node.
Optionally, if the operation result of the first determining sub-module is that a packet identifier is recorded in the first node, the packing module 406 further includes:
and the first updating submodule is configured to update the group identifier of the first node according to the node identifier of the first node, and the updated group identifier of the first node is consistent with the node identifier of the first node.
Optionally, the packing module 406 further includes:
a third determining submodule configured to determine a second node in the relationship network, which has an association relationship with the first node, and determine whether a group identifier is recorded in the second node;
if the operation result of the third determining submodule is that a grouping identifier is recorded in the second node, operating a fourth determining submodule;
the fourth determining submodule is configured to determine whether the group identifier of the second node is consistent with the node identifier of the second node;
if the operation result of the fourth determination submodule is inconsistent, operating a second modification submodule;
the second modification submodule is configured to modify the node identifier of the second node based on the group identifier of the second node, and the modified node identifier of the second node is consistent with the group identifier of the second node.
Optionally, if the operation result of the third determining sub-module is that a group identifier is recorded in the second node, the packing module 406 further includes:
and the second updating submodule is configured to update the group identifier of the second node according to the node identifier of the second node, and the updated group identifier of the second node is consistent with the node identifier of the second node.
Optionally, the packing module 406 further includes:
a comparison submodule configured to compare the group identifier of the first node with the group identifier of the second node;
if the comparison result of the comparison sub-module is inconsistent, operating a target grouping identifier determining sub-module;
the target group identifier determining submodule is configured to take the smaller group identifier of the first node and the group identifier of the second node as a target group identifier;
a third modification submodule configured to modify the group identity of the first node or the second node based on the target group identity.
Optionally, the packing module 406 further includes:
the estimation submodule is configured to estimate the packing resource consumption value required by each grouping result respectively;
and the packaging submodule is configured to integrate each grouping result according to the estimation result to generate at least two analog resource packet sets, and call a packaging interface to respectively package the resources to be processed corresponding to the at least two analog resource packet sets.
Optionally, the predictor module includes:
and the estimating unit is configured to estimate the packaging resource consumption value required by each grouping result according to the file type and the file size of the file contained in the simulated resource packet in each grouping result.
Optionally, the predictor module includes:
a file information determination unit configured to determine a file type and a file size of at least one file in the first emulated resource package;
a first calculating unit, configured to determine packed resource consumption reference values corresponding to the at least one file respectively according to the file types, and take a product of a file size of the at least one file and the packed resource consumption reference values corresponding to the at least one file respectively as a packed resource consumption value of the at least one file;
a second calculation unit configured to sum the packing resource consumption values of the at least one file, and to take the sum result as a first packing resource consumption value required by the first simulation resource package;
the first analog resource packet is any one of analog resource packets contained in any one of the grouping results.
Optionally, the predictor module further includes:
and the estimation unit is configured to sum the first packing resource consumption values corresponding to at least one first simulation resource pack in each grouping result respectively, and take the sum result as the packing resource consumption value.
Optionally, the packing sub-module includes:
the calculating unit is configured to calculate the average packaging capacity corresponding to each packaging batch according to the estimation result and a preset packaging batch;
and the integration unit is configured to integrate the grouping results according to the average packaging capacity and the packaging resource consumption value required by each grouping result to generate the at least two analog resource package sets.
The foregoing is a schematic diagram of a resource management apparatus according to this embodiment. It should be noted that the technical solution of the resource management device and the technical solution of the resource management method belong to the same concept, and details that are not described in detail in the technical solution of the resource management device can be referred to the description of the technical solution of the resource management method.
FIG. 5 illustrates a block diagram of a computing device 500 provided according to an embodiment of the present application. The components of the computing device 500 include, but are not limited to, a memory 510 and a processor 520. Processor 520 is coupled to memory 510 via bus 530, and database 550 is used to store data.
Computing device 500 also includes access device 540, access device 540 enabling computing device 500 to communicate via one or more networks 560. Examples of such networks include the Public Switched Telephone Network (PSTN), a Local Area Network (LAN), a Wide Area Network (WAN), a Personal Area Network (PAN), or a combination of communication networks such as the internet. The access device 540 may include one or more of any type of network interface, e.g., a Network Interface Card (NIC), wired or wireless, such as an IEEE802.11 Wireless Local Area Network (WLAN) wireless interface, a worldwide interoperability for microwave access (Wi-MAX) interface, an ethernet interface, a Universal Serial Bus (USB) interface, a cellular network interface, a bluetooth interface, a Near Field Communication (NFC) interface, and so forth.
In one embodiment of the application, the above-described components of computing device 500 and other components not shown in FIG. 5 may also be connected to each other, such as by a bus. It should be understood that the block diagram of the computing device architecture shown in FIG. 5 is for purposes of example only and is not limiting as to the scope of the present application. Those skilled in the art may add or replace other components as desired.
Computing device 500 may be any type of stationary or mobile computing device, including a mobile computer or mobile computing device (e.g., tablet, personal digital assistant, laptop, notebook, netbook, etc.), mobile phone (e.g., smartphone), wearable computing device (e.g., smartwatch, smartglasses, etc.), or other type of mobile device, or a stationary computing device such as a desktop computer or PC. Computing device 500 may also be a mobile or stationary server.
Wherein the memory 510 is configured to store computer-executable instructions and the processor 520 is configured to execute the following computer-executable instructions for implementing the steps of the resource management method.
The above is an illustrative scheme of a computing device of the present embodiment. It should be noted that the technical solution of the computing device and the technical solution of the resource management method belong to the same concept, and details that are not described in detail in the technical solution of the computing device can be referred to the description of the technical solution of the resource management method.
An embodiment of the present application also provides a computer readable storage medium storing computer instructions, which when executed by a processor, are used for implementing the steps of the resource management method.
The above is an illustrative scheme of a computer-readable storage medium of the present embodiment. It should be noted that the technical solution of the storage medium belongs to the same concept as the technical solution of the resource management method, and details that are not described in detail in the technical solution of the storage medium can be referred to the description of the technical solution of the resource management method.
The foregoing description of specific embodiments of the present application has been presented. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
The computer instructions comprise computer program code which may be in the form of source code, object code, an executable file or some intermediate form, or the like. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like. It should be noted that the computer readable medium may contain content that is subject to appropriate increase or decrease as required by legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable media does not include electrical carrier signals and telecommunications signals as is required by legislation and patent practice.
It should be noted that, for the sake of simplicity, the foregoing method embodiments are described as a series of acts or combinations, but those skilled in the art should understand that the present application embodiment is not limited by the described acts or sequences, because some steps may be performed in other sequences or simultaneously according to the present application embodiment. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that acts and modules referred to are not necessarily required to implement the embodiments of the application.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
The preferred embodiments of the present application disclosed above are intended only to aid in the explanation of the application. Alternative embodiments are not exhaustive and do not limit the invention to the precise embodiments described. Obviously, many modifications and variations are possible in light of the above teaching. The embodiments were chosen and described in order to best explain the principles of the embodiments of the application and its practical application, to thereby enable others skilled in the art to best understand and utilize the application. The application is limited only by the claims and their full scope and equivalents.

Claims (15)

1. A method for resource management, comprising:
acquiring a simulation packing result generated by performing simulation packing on a resource to be processed, wherein the simulation packing result comprises identification information of at least two simulation resource packages generated by the simulation packing and a dependency relationship between the at least two simulation resource packages;
constructing a relationship network of the at least two simulation resource packages according to the identification information and the dependency relationship, wherein nodes of the relationship network represent the at least two simulation resource packages;
and grouping the at least two analog resource packets according to the incidence relation of each node in the relational network, and calling a packaging interface to package the resources to be processed corresponding to each grouping result.
2. The method according to claim 1, wherein said grouping the at least two simulated resource packages according to the association relationship of each node in the relational network comprises:
and dividing a connected domain formed among all nodes in the relational network by utilizing a parallel searching algorithm, and grouping the at least two analog resource packets according to a dividing result.
3. The method according to claim 1 or 2, wherein said grouping the at least two analog resource packages according to the association relationship of each node in the relationship network comprises:
determining whether a first node in the relational network records a group identifier;
if the first node records a group identifier, determining whether the group identifier of the first node is consistent with the node identifier of the first node;
and if not, modifying the node identifier of the first node based on the group identifier, wherein the modified node identifier of the first node is consistent with the group identifier of the first node.
4. The method of claim 3, wherein if the first node in the relational network does not record a packet identifier, the method further comprises:
and updating the group identifier of the first node according to the node identifier of the first node, wherein the updated group identifier of the first node is consistent with the node identifier of the first node.
5. The method according to claim 3, wherein said grouping said at least two simulated resource packages according to the association relationship of each node in said relational network further comprises:
determining a second node in the relationship network, wherein the second node has an association relationship with the first node, and determining whether a group identifier is recorded in the second node;
if the second node records a group identifier, determining whether the group identifier of the second node is consistent with the node identifier of the second node;
and if not, modifying the node identifier of the second node based on the group identifier of the second node, wherein the modified node identifier of the second node is consistent with the group identifier of the second node.
6. The method of claim 5, wherein if no packet identifier is recorded by the second node in the relational network, the method further comprises:
and updating the group identifier of the second node according to the node identifier of the second node, wherein the updated group identifier of the second node is consistent with the node identifier of the second node.
7. The resource management method of claim 5, further comprising:
comparing the group identifier of the first node with the group identifier of the second node;
if the comparison is inconsistent, taking the smaller group identifier in the group identifiers of the first node and the second node as a target group identifier;
modifying the group identity of the first node or the second node based on the target group identity.
8. The resource management method according to claim 1, wherein the invoking of the packing interface packs the to-be-processed resource corresponding to each grouping result, including:
respectively estimating the packing resource consumption value required by each grouping result;
and integrating the grouping results according to the estimated results to generate at least two analog resource packet sets, and calling a packaging interface to respectively package the resources to be processed corresponding to the at least two analog resource packet sets.
9. The method of claim 8, wherein the estimating the consumption value of the packing resource required by each grouping result comprises:
and estimating the packaging resource consumption value required by each grouping result according to the file type and the file size of the file contained in the simulation resource package in each grouping result.
10. The resource management method according to claim 1 or 9, further comprising:
determining the file type and the file size of at least one file in the first simulation resource package;
determining packed resource consumption reference values corresponding to the at least one file respectively according to the file types, and taking the product of the file size of the at least one file and the packed resource consumption reference values corresponding to the at least one file respectively as the packed resource consumption value of the at least one file;
summing the packaging resource consumption values of the at least one file, and taking the summation result as a first packaging resource consumption value required by the first simulation resource package;
the first analog resource packet is any one of analog resource packets contained in any one of the grouping results.
11. The method of claim 10, wherein the estimating the consumption value of the packing resource required by each grouping result comprises:
and respectively summing the first packing resource consumption values corresponding to at least one first simulation resource package in each grouping result, and taking the summation result as the packing resource consumption value.
12. The method according to claim 8, wherein the integrating the grouping results according to the pre-estimated results to generate at least two sets of simulation resource packages comprises:
calculating the average packing capacity corresponding to each packing batch according to the estimation result and the preset packing batch;
and integrating the grouping results according to the average packaging capacity and the packaging resource consumption value required by each grouping result to generate the at least two analog resource package sets.
13. A resource management apparatus, comprising:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is configured to acquire a simulation packing result generated by performing simulation packing on resources to be processed, and the simulation packing result comprises identification information of at least two simulation resource packages generated by the simulation packing and a dependency relationship between the at least two simulation resource packages;
a building module configured to build a relationship network of the at least two simulated resource packages according to the identification information and the dependency relationship, wherein a node of the relationship network characterizes the at least two simulated resource packages;
and the packing module is configured to group the at least two analog resource packages according to the incidence relation of each node in the relational network, and call a packing interface to pack the to-be-processed resource corresponding to each grouping result.
14. A computing device, comprising:
a memory and a processor;
the memory is for storing computer-executable instructions, and the processor is for executing the computer-executable instructions to implement the steps of the resource management method of any one of claims 1 to 12.
15. A computer-readable storage medium storing computer instructions which, when executed by a processor, perform the steps of the resource management method of any one of claims 1 to 12.
CN202011249590.3A 2020-11-10 2020-11-10 Resource management method and device Active CN112351103B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011249590.3A CN112351103B (en) 2020-11-10 2020-11-10 Resource management method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011249590.3A CN112351103B (en) 2020-11-10 2020-11-10 Resource management method and device

Publications (2)

Publication Number Publication Date
CN112351103A true CN112351103A (en) 2021-02-09
CN112351103B CN112351103B (en) 2022-12-27

Family

ID=74362540

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011249590.3A Active CN112351103B (en) 2020-11-10 2020-11-10 Resource management method and device

Country Status (1)

Country Link
CN (1) CN112351103B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113656417A (en) * 2021-07-23 2021-11-16 厦门雅基软件有限公司 Data processing method, device, equipment and computer readable storage medium

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104854844A (en) * 2012-12-13 2015-08-19 高通股份有限公司 Loading a re-directed web resource on a web browser of a client device in a communications system
CN107402788A (en) * 2017-07-25 2017-11-28 网易（杭州）网络有限公司 Resource packing management method and device
CN108449377A (en) * 2018-02-02 2018-08-24 珠海金山网络游戏科技有限公司 A kind of update method and resource packing and issuing system and method for game version
CN108846747A (en) * 2018-05-24 2018-11-20 阿里巴巴集团控股有限公司 A kind of virtual resource based on block chain is delivered, crowd raises method and device
CN110147237A (en) * 2019-05-20 2019-08-20 深圳市腾讯网域计算机网络有限公司 A kind of redundant resource minimizing technology and device
CN110152299A (en) * 2018-11-22 2019-08-23 腾讯科技（深圳）有限公司 A kind of construction method and device of game resource
CN110362338A (en) * 2019-07-14 2019-10-22 广州泳泳信息科技有限公司 A kind of game resource packing and resource quick access method under mobile platform
CN110515631A (en) * 2019-08-23 2019-11-29 掌阅科技股份有限公司 Using the generation method of installation data packet, server and computer storage medium
CN111249744A (en) * 2020-01-19 2020-06-09 腾讯科技（深圳）有限公司 Resource loading method and device, storage medium and electronic device

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104854844A (en) * 2012-12-13 2015-08-19 高通股份有限公司 Loading a re-directed web resource on a web browser of a client device in a communications system
CN107402788A (en) * 2017-07-25 2017-11-28 网易（杭州）网络有限公司 Resource packing management method and device
CN108449377A (en) * 2018-02-02 2018-08-24 珠海金山网络游戏科技有限公司 A kind of update method and resource packing and issuing system and method for game version
CN108846747A (en) * 2018-05-24 2018-11-20 阿里巴巴集团控股有限公司 A kind of virtual resource based on block chain is delivered, crowd raises method and device
CN110152299A (en) * 2018-11-22 2019-08-23 腾讯科技（深圳）有限公司 A kind of construction method and device of game resource
CN110147237A (en) * 2019-05-20 2019-08-20 深圳市腾讯网域计算机网络有限公司 A kind of redundant resource minimizing technology and device
CN110362338A (en) * 2019-07-14 2019-10-22 广州泳泳信息科技有限公司 A kind of game resource packing and resource quick access method under mobile platform
CN110515631A (en) * 2019-08-23 2019-11-29 掌阅科技股份有限公司 Using the generation method of installation data packet, server and computer storage medium
CN111249744A (en) * 2020-01-19 2020-06-09 腾讯科技（深圳）有限公司 Resource loading method and device, storage medium and electronic device

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113656417A (en) * 2021-07-23 2021-11-16 厦门雅基软件有限公司 Data processing method, device, equipment and computer readable storage medium
CN113656417B (en) * 2021-07-23 2022-07-22 厦门雅基软件有限公司 Data processing method, device, equipment and computer readable storage medium

Also Published As

Publication number Publication date
CN112351103B (en) 2022-12-27

Similar Documents

Publication Publication Date Title
CN107170050A (en) The 3D scenes method for building up and system of Internet of Things pel
CN104915717A (en) Data processing method, knowledge base reasoning method and related device
CN114282073B (en) Data storage method and device and data reading method and device
CN104599319B (en) A kind of Real-time Generation of 3D scenes
CN112906206B (en) Digital twin model construction method and device
CN112351103B (en) Resource management method and device
CN113190254A (en) Updating method and device
CN111459621B (en) Cloud simulation integration and scheduling method and device, computer equipment and storage medium
CN112100450A (en) Graph calculation data segmentation method, terminal device and storage medium
CN114239237A (en) Power distribution network simulation scene generation system and method supporting digital twinning
CN116340260A (en) Building model data rendering method and device, electronic equipment and readable storage medium
CN114119939A (en) Data lightweight processing method and device, storage medium and electronic device
CN112395108A (en) Calling method and device of BIM (building information modeling) element model
CN109165217A (en) A kind of high-efficiency storage method of time series data
US20230334325A1 (en) Model Training Method and Apparatus, Storage Medium, and Device
CN108319728A (en) A kind of frequent community search method and system based on k-star
CN112704872A (en) Scene data synchronization method, device, system and storage medium
CN111475511A (en) Data storage method, data access method, data storage device, data access device and data access equipment based on tree structure
CN110442753A (en) A kind of chart database auto-creating method and device based on OPC UA
CN114936198A (en) Data migration method and device
CN115293365A (en) Management method, device, management platform and storage medium of machine learning model
CN114385864A (en) Graph searching method, device, equipment and storage medium
CN112433950A (en) Method for automatically building test environment, electronic equipment and storage medium
CN110598056A (en) Node layout determination method and device
CN113568620B (en) Code file processing method, device, equipment and medium

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