Method of creating an intelligent upgrade flow for a heterogeneous data center
AssigneeEMC IP Holding Company LLC
InventorsShelesh Chopra, Hemant Gaikwad, Rahul Deo Vishwakarma
Life of this patent
Estimating the term…
Loading patent…
AssigneeEMC IP Holding Company LLC
InventorsShelesh Chopra, Hemant Gaikwad, Rahul Deo Vishwakarma
Estimating the term…
In general, in one aspect, the invention relates to a method for managing updates, the method includes identifying a sub-tree based on a call graph, generating an update sequence for the sub-tree using the call graph, selecting a first component of the sub-tree based on the update sequence, wherein the first component is a hardware resource, applying an update to the first component to obtain a first updated component, selecting, after applying the update to the first component, a second component of the sub-tree based on the update sequence, and performing an update on the second component.
A method for managing updates, the method comprising:
A non-transitory computer readable medium comprising computer readable program code, which when executed by a computer processor enables the computer processor to perform a method for managing updates, the method comprising:
A system for managing updates, the system comprising:
Dependencies are inferred from the claim text.
Drawings are temporarily unavailable. Open the PDF at USPTO
From the US filing history. Foreign family members aren’t listed.
Software deployment: updates
Indexing; Data structures therefor; Storage structures: graphs; Linked lists
Computing and data processing
About 14 years 9 months of term left · ends 27 Jul 2041 (estimated)
Computing devices may provide services. To provide the services, the computing devices may include hardware resources and software components. The hardware and software components may be updated to improve the performance of the aforementioned services. The performance of the services may be important to users and/or other computing devices.
Certain embodiments of the invention will be described with reference to the accompanying drawings. However, the accompanying drawings illustrate only certain aspects or implementations of the invention by way of example and are not meant to limit the scope of the claims.
FIG. 1A shows a diagram of a system in accordance with one or more embodiments of the invention.
FIG. 1B shows a diagram of a storage in accordance with one or more embodiments of the invention.
Specific embodiments will now be described with reference to the accompanying figures. In the following description, numerous details are set forth as examples of the invention. It will be understood by those skilled in the art that one or more embodiments of the present invention may be practiced without these specific details and that numerous variations or modifications may be possible without departing from the scope of the invention. Certain details known to those of ordinary skill in the art are omitted to avoid obscuring the description.
In the following description of the figures, any component described with regard to a figure, in various embodiments of the invention, may be equivalent to one or more like-named components described with regard to any other figure. For brevity, descriptions of these components will not be repeated with regard to each figure. Thus, each and every embodiment of the components of each figure is incorporated by reference and assumed to be optionally present within every other figure having one or more like-named components. Additionally, in accordance with various embodiments of the invention, any description of the components of a figure is to be interpreted as an optional embodiment, which may be implemented in addition to, in conjunction with, or in place of the embodiments described with regard to a corresponding like-named component in any other figure.
Throughout this application, elements of figures may be labeled as A to N. As used herein, the aforementioned labeling means that the element may include any number of items and does not require that the element include the same number of elements as any other item labeled as A to N. For example, a data structure may include a first element labeled as A and a second element labeled as N. This labeling convention means that the data structure may include any number of the elements. A second data structure, also labeled as A to N, may also include any number of elements. The number of elements of the first data structure and the number of elements of the second data structure may be the same or different.