Abstract: Embodiments are directed to managing resources over a network. Objects that each correspond to a separate key container may be provided such that each separate key container includes a region key, a shard key, a nonce key. A data center and a data store may be determined for each object based on the region key and the shard key included in each separate key container such that a value of the region key corresponds to the data center and a value of the shard key corresponds to the data store.

Abstract: Physical storage devices may be managed for spontaneous de-staging from a cache, for example, by determining a background task threshold (UBTT), and controlling one or more physical storage devices to use the UBTT instead of the VBTT in determining when to enter background task mode. The determined UBTT may be less than the VBTT, which may cause the physical storage device to enter into background task mode earlier, which means that background tasks like garbage collection and write leveling may be performed more frequently. An ability to turn on and turn off management of physical storage devices for spontaneous de-staging of a cache may be provided. It may be desirable to turn off physical storage device management for spontaneous de-staging, for example, during peak workload hours, to prevent physical storage devices from entering into background task mode more frequently during certain times.

Abstract: A method of communicating data in a data grid. The method includes receiving a first search request defined by search criteria of a search query. The method includes communicating the first search request to search for data segments at the first node that match the search criteria. The method includes receiving one or more data segments matching the search criteria. The method includes receiving rebalance information. The method further includes identifying a second node storing rebalance data segments of the plurality of rebalance data segments based on the rebalance information. The method further includes communicating a second search request to search for the rebalance data segments matching the search criteria. The method further includes receiving one or more rebalance data segments matching the search criteria. The method further includes determining search result data using the data segments from the first node and the rebalance data segments from the second node.

Abstract: A technique is applied to eventually converge on a single data storage strategy for any set of object data which had an inconsistent data storage strategy applied during storage while there was a network partition. This state could occur in instances of a highly available distributed object storage system which can store objects according to multiple data storage strategies. Upon the healing of a network partition, the technique discovers if multiple data storage strategies were applied to the object data stored during a network partition, deterministically identifies which data storage strategy represents the correct strategy, for example based on the log of state transitions requested by the client according to the API contract, and ensures that this strategy is consistently applied to all object data in the collection.

Abstract: An IP-PBX system with the capability of automatic data backup and a method using the same is disclosed. The system includes one or more first devices, one or more second devices, and an IP-PBX having at least a first data storing area. The IP-PBX is installed with a verification program. The verification program verifies the backup permission of the first device or the second device when the first device or the second device reads the first data storing area. The first device is installed with a first control program and at least a backup verification code. The first control program drives a backup instruction set to automatically search the first data storing area and downloads the content of the first data storing area to the first device according to the backup verification code when the first device is electrically connected to the IP-PBX.

Abstract: A memory device operable in either of a Secure Digital operational mode and an NVMe operational mode includes password conversion logic to enable the memory device user-mode memory blocks to be accessed in the NVMe operational mode after the memory device was locked in the Secure Digital operational mode.

Abstract: Provided herein may be a memory system and a method of operating the memory system. The method includes: allocating a first buffer region to a first workload group; allocating a second buffer region to a second workload group; monitoring a first workload group latency and a second workload group latency; and dynamically adjusting a memory space of each of the first and second buffer regions based on a result of the monitoring.

Abstract: Particular embodiments may receive a request to perform a task to a core network by a user device via an access point. The user device may be authenticated by the core network which comprises one or more network functionality components, and each of the one or more network functionality components may be decomposed into multiple service types. The core network may identify a sequence of a service instances based on the task. Each of the service instances may belong to one of the multiple decomposed service types. The sequence of service instances may be scheduled for deployment to accomplish the task by the core network. The core network may deploy the sequence of the service instances to one or more server machines of the core network.

Abstract: Methods and systems for a virtual machine environment are provided. One method includes allocating a memory for storing a dirty pages data structure for tracking writes to a virtual machine memory by an adapter coupled to a computing device and shared by a plurality of virtual machines; initiating a tracking operation by the adapter or a virtual function driver to track writes to the virtual memory; providing access to the dirty pages data structure in response to a query command, while the adapter or the virtual function driver tracks writes to the virtual machine memory; and providing a number of dirty pages within the dirty pages data structure and a pointer the dirty pages data structure by the adapter or the virtual function driver.

