The claimed invention relates generally to the field of computer software and more particularly, but not by way of limitation, to an apparatus and method for real time logging and analyzing event flows associated with execution of a service request in a software system.
Computer-based systems enable a wide variety of data processing tasks to be accomplished in a fast and efficient manner. From hand-held consumer products to geographically distributed storage area networks with multi-device data storage arrays, such systems continue to proliferate into all areas of society and commerce.
Software is provided to direct the operation of such systems. Software (including firmware) can take a number of forms such as application programs, operating systems, interface and controller routines, and maintenance and housekeeping modules.
Each time a process is initiated by the software, a number of additional processes, handshakes, links, calculations, and other events can be carried out by the various layers of software in order to service and complete the service request. Generally, with increased complexity in the overall software system, including additional layers of software applications and operating systems, distributed processing and fault tolerant redundancy, it becomes increasingly difficult to assess the extent to which system resources are utilized to carry out a given process.
In some solutions these resultant events are logged for purposes of analysis in the event an execution error is identified. However, typically the error is identified at some time after the execution step causing the error, making it painstakingly difficult, if not impossible, to trace back through the logged events to ascertain a root cause. What is needed is a solution providing a real time analysis of system execution errors. It is to these benefits and advantages that the embodiments of the present invention are directed.
Embodiments of the present invention are generally directed to a method and an apparatus for logging and analyzing event flows associated with execution of a service request in a software system, such as a computer-based system comprising a multi-disc data storage array.
In some embodiments a method is provided comprising: executing a service request in a software system resulting in a plurality of events performed by the software system; accumulating in a selected memory space a plurality of entries associated with the events, wherein each entry defines a software system operational state; and analyzing the entries to determine whether an error occurred during the accumulating step.
In some embodiments an apparatus is provided comprising a software system resident in a memory space configured to execute a service request which results in a plurality of events carried out by the software system in completing the service request. The software system also creates a plurality of entries associated with the events, wherein each entry defines an operational state of the software system.
In some embodiments an apparatus is provided comprising a software system resident in a memory space configured to execute a service request which results in a plurality of events carried out by the software system to complete the service request, and means for determining a software system execution error by associating the state of the software system with the events.
These and various other features and advantages which characterize the claimed invention will become apparent upon reading the following detailed description and upon reviewing the associated drawings.
To illustrate an exemplary environment in which presently preferred embodiments of the present invention can be advantageously practiced,
The system 100 includes a number of host computers 102, respectively identified as hosts A, B and C. The host computers 102 interact with each other as well as with a pair of data storage arrays 104 (denoted A and B, respectively) via a fabric 106. The fabric 106 is preferably characterized as a fibre-channel based switching network, although other configurations can be utilized as well, including the Internet.
Each array 104 includes a pair of controllers 108 (denoted A1, A2 and B1, B2 respectively) and a set of data storage devices 110 preferably characterized as hard disc drives operated as a RAID (redundant array of independent discs). The controllers 108 and devices 110 preferably utilize a fault tolerant arrangement so that the various controllers 108 utilize parallel, redundant links and at least some of the user data stored by the system 100 is mirrored on both sets of devices 110.
It is further contemplated that the A host computer 102 and the A data storage array 104 are physically located at a first site, the B host computer 102 and B storage array 104 are physically located at a second site, and the C host computer 102 is at yet a third site, although such is merely illustrative and not limiting.
A main processor 112, preferably characterized as a programmable, general purpose computer processor, provides top level control in accordance with programming steps and processing data stored in non-volatile memory 114 (such as flash memory or similar) and in dynamic random access memory (DRAM) 116.
A fabric interface (I/F) circuit 118 communicates with the other controllers 108 and the host computers 102 via the fabric 106, and a device I/F circuit 120 communicates with the storage devices 110. The I/F circuits 118, 120 and a path controller 122 form a communication path to pass commands and data between the storage array and the host using cache memory 124.
As will be recognized, a data transfer request from a selected host computer 102 to write data to the devices 110 will invoke one or more host level command processes. Such processes in turn invoke various other processes down and back up through the various layers to ultimately result in the completion of the desired task. Along the way, various system resources are allocated, utilized and released.
During operation, a service request will generally allocate one or more of the resources to perform a desired operation, and may invoke or link to one or more lower level processes until the service request is completed. Preferably, upon the operation of every event, each of the software layers operates to provide an entry into the global event log 134, as depicted by
Each entry is associated with a respective event, and defines the operational state of the software system at a time corresponding to the event. The event entries also include indexing information that identifies the initiating process (such as Process(1), Process(2), and Process(3) as generally identified in
The size of the log (i.e., the amount of memory allocated therefor) can be selectively varied by the log manager and by inputs from the user. A larger allocated space will track a greater history window, but will also consume greater system resources. It is contemplated that the log is preferably sized to reflect several hours of continued operation of the system 100. The log 134 is further preferably characterized as having a buffer for storing a predetermined plurality of the entries, which can be batch processed by the analysis tool 136 for reducing the processing overhead burden on the system 100. A counter 142 (
As shown by
The log 134 can be updated in a real-time fashion, but process efficiencies can be generally obtained by caching, at either a layer level and/or at a device level, a short listing of the recent events which is then transferred to the log manager at an appropriate time. In this way, the global collection of event data as described herein can have a reduced, if not wholly transparent, effect upon system 100 availability.
The analysis tool 136 of
The resulting analysis can be presented by the GUI 138 in any suitable fashion, such as the system resource utilization diagram in
It is contemplated that the GUI 138 is accessible via the host computers 102 using system administrator access, although other suitable arrangements including a dedicated computer can be utilized as well.
The analysis tool 136 can also be operated in an automated fashion in response to certain pre-set or user selectable occurrences, such as command timeouts, error conditions and the like, in order to provide an indication of system utilization in the moments leading up to such occurrences.
The global event log 134 is preferably physically arranged as a single structure, but in other preferred embodiments the log can be physically distributed among different locations so long as the log correctly reflects all of the entries associated with each event. The logging and analysis module 130 thus provides valuable information regarding system resource utilization during system design efforts as well as during field maintenance performance evaluation and failure analysis.
In view of the foregoing discussion, it will now be understood that preferred embodiments of the present invention are generally directed to a method and apparatus for logging and analyzing event flows associated with execution of a service request in a software system, such as a computer-based system (such as 100) comprising a multi-disc data storage array (such as 104).
Execution of the service request preferably results in a plurality of events carried out by multiple layers of the software system. A global event log (such as 134) accumulates a corresponding plurality of entries, each defining a current software system state.
An analysis tool (such as 136) preferably accesses the global event log to provide a real time indication of execution errors, such as in a graphical display by a graphical user interface (such as 138). A log manager preferably controls operation of the global event log (such as 132).
Entries in the global event log are preferably entered sequentially for each ongoing process, and each entry preferably includes an identifier that identifies the associated service request.
For purposes of the appended claims, the recited “means for determining” will be understood to correspond to the disclosed module 130 of
It is to be understood that even though numerous characteristics and advantages of various embodiments of the present invention have been set forth in the foregoing description, together with details of the structure and function of various embodiments of the invention, this detailed description is illustrative only, and changes may be made in detail, especially in matters of structure and arrangements of parts within the principles of the present invention to the full extent indicated by the broad general meaning of the terms in which the appended claims are expressed. For example, the particular elements may vary depending on the particular processing environment without departing from the spirit and scope of the present invention.
In addition, although the embodiments described herein are directed to a data storage array, it will be appreciated by those skilled in the art that the claimed subject matter is not so limited and various other processing systems can be utilized without departing from the spirit and scope of the claimed invention.
Number | Name | Date | Kind |
---|---|---|---|
5297258 | Hale et al. | Mar 1994 | A |
5612898 | Huckins | Mar 1997 | A |
5638514 | Yoshida et al. | Jun 1997 | A |
5712979 | Graber et al. | Jan 1998 | A |
5745686 | Saito et al. | Apr 1998 | A |
5790427 | Greer et al. | Aug 1998 | A |
5829053 | Smith et al. | Oct 1998 | A |
5835955 | Dornier et al. | Nov 1998 | A |
5860079 | Smith et al. | Jan 1999 | A |
5912669 | Hsia | Jun 1999 | A |
5930476 | Yamunachari et al. | Jul 1999 | A |
5949415 | Lin et al. | Sep 1999 | A |
5949976 | Chappelle | Sep 1999 | A |
5966705 | Koneru et al. | Oct 1999 | A |
5996054 | Ledain et al. | Nov 1999 | A |
6041423 | Tsukerman | Mar 2000 | A |
6065018 | Beier et al. | May 2000 | A |
6125392 | Labatte et al. | Sep 2000 | A |
6397348 | Styczinski | May 2002 | B1 |
6418445 | Moerbeek | Jul 2002 | B1 |
6449623 | Bohannon et al. | Sep 2002 | B1 |
6477617 | Golding | Nov 2002 | B1 |
6493837 | Pang et al. | Dec 2002 | B1 |
6510463 | Farhat et al. | Jan 2003 | B1 |
6539341 | Li et al. | Mar 2003 | B1 |
6567910 | Tessarolo et al. | May 2003 | B2 |
6606658 | Uematsu | Aug 2003 | B1 |
6622260 | Marisetty et al. | Sep 2003 | B1 |
6654795 | Coile | Nov 2003 | B1 |
6658590 | Sicola et al. | Dec 2003 | B1 |
6701363 | Chiu et al. | Mar 2004 | B1 |
6714979 | Brandt et al. | Mar 2004 | B1 |
6725392 | Frey et al. | Apr 2004 | B1 |
6732293 | Schneider | May 2004 | B1 |
6742030 | MacPhail | May 2004 | B1 |
6751636 | Mende, Jr. et al. | Jun 2004 | B1 |
7197431 | Barritz | Mar 2007 | B2 |
20020016843 | Schweitzer et al. | Feb 2002 | A1 |
20020077791 | Go et al. | Jun 2002 | A1 |
20030051236 | Pace et al. | Mar 2003 | A1 |
20030056199 | Li et al. | Mar 2003 | A1 |
20030056200 | Li et al. | Mar 2003 | A1 |
20030140209 | Testardi | Jul 2003 | A1 |
20030140210 | Testardi | Jul 2003 | A1 |
20040064639 | Sicola et al. | Apr 2004 | A1 |
20040181600 | Yamagami | Sep 2004 | A1 |
20040205398 | Osborn et al. | Oct 2004 | A1 |
20060005080 | Walker et al. | Jan 2006 | A1 |
20060041593 | Borthakur et al. | Feb 2006 | A1 |
Number | Date | Country |
---|---|---|
0913774 | May 1999 | EP |
0913774 | Jun 1999 | EP |
WO 0055953 | Sep 2000 | WO |
Number | Date | Country | |
---|---|---|---|
20060168479 A1 | Jul 2006 | US |