44 results about "Spatial allocation" patented technology

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 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.

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 invention provides a host data set space allocation control method, device and equipment, a computer readable storage medium and a computer program product, and can be applied to the technical field of financial science and technology. The method comprises the following steps: receiving a data set creation request; obtaining the maximum distributable space size of a target disk group to which the target disk volume belongs; under the condition that the sum of the size of the first disk space and the size of the second disk space is larger than the maximum distributable space size, adjusting prompt information is generated and output, and the adjusting prompt information comprises at least one of the following information: an adjusting suggestion for the size of the first disk space and / or the size of the second disk space; recommending target alternative disk volume information; and executing corresponding adjustment operation according to confirmation feedback of the user on the adjustment prompt information, and triggering creation of the data set based on the adjusted parameters. According to the scheme, the risks of data set space depletion, job interruption and consequent complex data rollback operation caused by the fact that the secondary distribution requirement cannot be met can be reduced.

The invention belongs to the field of use methods of chip shared caches, and relates to a method for sharing cache spaces among multi-priority queues, which comprises the following steps of: dividing the queues according to priorities, allocating different quantities of shared cache spaces for different priorities, and ensuring the requirements of high-priority queues on the shared cache spaces according to an allocation principle; distributing a corresponding shared cache space according to the requirement of each priority queue on the shared cache; the high-priority queues can occupy the idle shared cache space of the low-priority queues, and the idle shared cache space is occupied from low to high according to the principle that the priorities are from low to high; a constraint condition is set, when the constraint condition is met, the low-priority queues can occupy the shared cache spaces of the high-priority queues, and the number of the shared cache spaces occupied by the low-priority queues is constrained. According to the method, the utilization rate of the shared cache space is further improved on the basis of ensuring the cache space of the high-priority queue.

A system for automatically generating a content item may include receiving a content item template having a set of elements for creating a content item and content item data for the set of elements. A placeholder for each element of the set of elements may be generated and a space allocation for each element may be selected based on the generated placeholders for each element. A determination if a conflict exists based on the determined space allocations for each element may be made and, when a conflict exists, an element from the set of elements may be eliminated and a new reduced set of elements may be returned. Responsive to determining no conflict exists, a content item may be generated using the content item data for the reduced set of elements and the determined space allocations.

The application discloses a space task allocation method based on a heuristic clustering algorithm, which can arrange tasks with different frequencies into m time periods and ensure load balance of each time period. The method first performs space division, clusters high-frequency space allocation tasks in space task data into m clusters through a clustering algorithm, then calculates an average allocation threshold range, finds out clusters that do not meet the average allocation threshold range, adjusts the clusters, adjusts the high-frequency clusters, then clusters low-frequency space allocation tasks into n clusters, and finally allocates the n clusters to the nearest adjusted high-frequency clusters. The application provides a new space task allocation method in balancing space task allocation.

The invention discloses a storage space allocation method and device and storage device.The method comprises the steps that a node list comprising node identifiers, occupation information and idle capacity values of storage nodes is searched according to a preset search direction, and when the idle capacity values of target nodes are matched with the data size of data to be stored in the node list, the target nodes are allocated to the storage nodes; inserting a new storage node after the target node, updating the idle capacity value of the target node, and storing the to-be-stored data according to the initial address of the to-be-stored data. Therefore, according to the embodiment, the storage nodes and the storage areas corresponding to the storage nodes are managed through the node list, data storage and storage space allocation are achieved, the state of storage resources can be grasped globally, time and algorithm complexity during data storage are reduced, fragments are reduced, an existing dynamic continuous space management method is improved, and the dynamic continuous space management efficiency is improved. And the dynamic continuous space management effect is optimized.

The invention belongs to the technical field of information, and relates to a product quantization optimization method and system based on optimal subspace allocation. The coding process of the method comprises the following steps: dividing N input D-dimensional vectors into M subspaces, wherein each subspace comprises N D / M-dimensional subspace vectors; respectively mapping all the subspace vectors to d subspaces; executing a K-means clustering algorithm on the mapped subspaces to obtain approximate estimation code words of each subspace vector in d subspaces to which the subspace vector is mapped; for a subspace vector and d approximate estimation code words thereof in different subspaces, reserving a mapping position with a minimum residual absolute value to obtain a code of the subspace vector; and combining the codes of the subspace vectors to obtain a compression result of the input vector. The invention aims to improve and optimize a product quantization algorithm, can reduce quantization errors as much as possible while ensuring the decoding speed, and can be widely applied to the related fields of approximate nearest neighbor search and large-scale quantization models.

