Abstract: Some embodiments provide a method of providing distributed storage services to a host computer from a network interface card (NIC) of the host computer. At the NIC, the method accesses a set of one or more external storages operating outside of the host computer through a shared port of the NIC that is not only used to access the set of external storages but also for forwarding packets not related to an external storage. In some embodiments, the method accesses the external storage set by using a network fabric storage driver that employs a network fabric storage protocol to access the external storage set. The method presents the external storage as a local storage of the host computer to a set of programs executing on the host computer. In some embodiments, the method presents the local storage by using a storage emulation layer on the NIC to create a local storage construct that presents the set of external storages as a local storage of the host computer.

Abstract: Methods, systems, and computer-readable media for a scalable metadata index for a time-series database are disclosed. A time-series database receives a query comprising spatial and temporal boundaries of requested time-series data in a table. Using traversal of a metadata index, the time-series database determines one or more storage locations in the one or more data sources corresponding to the spatial and temporal boundaries. The metadata index includes a root node representing spatial and temporal boundaries of the table. The metadata index includes one or more leaf nodes representing the spatial and temporal boundaries of the requested time-series data. The one or more leaf nodes indicate the one or more storage locations in the one or more data sources. The time-series database obtains one or more elements of the requested time-series data from the one or more storage locations in the one or more data sources.

Abstract: Computer-implemented methods for optimized compute resource addition and removal in a distributed storage platform. In a case of a newly added compute resource being connected to a storage subsystem shared by compute resources in the distributed storage platform, the distributed storage platform formulates a redistribution plan to redistribute a subset of a global address space of the storage subsystem to a newly added logical volume in the storage subsystem. In a case of a removed compute resource being disconnected from the storage subsystem, the distributed storage platform formulates a redistribution plan to redistribute respective logical blocks in a logical volume for the removed compute resource to respective remaining logical volumes for respective remaining compute resources in the distributed storage platform. The distributed storage platform executes the redistribution plan to reassign data block ownerships on one or more physical memory devices in the storage subsystem.

Abstract: Some embodiments provide a method for migrating data from a first database to a second database. The method uses a data segmentation process to dynamically determine a set of segmentation criteria for a particular portion of the first database. The method uses the set of segmentation criteria to divide the particular portion of the first database into multiple data segments. The method incrementally transfers the multiple data segments from the first database to the second database.

Abstract: A priority for each operating requirement of a set of operating requirements of a memory sub-system can be determined. A programming operation setting for a programming operation to be performed at the memory sub-system can be determined based on the priority for each operating requirement. A request to perform the programming operation at the memory sub-system can be received. Responsive to receiving the request to perform the programming operation, the programming operation can be performed at the memory sub-system based on the programming operation setting.

Abstract: Techniques and apparatus for installation optimization process are described. In one embodiment, for example, an computing device may include at least one memory; at least one storage device; and logic coupled to the at least one memory to perform an installation process, the logic to: determine installation requirements for an analytical platform, the installation platform comprising at least one of an analytical application, a database application, and a fast recovery area (FRA), perform at least one prerequisite test based on a hardware configuration of the computing device and the installation requirements, and perform a drive optimization process to determine at least one optimal drive configuration for installation of the installation platform based on remaining free space (RFS) on the at least one storage device and at least one storage device installation rule. Other embodiments are described.

Abstract: A system for managing storage of data in a information handling systems includes a first information handling system, and a specialized information handling system comprising an enhanced networking interface, wherein the enhanced networking interface is programmed to: obtain data to be processed by the system, perform a data sharding analysis using telemetry data to identify the first information handling system, and transmit the data to the first information handling system based on the identifying.

Abstract: A distributed database system maintains data for a logical table by storing, on a plurality of storage nodes, a collection of key-item pairs. The distributed database system receives a query of the logical table, and identifies one or more portions of a key specified by the query. Based on the one or more portions of the key, the distributed database causes at least one of a get, range query, or scan operation to be performed by one or more of the storage nodes. Results for the query are generated based on one or more items obtained by performance of the operation.

