124 results about "Spatial allocation" patented technology

The invention discloses a distributed storage system, a space allocation method and device, electronic equipment and a nonvolatile storage medium, and is applied to the technical field of storage. The method comprises the steps that a storage space is divided into a plurality of storage areas with the same storage capacity and continuous addresses in advance, and the corresponding relation between storage bitmaps and the storage addresses of corresponding storage units is persisted to the storage space; the bits of the storage bitmap indicate whether the state of the corresponding storage unit is an idle state or an allocated state. And in a storage node starting process, determining a target storage area in an idle state in the storage space according to the corresponding relationship, and loading bitmap information corresponding to the target storage area into a memory. According to the method and the device, the problems of excessive memory occupation and low service recovery speed in related technologies can be solved, less memory can be occupied when the PB-level space is managed, meanwhile, the loading time during node restarting is shortened, and the recovery speed of node operation services is effectively improved.

The present application relates to a memory space allocation method, apparatus, computer equipment, computer-readable storage medium and computer program product. The method comprises: obtaining the execution information of the work group and the allocatable space data of the target memory; wherein the execution information at least includes the number of thread bundles of the work group and the space data of the target memory that each thread bundle needs to access; determining the number of target memory slots according to the execution information and the allocatable space data; allocating a target memory slot label to each thread bundle according to the number of target memory slots; executing the target task of the thread bundle accessing the target memory according to the target memory slot label, and releasing the storage space corresponding to the target memory according to the target memory slot label after the execution of the target task is completed. The use of this method can reduce the waste of video memory.

The technology described herein is directed towards automatic virtual subnet delegation. An automated process scans the subnets of a virtual network and builds a tree of the IP space, including allocated and unused space designations. User-defined parameters and organization policy data are used to determine the number of IP addresses needed for an application or the like. By traversing the tree of existing IP space, the technology described herein finds and places a new subnet, such as to ensure a high utilization of the overall IP space or based on an alternative type-of-fit criterion. When the virtual subnet space is created in the cloud, a public cloud-specific subnet identifier is returned to the user to utilize in deploying the application. Another use of the technology described herein is to track and optimize IP space allocation for existing virtual networks in the public cloud, including to identify underutilized and / or improperly-sized subnets.

The invention discloses a disk space distribution method and device, electronic equipment and a computer readable storage medium. The disk space distribution method comprises the steps that address information of at least one target free space block in the same disk is acquired; setting the lowest address in the obtained address information to a root node of the binary heap, and setting other obtained address information in the binary heap according to a principle that an address indicated by any father node in the binary heap is lower than an address indicated by a child node; the target free space blocks are allocated based on the binary heap, the target free space blocks corresponding to the addresses set by the root nodes are always allocated in each allocation, and the target free space blocks are allocated according to the principle that the root nodes in the binary heap indicate the lowest address and the address indicated by any father node in the binary heap is lower than the address indicated by the child nodes after allocation. And updating the address indicated by each node in the binary heap. The overall read-write speed of the storage system can be improved.

The invention provides a distributed GEO fence implementation method and system based on edge computing, and relates to the technical field of electronic fences, and the method comprises the steps: carrying out the dynamic space distribution of a global fence, and generating a jurisdiction of each edge node; in each edge node, constructing a dynamic spatial-temporal index according to the corresponding sub-fence and the overlapping region, screening a device position reported in the jurisdiction region through the dynamic spatial-temporal index, and generating a to-be-matched data stream with a region label; performing differential matching according to the region label of the to-be-matched data stream, generating a primary event for a non-overlapping region and a secondary event for an overlapping region, and uploading the primary event and the secondary event to a cloud center; the multi-index characteristics of the primary events and the secondary events are counted, when any index characteristic exceeds the corresponding preset condition, dynamic space redistribution is triggered, and the high-efficiency, low-delay and strong-self-adaption distributed geofence is achieved in the mode that dynamic space distribution, edge node collaborative matching and cloud index monitoring are combined.

The invention relates to the technical field of storage, and provides a storage space allocation method and device and a solid state disk. The method is applied to a solid state disk adopting a PLC (programmable logic controller) system, and comprises the following steps: firstly, checking the health state of each data block, and marking each data block of which the health state is completely bad as a bad block; obtaining each data block except all bad blocks from all the data blocks to obtain a to-be-processed block set; finally, distributing the to-be-processed block set to obtain a first storage space and a second storage space; the first storage space is used as a system area, and the second storage space is used as a user area. According to the method, the health state of each data block in the solid state disk is checked, and the data blocks of which the health state is completely bad are marked as bad blocks, so that the bad blocks are eliminated when the storage spaces of the system area and the user area are distributed, the stability of the solid state disk is improved, and the storage performance of the solid state disk is improved.

