32 results about "Virtual storage" patented technology

Data recovery in a virtual storage system includes detecting a data loss within a data set within storage provided by a first storage tier of the virtual storage system, wherein recovery data for the data set is stored in a second storage tier, determining a recovery point for the data set from which a consistent version of the data set is recoverable from the recovery data stored in the second storage tier up to the recovery point, and recovering the consistent version of the data set within the storage provided by the first storage tier of the virtual storage system.

The application discloses a Tensor data processing method and device and related equipment. The method comprises the following steps: acquiring prior information of Tensor data, wherein the prior information comprises a dimension parameter and a storage address mapping rule of the Tensor data; determining each target element based on the dimension parameter of the Tensor data; converting the virtual storage address of each target element into a physical storage address by using the storage address mapping rule, wherein the physical storage addresses are continuous; storing each target element into the corresponding physical storage address; and performing a preset operation on each target element stored in the physical storage address by using a preset algorithm to obtain a processing result. Thus, the cache hit rate is improved.

During a post-copy migration process, latency and memory overrides can be avoided by implementing some techniques described herein. For example, during a post-copy migration process involving migrating a virtual machine from a source computing device to the destination computing device, a hypervisor can start the virtual machine on the destination computing device. After starting the virtual machine, the hypervisor can receive a message associated with storing data from a passthrough device to a virtual memory segment of the virtual machine on the destination computing device. Based on receiving the message, the hypervisor can prevent the virtual memory segment from being migrated from the source computing device to the destination computing device. This can prevent the data from the passthrough device from being overridden.

Approaches are described for a decentralized computing platform that enables dynamic execution of distributed services through a hybrid on-chain and off-chain architecture. The platform consists of a network of nodes, each running a virtual machine to host and execute service instances. A sequencer component records, sequences, and notarizes function calls to maintain a consistent service-level state across the network. Computation takes place off-chain on nodes that participate dynamically in specific services based on resource availability. A persistent virtual memory structure manages both service-level and instance-level state. The service-level state is synchronized across nodes participating in the same service, while the instance-level state is isolated to individual nodes for independent operations. The memory system is non-volatile, retaining state across function calls and enabling direct execution from memory. A universal procedure call (UPC) framework facilitates decentralized communication through multicast-enabled operations with customizable fault tolerance and supports applications from finance to high-performance computing.

A canary update method according to some embodiments is disclosed. The canary update method includes executing, by a processor configured to process tasks including the canary, computer program instructions to perform operations including extracting, by a processor, a first value from an array including N values, setting the canary to the first value, determining that the canary is updated based on a canary flag value of a first task, extracting, when determined that the canary is updated, a second value from the array, and updating the canary of the first task to the second value. The processor is configured to access a memory through a mapping circuit, and the mapping circuit includes mapping information between a physical memory region in the memory corresponding to the first task and a virtual memory region associated with the mapping circuit.

This invention discloses a method for managing a portable solid-state drive (SSD) based on virtual storage, comprising the following steps: Step 1: Reading the logical address arrangement and operating status of the portable SSD, and performing continuity detection and correction processing; Step 2: Performing address location, time window division, and segment type extraction on the currently mounted file access records; Step 3: Performing time-series prediction using an improved FEDformer model to obtain access migration results; Step 4: Performing migration rearrangement and segment filtering on the virtual storage organization table based on the access migration results, generating a rearrangement mapping table; Step 5: Performing sequential scanning and splitting processing on actual read / write requests based on the rearrangement mapping table, and generating an execution scheduling table; Step 6: Recording and encapsulating recovery status units based on the execution scheduling table, and generating a breakpoint recovery table. This invention achieves predictive rearrangement and breakpoint recovery for portable SSDs through an improved FEDformer model.

This application provides a method, device, and storage medium for automatic pallet stacking and recycling scheduling. In one example, the method includes: when it is determined that there are pallets to be recycled and there are available storage spaces at the stacking point, storing the pallets to be recycled in a target virtual storage space using a forklift; and when it is determined that preset recycling conditions are met, recycling the pallets stored in the virtual rack. This method can achieve automatic stacking and recycling of pallets to be recycled without the need for a dedicated stacking machine.

A method includes allocating a first portion of virtual memory of a volatile storage device of a computing system as a compressed memory swap space, wherein the virtual memory includes a second portion different from the first portion, and wherein the compressed memory swap space is aligned with a partial array boundary in the volatile storage device. The method further includes storing at least a portion of the contents of the second portion in the compressed memory swap space. The method further includes, in response to the computing system operating in a low-power mode: copying the contents of the compressed memory swap space to a non-volatile storage device; setting the refresh mode of the volatile storage device to a partial array self-refresh mode; and suppressing the refreshing of the compressed memory swap space. The method further includes copying the contents of the compressed memory swap space back to the volatile storage device.