Abstract: A device includes a host including a main memory, and semiconductor memory including a nonvolatile semiconductor memory, memory unit, and controller. The nonvolatile semiconductor memory stores first address information. The memory unit stores second address information as part of the first address information. The controller accesses the nonvolatile semiconductor memory based on the second address information. Third address information is stored in the main memory, and is part or all of the first address information. The controller uses the third address information when accessing the nonvolatile semiconductor memory if address information to be referred is not stored in the second address information.

Abstract: Systems and methods for automatically populating a post-operative report of a surgical procedure are disclosed. A system may include at least one processor configured to implement a method including receiving an identifier of a patient, an identifier of a healthcare provider, and surgical footage of a surgical procedure performed on the patient. The method may include analyzing frames of the surgical footage to identify phases of the surgical procedure based on interactions between medical instruments and biological structures and, based on the interactions, associate a name with each phase. The method may include determining a beginning of each phase and associating a time marker with the beginning of each phase. The method may include populating a post-operative report with the patient identifier, the names of the phases, and time markers associated with the phases in a manner that enables the health care provider to alter the post-operative report.

Abstract: In one or more embodiments described herein, system, methods, and/or computer program products that forensic analysis through metadata extraction. According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a metadata generation component that generates a metadata product comprising one or more data items associated with a distributed architecture of a file system, wherein the file system comprises one or more disks. The computer executable components can further comprise a security component that monitors the file system, wherein the security component generates an alert in response to detecting a degradation event associated with the one or more disks.

Abstract: A server box embodiment is disclosed that generally comprises an array of dummy HDDs that share a common set of universal disk drive components in a master components module, or power module. Each dummy HDDs is constructed without expensive onboard chipsets that control the normal functionality of a standard HDD. By sharing expensive chipsets in a master components module (power module) money can be saved in building and selling the dummy HDD server. Embodiments envision a power module possessing the needed chipset functionality that is missing in a dummy HDD. The power module can be made to move from dummy HDD to dummy HDD supplying the necessary chipset in a shared manner when data is being stored or retrieved for client or end-user.

Abstract: Methods that can access a shared computing resource are provided. One method includes determining, by a processor, a level of stress for a shared computing resource during each increment of time in a predetermined period of time, determining an optimized block of time within the predetermined period of time to perform a set of background operations on the shared computing resource based on the determined level of stress, and performing the set of background operations during the optimized block of time. Apparatus and computer program products that can include, perform, and/or implement the methods are also provided.

Abstract: A storage management technique involves: receiving a request for creating a virtual volume, the request at least indicating a size and a service level of the virtual volume; in response to the request, creating the virtual volume on a first storage device; storing metadata information of the virtual volume in a local database that is accessible to the first storage device, the metadata information at least comprising identification information of the virtual volume and identification information of the first storage device; and synchronizing the metadata information to at least one second storage device. Such a technique enables more flexible creation of virtual volumes on a cluster of storage device.

Abstract: The described technology is generally directed towards performing memory copy operations. According to an embodiment, a system can comprise a memory that stores computer executable components, a compression component, and a processor that can execute the computer executable components stored in the memory. The computer executable components comprise an instruction decoder that can receive an instruction from a host application, resulting in a decoded instruction. The components can also comprise a compression component controller to control the compression component, and a memory copier to employ the compression component controller to control the compression component to copy the value from the first memory location to a second memory location in the second memory, in accordance with the decoded instruction.

Abstract: An application programming interface (API) that enables installation of an application as one or more key-value objects on a data storage drive such as a hard disk drive, a solid state drive or a hybrid drive. The API also enables execution of the application within a controlled environment of the data storage drive.

Abstract: Examples described herein relate to manipulation of a structure of a policy hierarchy, while reformulating policies associated with the manipulated nodes, or other nodes effected by the manipulation, of the hierarchy. In some examples, a node may be created, moved, and/or deleted, and the manipulated node (and other nodes effected by the manipulation of the node) may reformulate their respective policies based on their new positions within the policy hierarchy. In some examples, nodes indirectly effected by the hierarchy manipulation may be moved within the hierarchy as a result.