Abstract: A system for managing abort events of Hardware Transactional Memory (HTM) transactions to an in-memory database, comprising a processor adapted to control a plurality of abort events of a plurality of database transactions held concurrently to a shared in-memory database and a method for managing abort events comprising analyzing a metadata record associated with each potential abort event, where the metadata record comprises a row ID value and a row version value of a certain one of a plurality of rows of a database that is concurrently accessed by an aborting HTM transaction and another HTM transaction, comparing the row ID value and the row version value to a local ID value and a local version value of the aborting HTM transaction and determining a contention condition between the aborting HTM transaction and the other HTM transaction.

Abstract: Disclosed embodiments relate to generating an update package for updating software on an Electronic Control Unit (ECU) in a vehicle. Operations may include accessing a plurality of attributes of a software update to be stored on the ECU in the vehicle; accessing a corresponding plurality of attributes of current software stored on the ECU in the vehicle; comparing the plurality of attributes with the corresponding plurality of attributes; generating a delta file representing differences between the plurality of attributes and the corresponding plurality of attributes determined in the comparison; and providing the delta file to the ECU, wherein the delta file is configured to be processed by startup code in the ECU that enables the delta file to execute in the ECU in the vehicle.

Abstract: A computer-implemented method of importing data from a data source to a target storage system is disclosed. The method involves executing an automated data import process to retrieve data from the data source and update the target storage system based on the retrieved data. The automated data import process operates in dependence on a source data schema of the data source. The method involves detecting a change in the source data schema, and, in response to detecting the change in the source data schema, modifying the automated data import process. The modified automated data import process can subsequently be used to retrieve further data from the data source and update the target storage system based on the further retrieved data.

Abstract: Storing documents in an object store in the cloud by creating a container for the documents, defining a document record including unique document ID and an index. A backup record for every backup includes a timestamp for each backup, and a bitmask for each document in the container has a single bit position for each document to indicate the corresponding document as unchanged or that it has been changed/deleted. Each bit location in the bitmask is referenced by the index in the document record. Large documents have a multi-part record identifying the containers. During point-in-time recovery, containers that match a given timestamp are found, and documents where the bitmask bit is set are restored.

Abstract: Partitions of drives are used to form a volume of a drive array. Each partition is associated with a trusted computing group (TCG) band. Each drive encrypts data stored on the partition with a key unique to the TCG band. The volume is formed using the partitions of the drives. In response to a band-based erasure being invoked on the volume, each drive of the plurality of drives overwrites the key of the TCG band associated with the partition and provides an erasure certificate attesting to the overwriting of the key. The erasure certifications from the drives are compiled into a consolidated erasure certification that attests to the erasure of the volume.

Abstract: Replication of a filesystem or a mount point or share may replicate all data that it consists of irrespective of where the data is stored. Replication protects data irrespective of location. One method is to replicate the filesystem namespace as is while skipping the data outside of the appliance/machine so that replication cost and time are reasonable. The data outside of the machine, like cloud/tape data is protected differently. One example method includes a data protection operation configured to replication a namespace associated with multiple data tiers. During replication, data from one of the tiers is skipped while all of the namespace metadata is replicated. The recovery restores the namespace metadata and the data that was replicated from the other tier. This may be performed in connection with cyber security, for example when replicating multi-tier data to a vault.

Abstract: A method for sharing secret data between multiple containers. In response to the initial booting of an operating system instance in a container, a unique operating system identifier is generated for the operating system instance. A grant authority stores the unique operating system identifier in a reserved area of a secure storage device. In response to a request from the operating system instance to access secret data in the secure storage device, the grant authority determines whether the unique operating system identifier is stored in the secure storage device. The operating system instance may be granted access to secret data in the non-reserved area of the secure storage device.

Abstract: A method to deploy a plurality of event-driven application components of an event-driven application in a distributed computing environment is described. The method includes automatically analyzing application source code of the event-driven application, using one or more processors, to identify relationships between the plurality of event-driven application components. Thereafter, a set of rules are applied to, based on the automatic analysis, generate assignment data recording assignments of event-driven application components to a plurality of computational nodes in the distributed computing environment. The set of rules is also applied to determine component requirements for each of the plurality of event-driven application components required to support execution at an assigned computational node in the distributed computing environment.