The invention belongs to the technical field of communication and discloses a cache processing method, device and equipment, a readable storage medium and a program product. In the communication process through a target bus, a fixed-length memory space in a bus memory is used for caching a fixed-length data frame, and a flexible-length memory space in the bus memory is used for caching a flexible-length data frame; acquiring space utilization rates corresponding to the flexible-length memory space and the fixed-length memory space respectively; determining a space allocation weight by using the space utilization rate, and recycling unused fragmented space; and according to the space allocation weight, reallocating the fragment space so as to dynamically adjust the space sizes of the fixed-length memory space and the flexible-length memory space. According to the method and the device, by dynamically dividing the resources of the memory, the cache requirements in different communication requirement scenes can be effectively adapted, the flexibility of resource allocation can be improved, the communication cache efficiency can be improved, and the communication performance can be improved.

The application discloses an anti-fragmentation method for a portable flash memory device and relates to the technical field of computer storage systems and operating system kernels. The method comprises the following steps: S1, in the file system initialization stage, a hybrid granularity partition model is established, and a storage space is proportionally divided into a small cluster area and a large cluster area according to functional requirements; S2, an extended allocation bitmap management structure is constructed in the memory; S3, in response to a space allocation request, an allocation strategy is selected according to the data characteristics of the request; and S4, an allocation process in the large cluster area. According to the application, the cluster space of the flash memory device is divided into the small cluster area and the large cluster area, various requests are classified and processed based on prompt information when allocating the space, and a relaxed reuse mechanism is introduced, so that the fragmentation process of the storage space is significantly delayed, and the average bandwidth of multi-threaded writing and the space utilization are significantly improved without affecting compatibility and space utilization.

The invention belongs to the technical field of earthquake risk assessment, and provides a multi-factor calculation method for constructing a space distribution function of a potential source area, which comprises the following steps: selecting a plurality of factors for evaluating the earthquake risk of the potential source area; determining a factor combination participating in calculation of a space distribution function for different earthquake magnitude grades; performing quantitative assignment on each selected factor of each potential seismic source region; and according to the factor combination, carrying out average calculation on the normalized value of each factor in each potential seismic source region to obtain a space distribution function value of the potential seismic source region corresponding to the specific seismic magnitude grade. According to the method, different factor combinations are adopted for calculation for different earthquake magnitudes. The design is based on the understanding of seismic activity control factors of different earthquake magnitudes, so that the calculation result can more finely reflect the relative danger degree of the potential seismic source area on different earthquake magnitude levels, and reliable technical support is provided for compiling a more accurate seismic oscillation parameter zoning map.

The application discloses a storage resource dynamic allocation method and device, computer equipment and a storage medium, relates to the technical field of computers, and comprises obtaining storage load data of each virtual function and generating load prediction data, combining a dynamic reserved space allocation strategy to realize adaptive adjustment of a physical block resource state, changing a traditional static allocation and lag monitoring mode, and constructing a resource scheduling mechanism with real-time performance and predictability. The performance fluctuation problem caused by static reserved space allocation, software monitoring delay and the lack of prediction ability in a single input / output virtualization scene is solved, the technical effects of improving storage resource dynamic scheduling efficiency, enhancing the adaptive capacity of the system to sudden load, reducing the delay jitter amplitude, and balancing flash wear through fine management are achieved.

This invention provides a method and apparatus for expanding a storage system, relating to the field of data storage technology. The method includes: responding to a storage system expansion request, selecting at least one target subspace from multiple subspaces of a two-dimensional logical data space, wherein each data point in the two-dimensional logical data space is obtained by mapping data in the storage system, and there is a correspondence between each subspace and a storage node in the storage system; dividing each target subspace to obtain a first subspace containing all data points within the target subspace, and a second subspace that does not contain any data points at the time of division; reallocating the first subspace to the storage node corresponding to the target subspace, allocating the second subspace to a newly added storage node, and updating the changed correspondence between each subspace and the storage node. This invention achieves real-time expansion without data migration during the expansion process.