Abstract: An embodiment includes initiating a migration of data rows in a source dataset in a source storage device to a target dataset in a target storage device. A block size defined for the target dataset equals a block size defined for the source dataset, and the migration is to be performed according to a native sequence of the data rows. The embodiment includes receiving, during the migration, a user request for access to a first data row in the source dataset, determining that the first data row was migrated to a first target block in the target dataset, and responding to the user request using the first data row in the first target block. In specific embodiments, a capacity of the target dataset is greater than a capacity of the source dataset. In other embodiments, a capacity of the target dataset is less than a capacity of the source dataset.

Abstract: Systems and methods for reducing locks on a storage layout of a distributed file system by detecting and notifying clients of stale storage layouts. An example method may comprise: receiving a request to modify a file system object associated with a storage layout, the request comprising an index range and the storage layout comprising an index range; determining whether the request is associated with a stale storage layout in view of a comparison of the index range of the request and the one or more index ranges of the storage layout; receiving a lock request to prevent changes to the storage layout; and transmitting at least a portion of the storage layout to update the stale storage layout.

Abstract: A control device for controlling a memory device to process requests from a plurality of hosts may include a request controller configured to manage a set representing storage space allocated to each of the plurality of the hosts; and a set controller configured to monitor requests from the plurality of hosts and to adjust size of the set, wherein, when the request is a write request from a host among the plurality of hosts, the request controller selects a target physical address among physical addresses included in the set allocated to the host, the target physical address indicating where the request is to be processed.

Abstract: A disclosed computer-implemented method may include receiving, via a monitoring infrastructure that monitors an operational state of a networking infrastructure, data representative of the operational state of the networking infrastructure during a period of time. The networking infrastructure may include (1) a plurality of data centers, and (2) at least one point-of-presence (POP) edge node. The method may also include (1) accessing data representative of a set of predefined policies associated with the networking infrastructure, and (2) based on the data representative of the operational state (a) determining a set of edge load factors associated with the edge node, and (b) generating, via a linear solver and further based the set of edge load factors associated with the edge node and the set of predefined policies associated with the networking infrastructure, a routing table for the POP edge node. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Stage task control blocks (TCB) are allocated for performing staging operations in a storage controller controlling one or more storage ranks. Destage TCBs are allocated for performing destaging operations in the storage controller. The storage controller adjusts how many stage TCBs and destage TCBs are to be allocated based on response times of the one or more storage ranks.

Abstract: Embodiments of the present disclosure relate to method, device and computer readable storage media for rebuilding redundant array of independent disks (RAID). The method comprises: in response to detecting at least one fault disk in the RAID, adding a new disk to the RAID for rebuilding; determining, according to a mapping table, a first set of storage blocks marked as “free” in the at least one fault disk, the mapping table indicating usage state of storage space in the RAID; and writing a predetermined value into a second set of storage blocks corresponding to the first group of storage blocks in the new disk.

Abstract: According to various aspects of the present disclosure, methods, systems, and media for data migration are provided. In some embodiments, the systems may include: at least one computer-readable storage medium including a set of instructions for migrating data records; and at least one processor in communication with the computer-readable storage medium, wherein when executing the set of instructions, the at least one processor is directed to: query data in a data storage system comprising a plurality of slave nodes; determine, from a plurality of data records in the slave nodes, at least one candidate data record that satisfies a first condition; identify, from the slave nodes, at least one candidate slave node that satisfies a second condition; and in response to determining that the number of the at least one candidate slave node is not less than a threshold value, migrate the candidate data record to a target slave node.

Abstract: Disclosed herein is a technique for migrating data between a first device and a second device via a private wireless network hosted by the first device. According to some embodiments, the private wireless network is established based on a code generated by the first device. The second device derives wireless network parameters associated with the private wireless network and connects to the private wireless network. In turn, the data migration can commence when a connection between the first device and the second device has been established.

