Abstract: When an application execution error occurs, an entry for the execution error is included in an error log. In instances where user data associated with the error should be preserved, a placeholder corresponding to the error is included in the error log. The placeholder contains pseudo data representing the user data, but is formatted in such a way to prevent the vendor from accessing the content of the data without additional authorization. When reviewing the log file, the vendor has visibility to the pseudo data contained in the placeholders, but is not able to discern the content of the user data from the pseudo data. In response to a request from the vendor to access instances of user data, the customer can selectively provide access to particular instances of user data that are deemed to not contain sensitive information.

Abstract: A method facilitating cluster expansion using a flexible ready node and enhanced join process includes determining a compatibility between a first operating system of a first node device and a second operating system of a second node device in response to the first node device receiving a request by the second node device to join a cluster in which the first node device operates; in response to determining that the second operating system does not have the compatibility with the first operating system, causing the second node device to install an operating system image, the operating system image being of an operating system version that is compatible with the first operating system; and facilitating merging of the second node device into the cluster in response to determining that the second node device has successfully installed, and booted from, the operating system image.

Abstract: Embodiments for power supply-based communication for detection of a lack of redundancy in power that has been supplied to a system are presented herein. A system generates first identification data to be transmitted from the system via a power connection between the system and a power source, in which the first identification data references a first unique identification corresponding to a first power supply of the system. Further, in response to a data transmission comprising second identification data referencing a second unique identification corresponding to a second power supply of the system being determined to be received via the power connection, the system determines a lack of redundancy in power that has been supplied to the system.

Abstract: A method facilitating storage system repurposing with preservation of cluster configuration deltas and data in-place includes removing, by a node device including at least one processor, a volume associated with the node device from a file system of a computing cluster in which the node device operates in response to an operating system upgrade instruction being received by the node device; in response to determining that the volume has successfully been removed from the file system of the computing cluster, populating, by the node device, a partition of the volume with cluster configuration data representative of a configuration of the computing cluster; and booting, by the node device based on the cluster configuration data as stored on the partition of the volume, the node device from an operating system image installed on the volume.

Abstract: Per-CPU reference counting leveraging per-CPU operations is presented herein. An example method comprises receiving a read request for access to shared data from a thread executing on one processor of a multi-processor core, determining that the shared data is unavailable in a first cache memory, transmitting the read request to storage server equipment, polling a second cache memory to determine that the shared data is unavailable in the second cache memory, based on the unavailability of shared data in the first cache memory and second cache memory, sending the shared data to the first cache memory, providing access to the shared data, incrementing a counter value, and based on the shared data having been modified, writing the modified shared data to the first cache memory for future access to the modified shared data by the thread.

Abstract: Embodiments for power supply-based communication for detection of a lack of redundancy in power that has been supplied to a system are presented herein. A system generates first identification data to be transmitted from the system via a power connection between the system and a power source, in which the first identification data references a first unique identification corresponding to a first power supply of the system. Further, in response to a data transmission comprising second identification data referencing a second unique identification corresponding to a second power supply of the system being determined to be received via the power connection, the system determines a lack of redundancy in power that has been supplied to the system.

Abstract: The described technology is generally directed towards maintaining a heat score per file based on a file's access/activity level, and using the heat score to re-tier files from faster to slower storage and vice-versa. Files on a slower tier that have more activity are thereby moved (“up-tiered”) to a faster access storage tier, while the files that have less activity on the faster access storage tier are moved (“down-tiered”) to a slower access storage tier. The heat score for a file is increased based on more input-output operation activity, and decayed over time. The decaying can be based on a relative importance value (e.g., business value) assigned to the file or a domain that includes the file. Ordering the files based on their respective heat scores allows only a fraction of the files to be considered for re-tiering before the re-tiering moves are performed.

