Patent classifications
G06F16/1724
No-code, event-driven edge computing platform
Unified management, automation and interoperability of business and device processes utilizing components of a no-code, event-driven edge computing platform on any device and/or across difference devices. In an embodiment, an event processor on a device accesses a first events dataset which may represent a two-dimensional structure. Each row in the events dataset is processed by the event processor to update the state of a runtime dataset which represents a two-dimensional structure. The updated state of the runtime dataset comprises event-defined processes. In an embodiment, the event-defined processes are executed by the event processor to process a second events dataset, wherein the execution of the event-defined processes further updates the state of the runtime dataset and may create one or more new events for processing.
SMART DE-FRAGMENTATION OF FILE SYSTEMS INSIDE VMS FOR FAST REHYDRATION IN THE CLOUD AND EFFICIENT DEDUPLICATION TO THE CLOUD
One example method includes chunking a respective disk of each of a plurality of virtual machines (VM) to create a respective plurality of chunks associated with each of the VMs, creating, based on the chunking process, a cluster comprising one or more of the VMs, creating a VM template whose data and disk structure match respective data and disk structures of each of the VMs in the cluster, and in response to a file operation involving a first one of the VM disks, defragmenting the first VM disk so that a disk structure of the first VM disk is the same as a disk structure of the VM template.
Smart de-fragmentation of file systems inside VMs for fast rehydration in the cloud and efficient deduplication to the cloud
One example method includes chunking a respective disk of each of a plurality of virtual machines (VM) to create a respective plurality of chunks associated with each of the VMs, creating, based on the chunking process, a cluster comprising one or more of the VMs, creating a VM template whose data and disk structure match respective data and disk structures of each of the VMs in the cluster, and in response to a file operation involving a first one of the VM disks, defragmenting the first VM disk so that a disk structure of the first VM disk is the same as a disk structure of the VM template.
COMMAND LINE UTILITY TO GENERATE USER-CONTROLLED FRAGMENTATED TEST DATA ON A HARD DISK DRIVE
Embodiments of the disclosure provide systems and methods for intentionally creating fragmentation of data in one or more storage media based on user-specified parameters. According to one embodiment, a method for creating user-controlled fragmentation of data stored in one or more storage media can comprise receiving a plurality of parameters defining the user-controlled fragmentation of the data stored in the one or more storage media, determining a first random number, and creating a first file on the one or more storage media. The first file can be initially empty. An amount of data for the first file can be determined based on the first random number and data can be written to the first file on the one or more storage media up to the determined amount of data for the first file.
Redistribution of architected states for a processor register file
In an approach to dynamic redistribution of register files, whether a redistribution of register files is necessary is determined. Responsive to determining that the redistribution of register files is necessary, one or more register file transfers that have not yet completed are flushed. One or more register file write locations are allocated for each architected register based on a register free list. Source data is read from each architected register. The source data is written to the one or more register file write locations.
Data fragmentation tuning and candidacy persistence
A method for implementing defragmentation of a data area is provided. The method includes receiving a data change event for the data area and determining, whether the data area has exceeded a defragment threshold based on a defragment threshold value. The method may further include adding the data area to a candidacy list when the data area is determined to have exceeded the defragment threshold based on the defragment threshold value. The method may also include defragmenting the data area when the data area is determined to have exceeded the defragment threshold based on the defragment threshold value and removing the data area from the candidacy list following the determination.
SYSTEMS AND METHODS FOR STORAGE MEDIUM MANAGEMENT
The present disclosure relates to a system and method for managing files stored in a storage medium. The method may include obtaining file information of a file stored in the storage medium, wherein the file includes at least two data fragments, each two of the at least two data fragments are stored separately in two discontinuous storage units in the storage medium. The method may also include determining a first parameter of the file according to the file information, wherein the first parameter represents an integrity of the at least two data fragments in the storage medium. The method may further include determining whether the first parameter is equal to or smaller than a preset threshold. The method may still further include defragmenting the at least two data fragments in the storage medium if the first parameter is equal to or smaller than the preset threshold.
Load balancing for distributed processing of deterministically assigned data using statistical analysis of block data
Dynamic generation and implementation of assignment mappings of data items in large data files to distributed processors to achieve objectives such as reduced overall processing time like. Any appropriate key (e.g., character string) can be identified or obtained for each data item in a data file and the file can be segmented into sequential data blocks, where each data block includes a set of data items. The data items in each of a first plurality of the blocks (e.g., sampled block set) may be initially sorted into one of a plurality of key ranges of a search space (each corresponding to a different respective processor) and analyses conducted on the data items totals in each key range. The key range boundaries can be adjusted by accounting for uncertainty in the sample estimates to more evenly distribute data items from all blocks sent to each processor and thereby achieve the objective.
Intelligent defragmentation in a storage system
Techniques are provided for implementing intelligent defragmentation in a storage system. A storage control system manages a logical address space of a storage volume. The logical address space is partitioned into a plurality of extents, wherein each extent comprises a contiguous block of logical addresses of the logical address space. The storage control system monitors input/output (I/O) operations for logical addresses associated with the extents, and estimates fragmentation levels of the extents based on metadata associated with the monitored I/O operations. The storage control system identifies one or more extents as candidates for defragmentation based at least on the estimated fragmentation levels of the extents.
EFFICIENT AND NON-DISRUPTIVE ONLINE DEFRAGMENTATION WITH RECORD LOCKING
Methods, systems, and computer-readable storage media for online defragmentation of memory in database systems by applying an IX-lock to each table having data stored in a marked page in a set of marked pages, generating a record map including key-value pairs, each being associated with a record location in a marked page, a value of each key-value pair initially set to a first value, iteratively executing the online defragmentation to delete data from marked pages and add the data to non-sparse pages, at least one iteration including applying a try-lock to a record in a marked page, and at iterations of the online defragmentation, updating the record map to change the value of at least one key-value pair from the first value to the second value, the second value representing that data of a marked page has been deleted from the marked page and added to a non-sparse page.