Abstract: In accordance with an embodiment, described herein is a system and method for resource isolation and consumption in an application server environment. The system can provide, at one or more computers, including an application server environment executing thereon, a plurality of resources which can be used within the application server environment, and one or more partitions, wherein each partition provides an administrative and runtime subdivision of a domain. The system can also configure a resource consumption management module to monitor each partition's usage of the plurality of resources. The resource consumption management module can comprise at least one member of the group consisting of resource reservations, resource constraints, and resource notifications.

Abstract: Methods, systems, and computer readable media for optimizing storage of application data in memory are disclosed. According to one method for optimizing storage of application data in memory, the method includes receiving application data associated with an application. The method also includes generating, using information about the application, information about a processor, and information about a memory, a memory map indicating one or more memory locations in the memory for storing the application data. The method further includes storing, using the memory map, the application data in the one or more memory locations. The method also includes executing, using the processor, the application that uses the application data.

Abstract: A first event occurs at a first computer at a first time, as measured by a local clock. A second event is initiated at a second computer by sending a message that includes the first time. The second event occurs at a second time, as measured by a local clock. Because of clock error, the first time is later than the second time. Based on the first time being later than the second time, an alternate second time, that is based on the first time, is used as the time of the second event. When a third system determines the order of the two events, the first time is obtained from the first computer, and the alternate second time is obtained from the second computer, and the order of the events is determined based on a comparison of the two times.

Abstract: There is provided data source system agnostic fact partitioned data information repository system comprising: a data repository comprising: a plurality of fact partitions; a plurality of dimensions stored in relation to the fact partitions, the plurality of dimensions shared by each of the fact partitions; and a plurality of data source system specific data mappings; a data receiver for receiving data from the plurality of data source systems; and a data mapper for partitioning the data into the plurality of fact partitions using the plurality of data source system specific data mappings.

Abstract: Core to resource and resource to core mapping is disclosed. In an embodiment, a method includes obtaining an input pattern including a plurality of resource identifiers corresponding to resources. The method further includes applying the input pattern to a guaranteed regular and uniform distribution process to obtain a distribution pattern that indicates a distribution of resources across cores or a distribution of the cores across the resources. The method further includes distributing the resources across the cores or distributing the cores across the resources according to the distribution pattern.

Abstract: A system-on-chip (SOC), includes a memory, a partition access module coupled to the memory, a partition requesting unit coupled to the partition access module, and a first input-output (IO) device coupled to the partition access module. The partition access module creates a first partition of the SOC. The first partition includes a first portion of a first processor, the first IO device, and a first portion of the memory. Based upon a partition request, the partition access module repartitions the SOC to create a dynamic partition. The dynamic partition includes the first portion of the first processor, the first input-output (IO) device, the first portion of the memory, and a second IO device not included in the first partition.

Abstract: A storage system and storage control method are provided in which a plurality of volumes to be processed by a storage control unit are distributed and evacuated in a normal storage control unit without recovering redundancy of the storage control unit having decreased redundancy, and the storage control unit itself having the decreased redundancy is deleted after the evacuating is completed, and thus reservation information processing resources for guaranteeing recoverability of the redundancy become unnecessary.

Abstract: Aspects of a multi-protocol storage device including a controller are provided which handle mode switches after a shutdown resulting in a large amount of unfinished work by phasing the work during and after initialization. The controller operates in a first mode such as an SD mode and a second mode such as a NVMe mode. In the event of a shutdown in the second mode resulting in unfinished work, the controller initializes in the first mode. During initialization, the controller determines whether a completion time for the unfinished work exceeds an initialization time in the first mode. When the completion time exceeds the initialization time, the controller performs a first portion of the work during initialization and postpones performance of at least a second portion of the unfinished work until after initialization. As a result, initialization timeouts in the first mode due to the unfinished work may be avoided.

Abstract: Systems, methods, and devices for transactional processing of change tracking data for a database are discussed. A method includes generating a micro-partition based on execution of a transaction on a table of a database, the micro-partition reflecting changes made to the table by the transaction. A change tracking entry is generated in response to the execution of the transaction. The change tracking entry includes an indication of one or more modifications made to the table by the transaction and an indication of the micro-partition generated based on the execution of the transaction. The change tracking entry is stored in the micro-partition as metadata. At least one existing micro-partition is removed from the table, responsive to storing the change tracking entry.

