|Publication number||US20020198996 A1|
|Application number||US 09/997,404|
|Publication date||Dec 26, 2002|
|Filing date||Nov 29, 2001|
|Priority date||Mar 16, 2000|
|Also published as||US8769132, US20110214007, US20140281675|
|Publication number||09997404, 997404, US 2002/0198996 A1, US 2002/198996 A1, US 20020198996 A1, US 20020198996A1, US 2002198996 A1, US 2002198996A1, US-A1-20020198996, US-A1-2002198996, US2002/0198996A1, US2002/198996A1, US20020198996 A1, US20020198996A1, US2002198996 A1, US2002198996A1|
|Inventors||Padmanabhan Sreenivasan, Ajit Dandapani, Michael Nishimoto, Ira Pramanick, Manish Verma, Robert Bradshaw, Luca Castellano, Raghu Mallena|
|Original Assignee||Padmanabhan Sreenivasan, Ajit Dandapani, Michael Nishimoto, Ira Pramanick, Manish Verma, Bradshaw Robert David, Luca Castellano, Raghu Mallena|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (5), Referenced by (37), Classifications (5), Legal Events (7)|
|External Links: USPTO, USPTO Assignment, Espacenet|
 This application claims the benefit of U.S. Provisional Application No. 60/189,864, entitled “HIGH AVAILABILITY COMPUTING SYSTEM AND METHOD” and filed Mar. 16, 2000, and is related to cofiled, copending and coassigned U.S. patent application Ser. No. ______ entitled “MAINTAINING MEMBERSHIP IN HIGH AVAILABILITY COMPUTING SYSTEMS”, both of which are hereby incorporated herein by reference.
 The present invention is related to computer processing, and more particularly to providing flexible failover policies on high availability computer processing systems.
 A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever. The following notice applies to the software and data as described below and in the drawings hereto: Copyright © 2000, 2001 Silicon Graphics Incorporated, All Rights Reserved.
 Companies today rely on computers to drive all aspects of their business. Certain business functions can survive intermittent interruptions in service; others cannot.
 To date, attempts to ensure high availability to mission critical applications have relied on two approaches. Applications have been made more available either through the use of specialized fault tolerant hardware or through cumbersome changes to the applications or to the environment in which the applications run. These approaches increase the costs to the organization of running the applications. In addition, certain approaches to making applications more available increase the risk of introducing errors in the underlying data.
 Furthermore, these approaches
 What is needed is a system and method of increasing the availability of mission critical applications by providing greater failover flexibility in determining the targets for moving resources from a machine that has failed.
 To address the problems stated above, and to solve other problems that will become apparent in reading the specification and claims, a high availability computing system and method are described. The high availability computing system includes a plurality of servers connected by a first and a second network, wherein the servers communicate with each other to detect server failure and transfer applications to other servers on detecting server failure through a process referred to as “failover”.
 According to another aspect of the present invention, a system for implementing a failover policy includes a cluster infrastructure for managing a plurality of nodes, a high availability infrastructure for providing group and cluster membership services, and a high availability script execution component operative to receive a failover script and at least one failover attribute and operative to produce a failover domain.
 According to another aspect of the invention, a method for determining a target node for a failover comprises executing a failover script that produces a failover domain, the failover domain having an ordered list of nodes, receiving a failover attribute and based on the failover attribute and failover domain, selecting a node upon which to locate a resource.