The invention discloses a storage space distribution method and device, a storage medium and electronic equipment, and relates to the technical field of storage space distribution.The method comprises the steps that in response to a received storage space distribution request, a target storage space is determined in equipment storage space; according to a space group bitmap corresponding to a storage space group in the target storage space, determining a target space group in an idle state from the storage space group; determining a target space block in an idle state from the storage space blocks according to the space block bitmaps corresponding to the storage space blocks in the target space group; and finally, allocating the target space block to the storage space allocation request. According to the method, the target space block is determined through the bitmaps corresponding to the multiple space levels, the target space block is allocated to the storage space allocation request, the situation of storage space fragmentation can be reduced through the space block allocation mode, and then the storage performance is improved.

The invention relates to the technical field of storage, in particular to a cache management method, a storage array controller, a device, equipment and a medium. The method comprises the following steps: distributing a cache region for an access command in a static cache subspace according to a namespace to be accessed by the access command; receiving, reading and writing target data of the storage array based on the access command, and caching the target data to the cache region; wherein the static cache subspace is obtained by dividing a static cache space in the controller memory according to the namespace. Therefore, the problem that the efficiency of reading and writing the storage array data is low due to unreasonable cache space distribution can be effectively solved.

The invention discloses a storage space distribution method based on an unmanned distribution system and a storage medium, and the method comprises the steps: obtaining a virtual storage bin identifier of a user corresponding to an article storage request when the article storage request is received; detecting the use state of each storage space of the unmanned distribution system; and according to the use state of each storage space of the unmanned distribution system, distributing a target storage space for an article corresponding to the article storage request, and binding the target storage space with the virtual storage bin identifier. A computer program for implementing the method is stored in the storage medium. The method has the advantages of simple principle, simplicity and convenience in operation, convenience in management and the like.

The invention discloses a memory allocation method and device, equipment and a medium. The method comprises the following steps: executing a first round of storage space allocation process according to the tensor size of a tensor to be allocated; if the result of the first round of storage space distribution process is distribution failure, triggering a hook logic added at the first node, performing recursive combination on the first cache pool and the second cache pool through the hook logic, and executing cache redistribution; the first cache pool is a cache pool sorted according to address sizes, and the second cache pool is a cache pool sorted according to block sizes; and if cache redistribution fails, performing two rounds of cache block release operation on the merged cache pool, and after each round of cache block release operation, applying for an actual video memory block meeting the tensor size from the video memory until a target actual video memory block is successfully applied for the tensor to be distributed, and ending the memory distribution process. According to the technical scheme, efficient memory allocation can be achieved, the video memory utilization rate is increased, and unnecessary video memory application overhead is reduced.

The invention discloses a double-layer optimization method and system for real-time flood control scheduling of a series reservoir group. The method comprises the steps that the maximum feasible impounding boundary of each time period is calculated based on the discharge capacity and storage capacity constraint of each reservoir; constructing a space-time risk response kernel matrix, encoding lag response and attenuation intensity of flood routing, constructing a dynamic risk potential energy index in combination with real-time reservoir capacity, and solving space distribution water quantity of each reservoir by taking minimization of the index as a target under physical boundary constraint; the space distribution water quantity is used as a guide target, an evolutionary algorithm embedded with a physical consistent projection operator is adopted, and iterative optimization is carried out on hourly output flow of each reservoir. According to the method, through matrix coding of the space-time risk and introduction of manifold projection solution, the problem that upstream and downstream hydraulic space-time coupling and strong physical constraint are difficult to solve is effectively solved, and the physical consistency and peak clipping efficiency of a scheduling scheme are improved.

The invention belongs to the technical field of geographic information science, and particularly relates to a Markov-FLUS model-based feedback land utilization change simulation method and system, and the method comprises the steps: firstly predicting an initial area target vector based on historical data and a Markov chain, and inputting the initial area target vector into a FLUS model to carry out the first space distribution simulation; by calculating the achievement degree of the simulation result and the area target, the space conflict type which cannot be achieved due to the space constraint is identified, the area target vector is dynamically corrected according to the space conflict type, and the corrected target is fed back to the FLUS model for iterative simulation until the result is converged. According to the method, the technical problem of disjunction of area prediction and spatial layout in a traditional coupling model is effectively solved, and the scientificity and accuracy of land utilization change simulation are remarkably improved.