Abstract: One embodiment provides a system which facilitates organization of data. During operation, the system identifies an original data chunk stored in a non-volatile memory of a storage device, wherein the original data chunk is a logical chunk which includes original logical block addresses. The system stores a first mapping of the original logical block addresses to original physical block addresses in a first data structure. The system assigns new logical block addresses to be included in a new data chunk. The system creates, in a second data structure based on an order of the assigned new logical block addresses, a mapping of the new logical block addresses to valid original logical block addresses. The system stores, based on the first data structure and the second data structure, a second mapping of the new logical block addresses to the original physical block addresses.

Abstract: A system is used in a data processing system comprising at least one memory system which is operatively engaged and disengaged from a host or from another memory system and the host transmitting commands into the at least one memory system. The system includes a metadata generator configured to generate a map table for an available address range and a reallocation table for indicating an allocable address range in the map table; and a metadata controller configured to allocate the allocable address range to the at least one memory system when the at least one memory system is operatively engaged to the host or to another memory system, or release an allocated range for the at least one memory system such that the allocated range becomes the allocable address range when the at least one memory system is operatively disengaged from the host or the another memory system.

Abstract: A data storage apparatus may include a first memory device comprising a first area in which write data from a host device are stored and a second area, a second memory device into which the write data stored in the first memory device are copied, a storage device, and a controller. The controller is configured to control data input/output for the first memory device, the second memory device and the storage device, wherein the controller comprises a cache manager configured to evict eviction target data from the second memory device by: storing the eviction target data into the storage device, and storing the eviction target data into the second area of the first memory device.

Abstract: A distributed computing system for automatic constraint-based data resource arrangement, comprising a plurality of computing components being communicatively coupled to each other, each computing component comprising the following data resources: data storage media for storing client-related digital information, a data processor for processing said client-related digital information, and a network communications interface for communicating said client-related digital information; and a constraint engine for automatically determining alternate arrangements of said data resource assignments, said constraint engine comprising a constraint processor and a constraint database, said constraint database for receiving and storing changeable digital constraint parameters indicative of permissible operational constraints on said data resources, wherein said alternate arrangements comply with at least a first set of said changeable digital constraint parameters; wherein said data resource assignments are reassigned from

Abstract: Disclosed in the present disclosure is a data caching method and apparatus, the data caching method includes the following steps: receiving a data request message sent by a user terminal; if detecting that a cache apparatus does not include the target access data requested by the data request message, then sending the target access data in a storage apparatus to the user terminal; extracting parameter information of the target access data in the storage apparatus, and determining whether the parameter information matches a preset parameter condition; and, if the parameter information matches the preset parameter condition, then transmitting the target access data to the cache apparatus.

Abstract: Method and system are provided for managing capacity in a storage system using copy services. The method is a computer-implemented method that predicts an imminent event due to a constrained resource and identifies one or more copy service relationship that will mitigate the imminent event. The method orchestrates a partial or full invalidation of a copy service relationship to reclaim some of the constrained resource to prevent the imminent event, including updating the copy service relationship metadata to indicate the invalidation.

Abstract: According to one aspect of the present disclosure, a method and technique for hybrid virtual machine configuration management is disclosed. The method includes assigning to a first set of virtual resources associated with a virtual machine a first priority and assigning to a second set of virtual resources associated with the virtual machine a second priority lower than the first priority. An operating system of the virtual machine is provided with the first and second priorities assigned to the respective first and second sets of virtual resources. The operating system dispatches to process a workload the virtual resources from the first set before dispatching the virtual resources from the second set.

Abstract: Techniques for data processing may include: receiving a data chunk of the data set; determining, in accordance with criteria including a compressibility ratio for the data set and a cost ratio of compression computation cost and entropy computation cost, whether to activate or deactivate entropy computation for the data set, wherein the compressibility ratio is ratio of a number of compressible data chunks of the data set and a number of uncompressible data chunks of the data set; and responsive to determining to activate entropy computation for the data set, performing first processing comprising: determining an entropy value for the data chunk; and determining, in accordance with the entropy value for the data chunk, whether to compress the data chunk.