Abstract: Facilitating per-CPU reference counting for multi-core systems with a long-lived reference is provided herein. A system includes a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations. The operations include determining a first quantity of releases associated with an object in a data structure of the system and determining a second quantity of acquisitions associated with the object. The first quantity of releases can be distributed among respective first counters of processing elements of a group of processing elements. The second quantity of acquisitions can be distributed among respective second counters of the processing elements of the group of processing elements. Further, the operations can include, based on the second quantity of acquisitions and the first quantity of releases being determined to be a same value, implementing a removal of the object from the data structure.

Abstract: A storage system calculates relative writability of SSDs and biases storage of data from write IOs to the SSD that has the greatest relative writability, where writability is a value calculated as a function of remaining wear-life and drive capacity. When the remaining wear-life of an SSD falls below a threshold, unstable data is evicted from that drive, where data stability is an indication of likelihood of data being changed. The drive with the greatest relative writability is selected as the target for the unstable data. The drive with the greatest relative writability is also selected as the donor for stable data that is moved to the free space created by eviction of the unstable data. Consequently, the SSD that triggers the low wear-life threshold processes fewer write IOs.

Abstract: A system can comprise a processor and a memory that can store executable instructions that, when executed by the processor, facilitate performance of operations comprising generating data comprising a power source identifier to be transmitted as a data transmission; and transmitting, to a power consumer, the data transmission via a power connection from a power source. The data transmission can comprise other information related to the power source. The operations can further comprise receiving one or more consumption data transmissions from one or more power consumers, wherein the one or more power consumers are associated with the power source and comprise the power consumer, and wherein at least one of the one or more consumption data transmissions comprises a consumption indicator associated with the power consumer.

Abstract: A system can determine that a thread has failed to acquire a lock. The system can, in response to determining a thread has failed to acquire a lock, determine an average hold time and/or an average acquire time for threads that have previously acquired the lock. The system can compare the average hold time to a threshold hold time and/or compare the average acquire time to a threshold acquire time. The system can query a scheduler for a count of tasks which could be run. The system can determine whether a thread waiting to acquire a lock should spin or sleep based on at least one of an average hold time for the lock, an average acquire time for the lock, and a count of tasks which could be run.

Abstract: The described technology is generally directed towards maintaining a heat score per file based on a file's access/activity level, and using the heat score to re-tier files from faster to slower storage and vice-versa. Files on a slower tier that have more activity are thereby moved (“up-tiered”) to a faster access storage tier, while the files that have less activity on the faster access storage tier are moved (“down-tiered”) to a slower access storage tier. The heat score for a file is increased based on more input-output operation activity, and decayed over time. The decaying can be based on a relative importance value (e.g., business value) assigned to the file or a domain that includes the file. Ordering the files based on their respective heat scores allows only a fraction of the files to be considered for re-tiering before the re-tiering moves are performed.

Abstract: A storage system calculates relative writability of SSDs and biases storage of data from write IOs to the SSD that has the greatest relative writability, where writability is a value calculated as a function of remaining wear-life and drive capacity. When the remaining wear-life of an SSD falls below a threshold, unstable data is evicted from that drive, where data stability is an indication of likelihood of data being changed. The drive with the greatest relative writability is selected as the target for the unstable data. The drive with the greatest relative writability is also selected as the donor for stable data that is moved to the free space created by eviction of the unstable data. Consequently, the SSD that triggers the low wear-life threshold processes fewer write IOs.

Abstract: Facilitating per-CPU reference counting for multi-core systems with a long-lived reference is provided herein. A system includes a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations. The operations include determining a first quantity of releases associated with an object in a data structure of the system and determining a second quantity of acquisitions associated with the object. The first quantity of releases can be distributed among respective first counters of processing elements of a group of processing elements. The second quantity of acquisitions can be distributed among respective second counters of the processing elements of the group of processing elements. Further, the operations can include, based on the second quantity of acquisitions and the first quantity of releases being determined to be a same value, implementing a removal of the object from the data structure.

