Patent application number | Description | Published |
20080244041 | METHODS, SYSTEMS, AND COMPUTER PROGRAM PRODUCTS FOR AUTOMATICALLY GENERATING BEST PRACTICES FOR CONFIGURING A NETWORKED SYSTEM - A method, system, and computer program product for automatically generating best practices for configuring a networked system of entities are provided. The method includes identifying a networked system configuration problem and determining a set of problematic entities. The set of problematic entities includes the entities reporting the networked system configuration problem. The method further includes determining a set of problem associated entities, where the set of problem associated entities includes the entities with a common association having a strongest correlation to the set of problematic entities. The method additionally includes classifying the set of problem associated entities on an attribute basis to determine one or more attributes of the entities that contribute to the networked system configuration problem, and reporting the best practices for configuring the networked system of entities as avoiding the one or more attributes of the entities that contribute to the networked system configuration problem. | 10-02-2008 |
20090043822 | SYSTEM AND METHOD FOR INTELLIGENT STORAGE MIGRATION - The present invention relates to a methodology and computer program product for data storage migration that comprises monitoring a plurality of entities that comprise a storage area network for a predetermined set of information gathering cycles, constructing a resource graph that is representative of the entities that are comprised within the storage area network, and analyzing the resource graph. Further comprised are the determining of a data storage source and a data storage target for the migration of data stored at the data storage source, determining a time period and an execution point for the migration of the stored data, determining a data migration schedule, migrating the stored data according to the determined data migration schedule, and monitoring the data migration operation until the completion of the data migration operation. | 02-12-2009 |
20090094419 | VARYING ACCESS PARAMETERS FOR PROCESSES TO ACCESS MEMORY ADDRESSES IN RESPONSE TO DETECTING A CONDITION RELATED TO A PATTERN OF PROCESSES ACCESS TO MEMORY ADDRESSES - Provided are a method, system, and article of manufacture for varying access parameters for processes to access memory addresses in response to detecting a condition related to a pattern of processes access to memory addresses. A monitored condition is detected during application execution. An instrumentation program is invoked to monitor processes accessing data at addresses in a memory device in response to detecting the monitored condition. Information is logged on processes and the addresses they access in the memory device in response to invoking the instrumentation program. The logged information on the processes and the addresses they access is forwarded to an application analysis system in response to detecting a monitored condition during application execution. | 04-09-2009 |
20090094431 | MONITORING PATTERNS OF PROCESSES ACCESSING ADDRESSES IN A STORAGE DEVICE TO DETERMINE ACCESS PARAMETERS TO APPLY - Provided are a method, system, and article of manufacture for monitoring patterns of processes accessing addresses in a storage device to determine access parameters to apply. Processes accessing addresses of data in a storage device are monitored. The processes are granted access to the addresses according to first access parameters that indicate how to arbitrate access by processes to the addresses. A condition occurring in response to a pattern of processes accessing addresses is detected. A determination is made of one of the processes in the pattern and the address accessed by the determined process. Indication is made that second access parameters apply for the determined address. The second access parameters are used to grant access to the determined address for subsequent accesses of the indicated address. | 04-09-2009 |
20090187518 | AUTOMATICALLY IDENTIFYING AN OPTIMAL SET OF ATTRIBUTES TO FACILITATE GENERATING BEST PRACTICES FOR CONFIGURING A NETWORKED SYSTEM - A method and system for automatically identifying an optimal set of attributes of entities included in a networked system. Entity types are ranked based on information gain. A first classification accuracy relative to a first entity type is determined. The first entity type is the top-ranked entity type or a first aggregate entity type. A second entity type is selected base on the ranking. A database join of a first set of attributes associated with the first entity type and a second set of attributes associated with the second entity type is performed. A second classification accuracy relative to a second aggregate entity type generated by the join is determined. In response to determining that the second classification accuracy is not greater than the first classification accuracy, an optimal set of attributes contributing to a problem in the networked system is identified as the first set of attributes. | 07-23-2009 |
20090187533 | AUTOMATICALLY IDENTIFYING AN OPTIMAL SET OF ATTRIBUTES TO FACILITATE GENERATING BEST PRACTICES FOR CONFIGURING A NETWORKED SYSTEM - A method and system for automatically identifying an optimal set of attributes of entities included in a networked system. Entity types are ranked based on information gain. A first classification accuracy relative to a first entity type is determined. The first entity type is the top-ranked entity type or a first aggregate entity type. A second entity type is selected basal on the ranking. A database join of a first set of attributes associated with the first entity type and a second set of attributes associated with the second entity type is performed. A second classification accuracy relative to a second aggregate entity type generated by the join is determined. In response to determining that the second classification accuracy is not greater than the first classification accuracy, an optimal set of attributes contributing to a problem in the networked system is identified as the first set of attributes. | 07-23-2009 |
20090204759 | ON-LINE VOLUME COALESCE OPERATION TO ENABLE ON-LINE STORAGE SUBSYSTEM VOLUME CONSOLIDATION - A mechanism to permit consolidation of storage subsystem volumes into larger, more easily managed volumes and an operating system device driver which includes a trap mechanism for intercepting calls from a host into logical unit devices that were previously consolidated into a single physical volume. A map converts such calls to a logical unit device into a corresponding offset in the single physical volume. A driver accesses the single physical volume with corresponding offsets to transfer data associated with a particular logical unit device. So, logical unit devices can be consolidated and reconsolidated to single physical volumes and other physical volumes without requiring changes to the operating system or its application software and without requiring application or host downtime. | 08-13-2009 |
20090210455 | CONTINUOUSLY AVAILABLE PROGRAM REPLICAS - A method for replicating a program and data storage according to one embodiment comprises sending program replication data from a first program to a second program, the second program having an application program that is a replica of an application program of the first program; sending data storage requests from the first program to a first storage system; and replicating data stored in the first storage system in a second storage system. Additional methods, systems, and computer program products are disclosed. | 08-20-2009 |
20100251252 | POLICY MANAGEMENT FRAMEWORK IN MANAGED SYSTEMS ENVIRONMENT - A method, system, and computer program product for implementing policies in a managed systems environment is provided. A plurality of the heterogeneous entities is organized into a system resource group (SRG). Each of the plurality of heterogeneous entities is visible to an application operable on the managed systems environment. The system resource group is subject to at least one membership requirement, defines a relationship between at least two of the heterogeneous entities, contains at least one policy defining an operation as to be performed on the system resource group for a domain of the managed systems environment, and defines at least a portion of a policy framework between the system resource group and an additional system resource group organized from an additional plurality of the heterogeneous entities. The system resource group expands according to an action performed incorporating the relationship, policy, or policy framework. | 09-30-2010 |
20100325500 | Detecting and Recovering from Silent Data Errors in Application Cloning Systems - A method, system, and article for resolving a silent error is disclosed. A primary program copy runs on a primary host, and a secondary program copy runs on a secondary host. The primary and secondary copies communicate to maintain synchronized execution. A third copy of the data is stored on a storage device as a write operations log and maintained in memory on the primary host while the program is running. The primary copy is synchronized with the secondary copy by computing a first checksum of data on the primary host in response to a read operation local to the primary host, computing a second checksum of data on the secondary host in response to a read operation local to the secondary host, and periodically communicating the first checksum to the secondary host, and resolving any discrepancies between the first and second checksum of data reflecting a silent data error. | 12-23-2010 |
20110099360 | Addressing Node Failure During A Hyperswap Operation - A method, system, and article are provided to enable a Hyperswap operation in a clustered computer system. Each node in the system is configured with flash memory, with a hierarchical list of boot volumes therein. Following a Hyperswap operation, the current boot volume is communicated to each node in the cluster and each node joining the cluster. All previously inactive nodes that were booted from the improper boot volume are re-booted from the correct and the flash memory is amended to reflect the correct boot volume. | 04-28-2011 |
20110258378 | Optimizing a File System for Different Types of Applications in a Compute Cluster Using Dynamic Block Size Granularity - Embodiments of the invention relate to optimizing a file system for different types of applications in a compute cluster using dynamic block size granularity. An exemplary embodiment includes reserving a predetermined number of storage allocation regions for each node in a cluster, wherein each storage allocation region comprises a set of contiguous data blocks on a single storage disk of locally attached storage; using a contiguous set of data blocks on a single storage disk of locally attached storage as a file system's block allocation granularity for striping data to be stored in the file system for a compute operation in the cluster; and using a single data block of a shared storage subsystem as the file system's block allocation granularity for striping data to be stored in the file system for a data access operation in the cluster. | 10-20-2011 |
20120005467 | Streaming Virtual Machine Boot Services Over a Network - Embodiments of the invention are directed to streaming virtual machine boot services over a network. An aspect of the invention includes booting a first virtual machine and recording data and metadata from a virtual machine boot image into a virtual machine boot file. The data and metadata are accessed in the process of booting the first virtual machine. The virtual machine boot image has setup information of the virtual machine type of the first virtual machine. The virtual machine boot file is configured for the virtual machine type of the first virtual machine. A descriptor is added to metadata of the virtual machine boot image, which references a location of the virtual machine boot file for the virtual machine type of the first virtual machine. When subsequently booting a second virtual machine of the same type of virtual machine as the first virtual machine, data are streamed from the virtual machine boot file to a virtual machine monitor of a second virtual machine without the need to stream data from the virtual machine boot image. | 01-05-2012 |
20120042033 | MIGRATING VIRTUAL MACHINES ACROSS NETWORK SEPARATED DATA CENTERS - Embodiments of the present invention provide an approach for migrating virtual machines across network (e.g., WAN) separated data centers (e.g., storage clouds). Specifically, under embodiments of the present invention, a first storage system associated with a first data center is synchronized with a second storage system associated with a second data center via a storage system link. Then, a minimal state of a virtual machine is migrated from a first computer in the first data center to a second computer in the second data center via a WAN link. Using the minimal state, the virtual machine is stored in the second computer. Thereafter, the storage system link is terminated. In addition, as updated pages are received in memory of the first computer, they are migrated to the second computer via the WAN link. Once this migration is complete, the WAN link can be terminated. Therefore, embodiments of the present invention provide at least two forms of synchronization: computational synchronization and storage synchronization. | 02-16-2012 |
20120047394 | HIGH-AVAILABILITY COMPUTER CLUSTER WITH FAILOVER SUPPORT BASED ON A RESOURCE MAP - Embodiments of the invention relate to handling failures in a cluster of computer resources. The resources are represented as nodes in a dependency graph in which some nodes are articulation points and the removal of any articulation point due to a resource failure results in a disconnected graph. The embodiments perform a failover when a resource corresponding to an articulation point fails. The failover is to a local resource if the failed resource does not affect all local resources. The failover is to a remote resource if no local resource can meet all resource requirements of the failed resource, and to a remote resource running in a degraded mode if the remote resource cannot meet all of the requirements. | 02-23-2012 |
20120137094 | SNAPSHOT BASED REPLICATION - Embodiments of the invention relate to data replication and block allocation in a file system to support write transactions. Regions in a cluster file system are defined to support a block allocation. Blocks in the defined regions are allocated to support the data replication. A pipeline manager is provided to schedule population of the blocks in the allocated region(s) based upon network characteristics. | 05-31-2012 |
20120198269 | METHOD AND APPARATUS FOR APPLICATION RECOVERY IN A FILE SYSTEM - Embodiments of the invention relate to block layout and block allocation in a file system to support transparency of application processing. At least one copy of an application is replicated in a write affinity region of a secondary server, and at least one copy of the application is replicated in a wide striping region across a cluster file system. When the application is subject to failure, application processing is transferred from the failure location to the write affinity copy. At the same time, the failed application is rebuilt using the wide striping replication of the application. Once the application is rebuilt, processing may return to the failed location employing the rebuilt application. | 08-02-2012 |
20120221516 | CONTINUOUSLY AVAILABLE PROGRAM REPLICAS - A method for replicating a program and data storage according to one embodiment comprises sending program replication data from a first program to a second program, the second program having an application program that is a replica of an application program of the first program; sending data storage requests from the first program to a first storage system; and replicating data stored in the first storage system in a second storage system. Additional methods, systems, and computer program products are disclosed. | 08-30-2012 |
20120254131 | VIRTUAL MACHINE IMAGE CO-MIGRATION - Embodiments of the invention relate to co-migration in a shared pool of resources with similarity across data sets of a migrating application. The data sets are processed and profiled. Metadata is reviewed to remove duplicate elements and to distribute the processing load across available nodes. At the same time, a ranking may be assigned to select metadata to support a prioritized migration. Non-duplicate data chunks are migrated across the shared pool of resources responsive to the assigned prioritization. | 10-04-2012 |
20120284472 | SNAPSHOT BASED REPLICATION - Embodiments of the invention relate to data replication and block allocation in a file system to support write transactions. Regions in a cluster file system are defined to support a block allocation. Blocks in the defined regions are allocated to support the data replication. A pipeline manager is provided to schedule population of the blocks in the allocated region(s) based upon network characteristics. | 11-08-2012 |
20120284558 | APPLICATION RECOVERY IN A FILE SYSTEM - Embodiments of the invention relate to block layout and block allocation in a file system to support transparency of application processing. At least one copy of an application is replicated in a write affinity region of a secondary server, and at least one copy of the application is replicated in a wide striping region across a cluster file system. When the application is subject to failure, application processing is transferred from the failure location to the write affinity copy. At the same time, the failed application is rebuilt using the wide striping replication of the application. Once the application is rebuilt, processing may return to the failed location employing the rebuilt application. | 11-08-2012 |
20130067472 | ORGANIZATION OF HETEROGENEOUS ENTITIES INTO SYSTEM RESOURCE GROUPS FOR DEFINING POLICY MANAGEMENT FRAMEWORK IN VIRTUAL CLUSTER MANAGED SYSTEMS ENVIRONMENT - Policies are implemented in a virtual cluster managed systems. Heterogeneous entities are organized into system resource group (SRG) hosted on a virtual volume that is accessed via a virtual machine. Each of the heterogeneous entities is visible to an application operable on the virtual cluster managed systems environment. The system resource group is subject to at least one membership requirement, defines a relationship between at least two of the heterogeneous entities, contains at least one policy defining an operation as to be performed on the system resource group for a domain of the virtual cluster managed systems environment, and defines at least a portion of a policy framework between the system resource group and an additional system resource group organized from additional heterogeneous entities. The system resource group expands according to an action performed incorporating the relationship, policy, or policy framework. | 03-14-2013 |
20130290953 | EFFICIENT EXECUTION OF JOBS IN A SHARED POOL OF RESOURCES - Embodiments of the invention relate to a shared group of resource and efficient processing of one or more jobs in the share group of resources. Tools are provided in the shared group of resource to assess and organize a topology of the shared resources, including physical and virtual machines, as well as storage devices. The topology is stored in a known location and utilized for efficient assignment of one or more jobs responsive to the hierarchy. | 10-31-2013 |
20130290957 | EFFICIENT EXECUTION OF JOBS IN A SHARED POOL OF RESOURCES - Embodiments of the invention relate to a shared group of resource and efficient processing of one or more jobs in the share group of resources. Tools are provided in the shared group of resource to assess and organize a topology of the shared resources, including physical and virtual machines, as well as storage devices. The topology is stored in a known location and utilized for efficient assignment of one or more jobs responsive to the hierarchy. | 10-31-2013 |
20140122823 | GENERALIZED STORAGE ALLOCATION FOR MULTIPLE ARCHITECTURES - Embodiments of the invention relate to storage allocation in a storage system. One embodiment includes generating a request for storage space allocation in a particular storage device by a first node. An owner node associated with the particular storage device is determined by a first allocation client associated with the first node. The request is sent by the first allocation client to a second allocation client associated with the owner node. A storage device allocation region of the particular storage device is created, the allocation region comprising a height proportional to storage devices the owner node and the second allocation client are coupled with, and a width that is inversely proportional to a number of nodes sharing the particular storage device. | 05-01-2014 |
20140173199 | Enhancing Analytics Performance Using Distributed Multi-Tiering - Embodiments of the invention relate to cluster-centric tiered storage with a flexible tier definition to support performance of transactions. Object data is distributed in a multi-tiered shared-nothing cluster. Hierarchical tiers of data storage are assigned different roles within the hierarchy. The tiers are managed globally across the cluster and objects are placed in tiers according to a flexible tier definition. The probability of object access is computed for objects, and objects are moved to different tiers responsive to the computation to minimize system runtime. The location of an object is further optimized in response to an access request. | 06-19-2014 |
20140195488 | Intelligent Selection of Replication Node for File Data Blocks in GPFS-SNC - A mechanism is provided in a data processing system for replicating writing of a file with striping. The mechanism writes a file at an owner node within a plurality of nodes in a data processing system. The mechanism divides the file into a plurality of file chunks. The mechanism identifies at least one replication node within the plurality of nodes having a duplicate copy of a respective file chunk within the plurality of file chunks. The mechanism selects a plurality of replication nodes for the plurality of file chunks based on identification at least one replication node within the plurality of nodes having a duplicate copy of a respective file chunk and replicates the file at the plurality of replication nodes based on the selection of the plurality of replication nodes. | 07-10-2014 |
20140280154 | SCALABLE DATA TRANSFER IN AND OUT OF ANALYTICS CLUSTERS - Embodiments of the invention relate to analytics clusters and to efficiently supporting read and write requests in the cluster. In one aspect, one or more compute nodes within a region of the cluster are designated to support the request, and based upon the designation, the request is directly communicated between a requesting agent external to the cluster and the supporting compute node(s). The direct communication mitigates the functionality of the head node(s) supporting the compute node(s). | 09-18-2014 |
20140280435 | SCALABLE DATA TRANSFER IN AND OUT OF ANALYTICS CLUSTERS - Embodiments of the invention relate to analytics clusters, and to a network layer application to efficiently supporting read and write requests in the cluster. In one aspect, one or more compute nodes within a region of the cluster are designated to support the request, and based upon the designation, the request is directly communicated between a requesting agent external to the cluster and the supporting compute node(s) via a regional hardware element. The direct communication mitigates the functionality of the head node(s) supporting the compute node(s). | 09-18-2014 |
20140280444 | SCALABLE DATA TRANSFER IN AND OUT OF ANALYTICS CLUSTERS - Embodiments of the invention relate to analytics clusters, and to a network layer application to efficiently supporting read and write requests in the cluster. In one aspect, one or more compute nodes within a region of the cluster are designated to support the request, and based upon the designation, the request is directly communicated between a requesting agent external to the cluster and the supporting compute node(s) via a regional hardware element. The direct communication mitigates the functionality of the head node(s) supporting the compute node(s). | 09-18-2014 |
20140280667 | SCALABLE DATA TRANSFER IN AND OUT OF ANALYTICS CLUSTERS - Embodiments of the invention relate to analytics clusters and to efficiently supporting read and write requests in the cluster. In one aspect, one or more compute nodes within a region of the cluster are designated to support the request, and based upon the designation, the request is directly communicated between a requesting agent external to the cluster and the supporting compute node(s). The direct communication mitigates the functionality of the head node(s) supporting the compute node(s). | 09-18-2014 |
20140359050 | MODULAR ARCHITECTURE FOR EXTREME-SCALE DISTRIBUTED PROCESSING APPLICATIONS - Embodiments of the present invention relate to a new data center architecture that provides for efficient processing in distributed analytics applications. In one embodiment, a distributed processing node is provided. The node comprises a plurality of subnodes. Each subnode includes at least one processor core operatively connected to a memory. A first interconnect operatively connects each of the plurality of subnodes within the node. A second interconnect operably connects each of the plurality of subnodes to a storage. A process runs on a first of the plurality of subnodes, the process being operative to retrieve data from the memory of the first subnode. The process interrogates the memory of the first subnode for requested data. If the requested data is not found in the memory of the first subnode, the process interrogates the memory of at least one other subnode of the plurality of subnodes via the first interconnect. If the requested data is found in the memory of the other subnode, the process copies the requested data to the memory of the first subnode. If the requested data is not found in the memory of the first subnode or the memories of at least one subnode of the plurality of subnodes, the process interrogates the storage via the second interconnect. | 12-04-2014 |