Abstract: Systems and techniques for garbage collection are disclosed for concurrently performing a garbage collection cycle in a single traversal of a garbage collection heap while application threads are running. The garbage collection cycle includes marking a first memory object as live. The garbage collection cycle also includes determining that a forwarding pointer of the first memory object points to the first memory object. The garbage collection cycle further includes evacuating the first memory object to a free region based on the determining. The garbage collection cycle additionally includes evacuating a second memory object in the same single traversal of the garbage collection heap in which the first memory object is being marked live.

Abstract: A method, computer program product, and computer system for identifying, by a computing device, historical block usage in a plurality of slices for a user. At least a portion of the plurality of slices to keep during an evacuation process for the plurality of slices may be determined. At least the portion of the plurality of slices may be excluded from the evacuation process for the plurality of slices based upon, at least in part, the historical block usage in the plurality of slices for the user.

Abstract: An apparatus comprises a processing device configured to identify a snapshot lineage comprising snapshots of a storage volume and to maintain, for the snapshot lineage, a multi-level tree structure comprising (i) a first level comprising a primary volume object representing the storage volume and snapshot volume objects representing the snapshots of the storage volume and (ii) additional levels comprising data objects, where the primary and snapshot volume objects comprise pointers to the data objects, the data objects comprising data of the storage volume and snapshots. The processing device is also configured to determine storage capacity usage by the snapshot lineage based on a collective size of the data objects pointed to by the primary and snapshot volume objects, to store the determined storage capacity usage as metadata associated with the primary volume object, and to dynamically update the metadata responsive to changes in the snapshot lineage.

Abstract: A computer-implemented method for increasing record availability on a distributed database system implementing multiple partitioning strategies includes identifying first processing devices of a distributed database system for storing one or more first records in accordance with multiple partitioning strategies, determining that at least two of the first processing devices are identified for storing a given one of the one or more first records, and selecting one or more new processing devices of the distributed database system for storing the given first record to achieve sufficiently high availability of the given record within the distributed database system.

Abstract: A query including at least a first part and a second part can be received by an electronic system. The first part of the query can indicate to access at least a first database table and a second database table to generate an intermediate result. The second part of the query can indicate to perform a sort operation on the intermediate result with respect to columns across the first database table and the second database table to produce a final result. The method further includes building execution plans for generating the intermediate result according to the first part, where the intermediate result is to be used as the final result without building an execution plan for performing the sort operation.

Abstract: A computing system includes a computer in communication with a tiered storage system. The computing system identifies a set of data transferring to a storage tier within the storage system. The computing system identifies a program to which the data set is allocated and determines to increase or reduce resources of the computer allocated to the program, based on the set of data transferring to the storage tier. The computing system discontinues transferring the set of data to the storage tier if a resource allocated to the program cannot be increased.

Abstract: A key retrieval system includes a management system and a managed system that is coupled to the management system through a network. The managed system includes a managed device, a management system configuration storage, a remote access controller device that stores a management system configuration for the management system in the management system configuration storage and provides a key management client subsystem that is configured to use the management system configuration to access the management system. The managed system also includes a BIOS. The BIOS detects an event that triggers unlocking the managed device. The BIOS determines that the remote access controller device is unavailable and, in response, retrieves the management system configuration and accesses the management system using the management system configuration. The BIOS then retrieves the locking key from the management system and unlocks the managed device using the locking key.

Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. A plurality of failure resilient stripes is distributed across the plurality of storage devices such that each of the plurality of failure resilient stripes spans a plurality of the storage devices. A graphics processing unit is operable to access data files from the failure resilient stripes, while bypassing a kernel page cache. Furthermore, these data files may be accessed in parallel by the graphics processing unit.

Abstract: A first event occurs at a first computer at a first time, as measured by a local clock. A second event is initiated at a second computer by sending a message that includes the first time. The second event occurs at a second time, as measured by a local clock. Because of clock error, the first time is later than the second time. Based on the first time being later than the second time, an alternate second time, that is based on the first time, is used as the time of the second event. When a third system determines the order of the two events, the first time is obtained from the first computer, and the alternate second time is obtained from the second computer, and the order of the events is determined based on a comparison of the two times.

Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. A plurality of failure resilient stripes is distributed across the plurality of storage devices such that each of the plurality of failure resilient stripes spans a plurality of the storage devices. A graphics processing unit is operable to access data files from the failure resilient stripes, while bypassing a kernel page cache. Furthermore, these data files may be accessed in parallel by the graphics processing unit.