The disclosure relates to a computer-implemented method for designing an automated storage and retrieval system at a storage site. The method comprises capturing a material dimension of the storage site, generating a virtual storage system based on the material dimension, and displaying, to a user, the virtual storage system synchronously overlaying a representation of the storage site. The virtual storage system comprises a virtual frame delineating a plurality of virtual storage columns for receiving virtual stacks of storage containers. The representation portrays the material dimension.

A computer-implemented method for providing a process with access to data stored in a file comprises receiving a request, from a process, to access at least a portion of the data, creating an empty sparse file and associated metadata; creating a memory-mapped sparse file in a virtual memory of the process and allocating memory for the process using a pointer to a starting position of the memory-mapped sparse file; copying in the at least a portion of the data into the sparse file; and providing the process with access to the data based upon the based upon the memory-mapped sparse file. The zero content of the memory-mapped sparse file is mapped to a system zero page. By using the memory-mapped sparse file as a container for the data and the system zero page, data may be more efficiently allocated by the computer system.

Embodiments of the present application disclose a neural network processing unit verification method and device and electronic equipment, and relate to the technical field of artificial intelligence. The method comprises: for a plurality of PEs included in an NPU, generating instruction sequences for each PE participating in a verification scenario based on a three-layer random mechanism of PE level, engine level and instruction level; generating source code files for the instruction sequences of each PE in a verification environment and compiling to generate respective corresponding firmware image files; loading the firmware image files of each PE into a virtual storage model to simulate a storage process, and carrying machine code in the virtual storage model to the instruction cache of each PE through an instruction carrying module inside the NPU; the processor of each PE respectively executes the corresponding machine code and drives the respective engine to perform corresponding operations; actual data obtained after each PE executes the machine code is acquired, and is compared with expected data generated based on a reference model, and the function of the NPU is verified according to the comparison result.

This disclosure provides techniques hierarchical address virtualization within a memory controller and configurable block device allocation. By performing address translation only at select hierarchical levels, a memory controller can be designed to have predictable I / O latency, with brief or otherwise negligible logical-to-physical address translation time. In one embodiment, address transition may be implemented entirely with logical gates and look-up tables of a memory controller integrated circuit, without requiring processor cycles. The disclosed virtualization scheme also provides for flexibility in customizing the configuration of virtual storage devices, to present nearly any desired configuration to a host or client.

This invention relates to the field of shipbuilding technology, specifically disclosing a calculation method for reducing the computational power requirements of ship section assembly simulation. The method first establishes an assembly simulation model in Plant Simulation software, including section storage yards, assembly jig positions, and gantry crane resources. Innovatively, it adds three virtual storage yards corresponding to assembly sequence constraints, assembly sequence constraints, and jig position resource constraints, respectively. By judging the lifting conditions of sections entering the section storage yard, those meeting the conditions are lifted into the assembly jig position; those not meeting the conditions are diverted to the corresponding virtual storage yard for temporary storage according to the specific constraint type. Through event-driven dynamic scheduling, sections that do not meet the conditions are placed in a dormant state, significantly reducing invalid calculations during the simulation process and greatly lowering the simulation computational power requirements.

A method of performing a program process on a three-dimensional (3D) NAND memory device is disclosed. The method causes residual electrons trapped in a storage region of a dummy cell in the middle of an unselected string of the 3D NAND memory device during a pre-charge phase to be removed, thereby reducing program disturbance to a selected string adjacent to the unselected string.

The application provides a node setting method, a data storage method, an electronic device and a storage medium. Each storage node is respectively provided with a corresponding sparse file, each virtual storage address in the sparse file corresponds to each physical storage address in the corresponding storage node in one-to-one correspondence, and the method comprises the following steps: acquiring a data storage instruction, the data storage instruction comprising a data storage address and to-be-stored data; writing the to-be-stored data into each sparse file according to the data storage instruction, the virtual storage address indicated by the data storage address; and writing the to-be-stored data written in the virtual storage address indicated by the data storage address in each sparse file into the corresponding storage node respectively, the physical storage address corresponding to the virtual storage address. Therefore, compared with the backup mode of the primary node and the standby node in the prior art, the data is not easy to be lost due to the absence of the time difference between the primary node and the standby node.