The application belongs to the field of chip shared cache usage method, and relates to a method for sharing cache space among multiple priority queues, which divides the queues according to priorities, allocates different amounts of shared cache space for different priorities, and the allocation principle firstly guarantees the demand of high-priority queues for shared cache space; the corresponding shared cache space is allocated according to the demand of each priority queue for shared cache; the high-priority queue can occupy the idle shared cache space of the low-priority queue, and the occupation is performed according to the principle from low to high priority; a constraint condition is set, when the constraint condition is met, the low-priority queue can occupy the shared cache space of the high-priority queue, and the amount of shared cache space occupied by the low-priority queue is constrained. The application further improves the utilization of shared cache space on the basis of guaranteeing the cache space of high-priority queues.

The invention provides a book box with variable partition plates and a boxing method. The method comprises the steps that a book list and an initial box body space are obtained; based on a branch and bound-greedy hybrid optimization algorithm, carrying out space state circulation processing to obtain an optimal space allocation scheme; based on the optimal space distribution scheme, re-planning the space layout, updating the optimal position of the partition plate, and obtaining the sizes of the four divided spaces; and on the basis of the sizes of the four divided spaces, book placement information is obtained, and books are placed in sequence. According to the method, the optimal space distribution scheme of the four partition spaces is obtained through the branch and limit-greedy hybrid optimization algorithm, so that the book placement direction and position are selected, and the residual space is minimum.

Disclosed embodiments perform automated design for buildings or portions of buildings and machine-generate architectural design and floor plans. Computer-implemented systems and methods of designing multi-unit buildings and portions of buildings include a set of one or more input requirements, a relationships module, an options placement system, a layout predictor system, and a design plan generator. The input requirements include one or more pre-defined footprints and may include local regulatory requirements such as building code, zoning, accessibility, among others. The design plan generator generates an architectural design plan for the building or portion of a building that can be built on the one or more pre-defined footprints. Disclosed systems and methods substantially reduce the design time and cost while increasing the profitability, sustainability and efficiency of construction projects.

The invention discloses a three-level cache replacement method based on dirty page perception and adaptive capacity, and belongs to the technical field of computer memory cache management. The method comprises the following steps of: constructing a short-time-efficiency queue, a medium-time-efficiency queue and a global queue in a CXL extended memory equipment side cache; executing object insertion, migration and metadata updating according to the hit condition of the access request in each queue; when the cache space is insufficient, the access count, the dirty page mark and the dirty page revival mark are combined to execute eviction judgment; and calculating a return visit ratio based on global queue identifier insertion times and return visit times, and dynamically adjusting short-time-efficiency and medium-time-efficiency queue capacities. According to the method, the problems of high dirty page write-back cost and inflexible cache space distribution in the CXL extended memory are solved, and the redundant write-back overhead is reduced, the utilization efficiency of the cache space is improved and the access delay is reduced through collaborative optimization of the access characteristics, the dirty page state and the elimination return visit behavior.

The present application provides a memory allocation method, related equipment, and computer-readable storage medium, the method comprising: obtaining a computational graph corresponding to a neural network; allocating memory space to the M tensor data in sequence based on the sorting results of M tensor data, wherein, if one of the M tensor data can reuse at least a portion of the allocated memory space, at least a portion of the memory space that can be reused by the tensor data is allocated to the tensor data, the allocated memory space being the memory space that has been allocated to the M tensor data before the tensor data, the sorting result indicating the order in which the memory space is allocated to the M tensor data, and the sorting result being related to the information of each tensor data in the M tensor data. Implementation of the present application can avoid unreasonable memory allocation.

The invention belongs to the technical field of distributed storage, and provides a distributed data optimization storage method, which comprises the steps of basic data acquisition, basic feature extraction, k proximity activeness prediction and storage space allocation scheme matching. According to the method, the access frequency, the access time, the access IP region, the file size and the file label of the to-be-distributed storage file are collected, so that the basic attribute information of the to-be-distributed storage file is obtained, and data input is provided for activity prediction; through basic feature extraction, form conversion of basic data is realized, and an input vector is provided for the subsequent process; through the k proximity activeness prediction model, the activeness of the to-be-allocated storage file is predicted, and an allocation basis is provided for a storage scheme; through the storage space allocation scheme library, the pre-allocation of the to-be-allocated storage file is realized, the file access efficiency is improved, and the system response time is reduced.