Abstract: Facilitating the embedding of block references for reducing and/or mitigating file access latency in file systems is provided herein. A system includes a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations. The operations include populating a data structure of the system with information indicative of a block pointer that identifies a first location of a first data block of an object. The first location is a location within a storage system. The operations also can include, based on a receipt of a read request for the object, enabling access to the first data block of the object based on the block pointer. Enabling access can include bypassing a reading of a block map for access to the first data block.

Abstract: Pre-decompressing a compressed form of data that has been pre-fetched into a cache to facilitate subsequent retrieval of a decompressed form of the data from the cache is presented herein. A system retrieves, from a first portion of a cache, a compression chunk comprising compressed data blocks representing a compressed form of a group of data blocks in response to a first cache hit from the first portion of the cache being incurred, decompresses the compression chunk to obtain a decompressed chunk comprising uncompressed data blocks representing an uncompressed form of the group of data blocks, and inserts the uncompressed data blocks into a second portion of the cache. Further, the system retrieves, from the second portion of the cache, an uncompressed data block of the uncompressed data blocks in response to a second cache hit from the second portion of the cache being incurred.

Abstract: Compression of data for a file system utilizing protection groups can be implemented and managed. A compression management component (CMC) can control compression of data via inline or post-process compression for storage in protection groups in memory, including determining whether to compress data, determining a compression algorithm to utilize to compress data, and/or determining whether to perform inline and/or post-process compression of data. CMC can generate protection group (PG) metadata for a PG in which compressed data is stored. PG metadata can comprise a logical extent map that describes which logical blocks contain compressed data, a list of cyclic redundancy check values for logical blocks, and a list of compression chunks that store individual metadata regarding individual compressed streams, wherein, for an individual compressed stream, the individual metadata comprises a compression format, compressed size, uncompressed size, and/or starting offset in physical space within the PG.

Abstract: Pre-decompressing a compressed form of data that has been pre-fetched into a cache to facilitate subsequent retrieval of a decompressed form of the data from the cache is presented herein. A decompression component retrieves, from a first portion of a cache, a compression chunk comprising compressed data blocks representing a compressed form of a group of data blocks in response to a first cache hit from the first portion of the cache being incurred, decompresses the compression chunk to obtain a decompressed chunk comprising uncompressed data blocks representing an uncompressed form of the group of data blocks, and inserts the uncompressed data blocks into a second portion of the cache. Further, a read component retrieves, from the second portion of the cache, an uncompressed data block of the uncompressed data blocks in response to a second cache hit from the second portion of the cache being incurred.

Abstract: Compression of data for a file system utilizing protection groups can be implemented and managed. A compression management component (CMC) can control compression of data via inline or post-process compression for storage in protection groups in memory, including determining whether to compress data, determining a compression algorithm to utilize to compress data, and/or determining whether to perform inline and/or post-process compression of data. CMC can generate protection group (PG) metadata for a PG in which compressed data is stored. PG metadata can comprise a logical extent map that describes which logical blocks contain compressed data, a list of cyclic redundancy check values for logical blocks, and a list of compression chunks that store individual metadata regarding individual compressed streams, wherein, for an individual compressed stream, the individual metadata comprises a compression format, compressed size, uncompressed size, and/or starting offset in physical space within the PG.

Abstract: Implementations are provided herein for offering partitioned performance within a distributed file system and providing throttling at the granular level. A set of hardware and network resources available to process work items can be determined. A set of resource accounting tokens based on resource records generated when processing work items can be dynamically updated. A granular resource accounting aggregate for a customizable field of data can be selected for throttling, such as a unique user identifier, a unique group identifier, a unique client internet protocol address, a unique file, etc. A granular throttling level can then be established based on a granular throttling policy. In response to the resource accounting aggregate meeting the throttling level, the user, group, internet protocol address, etc. can be throttled at, at least one of, the cluster layer, the node layer or the protocol layer.