Methods, systems, and devices for dynamic reconfiguration of error control operations are described. A memory system may configure ranks of the memory system to operate according to a single die data correction (SDDC) code. In the case that the memory system may determine that a memory die of one of the ranks may include an error, the memory system may reconfigure a first virtual bank of the rank and a second virtual bank of a second rank to operate according to a double die data correction (DDDC) code. The memory system may reconfigure the virtual banks of the ranks to operate according to a quadruple die data correction (QDDC) code in the case that further errors may be detected at the virtual banks, and may refrain from reconfiguring virtual banks that may not be associated with or adjacent to a memory die including an error.

The application provides a virtual material picking method and device, equipment and a storage medium, the picking method can adjust the display style of the target indication icon on the graphical user interface in real time according to the virtual material currently picked by the player, thereby synchronizing the storage state of the virtual material in the virtual storage space to the player in real time through the visual target indication icon, and the player can efficiently and intuitively understand the storage state of the virtual material corresponding to different material qualities in the virtual storage space in real time.

This invention discloses a method and system for jointly optimizing and determining surface-groundwater drought early warning thresholds and collaborative scheduling strategies, comprising the following steps: First, the groundwater supply space is divided into independent accounting units and generalized into virtual storage nodes with time-series cyclic constraints, a cycle zeroing mechanism is configured, and a multi-source joint configuration system network is constructed with surface reservoirs; Second, an optimization model is established with the optimal comprehensive evaluation index of system drought resilience as the objective function, coupling three dimensions: water supply security, drought recovery speed, and water shortage loss intensity; Third, based on boundary conditions, the time-series threshold sequences of surface reservoir drought warning water levels and groundwater source drought warning water volumes are determined by inverse deduction from the lowest storage state at the end of the cycle; Finally, a triggering mechanism coupling state monitoring and trend forecasting is constructed. This invention achieves closed-loop management of optimization-early warning-scheduling, significantly improving the drought resilience of multi-source joint water supply systems.

This disclosure provides techniques hierarchical address virtualization within a memory controller and configurable block device allocation. By performing address translation only at select hierarchical levels, a memory controller can be designed to have predictable I / O latency, with brief or otherwise negligible logical-to-physical address translation time. In one embodiment, address transition may be implemented entirely with logical gates and look-up tables of a memory controller integrated circuit, without requiring processor cycles. The disclosed virtualization scheme also provides for flexibility in customizing the configuration of virtual storage devices, to present nearly any desired configuration to a host or client.

A technique is directed to managing data in persistent storage. The technique includes receiving an input / output (I / O) request specifying a write of a data block. The technique further includes storing, in a physical storage layer, (i) a physical block that contains data of the data block and (ii) size metadata that specifies a size of the physical block. The technique further includes updating a virtual block in a virtual storage layer. The updated virtual block includes location metadata that indicates a location of the physical block in the physical storage layer.

Systems and methods for performing journal swapping are provided. In one example, the backing storage used for virtual non-volatile random access memory (vNVRAM) is dynamically switched based on the high-availability (HA) state of an HA pair of nodes of a virtual storage system. By default, in-memory logging may be used for write journaling when the HA pair is operating in a normal HA state. When the HA pair is in an HA degraded state, the write journaling may be performed to local ephemeral storage. This allows the file system of the virtual storage system to run in a more performant configuration most of the time (e.g., during which HA is enabled and healthy). At the same time, the file system has the ability to swap to a less performant but more resilient configuration during planned events (e.g., scheduled maintenance and throughput scaling) in which HA is in a degraded state.

A data processing network includes request nodes having local memory accessible as distributed virtual memory (DVM) and coupled by an interconnect structure. Multiple DVM domains are assigned, each containing a DVM node for processing DVM operation requests from request nodes in the domain. Upon receiving a request, the DVM node sends a snoop message to other request nodes in its domain and to one or more peer DVM nodes in other DVM domains. The DVM node receives snoop responses from the request nodes and from the one or more peer DVM nodes and sends a completion message to the first request node. Each peer DVM node sends a snoop message to request nodes in its domain, collects snoop responses, and sends a single response to the originating DVM node. In this manner, DVM operations are performed in parallel.

This invention relates to the field of trade data knowledge graph construction technology, specifically a method for generating a trade data mirror database. The method includes: configuring heterogeneous data source access points and periodically capturing a set of original trade records, obtaining intermediate data after multi-stage verification. A domain model is introduced to deconstruct and reassemble the intermediate data into data fragments with model labels. A virtual storage partition is allocated to each data fragment, and a data association network with trade entities as the core and trade events as the context is constructed within each partition. The association networks of all partitions are aggregated, and a panoramic trade knowledge graph is generated through cross-citation and link fusion techniques. The topology and attribute data of this knowledge graph are persisted to different storage engines to form the final mirror database. This invention realizes the transformation of trade data from discrete records to a panoramic associated knowledge system, improving the efficiency of data association queries and the ability for in-depth analysis.

