Abstract: A virtual machine of an information handling system (IHS) initializes an operating system to provide partition file system memory management during application execution. The operating system employs multiple partitions that include one or more applications for execution within the virtual machine. A file system tool identifies write operations to a global file system and generates local and common file system information. The file system tool populates the local file systems that include delta local file systems and differential file systems with write operation data. The file system tool may generate stackable common delta file system information to store write operation data common to two or more partitions that employ executing applications. The file system tool may combine or separate stackable common delta file system information to provide improvements in virtual machine memory utilization.

Abstract: Data pertaining to interactions between a plurality of customers is obtained. A graph is formed, having a plurality of nodes representing the customers and a plurality of edges representing interactions between the customers. A sub-set of the customers are denoted as previously churned customers. A spreading activation model is applied to the graph to identify, based on the graph and the previously churned customers, the potential churning customers.

Abstract: A device and method for efficient hoarding content set on a mobile client prior to disconnection of the mobile client from a network. The content set to be hoarded on the mobile client and a respective schedule for hoarding the content set on the mobile client are dynamically computed by considering various real times factors such as file utilities, device capabilities and network connectivity that affect the performance of the mobile client and the hoarding process.

Abstract: Techniques for placing at least one composite application in a federated environment are provided. The techniques include analyzing a composite application to be deployed in a federated environment, obtaining one or more application artifacts, analyzing feasibility of placing one or more application components at one or more clusters in the federated environment without knowledge of resource availability at each of the one or more clusters, and generating a mapping of the one or more application components to the one or more clusters such that an application requirement is met, wherein the one or more application artifacts are distributed across a federated environment.

Abstract: Techniques are disclosed for providing mapping of application components to a set of resources in a distributed environment using capacity driven provisioning using a layered approach. By way of example, a method for allocating resources to an application comprises the following steps. A first data structure is obtained representing a post order traversal of a dependency graph for the application and associated containers with capacity requirements. A second data structure is obtained representing a set of resources, and associated with each resource is a tuple representing available capacity. A mapping of the dependency graph data structure to the resource set is generated based on the available capacity such that resources of the set of resources are allocated to the application.

Abstract: Techniques for placing at least one composite application in a federated environment are provided. The techniques include analyzing a composite application to be deployed in a federated environment, obtaining one or more application artifacts, analyzing feasibility of placing one or more application components at one or more clusters in the federated environment without knowledge of resource availability at each of the one or more clusters, and generating a mapping of the one or more application components to the one or more clusters such that an application requirement is met, wherein the one or more application artifacts are distributed across a federated environment.

Abstract: Techniques for executing a batch of one or more workflows on one or more domains are provided. The techniques include receiving a request for workflow execution, sending at least one of one or more individual jobs in each workflow and dependency information to a scheduler, computing, by the scheduler, one or more outputs, wherein the one or more outputs are based on one or more performance objectives, and integrating orchestration of one or more workflows and scheduling of at least one of one or more jobs and one or more data transfers, wherein the integrating is used to execute a batch of one or more workflows based on at least one of one or more outputs of the scheduler, static information and run-time information.

Abstract: Data pertaining to interactions between a plurality of customers is obtained. A graph is formed, having a plurality of nodes representing the customers and a plurality of edges representing interactions between the customers. A sub-set of the customers are denoted as previously churned customers. A spreading activation model is applied to the graph to identify, based on the graph and the previously churned customers, the potential churning customers.

Abstract: Data pertaining to interactions between a plurality of customers is obtained. A graph is formed, having a plurality of nodes representing the customers and a plurality of edges representing interactions between the customers. A sub-set of the customers are denoted as previously churned customers. A spreading activation model is applied to the graph to identify, based on the graph and the previously churned customers, the potential churning customers.

Abstract: A device and method for efficient hoarding content set on a mobile client prior to disconnection of the mobile client from a network. The content set to be hoarded on the mobile client and a respective schedule for hoarding the content set on the mobile client are dynamically computed by considering various real times factors such as file utilities, device capabilities and network connectivity that affect the performance of the mobile client and the hoarding process.

Abstract: Scheduling of job execution, data transfers, and data replications in a distributed grid topology are integrated. Requests for job execution for a batch of jobs are received, along with a set of job requirements. The set of job requirements includes data objects needed for executing the jobs, computing resources needed for executing the jobs, and quality of service expectations. Execution sites are identified within the grid for executing the jobs based on the job requirements. Data transfers needed for providing the data objects for executing the batch of jobs are determined, and data for replication is identified. A set of end-points is identified in the distributed grid topology for use in data replication and data transfers. A schedule is generated for data transfer, data replication and job execution in the grid in accordance with global objectives.

Abstract: A device and method for efficient hoarding content set on a mobile client prior to disconnection of the mobile client from a network. The content set to be hoarded on the mobile client and a respective schedule for hoarding the content set on the mobile client are dynamically computed by considering various real times factors such as file utilities, device capabilities and network connectivity that affect the performance of the mobile client and the hoarding process.