The embodiment of the invention provides a cache space distribution method and device, a computer readable storage medium and electronic equipment, and the method comprises the steps: determining a first cache weight corresponding to each storage pool according to the capacity of a plurality of storage pools; according to the number of the storage pools and the first cache weight corresponding to each storage pool, redistributing the cache weight corresponding to each storage pool, and determining a second cache weight corresponding to each storage pool; according to the second cache weight corresponding to each storage pool, a preset total cache space is divided into a plurality of cache spaces corresponding to the storage pools in a one-to-one mode, and the cache spaces are used for caching resources needed by the corresponding storage pools. By the adoption of the method, the capacity of each storage pool and the total number of the storage pools are considered, the total cache space is divided into the multiple cache spaces to be distributed to the storage pools, reasonable distribution of the cache spaces is achieved, and the storage performance of the storage system is improved.

The invention discloses a data writing method and device based on a distributed storage system, equipment and a medium, and relates to the technical field of storage, and the method comprises the steps: recognizing a data object during data writing, then judging whether the data object is data written for the first time or not, if yes, distributing an initial storage space for the data object, and if not, storing the initial storage space; the initial storage space is set to be associated with the distributed storage system to form a mapping relation, when a rewrite operation is executed for the initial storage space, the mapping relation is queried to obtain a storage position associated with the initial storage space, and data not subjected to the first write operation is directly written into the storage position. The technical problems that in the data writing process, multiple times of space distribution is needed, and the space recycling operation is tedious are solved, and the data integrity during data rewriting is ensured.

The invention discloses a storage resource dynamic allocation method and device, computer equipment and a storage medium, and relates to the technical field of computers, and the method comprises the steps: obtaining storage load data of each virtual function, generating load prediction data, and achieving the self-adaptive adjustment of a physical block resource state in combination with a dynamic reserved space allocation strategy. A traditional static distribution and lagging monitoring mode is changed, and a resource scheduling mechanism with real-time performance and predictability is constructed. The problem of performance fluctuation caused by static reserved space distribution, software monitoring delay and prediction capability deficiency in a single-root input and output virtualization scene is solved, and the purposes of improving the dynamic scheduling efficiency of storage resources, enhancing the adaptive capacity of a system to burst loads, reducing the delay jitter amplitude and improving the performance of the system are achieved. And the wear of the flash memory is balanced through fine management.

The invention discloses a buffer area address allocation and SPILL scheduling method under a multi-level cache architecture, which comprises the following steps of: initializing a free block list for each cache type of an NPU (Network Processing Unit), allocating physical address offset for each buffer area in a computational graph, and executing free block merging and dynamic threshold adjustment; detecting a cache space distribution state, and screening an optimal SPILL victim from the candidate buffer area; reconstructing a dependency relationship between the SPILL operation and original buffer area nodes, and updating the calculation graph; an address multiplexing dependency graph is established and maintained, the life cycle overlapping condition of the buffer area is detected, and address multiplexing constraint and buffer area use time sequence constraint are maintained; and carrying out statistics on the extra data carrying amount brought by the SPILL operation, minimizing the data carrying amount except the total amount, and outputting a final cache allocation scheme and an SPILL operation set. According to the method, on the premise that all hardware constraints and execution constraints of the NPU of the SIMD architecture are met, the cache fragmentation degree is remarkably reduced.

The invention relates to a storage space distribution method and device, equipment and a medium, and the method comprises the steps: dividing a storage space into a plurality of blocks, and inserting block identifiers of free blocks in the plurality of blocks into a merging tree; wherein leaf nodes of the merge tree are linked according to the increasing sequence of the block identifiers; determining all continuous block segments according to the combination tree, and inserting block segment information of the continuous block segments into a distribution tree; nodes in the distribution tree correspond to the continuous block segments; in response to a space application request, querying continuous target blocks meeting the size of a space to be applied from the distribution tree; and responding to the space application request according to the continuous target block so as to realize storage space distribution. According to the technical scheme, space fragmentation is avoided, and the distribution efficiency of the storage space and the performance of the storage system are improved.

