Abstract: Examples described herein provide a computer-implemented method for intent aggregation. The method includes identifying an affinity between intent functions where serial execution forms a logical sequence that reduces a number of times any subsequent function is executed, the intent functions determined from a plurality of user operations. The method further includes determining a sequence for aggregation and execution of the intent functions. The method further includes executing the intent functions in the sequence to reduce a number of times that subsequent functions are executed.

Abstract: Systems and methods are provided for categorizing input/output rankings. Data in storage devices is categorized by data type and performance related characteristics of that data. All operation types are identified that are performed on the categorized data. A ranking is created for each data type by storage device. The ranking indicates the preferred storage devices for optimal performance. The rankings are stored as a map in one or more access devices. Upon receiving an input/output operation request, a storage device is selected based on the ranking in the map.

Abstract: Examples described herein provide a computer-implemented method that includes receiving diagnostic data about a plurality of operating system (OS) memory units of a distributed computing system. The method further includes defining a failure state for predicting whether at least one of the plurality of OS memory units will experience a failure. The method further includes predicting whether the at least one of the plurality of OS memory units will experience the failure based at least in part on the failure state and the diagnostic data about the plurality of OS memory units. The method further includes causing the at least one of the plurality of OS memory units predicted to experience the failure to be replaced with at least one replacement OS memory unit without impacting a namespace availability of the distributed computing system.

Abstract: In some implementations, a global coordinator may receive, from a distributed storage and task processing network (DSTN) managing unit, a first coordination message that indicates currently configured sampling policy information for the DSTN managing unit. The global coordinator may transmit, to an analytics agent, the currently configured sampling policy information for the DSTN managing unit. The global coordinator may receive, from the analytics agent, adjusted sampling policy information for the DSTN managing unit. The global coordinator may transmit, to the DSTN managing unit, a second coordination message that indicates the adjusted sampling policy information for the DSTN managing unit.

Abstract: Systems and methods are provided for delete operations over a stateless protocol of one or more regions stored in a dispersed storage network. The operation comprises receiving a request to delete one or more data regions of a data object with a topology map from an authorized application. The existing data topology map corresponding to the object metadata is fetched from the data storage processing unit in the dispersed storage network. One or more data regions of the data object are deleted. The updated topology map is returned to the authorized application.

Abstract: Systems and methods are provided for reorder transformation operations over a stateless protocol of one or more regions stored in a dispersed storage network. The operation comprises receiving a transformation request to apply to one or more data regions of a data object with a topology map from an authorized application. The existing data topology map corresponding to the object metadata is fetched from the data storage processing unit in the dispersed storage network. The transformation reorder is applied to the one or more data regions of the data object. The updated topology map is returned to the authorized application.

Abstract: A stored multi-part object management method, system, and computer program product for managing a stored multi-part object in a data storage application that includes modifying a stored multi-part object based on executing a predetermined operation and reporting a change to the multi-part object as a result of the modifying based on receiving a status request for the multi-part object.

Abstract: Systems and methods for managing conflicting background tasks in a dispersed storage network are provided. In embodiments, a method includes: gathering scheduled future task data for scheduled future tasks from a plurality of task scheduling modules within a dispersed storage network, wherein the scheduled future tasks are tasks associated with stored data objects; monitoring the scheduled future task data for scheduling conflicts based on stored rules; determining that a scheduling conflict exists between a first future task of the scheduled future tasks and a second future task of the scheduled future tasks; issuing instructions to at least one of the plurality of task scheduling modules to update the first future task or the second future task based on the scheduling conflict; and updating, by the at least one of the plurality of task scheduling modules, the first future task or the second future task based on the instructions.

Abstract: Systems and methods for managing conflicting background tasks in a dispersed storage network are provided. In embodiments, a method includes: gathering scheduled future task data for scheduled future tasks from a plurality of task scheduling modules within a dispersed storage network, wherein the scheduled future tasks are tasks associated with stored data objects; monitoring the scheduled future task data for scheduling conflicts based on stored rules; determining that a scheduling conflict exists between a first future task of the scheduled future tasks and a second future task of the scheduled future tasks; issuing instructions to at least one of the plurality of task scheduling modules to update the first future task or the second future task based on the scheduling conflict; and updating, by the at least one of the plurality of task scheduling modules, the first future task or the second future task based on the instructions.

Abstract: An assembly that includes a wedge and mandrel that share an axis of rotation and can be rotated independently or simultaneously to stow or deploy slit-tube longerons. A wedge is crescent shaped, with a height that increases along an outer perimeter as the arc of the crescent is traversed from a first end to a second end. The changing height of the wedge allows a slit-tube longeron to be flattened for stowage or can be disengaged to allow the tube to curl up for deployment.

Abstract: An assembly that includes a wedge and mandrel that share an axis of rotation and can be rotated independently or simultaneously to stow or deploy slit-tube longerons. A wedge is crescent shaped, with a height that increases along an outer perimeter as the arc of the crescent is traversed from a first end to a second end. The changing height of the wedge allows a slit-tube longeron to be flattened for stowage or can be disengaged to allow the tube to curl up for deployment.

Abstract: Embodiments of the invention are directed toward rollable and collapsible structures. These structures, for example, can include a plurality of tubular longerons with a slit or gap that extends along the longitudinal length of the longerons. Such longerons can be combined in an arrangement that creates a structure. The structure can be collapsed and the longerons rolled either singularly or as a group into a stowed configuration.