Abstract: A new snapshot of a storage volume is created by instructing computing nodes to suppress write requests. Once pending write requests from the computing nodes are completed, storage nodes create a new snapshot for the storage volume by allocating a new segment to the new snapshot and finalizes and performs garbage collection with respect to segments allocated to the previous snapshot. An orchestration layer implements a bundled application that is provisioned with virtualized storage and computation resources. A snapshot of the bundled application may be created and used to rollback or clone the application. Clones snapshots of storage volumes may be gradually populated with data from prior snapshots to reduce loading on a primary snapshot. Chaos testing of the bundled application may be performed and storage volumes may be created, expanded, and/or moved based on usage of the bundled application.

Abstract: A fault tolerance method and system for a virtual machine group is proposed. The method includes: establishing fault tolerance backup connections of virtual machines between a virtual machine hypervisor of at least one primary host and a virtual machine hypervisor of at least one backup host to perform fault tolerance backups of the virtual machines, wherein the plurality of virtual machines are included in a fault tolerance group; when a synchronizer determines that a failover of at least one first virtual machine among the primary virtual machines in the fault tolerance group is being performed.

Abstract: An improved data storage system and apparatus, including an improved storage controller, is disclosed that enables the acceleration of datacenter software, by making it easier to deploy application software portions (applets) onto storage devices, in a manner that best supports runtime performance acceleration of storage-network-latency-throttled applications. Means are defined for how server hosted applications cause to have provisioned, initiate execution of, and work with a multitude of applets on a multitude of storage devices, proximate to storage contents. This invention supports the multi-exabyte growth of data storage, by scaling performance acceleration linearly with the growth in the number of storage devices. This in turn supports the evolving cloud and Enterprise Cognitive Computing datacenter by providing the infrastructure necessary for accelerating applications that face enormous heterogeneous datasets. This includes Big Data Analytics of problems that have eluded successful analysis.

Abstract: Hash-based application programming interface (API) importing can be prevented by allocating a name page and a guard page in memory. The name page and the guard page being associated with (i) an address of names array, (ii) an address of name ordinal array, and (iii) an address of functions array that are all generated by an operating system upon initiation of an application. The name page can then be filled with valid non-zero characters. Thereafter, protections on the guard page can be changed to no access. An entry is inserted into the address of names array pointing to a relative virtual address corresponding to anywhere within the name page. Access to the guard page causes the requesting application to terminate. Related apparatus, systems, techniques and articles are also described.

Abstract: A computing unit includes a data processing unit having a plurality of executable memory cells. Each of the plurality of executable memory cells includes a code portion for storing code, a data portion for storing data, and an arithmetic and logic unit for applying the code to the data. The computing system also includes a compilation unit for converting a sequence of instructions into an execution stream. The execution stream includes the code and the data that is executed by the plurality of executable memory cells.

Abstract: Systems and techniques for providing a low latency gateway for an asynchronous orchestration engine using direct memory are presented. A system can directly allocate an array memory space within a first data structure for transaction data associated with transaction requests for an online transaction system. The system can sequentially store respective data threads of the transaction data into respective memory blocks of the array memory space within the first data structure. The system can also sequentially separate the memory blocks of the array memory space within the first data structure into data channels for storage in a second data structure. Furthermore, the system can respectively format data channels and convert the data channels into communication pathways for the online transaction system based on at least one serialization technique for transmission to one or more memories of a virtual machine of the online transaction system.

Abstract: A plurality of stripe zones are mapped across drives in an array. A capacity of each of the stripe zones is smaller than or equal to an average size of the drives. A failed drive is determined in the array. A deletable stripe zone is selected that is being used for user data storage. The deletable stripe zone is taken offline and used to rebuild a subset of the plurality of the stripe zones affected by the failed drive.

Abstract: Systems, methods, and computer program products for automating the management of a tiered storage system, which improves the service life and costs of the flash-based storage devices that comprise the storage system. The systems, methods and program products utilize time series learning models to predict the write frequency of each data block for the next cycle of time. Using the write frequency predictions, management of the tiered flash-based storage system can automatically organize and migrate stored data based on storage costs, migration costs and frequency in which the data is accessed. Data that is more frequently accessed and updated is migrated to high-end flash-based storage devices, which are able to endure a greater number of program/erase cycles, while less frequently accessed data is migrated to less expensive, low-end flash-based storage devices, that have a lower maximum number program/erase cycles.