This invention belongs to the field of computer technology, specifically relating to a wear-aware space allocation method based on a persistent memory file system. The method includes: dividing the PM space into blocks composed of several consecutive physical pages; dividing all blocks into G groups based on block size; organizing all blocks within the same group into singly linked lists and storing the head nodes of the G linked lists in an array; setting a write counter for each page to record page write activity and storing all write counters in an array; when an I / O request arrives, allocating candidate blocks directly from the corresponding groups using a multi-level allocation mechanism based on the I / O request size, and reclaiming free blocks using a wear-aware reclamation mechanism. This invention achieves low-overhead, high-precision wear leveling by using a multi-level allocation mechanism to directly allocate candidate blocks from the corresponding groups and a wear-aware reclamation mechanism to reclaim free blocks, significantly improving system performance.

The application discloses a double-layer optimization method and system for real-time flood control scheduling of a series reservoir group. The method comprises the following steps: based on the discharge capacity and reservoir capacity constraints of each reservoir, the maximum feasible storage boundary of each period is calculated; a space-time risk response kernel matrix is constructed, the lag response and decay intensity of flood evolution are encoded, and a dynamic risk potential index is constructed in combination with the real-time reservoir capacity; and under the physical boundary constraint, the spatial allocation of water quantity of each reservoir is solved by taking the minimization of the index as a target. The evolutionary algorithm embedded with a physical consistent projection operator is adopted to iteratively optimize the discharge flow of each reservoir. The application effectively solves the problems of upstream and downstream hydraulic space-time coupling and strong physical constraint solving difficulty by matrix coding of space-time risk and introduction of manifold projection solving, and improves the physical consistency and peak shaving efficiency of the scheduling scheme.

A method for managing storage allocation in a warehouse includes obtaining inventory data including SKUs, determining a sales velocity of each of the SKUs, generating a storage allocation plan that assigns each SKU to a particular storage system among a plurality of storage systems and a particular slot of the particular storage system based on at least one of the sales velocity of the SKU, the temperature zone of the storage system, or a capacity of a transportation device of the storage system, and transmitting the storage allocation plan to the transportation device to move products corresponding to the SKUs in accordance with the storage allocation plan.

The application discloses a kind of based on end side's big model key value cache dynamic optimization method and system, method includes: S1, the context resource of multiple inference sequences is centrally controlled, and corresponding context space is pre-allocated;S2, whether the currently available context space satisfies the allocation demand of inference sequence is judged, if it satisfies, then the intelligent context allocation is carried out to inference sequence, if it does not satisfy, then whether the remaining memory space of end side equipment is enough is judged, according to the judgment result, step S3 or S4 is executed;S3, if space is enough, then the available context space is increased by dynamic expansion, and the context space allocation and context update of inference sequence are re-performed;S4, if space is insufficient, first carry out context recovery, then discard and retain context by sequence perception sliding window mechanism, and execute context update after allocation is completed.The application can realize the efficient inference of big model under the condition of end side limited resource.

The invention discloses a resource space optimization configuration method and system for land planning, and relates to the technical field of land planning and resource space configuration. According to the method, a complete topological adjacency relation is constructed by collecting and preprocessing spatial data of a planning region; a neighborhood association constraint matrix and a constraint processing priority sequence are established, candidate land use types are screened through priorities, and initial configuration is completed based on the comprehensive configuration score; detecting and digesting neighborhood conflicts, and adjusting land use structure deviation; and the configuration scheme is output based on the constraint conformity verification, so that the problem that the neighborhood association constraint is difficult to be effectively coupled in the optimization solution process is effectively solved, the scientificity and rationality of the land resource spatial configuration are remarkably improved, and the constraint conformity rate and the resource utilization efficiency of the configuration scheme are improved.