This invention relates to thread memory access. Apparatus, systems, and techniques according to at least one embodiment are disclosed for performing third-party management of thread memory requests within one or more processors by using a server to manage memory and memory requests to perform dynamic memory allocation during runtime without the risk of rewriting. In at least one embodiment, the processor includes one or more circuitry for causing one or more threads to access one or more physical memory locations using one or more virtual memory location addresses based at least in part on information indicating whether one or more physical memory locations have been allocated to the one or more threads.

Apparatuses, systems, and techniques to perform third party management of operational thread memory requests within one or more processors by use of a server to manage said memory and memory requests to perform dynamic memory allocation during runtime without overwrite risk, according to at least one embodiment. In at least one embodiment, processor scomprising one or more circuits to cause one or more threads to use one or more virtual storage location addresses to access one or more physical storage locations based, at least in part, on information indicating whether the one or more physical storage locations are allocated to the one or more threads.

Systems and methods for performing journal swapping are provided. In one example, the backing storage used for virtual non-volatile random access memory (vNVRAM) is dynamically switched based on the high-availability (HA) state of an HA pair of nodes of a virtual storage system. By default, in-memory logging may be used for write journaling when the HA pair is operating in a normal HA state. When the HA pair is in an HA degraded state, the write journaling may be performed to local ephemeral storage. This allows the file system of the virtual storage system to run in a more performant configuration most of the time (e.g., during which HA is enabled and healthy). At the same time, the file system has the ability to swap to a less performant but more resilient configuration during planned events (e.g., scheduled maintenance and throughput scaling) in which HA is in a degraded state.

The application discloses a streaming media processing method and related device, and relates to the field of computers, wherein in response to a streaming media playing request sent by a player, an original streaming media link is acquired, and a protocol header is modified into a self-defined protocol header; a loading request based on the self-defined protocol header is intercepted by using a resource loading delegation protocol interface, and a data request range is obtained by analysis, so that searching is performed in a local virtual storage index library; if media data segments in the data request range are cached in a single physical storage file locally, the media data segments are read according to physical offset recorded in the virtual storage index library, and are encapsulated and returned to the player. According to the application, a single physical storage file with a unique length is created for each video stream by a virtual storage engine, and in combination with the recorded physical offset, the file system can maintain only one file for each video stream, so that the index node resource consumption is reduced, and the input / output read / write efficiency of the disk and the streaming media storage efficiency are improved.

Systems and methods provide witness sled hardware installed in a chassis and supported during failures using management resources of the chassis. A chassis may include data storage devices and Information Handling Systems (IHSs), each storing data redundantly to the storage devices, such in a vSAN. The witness sled provides witness functions, such as arbitrating discrepancies in the redundantly stored data. The chassis includes a chassis management controller (CMC) that maintains a copy of witness transactions stored by the witness sled based on transaction data transmitted by the witness sled to the CMC via the management signaling pathway. The CMC notifies the IHSs of witness operations supported by the CMC in response to a detected fault in the witness sled and utilizes the copy of witness transactions to process witness transactions from the IHSs while the witness sled is not operational.

This invention discloses a method, system, and medium for controlling the inbound and outbound movement of goods, relating to the fields of Industrial Internet of Things (IIoT) and warehouse management. The method includes: creating a task to be executed when the current inbound / outbound request meets the task creation conditions; allocating virtual storage locations to the corresponding boxes of goods for the task to be executed based on a virtual storage location occupancy heatmap and storage age distribution map when the task type is an inbound task; binding the inbound information of the boxes to the target physical storage location mapped by the allocated virtual storage location after the boxes are moved to the location; and issuing the outbound boxes according to the first-in, first-out (FIFO) principle when the task type is an outbound task. The technical solution of this invention can improve the intelligence level of inbound / outbound management, achieve accurate tracking and positioning of boxes of goods, and optimize production scheduling.

This invention relates to the field of database systems and storage systems, and in particular to a writing method and apparatus based on a computable storage device. The method includes receiving a write transaction for a database; when the database is under non-write-intensive load, writing the flushed data corresponding to the write transaction to the actual storage area based on a B+ tree index structure; dividing the entire key space of the database into multiple partitions according to the range of keys, and for each partition, storing the key value falling into the partition and a pointer to the actual data in the leaf nodes of an adaptive radix tree, obtaining a multi-instance adaptive radix tree index structure; when the database is under write-intensive load, writing the flushed data corresponding to the write transaction to the virtual storage area of ​​the computable storage device based on the multi-instance adaptive radix tree index structure, and having the computable storage device complete the process of migrating the flushed data from the virtual storage area to the actual storage area. This invention can improve write performance.