FIG. 1A shows a diagram of the hardware and operating environment in conjunction with which embodiments of the invention may be practiced;
FIG. 1B is a diagram illustrating an exemplary node configuration according to embodiments of the invention; and
FIG. 2 is a flowchart illustrating a method for providing failover policies according to an embodiment of the invention;
 In the following detailed description, reference is made to the accompanying drawings which form a part hereof, and in which is shown by way of illustration specific embodiments in which the invention may be practiced. It is to be understood that other embodiments may be utilized and structural changes may be made without departing from the scope of the present invention.
 Some portions of the detailed descriptions which follow are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the ways used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like. It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussions, it is appreciated that throughout the present invention, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar computing device, that manipulates and transforms data represented as physical (e.g., electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
 A number of computing terms will be used throughout this specification. In this specification, a cluster node is a single computer system. Usually, a cluster node is an individual computer. The term node is also used for brevity. When one node fails, other nodes are left intact and able to operate.
 A pool is the entire set of nodes involved with a group of clusters. The group of clusters are usually close together and should always serve a common purpose. A replicated database is stored on each node in the pool.
 A cluster is a collection of one or more nodes coupled to each other by networks or other similar interconnections. A cluster is identified by a simple name; this name must be unique within the pool. A particular node may be a member of only one cluster. All nodes in a cluster are also in the pool: however, all nodes in the pool are not necessarily in the cluster.
 A node membership is the list of nodes in a cluster on which High Availability base software can allocate resource groups.
 A process membership is the list of process instances in a cluster that form a process group. There can be multiple process groups per node.
 A client-server environment is one in which a set of users operate on a set of client systems connected through a network to a set of server systems. Often, applications within a client-server system are divided into two components: a client component and a server component. Each component can run on the same of different nodes. A process running the client component of the application is called a client; a process running the server component is called a server.
 Clients send requests to servers and collect responses from them. Not all servers can satisfy all requests. For instance, a class of Oracle database servers might be able to satisfy requests regarding the employees of a company, while another class might be able to satisfy requests regarding the company's products.
 Servers that are able to satisfy the same type of requests are said to be providing the same service. The time interval between the event of posting a request and the event of receiving a response is called latency.
 Service availability can be defined by the following example. Consider a web service implemented by a set of web servers running on a single system. Assume that the system suffers an operating system failure. After the system is rebooted, the web servers are restarted and clients can connect again. A failure of the servers therefore appears to clients like a long latency.
 A service is said to be unavailable to a client when latencies become greater than a certain threshold, called critical latency. Otherwise, it is available. A service is down when it is unavailable to all clients; otherwise, it is up. An outage occurs when a service goes down. The outage lasts until the service comes up again.
 If downtime is the sum of the durations of outages over a certain time interval D=[t, t′], for a certain service S, service availability can be defined as:
 where t′-t is a large time interval, generally a year. For instance, a service which is available 99.99% should have an yearly downtime of about an hour. A service that is available 99.99% or higher is generally called highly available.
 Service outages occur for two reasons: maintenance (e.g. hardware and software upgrades) and failures (e.g. hardware failures, OS crashes).
 Outages due to maintenance are generally considered less severe. They can be scheduled when clients are less active, for instance, during a weekend. Users can get early notification. Downtime due to maintenance is often called scheduled downtime. On the other hand, failures tend to occur when the servers are working under heavy load, i.e. when most clients are connected. Downtime due to failures is often called unscheduled downtime. Some time service availability is measured considering only unscheduled downtime.
 Vendors often provide figures for system availability. System availability is computed similarly to service availability. The downtime is obtained by multiplying the average number of system failures (OS crashes, HW failures, . . . ) by the average repair time.
 Consider a service whose servers are distributed on a set of N (where N>1) nodes in a cluster. For the service to be unavailable, all of the N nodes must fail at the same time. Since most of system failures are statistically independent, the probability of such an event is pN, where p is the probability of a failure of a single system. For example, given a cluster of 2 nodes with availability of 99.7% for each node, at any given time, there is a 0.3% or 0.003 probability that a node is unavailable. The probability of both nodes being unavailable at the same time is 0.003 2=0.000009 or 0.0009%. The cluster as a whole therefore has a system availability of 99.9991 % or (1−0.000009). System availability of a cluster is high enough to allow the deployment of highly available services.
 A resource is a single physical or logical entity that provides a service to clients or other resources. For example, a resource can be a single disk volume, a particular network address, or an application such as a web server. A resource is generally available for use over time on two or more nodes in a cluster, although it can be allocated to only one node at any given time.
 Resources are identified by a resource name and a resource type. One resource can be dependent on one or more other resources: If so, it will not be able to start (that is, be made available for use) unless the dependent resources are also started. Dependent resources must be part of the same resource group and are identified in a resource dependency list
 A resource name identifies a specific instance of a resource type. A resource name must be unique for a given resource type.
 A resource type is a particular class of resource. All of the resources in a particular resource type can be handled in the same way for the purposes of failover. Every resource is an instance of exactly one resource type.
 A resource type is identified by a simple name: this name must be unique within the cluster. A resource type can be defined for a specific node, or It. can be defined for an entire cluster. A resource type that is defined for a specific node overrides a cluster-wide resource type definition with the same name: this allows an-individual node to override global settings from a cluster-wide resource type definition.
 Like resources, a resource type can be dependent on one or more other resource types. If such a. dependency exists, at least one instance of each of the dependent resource types must be defined. For example, a resource type named Netscape_web might have resource type dependencies on resource types named IP_address and volume. If a resource named web is defined with the Netscape web resource type, then the resource group containing web must also contain at least one resource of the type IP_address and one resource of the type volume.
 In one embodiment, predefined resource types, are provided. However, a user can create additional resource types.
 A resource group is a collection of interdependent resources. A resource group is identified by a simple name: this name must be unique within a duster. Table 1 shows an example of the resources for a resource group named WebGroup.
TABLE 1 Resource Resource Type Vol1 volume /fs1 filesystem 188.8.131.52 IP_address web1 Netscape_web Oracle_DB Application
 In some embodiments, if any individual resource in a resource group becomes unavailable for its intended use, then the entire resource group is considered unavailable. In these embodiments, a resource group is the unit of failover for the High Availability base software.
 In some embodiments of the invention, resource groups cannot overlap: that is. two resource groups cannot contain the same resource.
 A resource dependency list is a list of resources upon which a resource depends. Each resource instance must have resource dependencies that satisfy its resource type dependencies before it can be added to a resource group.
 A resource type dependency list is a list of resource types upon which a resource type depends. For example, the filesystem resource type depends upon the volume resource type, and the Netscape web resource type depends upon the filesystem and IP_address resource types.
 For example, suppose a file system instance /fs1 is mounted on volume /vol1.
 Before /fs1 can be added to a resource group. /fs1 must be defined to depend on /vol1. the High Availability base software only knows that a file system instance must have one volume instance in its dependency list. This requirement is inferred from the resource type dependency list
 A failover is the process of allocating a resource group (or application) to another node, according to a failover policy A failover may be triggered by the failure of a resource, a change in the node membership (such as when a node fails or starts), or a manual request by the administrator.
 A failover policy is the method used by High Availability base software to determine the destination node of a failover. A failover policy consists of the following:
 Failover domain
 Fallover attributes
 Failover script
 The administrator can configure a failover policy for each resource group. A failover policy name must be unique within the pool.
 A failover domain is the ordered list of nodes on which a given resource group can be allocated. The nodes listed in the failover domain must be within the same cluster. However, the failover domain does not have to include every node in the cluster.
 The administrator defines the initial failover domain when creating a failover policy. This list is transformed into a run-time failover domain by the failover script.
 High Availability base software uses the run-time failover domain along with failover attributes and the node membership to determine the node on which a resource group should reside. High Availability base software stores the run-time failover domain and uses it as input to the next failover script invocation. Depending on the run-time conditions and contents of the failover script, the initial and run-time failover domains may be identical.
 In general, High Availability base software allocates a given resource group to the first node listed in the run-time failover domain that is also in the node membership: the point at which this allocation takes place is affected by the failover attributes.
 A failover attribute is a string that affects the allocation of a resource group in a cluster. The administrator must spec˜system attributes (such as Auto_Failback or Controlled_Failback). and can optionally supply site-specific attributes.
 A failover script is a shell script that generates a run-time failover domain and returns it to the High Availability base software process. The High Availability base software process applies the failover attributes and then selects the first node in the returned failover domain that is also in the current node membership.
 The action scripts are the set of scripts that determine how a resource is started, monitored, and stopped. Typically, there will be a set of action scripts specified for each resource type.
 The following is the complete set of action scripts that can be specified for each resource:
 probe, which verifies that the resource is configured on a server
 exclusive, which verifies that the resource is not already running
 start, which starts the resource
 stop, which stops the resource
 monitor, which monitors the resource
 restart, which restarts the resource on the same server after a monitoring failure occurs
 Highly Available (HA) services can be provided in two ways. First, a multi-server application using built-in or highly available services, can directly provide HA services. In the alternative, a single-server application layered on top of multi-server highly available system services can provide equivalent HA services. In other words, a single-server application may depend on a special application which uses the multi-server application discussed above.
FIG. 1A illustrates an exemplary environment for providing HA services. As shown, the environment 10 includes nodes 20, clients 24, and database 26, all communicably coupled by a network 22. Each of nodes 20.1-20.5 are computer systems comprising hardware and software and can provide services to clients 24. Thus nodes 20 can also be referred to as servers. Specifically, processes 26 comprise software that provides services to client 24. Moreover, each of nodes 20.1 can be suitably configured to provide high availability services according to the various embodiments of the invention.
FIG. 1B provides further detail of software layers according to an embodiment of the invention that can be run on nodes 20 to support HA services. As illustrated, software running on a node 20 includes cluster infrastructure 12, HA infrastructure 14, HA base software 16, application plug-ins 28, and processes 26.
 Cluster infrastructure 12 includes software components for performing the following:
 Node logging
 Cluster administration
 Node definition
 In one embodiment, the cluster software infrastructure includes clusteruster_admin and cluster_control subsystems.
 HA infrastructure 14 provides software components to define clusters, resources, and resource types. In one embodiment, the HA infrastructure includes the following:
 Cluster membership daemon. Provides the list of nodes, called node membership, available to the cluster.
 Group membership daemon. Provides group membership and reliable communication services In the presence of failures to HA base software 12 processes.
 Start daemon. Starts HA base software daemons and restarts them on failures.
 System resource manager daemon. Manages resources, resource groups and resource types. Executes action scripts for resources.
 Interface agent daemon. Monitors the local node's network Interfaces.
 Further details on the cluster infrastructure 12 and HA infrastructure 14 can be found in the cofiled, copending, coassigned U.S. patent application Ser. No. ______ entitled “MAINTAINING MEMBERSHIP IN HIGH AVAILABILITY COMPUTING SYSTEMS”, previously incorporated by reference.
 HA base software 16 provides end-to-end monitoring of services and client in order to determine whether resource load balancing or failover are required. In one embodiment, HA base software 16 is the IRIS FailSafe product available from Silicon Graphics, Inc. In this embodiment, HAbase software includes the software required to make the following high-availability services:
 IP addresses (the IP_address resource type)
 XLV logical volumes (the volume resource type)
 XFS file systems (the filesystem resource type)
 MAC addresses (the MAC_address resource type)
 In one embodiment of the invention, application plug-ins 28 comprise software components that provide an interface to convert applications such as processes 26 into high-availability services. For example, application plug-ins 26 can include database agents. Each database agent monitors all instances of one type of database. In one embodiment, database agents comprise the following:
 IRIS FailSafe Oracle
 IRIS FailSafe INFORMIX
 IRIS FailSafe Netscape Web
 IRIS FailSafe Mediabase
 Processes 26 include software applications that can be configured to provide services. It is not a requirement that any of processes 26 be intrinsically HA services. Application plug-ins 18, along with HA base software 16 can be used to turn processes 26 into HA services. In order for a plug-in to be used to turn a process 26 into an HA application, it is desirable that the process 26 have the following characteristics:
 The application can be easily restarted and monitored.
 It should be able to recover from failures as do most client/server software. The failure could be a hardware failure, an operating system failure, or an application failure. If a node crashed and reboots, client/server software should be able to attach again automatically.
 The application must have a start and stop procedure.
 When the resource group fails over, the resources that constitute the resource group are stopped on one node and started on another node, according to the failover script and action scripts.
 The application can be moved from one node to another after failures.
 If the resource has failed, it must still be possible to run the resource stop procedure. In addition, the resource must recover from the failed state when the resource start procedure is executed in another node.
 The application does not depend on knowing the host name: that is those resources that can be configured to work with an IP address.
 It should be noted that an application process 26 itself is not modified to make it into a high-availability service.
 In addition, node 20 can include a database (not shown). The database can be used to store information including:
 Resource types
 Resource groups
 Failover policies
 In one embodiment, a cluster administration daemon (cad) maintains identical databases on each node in the cluster.
 The previous section described an overview of a system for providing high availability services and failover policies for such services. This section will provide a description of a method 200 for providing failover policies for high availability services. The methods to be performed by the operating environment constitute computer programs made up of computer-executable instructions. Describing the methods by reference to a flowchart enables one skilled in the art to develop such programs including such instructions to carry out the methods on suitable computers (the processor of the computer executing the instructions from computer-readable media). The method illustrated in FIG. 2 is inclusive of the acts required to be taken by an operating environment executing an exemplary embodiment of the invention.
 The method 200 begins when a software component, such as HA base software 16 (FIG. 1A) executes a failover script for a resource in response to either a failover event such as a node or process failure, or a load balancing event such as a resource bottleneck or processor load (block 202). The failover script can be programmed in any of a number of languages, include Java, per, shell (Bourne, C-Shell, Korn shell etc.) or the C programming language. The invention is not limited to a particular programming language. In one embodiment of the invention, the following scripts can be executed:
 probe, which verifies that the resource is configured on a node
 exclusive, which verifies that the resource is not already running
 start, which starts the resource
 stop, which stops the resource
 monitor, which monitors the resource
 restart, which restarts the resource on the same node when a monitoring failure occurs
 It should be noted that in some embodiments, the start, stop, and exclusive scripts are required for every resource type. A monitor script s may also required, but if need be only a return-success function. A restart script may be required if the restart mode is set to 1; however, this script may contain only a return-success function. The probe script is optional.
 In some embodiments, there are two types of monitoring that may be accomplished in a monitor script:
 Is the resource present?
 Is the resource responding?
 For a client-node resource that follows a protocol, the monitoring script can make a simple request and verify that the proper response is received. For a web node, the monitoring script can request a home page, verify that the connection was made, and ignore the resulting home page. For a database, a simple request such as querying a table can be made.
 Next, a system executing the method receives a failover domain as output from the failover script (block 204). The failover script can receive an input domain, apply script logic, and provide an output domain. The output domain is an ordered list of nodes on which a given resource can be allocated.
 Next, the system receives failover attributes (block 206). The failover attributes are used by the scripts and by the HA base software to modifying the run-time failover domain used for a specific resource group. Based on the failover domain and attributes, the method determines a target node for the resource (block 208). Once a target node has been determined, the system can cause the resource to start on the target node.
 In the above discussion and in the attached appendices, the term “computer” is defined to include any digital or analog data processing unit. Examples include any personal computer, workstation, set top box, mainframe, server, supercomputer, laptop or personal digital assistant capable of embodying the inventions described herein.
 Examples of articles comprising computer readable media are floppy disks, hard drives, CD-ROM or DVD media or any other read-write or read-only memory device.
 Although specific embodiments have been illustrated and described herein, it will be appreciated by those of ordinary skill in the art that any arrangement which is calculated to achieve the same purpose may be substituted for the specific embodiment shown. This application is intended to cover any adaptations or variations of the present invention. Therefore, it is intended that this invention be limited only by the claims and the equivalents thereof.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US2151733||May 4, 1936||Mar 28, 1939||American Box Board Co||Container|
|CH283612A *||Title not available|
|FR1392029A *||Title not available|
|FR2166276A1 *||Title not available|
|GB533718A||Title not available|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7296191 *||Jul 11, 2006||Nov 13, 2007||International Business Machines Corporation||Scalable method of continuous monitoring the remotely accessible resources against the node failures for very large clusters|
|US7401265||Aug 8, 2007||Jul 15, 2008||International Business Machines Corporation||Scalable method of continuous monitoring the remotely accessible resources against the node failures for very large clusters|
|US7451201||Sep 30, 2003||Nov 11, 2008||International Business Machines Corporation||Policy driven autonomic computing-specifying relationships|
|US7451347 *||Oct 8, 2004||Nov 11, 2008||Microsoft Corporation||Failover scopes for nodes of a computer cluster|
|US7533173||Sep 30, 2003||May 12, 2009||International Business Machines Corporation||Policy driven automation - specifying equivalent resources|
|US7669080||Aug 16, 2007||Feb 23, 2010||International Business Machines Corporation||Reducing likelihood of data loss during failovers in high-availability systems|
|US7734750 *||Dec 19, 2003||Jun 8, 2010||International Business Machines Corporation||Real-time feedback for policies for computing system management|
|US7757116||Apr 4, 2007||Jul 13, 2010||Vision Solutions, Inc.||Method and system for coordinated multiple cluster failover|
|US7814373 *||Jun 25, 2008||Oct 12, 2010||International Business Machines Corporation||Scalable method of continuous monitoring the remotely accessible resources against node failures for very large clusters|
|US8055933||Jul 21, 2009||Nov 8, 2011||International Business Machines Corporation||Dynamic updating of failover policies for increased application availability|
|US8307060||Apr 14, 2010||Nov 6, 2012||International Business Machines Corporation||Real-time feedback for policies for computing system management|
|US8429450||May 28, 2010||Apr 23, 2013||Vision Solutions, Inc.||Method and system for coordinated multiple cluster failover|
|US8438573 *||Jan 15, 2010||May 7, 2013||Oracle International Corporation||Dependency on a resource type|
|US8473548 *||Sep 23, 2010||Jun 25, 2013||Samsung Electronics Co., Ltd.||Intelligent network system and method and computer-readable medium controlling the same|
|US8583798||Jan 15, 2010||Nov 12, 2013||Oracle International Corporation||Unidirectional resource and type dependencies in oracle clusterware|
|US8732162||Jul 11, 2011||May 20, 2014||Sony Computer Entertainment America Llc||Systems and methods for server management|
|US8738961||Aug 17, 2010||May 27, 2014||International Business Machines Corporation||High-availability computer cluster with failover support based on a resource map|
|US8769132||Sep 27, 2010||Jul 1, 2014||Sony Computer Entertainment America Llc||Flexible failover policies in high availability computing systems|
|US8892702 *||Sep 30, 2003||Nov 18, 2014||International Business Machines Corporation||Policy driven autonomic computing-programmatic policy definitions|
|US8930509||Jul 5, 2012||Jan 6, 2015||International Business Machines Corporation||Real-time feedback for policies for computing system management|
|US8949425||Jan 15, 2010||Feb 3, 2015||Oracle International Corporation||“Local resource” type as a way to automate management of infrastructure resources in oracle clusterware|
|US9069619||Jan 15, 2010||Jun 30, 2015||Oracle International Corporation||Self-testable HA framework library infrastructure|
|US9098334||Jan 15, 2010||Aug 4, 2015||Oracle International Corporation||Special values in oracle clusterware resource profiles|
|US20040163007 *||Feb 19, 2003||Aug 19, 2004||Kazem Mirkhani||Determining a quantity of lost units resulting from a downtime of a software application or other computer-implemented system|
|US20050036483 *||Jul 16, 2004||Feb 17, 2005||Minoru Tomisaka||Method and system for managing programs for web service system|
|US20050071449 *||Sep 30, 2003||Mar 31, 2005||International Business Machines Corporation||Policy driven autonomic computing-programmatic policy definitions|
|US20050091351 *||Sep 30, 2003||Apr 28, 2005||International Business Machines Corporation||Policy driven automation - specifying equivalent resources|
|US20050091352 *||Sep 30, 2003||Apr 28, 2005||International Business Machines Corporation||Policy driven autonomic computing-specifying relationships|
|US20050132379 *||Dec 11, 2003||Jun 16, 2005||Dell Products L.P.||Method, system and software for allocating information handling system resources in response to high availability cluster fail-over events|
|US20050138317 *||Dec 19, 2003||Jun 23, 2005||Cannon David M.||Real-time feedback for policies for computing system management|
|US20050259572 *||May 18, 2005||Nov 24, 2005||Esfahany Kouros H||Distributed high availability system and method|
|US20110078235 *||Mar 31, 2011||Samsung Electronics Co., Ltd.||Intelligent network system and method and computer-readable medium controlling the same|
|US20110179419 *||Jan 15, 2010||Jul 21, 2011||Oracle International Corporation||Dependency on a resource type|
|CN1302412C *||Nov 11, 2003||Feb 28, 2007||联想(北京)有限公司||Computer group system and its operation managing method|
|CN1758608B||Sep 29, 2005||Aug 17, 2011||微软公司||Method and system for processing fault of computer cluster node|
|EP1647890A2 *||Sep 23, 2005||Apr 19, 2006||Microsoft Corporation||Failover scopes for nodes of a computer cluster|
|EP2416526A1 *||Mar 23, 2010||Feb 8, 2012||Huawei Technologies Co., Ltd.||Task switching method, server node and cluster system|
|Cooperative Classification||G06F11/2023, H04L69/40|
|Jul 18, 2002||AS||Assignment|
Owner name: SILICON GRAPHICS, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SREENIVASAN, PADMANABHAN;DANDAPANI, AJIT;NISHIMOTO, MICHAEL;AND OTHERS;REEL/FRAME:013102/0229;SIGNING DATES FROM 20020127 TO 20020710
|Nov 26, 2002||AS||Assignment|
Owner name: SILICON GRAPHICS, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SREENIVASAN, PADMANABHAN;DANDAPANI, AJIT;NISHIMOTO, MICHAEL;AND OTHERS;REEL/FRAME:013523/0968;SIGNING DATES FROM 20020127 TO 20020710
|Aug 19, 2005||AS||Assignment|
Owner name: WELLS FARGO FOOTHILL CAPITAL, INC.,CALIFORNIA
Free format text: SECURITY AGREEMENT;ASSIGNOR:SILICON GRAPHICS, INC. AND SILICON GRAPHICS FEDERAL, INC. (EACH A DELAWARE CORPORATION);REEL/FRAME:016871/0809
Effective date: 20050412
|Oct 24, 2006||AS||Assignment|
Owner name: GENERAL ELECTRIC CAPITAL CORPORATION,CALIFORNIA
Free format text: SECURITY INTEREST;ASSIGNOR:SILICON GRAPHICS, INC.;REEL/FRAME:018545/0777
Effective date: 20061017
|Oct 18, 2007||AS||Assignment|
Owner name: MORGAN STANLEY & CO., INCORPORATED,NEW YORK
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:GENERAL ELECTRIC CAPITAL CORPORATION;REEL/FRAME:019995/0895
Effective date: 20070926
|Mar 21, 2012||AS||Assignment|
Owner name: SILICON GRAPHICS INTERNATIONAL, CORP., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SILICON GRAPHICS, INC. ET AL.;SGI INTERNATIONAL, INC.;SIGNING DATES FROM 20090508 TO 20120320;REEL/FRAME:027904/0315
|Oct 31, 2013||AS||Assignment|
Owner name: SONY COMPUTER ENTERTAINMENT AMERICA LLC, CALIFORNI
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SILICON GRAPHICS INTERNATIONAL, CORP.;REEL/FRAME:031519/0523
Effective date: 20131015