The invention provides a storage space allocation method and device, a vehicle and a computer readable storage medium, and relates to the technical field of data storage, the method comprises the following steps: in response to a memory application request initiated by a target service thread to a vehicle end memory pool, obtaining an application memory size corresponding to the memory application request; comparing the applied memory size with a preset memory threshold value; a target strategy is determined from a first strategy and a second strategy according to the comparison result, the vehicle end memory pool comprises a first distribution area and a second distribution area, the first strategy refers to selecting a to-be-distributed memory block from a plurality of memory blocks in the first distribution area in a pointer offset mode, and a storage space is distributed for the service thread based on the to-be-distributed memory block; the second strategy refers to creating a memory block in a second allocation area and allocating a storage space for the service thread based on the created memory block; and distributing the target storage space for the target service thread based on the target distribution strategy. According to the method and the device, the problem of high HTTP request response delay in a high-concurrency scene can be solved.

Embodiments of the present application provide a stack space allocation method and device, electronic equipment and a readable storage medium. The method comprises: obtaining a to-be-processed function containing local variables in a to-be-compiled program during the compilation of the to-be-compiled program; determining a target alignment value of the to-be-processed function based on the respective alignment attribute values of the local variables in the to-be-processed function; the target alignment value is not less than the minimum value of the respective alignment attribute values of the local variables; allocating the respective target memory areas of the local variables in the to-be-processed function based on the target alignment value, and determining the stack space of the to-be-processed function based on the respective target memory areas of the local variables; the starting address of the target memory area corresponds to an integer multiple of the target alignment value; and responding to the access operation of the to-be-processed function according to the stack space of the to-be-processed function. The execution efficiency of the to-be-processed function is improved to a certain extent.

This invention discloses a multi-level bitmap storage space allocation method, apparatus, and medium based on fragmented management. The method includes dividing a storage device into multiple independent fragments, each fragment equipped with an independent CPU; setting a multi-level bitmap structure within each fragment; routing allocation requests to target fragments using a routing algorithm based on request object identifiers; when allocating storage space to the target fragment, employing a top-down multi-level search strategy to accurately locate a continuous sequence of free bits that meets the allocation requirements; upon finding the sequence, performing a bitmap marking operation to mark the corresponding bitmap from a free state to an allocated state; converting the allocation result from the relative address of the target fragment to a global physical address using an address translation mechanism and returning the result; and when releasing storage space to the target fragment, employing a bottom-up three-level bitmap update strategy to update available space statistics to achieve storage space release and consistent maintenance of the multi-level bitmap state.

The application discloses a three-level cache replacement method based on dirty page awareness and adaptive capacity, and belongs to the technical field of computer memory cache management. The method comprises the following steps: constructing short-time queues, medium-time queues and global queues on the side of a CXL extended memory device cache; performing object insertion, migration and metadata update according to the hit condition of each queue; when the cache space is insufficient, performing eviction determination in combination with access count, dirty page flag and dirty page revival flag; calculating the revisit ratio based on the global queue identification insertion frequency and revisit frequency, and dynamically adjusting the short-time queue capacity and the medium-time queue capacity. The application solves the problems of high dirty page write-back cost and inflexible cache space allocation in the CXL extended memory, optimizes the access characteristics, dirty page state and elimination revisit behavior in cooperation, reduces the redundant write-back overhead, improves the cache space utilization efficiency and reduces the access time delay.

The invention relates to the field of solid state storage, in particular to a multi-Namespace distribution management method applied to an NVMe SSD (Non-Volatile Memory Express Solid State Disk). Firstly, a data structure is defined, an idle linked list is used for managing an idle space, a red-black tree of Namespace and allocated block nodes are used for managing an allocated LBA interval in each Namespace, the Namespace is created in a mode of searching idle blocks from the idle linked list, optimal matching idle blocks are searched preferentially, and if the optimal matching idle blocks do not exist, the Namespace does not exist. Continuing to search whether the space formed by combining the adjacent free blocks meets the requirement or not, if not, continuing to combine the adjacent free blocks, and so on until the free block combination meeting the condition is found or the free linked list is traversed; and carrying out space distribution and Namespace updating, and carrying out space release when the Namespace is deleted. According to the method, the multi-Namespace of the NVMe SSD can be dynamically and intelligently managed, physical space holes are effectively avoided, and the utilization efficiency of the storage space is remarkably improved.