Abstract: A method for dynamically altering logical storage capacity within multiple storage drives is disclosed. In one embodiment, such a method monitors, within a storage environment, characteristics (e.g., age, wear, etc.) of multiple storage drives. Each storage drive has an amount of overprovisioning associated therewith. Based on the characteristics, the method periodically modifies a logical storage capacity of the storage drives in order to alter the amount of overprovisioning. The method then reorganizes the storage drives within various storage groups (e.g., RAID arrays, storage tiers, workloads, etc.) based on their logical storage capacity. For example, the method may place, as much as possible, storage drives of the same logical storage capacity within the same storage groups. A corresponding system and computer program product are also disclosed.

Abstract: Data processing apparatus comprises one or more processing elements to execute processing instructions; address translation circuitry to perform address translations between a virtual address space and a physical address space, the address translations being defined by a current hierarchical set of address translation tables selected from two or more hierarchical sets of address translation tables, the address translation circuitry being responsive to current table definition data providing at least a pointer to a memory location of the current hierarchical set of address translation tables; the one or more processing elements being configured to overwrite the current table definition data with second table definition data providing at least a pointer to a memory location of a second, different, hierarchical set of address translation tables of the two or more hierarchical sets of address translation tables; the one or more processing elements being configured to execute test instructions requiring address tr

Abstract: A computer-implemented method according to one embodiment includes partitioning resources of a network file system (NFS) platform into a plurality of zones, based on a number of exports within the NFS platform; receiving, at one of the exports within the NFS platform, a request from a first application to utilize the resources of the NFS platform; and allocating a predetermined portion of the resources to the first application within one of the plurality of zones, based on information included within the request.

Abstract: Systems and methods are described for providing an implementation of the MapReduce programming model utilizing tasks executing on an on-demand code execution system or other distributed code execution environment. A coordinator task may be used to obtain a request to process a set of data according to the implementation of the MapReduce programming model, to initiate executions of a map task to analyze that set of data, and to initiate executions of a reduce task to reduce outputs of the map task executions to a single results file. The coordinator task may be event-driven, such that it executes in response to completion of executions of the map task or reduce tasks, and can be halted or paused during those executions. Thus, the MapReduce programming model may be implemented without the use of a dedicated framework or infrastructure to manage map and reduce functions.

Abstract: An application monitoring system for identifying and removing unused components from memory associated with an application. Embodiments identify a range, a set of historical logs associated with the range, and components in each historical log. Each component is classified based on a frequency of use of the component, the most recent time the component was used, the number of periods between the most recent use of the component and the range end point, and the number of periods between the most recent use of the component and the previous use of the component. Unused and rarely used components are isolated or removed from the memory.

Abstract: Technology for configuring and executing a shallow virtual machine to enhance memory protection between different portions of user space memory of a particular computing process. An example method may involve: associating a computing process with a virtual machine data structure, wherein the computing process initiates an update to the virtual machine data structure to cause a processor to switch between a page table structures; loading first and second executable code into user space memory of the computing process, wherein a first page table structure comprises mapping data for the first and second executable code and wherein the second executable code comprises driver code of a device; updating the second page table structure to disable execution of the first executable code and to map a portion of the user space memory to the device; and restricting the first executable code from accessing the memory mapped device.

Abstract: A method includes detecting, by a vault management device, a failed storage unit common to a first vault and a second vault. The first vault is associated with a first set of storage units and the second vault is associated with a second set of storage units. The failed storage unit is in each of the first and second sets of storage units. The method further includes identifying a number of non-failed storage units of the first and second sets of storage units and comparing the number of non-failed storage units with first and second decode threshold numbers to determine a failure impact level. The first decode threshold number is associated with the first vault and the second decode threshold number is associated with the second vault. The method further includes determining a failure abatement approach based on the failure impact level and facilitating the failure abatement approach.