Dynamic Group Document Generation Based on FRU Location and Machine Configuration
Original Publication Date: 2009-May-29
Included in the Prior Art Database: 2009-May-29
This invention relates to solving the problem of writing hardware repair sequences for all valid combinations of Field Replaceable Units (FRUs) within a given computer system (CEC) without having to write unique sequences for each such possible FRU grouping or without falling back to requiring that only one FRU be repaired at a time. In short, its intent is to minimize the total service steps required to repair any legal combination of FRUs. Any given configuration of a CEC may have multiple occurrences of many of the same components within it but each in a different context. For example, the same memory DIMMs may be used in each of several Processing Units in a given CEC. While the final remove and replace step for any one DIMM is likely identical to that of any of its peers, the steps required to get to that point (the 'pre' steps) and returning from that point (the 'post' steps) will differ depending upon in which Processing Unit the DIMM resides. Further, other FRUs in the same 'geographical' region as said DIMMs will likely require identical pre- and post- sequences as the DIMMs, but have their own unique remove and replace instructions for the innermost step. The solution is to describe the set of FRU location codes for a given CEC in a Dynamic Group XML grammar (DGXML) document. This DXGML data base expresses the physical inter-relationships (grouping) for a given set of CEC FRUs and, when operated on by a parser and DGXML engine, against a list of one or more FRU location codes, produces a dynamic group document of pre-, post-, remove and install steps for a group service action against that input FRU list.