Abstract: A method includes flushing a write transaction based on byte-ranges within a file system block. It is determined if the write transaction is a first write transaction to the file system block and whether to flush the received write transaction to a recovery log. If it is determined to flush the write transaction to the recovery log and the received write transaction is the first write transaction: the data associated with the write transaction is appended in the recovery log and byte-ranges remaining in the file system block are recorded, and also recording an associated particular bit value or particular bit pattern that the remaining byte-ranges must be set to before the remaining byte-ranges are accessed or when a recovery sequence for recovering data in the recovery log executes due to failure. The write transaction is replicated. The entire file system block byte-range is marked as committed.

Abstract: A computer-implemented method according to one embodiment includes identifying an overhead associated with a tracing of a system, comparing the overhead to a predetermined threshold, and adjusting a number of trace points currently enabled within the system, based on the comparing.

Abstract: A system facilitates access to data in a network and includes a cache that stores instructions. A processor executes the instructions including: caching processing configured to integrate caching into a local cluster file system, and cache local file data in the cache based on fetching file data on demand from a remote cluster file system. The cache is visible to file system clients as a Portable Operating System Interface (POSIX) compliant file system. Applications execute on a multi-node cache cluster using POSIX semantics via a POSIX compliant file system interface. Data cache is locally and remotely consistent for updates.

Abstract: Embodiments relate to a computer system, computer program product, and method to process complex files, and specifically, to support read and write requests of a multi-object file. Upon receipt of a file, a computer system parses the file into two or more logical objects. Each logical object has an associated or inherent characteristic. Each of the logical objects is matched to a storage tier in a multi-tier storage array. Each logical object is then assigned to a tier based on one or more object characteristics in the matched storage tier, and stored in a decomposed format. In addition, an identification of each logical object, and the object assignment, is recorded in an index.

Abstract: Various embodiments providing a framework for Quality of Service (QoS) within and between globally distributed computing components by a processor. At least one resource required for a computing process is estimated by examining information associated with a resource template. A storlet is allocated as the at least one resource at a storage node, thereby offloading computing elements to at least one storage unit. The allocated storlet performs the computing process according to constraints delineated by the resource template.

Abstract: Embodiments of the invention relate to small write performance enhancements for parallel file systems. One embodiment includes flushing a received write transaction from a first memory device to a second memory device on a node in a file system based on one or more byte-ranges within a file system block. It is determined to flush the received write transaction to a recovery log that is stored in a non-volatile storage layer of the file system. If it is determined to flush the received write transaction to the recovery log: appending data associated with the received write transaction in the recovery log of the file system, replicating the data associated with the received write transaction in another non-volatile storage layer of another node if required, and marking the one or more byte-ranges as committed.

Abstract: In one embodiment, a method includes determining each gateway (GW) node in a clustered file system eligible to process read tasks and constructing a GW node list of all eligible GW nodes, determining a home node that corresponds to each GW node in the list, creating individual home node GW lists for each home node, with each home node GW list including a set of GW nodes which share a same home node, determining a peer GW eligibility value for each GW node, determining a GW node having a highest eligibility value for each home node, removing all other GW nodes which do not have the highest eligibility value for each home node from the list, assigning and defining a size for read task items for each GW node in the list, and distributing workload to each GW node in the list according to sizes of the read task items.

Abstract: A system facilitates access to data in a network. One implementations includes a caching layer function that is configured to integrate into a local cluster file system, to cache local file data in a cache based on fetching file data on demand from a remote cluster file system, and to operate on a multi-node cache cluster. The cache is visible to file system clients as a Portable Operating System Interface (POSIX) compliant file system, applications execute on the multi-node cache cluster using POSIX semantics via a POSIX compliant file system interface, and data cache is locally consistent for updates made at the multi-node cache cluster using distributed locking for the data cache.

Abstract: An approach for managing and optimizing available resources utilized in a networked computing environment (e.g., a cloud computing environment) is provided. In one aspect, a plurality of resources in a plurality of storage pools within the networked computing environment are monitored. Each storage pool is running at least one application workload using a corresponding subset of the plurality of resources. The storage pools are ranked based on the application workloads. In response to an over-utilized storage pool and/or an under-utilized storage pool, the plurality of resources are dynamically reconfigured.

Abstract: A processor may identify a first directory in the UFO storage system. The first directory may include one or more subdirectories in one or more levels under the first directory. The one or more subdirectories may include a second directory that has includes one or more objects. The first directory may be associated with a first inode, and the second directory may be associated with a second inode. The processor may perform a stat call on the second directory to determine metadata attributes for the one or more objects that are stored in the second directory. The metadata attributes for the one or more objects may be stored in the second inode. The processor may add the metadata attributes for the one or more objects to the first inode.