Abstract: Example storage systems, storage devices, and methods provide secure transfer of data between peer storage devices using protection information. Data operation commands may be received that use a protection information data block format for transferring a target data block between peer storage devices. A local data operation may operate on the target data block in a first storage device and compare at least one protection information tag value to a first data check value. At least one destination verification protection information tag value and the target data block may be transferred to a second storage device through a peer communication channel. The destination verification protection information tag value may be compared to a destination data block protection information tag value by the second storage device. The second storage device may then execute a data operation on the target data block.

Abstract: Systems and methods for storage pruning can enable users to delete, edit, or copy backed up data that matches a pattern. Storage pruning can enable fine-grain deletion or copying of these files from backups stored in secondary storage devices. Systems and methods can also enable editing of metadata associated with backups so that when the backups are restored or browsed, the logical edits to the metadata can then be performed physically on the data to create a custom restore or a custom view. A user may perform operations such as renaming, deleting, modifying flags, and modifying retention policies on backed up items. Although the underlying data in the backup may not change, the view of the backup data when the user browses the backup data can appear to include the user's changes. A restore of the data can cause those changes to be performed on the backup data.

Abstract: A distributed file system for a vehicle fire system leverages unused memory in slave modules. Such a system comprises file metadata stored on the master module, which includes information about specific files and the location of used and unused memory throughout the system, including memory on the master module and installed slave units. By maintaining the file metadata and sending instructions to slave units to save or read files at certain addresses, the master module can avail itself of unused memory throughout the entire system. This allows the master module to store more information on the system than there is available memory on the master itself.

Abstract: The disclosed computer-implemented method for write-once-read-many storage may include (1) receiving, at a file system on the computing device, a request to assign a write-once-read-many (WORM) attribute to a file, wherein the request is received from an application, (2) setting, in response to the request to assign the WORM attribute to the file, a WORM flag in an extended attribute associated with the file, and (3) associating with the file, in response to the setting of the WORM flag, a retention period attribute and read-only access until the end of the retention period. The provided systems and methods may provide per-file WORM support at a file system level using extended attributes of the file system. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The various embodiments described herein include methods, devices, and systems for processing memory operation requests. In one aspect, a method is performed at a computing system having one or more processors and non-volatile memory: (1) obtaining a plurality of internal memory operation requests for the non-volatile memory, the plurality of internal memory operation requests originating from within the computing system; (2) obtaining a plurality of external memory operation requests for the non-volatile memory, the plurality of external memory operation requests originating from one or more devices remote and distinct from the computing system; and (3) regulating a rate at which the plurality of internal memory operation requests are transferred to the non-volatile memory based on an amount of external memory operation requests in the plurality of external memory requests.

Abstract: In response to determining that a secondary index is to be created for a particular table of a non-relational database service, a service component verifies that automated transmission of change records of the table to a log-structured journal has been configured. A given change record comprises a before-image and an after-image associated with a committed database write, and is assigned a unique sequence number. A change record propagator for the secondary index examines change records stored in the journal, and transmits selected change records to an index storage node. The index storage node builds the secondary index using the selected change records.

Abstract: Techniques provide a storage management mechanism for flushing a page out of cache. The techniques involve obtaining recently used (RU) information of cache. The cache includes volumes, each of which includes a plurality of pages. The RU information indicates at least part of the volumes, and an unaccessed time length of pages in the at least part of the volumes exceeds a threshold time length. The techniques further involve: determining, based on a total number of pages to be flushed out of the cache and the RU information, a number of pages to be flushed out of the cache from the at least part of the volumes. The techniques further involve flushing, based on the determined number, pages in the at least part of the volumes. Accordingly, cache efficiency can be increased, and the overall performance of the disk array can be increased accordingly.

Abstract: When a real area is allocated to a write destination virtual area in a virtual volume, a storage device determines whether or not a size of compressed new data is larger than a size of the allocated real area. In a case where the determination result is true, the storage device determines whether or not there is one or more real areas having a size equal to or larger than the size of the compressed new data and including a garbage area that is a real area serving as garbage. In a case where the determination result is true, the storage device selects one or more real areas including the garbage area, allocates, instead of the allocated real area, the selected one or more real areas to the write destination virtual area, and manages the allocated real area as a garbage area.

