초록 ▼

Various components are provided to manage a clustered environment. These components include a System Registry that provides a global data storage; a Configuration manager that stores data locally on nodes of the clustered environment and globally within the System Registry; a Liveness component to p

Various components are provided to manage a clustered environment. These components include a System Registry that provides a global data storage; a Configuration manager that stores data locally on nodes of the clustered environment and globally within the System Registry; a Liveness component to provide status of communications paths of the cluster; a Group Services component that provides services to one or more other components of the clustered environment; and a Resource Management component that communicates with one or more resource controllers of the clustered environment. Each of the components of the clustered environment has one or more data and/or functional dependencies on one or more other components of the environment. However, relationships between the components are created such that the data and functional dependencies form an acyclic graph (i.e., a cycle of dependency relationships is avoided).

대표청구항 ▼

What is claimed is: 1. A method of providing ordered lists of service addresses, said method comprising: creating by a distributed configuration manager component of a computing environment a priority ordered list of service addresses to be used by a client node of a computing environment to reach

What is claimed is: 1. A method of providing ordered lists of service addresses, said method comprising: creating by a distributed configuration manager component of a computing environment a priority ordered list of service addresses to be used by a client node of a computing environment to reach a service of said computing environment, said distributed configuration manager component maintaining configuration data for said computing environment, said creating including determining whether any service addresses to be used are present on said client node, and if so, giving those service addresses a highest priority for said client node, and said creating further including identifying a plurality of service addresses of an equidistance number of routing hops from said client node and using a predefined equation to order said plurality of service addresses of equidistance number of routing hops from said client node, said predefined equation balancing use of said plurality of service addresses among said client node and at least one other client node of said computing environment, and said predefined equation employing at least in part a number of said client node, and a number of said plurality of service addresses having the equidistance number of routing hops; providing said ordered list created by said distributed configuration manager to said client node; and using said ordered list by said client node to reach said service, wherein said ordered list is ordered specifically for said client node based on one or more characteristics of said client node. 2. The method of claim 1, wherein said creating comprises ordering said service addresses based on distance from the client node to servers of said service addresses. 3. The method of claim 2, wherein said ordering based on distance comprises ordering based on lowest distance. 4. The method of claim 1, wherein said service comprises a system registry service. 5. The method of claim 1, further comprising maintaining said ordered list. 6. The method of claim 5, wherein said maintaining comprises updating said ordered list in response to a change in the service addresses of said list. 7. The method of claim 6, wherein said maintaining is performed by said distributed configuration manager of said computing environment. 8. A method of providing ordered lists of service addresses, said method comprising: creating an ordered list of service addresses to be used by a node of a computing environment to reach a service of said computing environment, said creating using a predefined equation to order a plurality of service addresses having the same ordering criterion, said predefined equation balancing use of said plurality of service addresses among said node and at least one other node of said computing environment, and said predefined equation comprising: [((a number of said node)mod(number of said plurality of service addresses having the same ordering criterion)+k)mod(number of said plurality of service addresses having the same ordering criterion)], wherein mod is an integer remainder of a division operation, and k is set to a selected value; and using said ordered list by said node to reach said service, wherein said ordered list is ordered specifically for said node. 9. The method of claim 8, wherein said predefined equation is computed a number of times, said number of times being equal to the number of said plurality of service addresses, and wherein k is incremented for each computation. 10. The method of claim 8, wherein said same ordering criterion comprises equidistance from said node to a plurality of servers corresponding to said plurality of service addresses. 11. The method of claim 10, wherein said creating further comprises ordering said service addresses based on distance from the node to servers of said service addresses. 12. A method of providing ordered lists of service addresses, said method comprising: priority ordering by a distributed configuration manager component of a computing environment a list of a plurality of service addresses according to an ordering criterion, said distributed configuration manager component maintaining configuration data for said computing environment, said ordered list being ordered for a specific client node based on one or more characteristics of the client node, said priority ordering including determining whether any service addresses to be used are present on said client node, and if so, giving those service addresses a highest priority for said client node; for at least one set of service addresses of said plurality of service addresses having an equidistance number of routing hops from said client node, selecting by the distributed configuration manager component an order for the service addresses of the set, said selecting being based at least in part on workload distribution, a node number of said client node and a number of service addresses of the set; providing said ordered list created by said distributed manager to said client node; and using said ordered list by said client node to reach said service, wherein said ordered list is ordered specifically for said client node based on one or more characteristics of said client node. 13. The method of claim 12, wherein said selecting comprises: indexing the service addresses of the set in a chosen order providing a set of indices corresponding to the service addresses of the set; and determining an order for the plurality of indices, said order to represent the order of the service addresses of the set. 14. The method of claim 13, wherein the chosen order is ascending order of service addresses. 15. The method of claim 13, wherein said determining comprises using an equation to determine the order, said equation being based at least in part on the number of said service addresses of said set and the node number of the specific client node. 16. The method of claim 12, wherein said ordering criterion is based on distance from said client node to a plurality of servers corresponding to said plurality of service addresses. 17. The method of claim 16, wherein said ordering criterion comprises a lowest distance from said client node to the plurality of servers. 18. A method of providing ordered lists of service addresses, said method comprising: ordering a list of a plurality of service addresses according to an ordering criterion, said ordered list being ordered for a specific node; and for at least one set of service addresses of said plurality of service addresses having a same value for the ordering criterion, selecting an order for the service addresses of the set, said selecting being based at least in part on workload distribution, and wherein said selecting comprises: indexing the service addresses of the set in a chosen order providing a set of indices corresponding to the service addresses of the set; and determining an order for the plurality of indices, said order to represent the order of the service addresses of the set, wherein said determining comprises using an equation to determine the order, said equation being based at least in part on the number of said service addresses of said set and a node number of the specific node, and said equation comprising: [((node number)mod(number of said service addresses of the set)+k)mod(number of said service addresses of the set)], wherein mod is an integer remainder of a division operation, and k is set to a selected value. 19. A system of providing ordered lists of service addresses, said system comprising: means for creating by a distributed configuration manager component of a computing environment a priority ordered list of service addresses to be used by a client node of a computing environment to reach a service of said computing environment, said distributed configuration manager component maintaining configuration data for said computing environment, said means for creating including means for determining whether any service addresses to be used are present on said client node, and if so, for giving those service addresses a highest priority for said client node, and said means for creating further including means for identifying a plurality of service addresses of an equidistance number of routing hops from said client node and further including identifying using a predefined equation to order said plurality of service addresses of equidistance number of routing hops from said client node, said predefined equation balancing use of said plurality of service addresses among said client node and at least one other client node of said computing environment, and said predefined equation employing at least in part a number of said client node, and a number of said plurality of service addresses having the equidistance number of routing hops; means for providing said ordered list created by said distributed manager to said client node; and means for using said ordered list by said client node to reach said service, wherein said ordered list is ordered specifically for said client node based on one or more characteristics of the client node. 20. The system of claim 19, wherein said means for creating comprises means for ordering said service addresses based on distance from the client node to servers of said service addresses. 21. The system of claim 20, wherein said means for ordering based on distance comprises means for ordering based on lowest distance. 22. The system of claim 19, wherein said service comprises a system registry service. 23. The system of claim 19, further comprising means for maintaining said ordered list. 24. The system of claim 23, wherein said means for maintaining comprises means for updating said ordered list in response to a change in the service addresses of said list. 25. The system of claim 24, wherein said means for maintaining comprises using said distributed configuration manager of said computing environment. 26. A system of providing ordered lists of service addresses, said system comprising: means for creating an ordered list of service addresses to be used by a node of a computing environment to reach a service of said computing environment, said means for creating using a predefined equation to order a plurality of service addresses having the same ordering criterion, said predefined equation balancing use of said plurality of service addresses among said node and at least one other node of said computing environment, and said predefined equation comprising: [((a number of said node)mod(number of said plurality of service addresses having the same ordering criterion)+k)mod(number of said plurality of service addresses having the same ordering criterion)], wherein mod is an integer remainder of a division operation, and k is set to a selected value; and means for using said ordered list by said node to reach said service, wherein said ordered list is ordered specifically for said node. 27. The system of claim 26, wherein said predefined equation is computed a number of times, said number of times being equal to the number of said plurality of service addresses, and wherein k is incremented for each computation. 28. The system of claim 26, wherein said same ordering criterion comprises equidistance from said node to a plurality of servers corresponding to said plurality of service addresses. 29. The system of claim 28, wherein said means for creating further comprises means for ordering said service addresses based on distance from the node to servers of said service addresses. 30. A system of providing ordered lists of service addresses, said system comprising: means for priority ordering by a distributed configuration manager component of a computing environment a list of a plurality of service addresses according to an ordering criterion, said distributed configuration manager component maintaining configuration data for said computing environment, said ordered list being ordered for a specific client node based on one or more characteristics of the client node, said priority ordering including determining whether any service addresses to be used are present on said client node, and if so, giving those service addresses a highest priority for said client node, and said creating further including identifying a plurality of service addresses of an equidistance number of routing hops from said client node; for at least one set of service addresses of said plurality of service addresses having an equidistance number of routing hops from said client node, means for selecting an order for the service addresses of the set, the selecting being based at least in part on workload distribution, a node number of said client node and a number of service addresses of the set; means for providing said ordered list created by said distributed configuration manager to said client node; and means for using said ordered list by said client node to reach said service, wherein said ordered list is ordered specifically for said client node based on one or more characteristics of said client node. 31. The system of claim 30, wherein said means for selecting comprises: means for indexing the service addresses of the set in a chosen order providing a set of indices corresponding to the service addresses of the set; and means for determining an order for the plurality of indices, said order to represent the order of the service addresses of the set. 32. The system of claim 31, wherein the chosen order is ascending order of service addresses. 33. The system of claim 31, wherein said means for determining comprises means for using an equation to determine the order, said equation being based at least in part on the number of said service addresses of said set and the node number of the specific client node. 34. The system of claim 30, wherein the ordering criterion is based on distance from said node to a plurality of servers corresponding to said plurality of service addresses. 35. The system of claim 34, wherein the ordering criterion comprises a lowest distance from said node to the plurality of servers. 36. A system of providing ordered lists of service addresses, said system comprising: means for ordering a list of a plurality of service addresses according to an ordering criterion, said ordered list being ordered for a specific node; and for at least one set of service addresses of said plurality of service addresses having a same value for the ordering criterion, means for selecting an order for the service addresses of the set, the selecting being based at least in part on workload distribution, and wherein said means for selecting comprises: means for indexing the service addresses of the set in a chosen order providing a set of indices corresponding to the service addresses of the set; and means for determining an order for the plurality of indices, said order to represent the order of the service addresses of the set, wherein said means for determining comprises means for using an equation to determine the order, said equation being based at least in part on the number of said service addresses of said set and a node number of the specific node, and said equation comprising: [((node number)mod(number of said service addresses of the set)+k)mod(number of said service addresses of the set)], wherein mod is an integer remainder of a division operation, and k is set to a selected value. 37. At least one program storage device readable by a machine tangibly embodying at least one program of instructions executable by the machine to perform a method of providing ordered lists of service addresses, said method comprising: creating by a distributed configuration manager component of a computing environment a priority ordered list of service addresses to be used by a client node of a computing environment to reach a service of said computing environment, said distributed configuration manager component maintaining configuration data for said computing environment, said creating including determining whether any service addresses to be used are present on said client node, and if so, giving those service addresses a highest priority for said client node, and said creating further including identifying a plurality of service addresses of an equidistance number of routing hops from said client node and using a predefined equation to order said plurality of service addresses of equidistance number of routing hops from said client node, said predefined equation balancing use of said plurality of service addresses among said client node and at least one other client node of said computing environment, and said predefined equation employing at least in part a number of said client node, and a number of said plurality of service addresses having the equidistance number of routing hops; providing said ordered list created by said distributed configuration manager to said client node; and using said ordered list by said client node to reach said service, wherein said ordered list is ordered specifically for said client node based on one or more characteristics of the client node. 38. The at least one program storage device of claim 37, wherein said creating comprises ordering said service addresses based on distance from the client node to servers of said service addresses. 39. The at least one program storage device of claim 38, wherein said ordering based on distance comprises ordering based on lowest distance. 40. The at least one program storage device of claim 37, wherein said service comprises a system registry service. 41. The at least one program storage device of claim 37, wherein said method further comprises maintaining said ordered list. 42. The at least one program storage device of claim 41, wherein said maintaining comprises updating said ordered list in response to a change in the service addresses of said list. 43. The at least one program storage device of claim 42, wherein said maintaining is performed by said distributed configuration manager of said computing environment. 44. At least one program storage device readable by a machine tangibly embodying at least one program of instructions executable by the machine to perform a method of providing ordered lists of service addresses, said method comprising: creating an ordered list of service addresses to be used by a node of a computing environment to reach a service of said computing environment, said creating using a predefined equation to order a plurality of service addresses having the same ordering criterion, said predefined equation balancing use of said plurality of service addresses among said node and at least one other node of said computing environment, and said predefined equation comprising: [((a number of said node)mod(number of said plurality of service addresses having the same ordering criterion)+k)mod(number of said plurality of service addresses having the same ordering criterion)], wherein mod is an integer remainder of a division operation, and k is set to a selected value; and using said ordered list by said node to reach said service, wherein said ordered list is ordered specifically for said node. 45. The at least one program storage device of claim 44, wherein said predefined equation is computed a number of times, said number of times being equal to the number of said plurality of service addresses, and wherein k is incremented for each computation. 46. The at least one program storage device of claim 44, wherein said same ordering criterion comprises equidistance from said node to a plurality of servers corresponding to said plurality of service addresses. 47. The at least one program storage device of claim 46, wherein said creating further comprises ordering said service addresses based on distance from the node to servers of said service addresses. 48. At least one program storage device readable by a machine tangibly embodying at least one program of instructions executable by the machine to perform a method of providing ordered lists of service addresses, said method comprising: priority ordering by a distributed configuration manager component of a computing environment a list of a plurality of service addresses according to an ordering criterion, said distributed configuration manager component maintaining configuration data for said computing environment, said ordered list being ordered for a specific client node based on one or more characteristics of the client node, said priority ordering including determining whether any service addresses to be used are present on said client node, and if so, giving those service addresses a highest priority for said client node; for at least one set of service addresses of said plurality of service addresses having an equidistance number of routing hops from said client node, selecting by the distributed configuration manager component an order for the service addresses of the set, said selecting being based at least in part on workload distribution, a node number of said client node and a number of service addresses of the set; providing said ordered list created by said distributed configuration manager to said client node; and using said ordered list by said client node to reach said service, wherein said ordered list is ordered specifically for said client node based on one or more characteristics of said client node. 49. The at least one program storage device of claim 46, wherein said selecting comprises: indexing the service addresses of the set in a chosen order providing a set of indices corresponding to the service addresses of the set; and determining an order for the plurality of indices, said order to represent the order of the service addresses of the set. 50. The at least one program storage device of claim 49, wherein the chosen order is ascending order of service addresses. 51. The at least one program storage device of claim 49, wherein said determining comprises using an equation to determine the order, said equation being based at least in part on the number of said service addresses of said set and the node number of the specific client node. 52. The at least one program storage device of claim 46, wherein said ordering criterion is based on distance from said node to a plurality of servers corresponding to said plurality of service addresses. 53. The at least one program storage device of claim 52, wherein said ordering criterion comprises a lowest distance from said node to the plurality of servers. 54. At least one program storage device readable by a machine tangibly embodying at least one program of instructions executable by the machine to perform a method of providing ordered lists of service addresses, said method comprising: ordering a list of a plurality of service addresses according to an ordering criterion, said ordered list being ordered for a specific node; and for at least one set of service addresses of said plurality of service addresses having a same value for the ordering criterion, selecting an order for the service addresses of the set, said selecting being based at least in part on workload distribution, and wherein said selecting comprises: indexing the service addresses of the set in a chosen order providing a set of indices corresponding to the service addresses of the set; and determining an order for the plurality of indices, said order to represent the order of the service addresses of the set, wherein said determining comprises using an equation to determine the order, said equation being based at least in part on the number of said service addresses of said set and a node number of the specific node, and said equation comprising: [((node number)mod(number of said service addresses of the set)+k)mod(number of said service addresses of the set)], wherein mod is an integer remainder of a division operation, and k is set to a selected value.