Abstract: A method and associated systems for efficient management of cloned data. One or more processors create a “child” clone of a “parent” software image. The child and parent contain identical information organized into identical sets of file blocks. To conserve storage, each child block initially points to a physical storage location already in use by a corresponding parent block, rather than requiring additional storage of its own. The first time a child block is updated, however, it will require additional physical storage. At the time of the child's creation, the processors reserve a number of physical blocks sufficient to store the contents of all child file blocks likely to be updated. A child file block is identified as likely to be updated by analyzing past volatility of a corresponding file block of the parent or of corresponding file blocks of other children of the same parent.

Abstract: In one general embodiment, a computer program product for sharing a data management policy with a load balancer comprises a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se. Additionally, the program instructions are executable by a processor to cause the processor to perform a method comprising analyzing, by the processor, a plurality of data management factors within an object-based storage system, determining, by the processor, a data management policy for predetermined data within the object-based storage system, based on the analyzing, and sharing, by the processor, the data management policy for the predetermined data with a load balancer associated with the object-based storage system.

Abstract: For autonomous data evacuation, a compartment is motivated by a propulsion device. A navigation module guides the compartment to a disaster recovery target using the propulsion device in response to an evacuation signal. At least a portion of the navigation module comprises one or more of hardware and executable code, the executable code stored on one or more computer readable storage media.

Abstract: Embodiments of the invention relate to supporting coordinated access to a clustered file system's shared disk storage subsystem by using dynamic creation of file access layout for different workloads and access patterns. Active file servers in the cluster have equivalent access to shared data of said file system. In one embodiment, a particular file server in the cluster is configured to coordinate the file system's layout. The particular file server, in response to a particular client's request for a layout of a file stored by said file system in said subsystem determines a file access layout for a parallel file access protocol to use when servicing an I/O request by said client, marks said layout as active for the client, and sends the layout to the client. The file access layout is determined based on one or more of current file system resources, a specific workload type and a specific byte-range of the file included in the client request, and properties of the file.

Abstract: In one general embodiment, a computer-implemented method includes creating multiple pools of micro services. Each of the pools includes a specific configuration set and resource properties. Also, the computer-implemented method includes receiving incoming workloads. Moreover, the computer-implemented method includes, for each of the incoming workloads, dynamically mapping the incoming workload, based on characteristics of the incoming workload, to an access path traversing a combination of a subset of the pools of micro services.

Abstract: A method and associated systems for efficient management of cloned data. One or more processors create a “child” clone of a “parent” software image. The child and parent contain identical information organized into identical sets of file blocks. To conserve storage, each child block initially points to a physical storage location already in use by a corresponding parent block, rather than requiring additional storage of its own. The first time a child block is updated, however, it will require additional physical storage. At the time of the child's creation, the processors reserve a number of physical blocks sufficient to store the contents of all child file blocks likely to be updated. A child file block is identified as likely to be updated by analyzing past volatility of a corresponding file block of the parent or of corresponding file blocks of other children of the same parent.

Abstract: A computer-implemented method is provided in one general embodiment for concurrent file and object protocol access. The method includes receiving a notification that indicates storage of an object by an object-based client, and creating a clone of the object. Also, the method includes providing a file-based client access to the clone of the object. Further, the method includes, after the file-based client has finished modifying the clone of the object, replacing the object with an updated object based on the modified clone of the object. The file-based client is provided access to the modified clone of the updated object. After the file-based client has finished modifying the modified clone of the updated object, the updated object is replaced with an additional object based on the modification to the modified clone of the updated object.

Abstract: In one embodiment, a method includes determining each gateway (GW) node in a clustered file system eligible to process read tasks and constructing a GW node list of all eligible GW nodes, determining a home node that corresponds to each GW node in the list, creating individual home node GW lists for each home node, with each home node GW list including a set of GW nodes which share a same home node, determining a peer GW eligibility value for each GW node, determining a GW node having a highest eligibility value for each home node, removing all other GW nodes which do not have the highest eligibility value for each home node from the list, assigning and defining a size for read task items for each GW node in the list, and distributing workload to each GW node in the list according to sizes of the read task items.

Abstract: In one general embodiment, a computer-implemented method is provided. The computer-implemented method includes identifying a first object in a tiered storage system, and identifying first metadata associated with the first object. The computer-implemented method also includes identifying a second object utilizing the first metadata of the first object. The second object is associated with second metadata. Moreover, the computer-implemented method includes, in response to an access of the first object, modifying a heat value associated with the second object.

Abstract: Embodiments relate to management of hybrid workloads, including serial and parallel workload optimizations, in a shared pool of configurable computer resources. Resource utilization in the shared pool is dynamically tracked, and employed for assessing a set of servers a parallel access protocol should utilize for one or more I/O requests in conjunction with any serial workload optimizations. Accordingly, the load balancing embodies a diverse set of workloads to support dynamic and equitable allocation.