Abstract: A digital system includes a non-volatile calculating register having a set of latches configured to perform a calculation. A set of non-volatile storage cells is coupled to the set of latches. Access detection logic is coupled to the calculating register and is operable to initiate a calculation of a next value by the calculating register each time the calculating register is accessed by an accessing module. The access detection logic is operable to cause the next value to be stored in the set of non-volatile storage cells at the completion of the calculation as an atomic transaction. After a power loss or other restore event, the contents of the calculating register may be restored from the non-volatile storage cells.

Abstract: A medication dispensing cabinet provides controlled access to medications and supplies stored in it. The cabinet may include at least one lockable storage compartment, and a controller that controls access to the at least one lockable storage compartment. The cabinet may include multiple printers integrated into the cabinet. The cabinet may include a camera operably coupled to the controller. The cabinet may include a set of cabinet electronics, and a power distribution and communications circuit board. The cabinet may include a radio frequency identification (RFID) reader, wherein the controller conditions access to the at least one lockable storage compartment on receipt of information from the RFID reader. Data may be stored in the controller according to an implementation of RAID technology. The controller may include multiple electronic communications network interfaces, and may include an out of band network communication channel. A dispensing cabinet may facilitate printing of labels for medications.

Abstract: A method, apparatus, and system for periodic performance optimization through heatmap based management of an in-memory area are provided. A heatmap is maintained to track database accesses, and a sliding most recent time window of the heatmap is externalized to a desired granularity level to provide access statistics regarding candidate elements to be possibly placed in the in-memory area. Initially and on a periodic basis, an appropriate knapsack algorithm is chosen based on an analysis on the computational costs versus the benefits of applying various knapsack algorithms for the candidate elements. Using the chosen algorithm in conjunction with a selected performance model, an optimized configuration of the in-memory area is determined. The optimized configuration indicates a set of elements chosen from the candidate elements, optionally specified with compression levels.

Abstract: Embodiments described herein are operable in a computing system. The computing system receives first and second commands (e.g., I/O commands). The computing system determines that the first command has a higher priority than the second I/O command, and queues the second command for servicing at a later time. The computing system services the first command, and services the second command after a timeout period based on performance degradation limit that decreases command processing performance of the computing system, overrides the timeout period, and increases a probability of executing the second command.

Abstract: Provided is a hard disk peak shift starting system, including: a power supply unit, a mainboard and a hard disk backplane. The power supply unit provides power to hard disks via a first power connector, a second power connector, E-Fuse chips and hard disk connectors. A Complex Programmable Logic Device (CPLD) unit sets a power-up starting sequence of the hard disks and a power-up starting time interval between the hard disks, and the CPLD unit is connected to a logical control end of each of the E-Fuse chips to control, based on the set power-up starting sequence and the set power-up starting time interval, on-off of a power supply end of each of the E-Fuse chips, to realize control of peak shift powering up and starting of the hard disks.

Abstract: Disclosed is a method, apparatus, and system for performing proxy-based partition backup in a virtualized environment, the operations comprising: mounting a backup source virtual machine disk to a backup proxy; obtaining, at the backup proxy, partition information for a backup source partition on the backup source virtual machine disk; and reading, by the backup proxy, partition data of the backup source partition based on the partition information and backing up the partition data to a data store.

Abstract: A storage cluster includes a plurality of storage nodes. Each of the plurality of storage nodes includes nonvolatile solid-state memory and each of the plurality of storage nodes is configured to cooperate with others of the plurality of storage nodes having differing storage capacities in applying erasure coding. The plurality of storage nodes are configured to distribute the user data and metadata throughout the plurality of storage nodes.

Abstract: Described are data movements techniques may include: receiving a plurality of write quotas for a plurality of physical media types; determining a first physical storage device of a first physical media type that is over utilized with respect to a write quota; selecting a first data portion of the first physical storage device for data movement; determining a target device that is not over utilized with respect to a write quota; determining an expected total write I/O workload of the target device after hypothetically moving the first data portion thereto; determining whether the expected total write I/O workload exceeds a write quota of the target device; and responsive to determining the total write I/O workload does not exceed the write quota for the target device, moving the first data portion to the target storage device.