The invention discloses a memory access method and device, a storage medium and an electronic device, a storage system comprises a controller and a memory, space allocation information of the memory is maintained in the controller, and the method comprises the following steps: writing data into the memory in a process of executing a target write request; a current to-be-executed target read request of the storage system is detected, and the target read request is used for requesting to read target data from a memory; converting a target storage position of the target data in a memory according to the space distribution information; matching the target storage position with a reference storage position corresponding to the target write request to obtain a matching result; and under the condition that the matching result is used for indicating that the target storage position and the reference storage position do not belong to the same storage position, the target data is read from the memory in response to the target read request, and by adopting the technical scheme, the problems of poor predictability of time delay of access to the memory and the like in related technologies are solved.

Methods, systems, and computer-readable storage media for allocating memory space are provided. In one aspect, a method includes receiving data to be stored in a memory space that includes one or more free spaces. The method further includes identifying a first free space of the one or more free spaces based on a first queue and a second queue. The first queue includes one or more addresses corresponding to end addresses of the one or more free space, and the second queue includes one or more addresses corresponding to start addresses of the one or more free spaces. The method further includes storing the data in the first free space, adding an address corresponding to a start address of the first free space to the first queue, and adding an address corresponding to an end address of the first free space to the second queue.

This invention provides a stylizable and deformation-resistant QR code encoding and recognition method based on topological coding, comprising: converting the binary string to be encoded into natural numbers using a bijective function and recursively decomposing it to generate a topological tree structure; determining the spatial allocation ratio based on the tile traces of each node in the topological tree; performing inward shrinking processing on the polygonal region carrying the QR code, recursively dividing it into non-overlapping closed sub-regions according to the ratio, mapping the hierarchical structure of the topological tree to a QR code with a nested structure and stylizing it; scanning the QR code image and performing preprocessing, extracting the boundary contours of the closed regions and constructing a global topological tree, enumerating multiple candidate topological trees and decoding them one by one, and filtering out the valid binary information as the recognition result after CRC verification. This invention achieves the deformation resistance of the QR code through the mapping of the topological tree structure and nested regions, and improves its visual effect and application flexibility through stylization processing.

The present invention relates to a high-performance data model access method and device based on a shared memory pool. The method primarily includes: applying for shared memory and mapping the shared memory to a fixed virtual address of a process; traversing XML to create a deduplicated symbol table and placing it in the shared memory; parsing the XML and converting it into a tree structure based on the shared memory pool to form an XML spanning tree; providing a data access interface and defining input parameters so that the input parameters can be used to search for corresponding memory nodes in the XML spanning tree, thereby reading and writing their contents. The present invention can be used to solve the problem of fast access to XML configuration data by multiple processes in a terminal device, reducing memory usage and improving access efficiency. It also addresses the use of pointers in shared memory and the dynamic allocation and release of space.

A storage space allocation method, and a server. The method is applied to a server. After receiving a storage space allocation request, a server can use a storage pool to allocate and provide storage space to computing nodes for executing tasks corresponding to service functions, so as to support the computing nodes in storing temporary files in the process of executing the tasks, thereby realizing the service functions. The storage pool is determined by means of storage resources in external storages of a server cluster and storage resources in internal storages of the server cluster. By means of the storage pool, the internal storages of a plurality of server clusters and the external storages of the server clusters can be used jointly to provide storage space, so as to ignore the problem of the storage modes for different types of storages being different, and to avoid the inability to realize service functions due to insufficient remaining storage space for a single storage, thereby improving the stability of realizing the service functions.

Systems and methods for space allocation for block device compression are provided. In particular, a computing device may receive an allocation request to write the compressed data, select a range list adequate for serving the allocation request from a plurality of range list, dequeue a range entry from the selected range list to allocate free space for the compressed data, and allocate the free space corresponding to the range entry to the compressed data to serve the allocation request.

The invention provides a video data storage method, device and system and electronic equipment. The method comprises the following steps: receiving a space allocation request sent by first video equipment; the space allocation request comprises a requested storage space; when it is determined that the storage space is smaller than a first shared storage space of the first video recording device in the shared storage pool, determining a second shared storage space matched with the storage space in the shared storage pool; the shared storage pool comprises a shared storage space of each piece of video equipment; sending an identifier of a second video recording device corresponding to the second shared storage space to the first video recording device, and updating a storage space state of the second shared storage space of the second video recording device to an occupied state, the identifier of the second video equipment is used for indicating that the video data of the first video equipment is stored in a second shared storage space of the second video equipment. The first video recording device stores the video recording data in different places, so that the data loss probability is reduced, and the storage security can be improved.