82 results about "Spatial allocation" patented technology

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

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.

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 provides a periodic information cache space balancing and flow control method and system, and the method achieves the ordered issuing of messages through the establishment of a mapping relation between a message identifier and a load length and the combination of a DMA polling issuing mechanism. By calculating the cache number occupied by each message, the total cache number and the balance factor, the cache space is dynamically allocated according to the load length and the balance factor, it is ensured that cache resources are reasonably allocated according to message requirements, and the problem of resource waste or insufficiency caused by uneven allocation of the cache space is avoided. By judging whether the total cache space meets the preset condition or not and dynamically adjusting the load length or the cache unit space, the cache utilization efficiency and the adaptability of the cache requirements of all messages and the total cache space of the board card in one scheduling period are further optimized, the stability of periodic information transmission and the high efficiency of resource utilization are improved, and the resource utilization rate is improved. The problem that the bandwidth requirement cannot be met due to DMA congestion, scheduling failure or low bandwidth in the communication process is solved.

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.

Systems and methods are provided for implementation and use of disaggregated storage by a distributed storage system. In various examples described herein, the association of blocks of storage space within a storage pod with a given dynamically extensible file system (DEFS) may be in large chunks of one or more gigabytes (GB), which may be referred to herein as “allocation areas” (AAs) that each include multiple RAID stripes. The use of large, multi-GB chunks, as the unit of space allocation / assignment to DEFSs of a distributed storage system facilitates ease of management and independence of write allocation. The use of AAs described herein further allows disk space to be used more fluidly across individual (nodes) storage systems of a distributed storage system (cluster of nodes working together), thereby eliminating silos of storage; and processing resource (e.g., CPU) load may be distributed across the cluster.

The invention provides a transverse axis dynamic self-adaptive webpage end approval flow visualization method and system and a medium, and the method comprises the steps: constructing a transverse single-axis container, automatically adjusting the node arrangement through a dynamic space distribution algorithm, and supporting transverse scrolling to display an approval process; generating approval process nodes, wherein the node width is adaptively adjusted according to the content length, and the maximum display width does not exceed a preset threshold value; an elastic gap container is inserted in front of a non-head node, the width of the elastic gap container is dynamically distributed based on the residual space and is constrained by the maximum width, and a continuous flow connecting line is formed; detecting the position of a current to-do node in real time, and automatically positioning the current to-do node to a visible area through rolling control logic; and in response to window size change, dynamically adjusting the space ratio of the node to the gap container to adapt to different screen sizes. According to the technical scheme provided by the invention, adaptive adjustment of the webpage end approval process can be realized, and the approval efficiency is 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.