Great research starts with great data.

Learn More
More >
Patent Analysis of

Low-impact application-level performance monitoring with minimal and automatically upgradable instrumentation in a storage system

Updated Time 12 June 2019

Patent Registration Data

Publication Number

US10152232

Application Number

US15/196674

Application Date

29 June 2016

Publication Date

11 December 2018

Current Assignee

EMC IP HOLDING COMPANY LLC

Original Assignee (Applicant)

EMC CORPORATION

International Classification

G06F3/06

Cooperative Classification

G06F3/0607,G06F3/065,G06F3/0653,G06F3/0659,G06F3/067

Inventor

KLEINER, VLADIMIR,SHOIKHET, KIRILL,MIRON, AMIR,KUCHEROV, ANTON,VEPRINSKY, ALEXANDR

Patent Images

This patent contains figures and images illustrating the invention and its embodiment.

US10152232 Low-impact application-level performance monitoring 1 US10152232 Low-impact application-level performance monitoring 2 US10152232 Low-impact application-level performance monitoring 3
See all images <>

Abstract

Described embodiments provide methods and systems for tracking performance of a storage system including one or more system resources. One or more threads may be generated to operate the storage system. Each of the one or more threads may be associated with one of a plurality of tasks of the storage system. When an operating state of one of the one or more threads is changed, one or more performance counters of the storage system may be updated. A performance snapshot may be generated by capturing a state of the tasks associated with the threads and the performance counters.

Read more

Claims

1. A method comprising:

generating one or more threads to operate a storage system, the storage system comprising one or more system resources, and each of the one or more threads associated with one of a plurality of tasks of the storage system; updating one or more performance counters of the storage system in response to a change in operating state of one of the one or more threads; and generating a performance snapshot by capturing a state of the tasks associated with the threads and the performance counters wherein generating the performance snapshot comprises: grouping one or more of the threads that are associated with a given task; grouping counter values of the one or more performance counters into containers associated with the given task; and generating a performance snapshot based upon the grouped one or more threads that are associated with the given task, and the containers associated with the given task, wherein generating the performance snapshot further comprises generating a directed-graph associated with the given task, the directed-graph comprising a plurality of nodes and at least one edge joining associated ones of the nodes, wherein each of the nodes is associated with a synchronization object of an operating system of the storage system, wherein each of the nodes is identified by a two-tuple node key based upon a task identifier associated with the node, and a resource identifier associated with the node, and wherein each of the edges is associated with a respective sequence of instructions.

2. The method of claim 1 wherein the one or more threads to operate a storage system comprises more than one thread associated with one of the plurality of tasks.

3. The method of claim 1, further comprising identifying each edge by a three-tuple edge key based upon a task identifier associated with the edge, a first resource identifier

associated with a first node associated with the edge, and a second resource identifier associated with a second node associated with the edge.

4. The method of claim 1, wherein the operating state comprises one of running, ready and suspended.

5. The method of claim 1, further comprising:

collecting, by one or more performance counters, application-level performance data with low-impact instrumentation, and updating firmware associated with the one or more performance counters by updating software associated with the storage system.

6. The method of claim 1, further comprising associating the one or more performance counters with the given task, the one or more performance counters comprising one or more of: a counter for accumulating a number of accesses of an associated resource by the given task, a counter for accumulating a number of requested units from the associated resource by the given task, a counter for accumulating a time of the given task in a suspended state, a counter for determining a number of suspended requests to the associated resource by the given task, and performance counters associated with sequences of processing instructions comprising one or more of: a counter for accumulating a number of passes of the given task, a counter for accumulating a time of one or more operating states of the given task, and a counter for accumulating a number of cooperative yields of the given task.

7. The method of claim 1, wherein generating a performance snapshot further comprises generating the performance snapshot at a periodic snapshot interval while concurrently operating the storage system, wherein the snapshot interval is based upon a target time-precision of the performance snapshot and available resources of the storage system.

8. A system comprising:

a processor; and memory storing computer program code that when executed on the processor causes the processor to operate a storage system, the storage system operable to perform the operations of: generating one or more threads to operate a storage system, the storage system comprising one or more system resources, and each of the one or more threads associated with one of a plurality of tasks of the storage system; updating one or more performance counters of the storage system in response to a change in operating state of one of the one or more threads; and generating a performance snapshot by capturing a state of the tasks associated with the threads and the performance counters, wherein generating the performance snapshot comprises: grouping one or more of the threads that are associated with a given task; grouping counter values of the one or more performance counters into containers associated with the given task; and generating a performance snapshot based upon the grouped one or more threads that are associated with the given task and the containers associated with the given task, wherein generating the performance snapshot further comprises generating a directed-graph associated with the given task, the directed-graph comprising a plurality of nodes and at least one edge joining associated ones of the nodes, wherein each of the nodes is associated with a synchronization object of an operating system of the storage system, wherein each of the nodes is identified by a two-tuple node key based upon a task identifier associated with the node, and a resource identifier associated with the node, and wherein each of the edges is associated with a respective sequence of instructions.

9. The system of claim 8, wherein the storage system is further operable to perform the operations of:

collecting, by one or more performance counters, application-level performance data with low-impact instrumentation, and updating firmware associated with the one or more performance counters by updating software associated with the storage system.

10. The system of claim 8, wherein the storage system is further operable to perform the operations of:

associating the one or more performance counters with the given task, the one or more performance counters comprising one or more of: a counter for accumulating a number of accesses of an associated resource by the given task, a counter for accumulating a number of requested units from the associated resource by the given task, a counter for accumulating a time of the given task in a suspended state, a counter for determining a number of suspended requests to the associated resource by the given task, and performance counters associated with sequences of processing instructions comprising one or more of: a counter for accumulating a number of passes of the given task, a counter for accumulating a time of one or more operating states of the given task, and a counter for accumulating a number of cooperative yields of the given task; and generating the performance snapshot at a periodic snapshot interval while concurrently operating the storage system, wherein the snapshot interval is based upon a target time-precision of the performance snapshot and available resources of the storage system.

11. A computer program product including a non-transitory computer readable storage medium having computer program code encoded thereon that when executed on a processor of a computer causes the computer to operate a storage system, the computer program product comprising:

computer program code for generating one or more threads to operate a storage system, the storage system comprising one or more system resources, and each of the one or more threads associated with one of a plurality of tasks of the storage system; computer program code for updating one or more performance counters of the storage system in response to a change in operating state of one of the one or more threads; and computer program code for generating a performance snapshot by capturing a state of the tasks associated with the threads and the performance counters, wherein generating the performance snapshot comprises: grouping one or more of the threads that are associated with a given task; grouping counter values of the one or more performance counters into containers associated with the given task; and generating a performance snapshot for each task based upon the grouped one or more threads and the containers associated with the given task, wherein generating a performance snapshot further comprises generating a directed-graph associated with the given task, the directed-graph comprising a plurality of nodes and at least one edge joining associated ones of the nodes, wherein each of the nodes is associated with a synchronization object of an operating system of the storage system, wherein each of the nodes is identified by a two-tuple node key based upon a task identifier associated with the node, and a resource identifier associated with the node, and wherein each of the edges is associated with a respective sequence of instructions.

12. The computer program product of claim 11, wherein the one or more performance counters are operable to collect application-level performance data with low-impact instrumentation, and wherein firmware associated with the one or more performance counters is updated with updates to software associated with the storage system, and wherein the computer program code for generating a performance snapshot further comprises computer program code for generating the performance snapshot at a periodic snapshot interval while concurrently operating the storage system, wherein the snapshot interval is based upon a target time-precision of the performance snapshot and available resources of the storage system.

Read more

Claim Tree

  • 1
    1. A method comprising:
    • generating one or more threads to operate a storage system, the storage system comprising one or more system resources, and each of the one or more threads associated with one of a plurality of tasks of the storage system
    • updating one or more performance counters of the storage system in response to a change in operating state of one of the one or more threads
    • and generating a performance snapshot by capturing a state of the tasks associated with the threads and the performance counters wherein generating the performance snapshot comprises: grouping one or more of the threads that are associated with a given task
    • grouping counter values of the one or more performance counters into containers associated with the given task
    • and generating a performance snapshot based upon the grouped one or more threads that are associated with the given task, and the containers associated with the given task, wherein generating the performance snapshot further comprises generating a directed-graph associated with the given task, the directed-graph comprising a plurality of nodes and at least one edge joining associated ones of the nodes, wherein each of the nodes is associated with a synchronization object of an operating system of the storage system, wherein each of the nodes is identified by a two-tuple node key based upon a task identifier associated with the node, and a resource identifier associated with the node, and wherein each of the edges is associated with a respective sequence of instructions.
    • 2. The method of claim 1 wherein
      • the one or more threads to operate a storage system comprises
    • 3. The method of claim 1, further comprising
      • identifying each edge by a three-tuple edge key based upon a task identifier associated with the edge, a first resource identifier associated with a first node associated with the edge, and a second resource identifier associated with a second node associated with the edge.
    • 4. The method of claim 1, wherein
      • the operating state comprises
    • 5. The method of claim 1, further comprising:
      • collecting, by one or more performance counters, application-level performance data with low-impact instrumentation, and updating firmware associated with the one or more performance counters by updating software associated with the storage system.
    • 6. The method of claim 1, further comprising
      • associating the one or more performance counters with the given task, the one or more performance counters comprising one or more of: a counter for accumulating a number of accesses of an associated resource by the given task, a counter for accumulating a number of requested units from the associated resource by the given task, a counter for accumulating a time of the given task in a suspended state, a counter for determining a number of suspended requests to the associated resource by the given task, and performance counters associated with sequences of processing instructions comprising one or more of: a counter for accumulating a number of passes of the given task, a counter for accumulating a time of one or more operating states of the given task, and a counter for accumulating a number of cooperative yields of the given task.
    • 7. The method of claim 1, wherein
      • generating a performance snapshot further comprises
  • 8
    8. A system comprising:
    • a processor
    • and memory storing computer program code that when executed on the processor causes the processor to operate a storage system, the storage system operable to perform the operations of: generating one or more threads to operate a storage system, the storage system comprising one or more system resources, and each of the one or more threads associated with one of a plurality of tasks of the storage system
    • updating one or more performance counters of the storage system in response to a change in operating state of one of the one or more threads
    • and generating a performance snapshot by capturing a state of the tasks associated with the threads and the performance counters, wherein generating the performance snapshot comprises: grouping one or more of the threads that are associated with a given task
    • grouping counter values of the one or more performance counters into containers associated with the given task
    • and generating a performance snapshot based upon the grouped one or more threads that are associated with the given task and the containers associated with the given task, wherein generating the performance snapshot further comprises generating a directed-graph associated with the given task, the directed-graph comprising a plurality of nodes and at least one edge joining associated ones of the nodes, wherein each of the nodes is associated with a synchronization object of an operating system of the storage system, wherein each of the nodes is identified by a two-tuple node key based upon a task identifier associated with the node, and a resource identifier associated with the node, and wherein each of the edges is associated with a respective sequence of instructions.
    • 9. The system of claim 8, wherein
      • the storage system is further operable to perform the operations of: collecting, by one or more performance counters, application-level performance data with low-impact instrumentation, and updating firmware associated with the one or more performance counters by updating software associated with the storage system.
    • 10. The system of claim 8, wherein
      • the storage system is further operable to perform the operations of: associating the one or more performance counters with the given task, the one or more performance counters comprising
  • 11
    11. A computer program product including
    • a non-transitory computer readable storage medium having computer program code encoded thereon that when executed on a processor of a computer causes the computer to operate a storage system, the computer program product comprising: computer program code for generating one or more threads to operate a storage system, the storage system comprising one or more system resources, and each of the one or more threads associated with one of a plurality of tasks of the storage system
    • computer program code for updating one or more performance counters of the storage system in response to a change in operating state of one of the one or more threads
    • and computer program code for generating a performance snapshot by capturing a state of the tasks associated with the threads and the performance counters, wherein generating the performance snapshot comprises: grouping one or more of the threads that are associated with a given task
    • grouping counter values of the one or more performance counters into containers associated with the given task
    • and generating a performance snapshot for each task based upon the grouped one or more threads and the containers associated with the given task, wherein generating a performance snapshot further comprises generating a directed-graph associated with the given task, the directed-graph comprising a plurality of nodes and at least one edge joining associated ones of the nodes, wherein each of the nodes is associated with a synchronization object of an operating system of the storage system, wherein each of the nodes is identified by a two-tuple node key based upon a task identifier associated with the node, and a resource identifier associated with the node, and wherein each of the edges is associated with a respective sequence of instructions.
    • 12. The computer program product of claim 11, wherein
      • the one or more performance counters are operable to collect application-level performance data with low-impact instrumentation, and wherein
See all independent claims <>

Description

BACKGROUND

A distributed storage system may include a plurality of storage devices (e.g., storage arrays) to provide data storage to a plurality of nodes. The plurality of storage devices and the plurality of nodes may be situated in the same physical location, or in one or more physically remote locations. The plurality of nodes may be coupled to the storage devices by a high-speed interconnect, such as a switch fabric.

SUMMARY

This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.

One aspect may provide a method for tracking performance of a storage system including one or more system resources. One or more threads may be generated to operate the storage system. Each of the one or more threads may be associated with one of a plurality of tasks of the storage system. When an operating state of one of the one or more threads is changed, one or more performance counters of the storage system may be updated. A performance snapshot may be generated by capturing a state of the tasks associated with the threads and the performance counters.

Another aspect may provide a system including a processor and a memory storing computer program code that when executed on the processor causes the processor to operate a storage system. The system is operable to track performance of a storage system including one or more system resources. One or more threads may be generated to operate the storage system. Each of the one or more threads may be associated with one of a plurality of tasks of the storage system. When an operating state of one of the one or more threads is changed, one or more performance counters of the storage system may be updated. A performance snapshot may be generated by capturing a state of the tasks associated with the threads and the performance counters.

Another aspect may provide a computer program product including a non-transitory computer readable storage medium having computer program code encoded thereon that when executed on a processor of a computer causes the computer to operate a storage system. The system is operable to track performance of a storage system including one or more system resources. One or more threads may be generated to operate the storage system. Each of the one or more threads may be associated with one of a plurality of tasks of the storage system. When an operating state of one of the one or more threads is changed, one or more performance counters of the storage system may be updated. A performance snapshot may be generated by capturing a state of the tasks associated with the threads and the performance counters.

BRIEF DESCRIPTION OF THE DRAWING FIGURES

Objects, aspects, features, and advantages of embodiments disclosed herein will become more fully apparent from the following detailed description, the appended claims, and the accompanying drawings in which like reference numerals identify similar or identical elements. Reference numerals that are introduced in the specification in association with a drawing figure may be repeated in one or more subsequent figures without additional description in the specification in order to provide context for other features. For clarity, not every element may be labeled in every figure. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating embodiments, principles, and concepts. The drawings are not meant to limit the scope of the claims included herewith.

FIG. 1 is a block diagram of an example of a storage system in accordance with an illustrative embodiment;

FIG. 2 is a block diagram of another example of a storage system in accordance with an illustrative embodiment;

FIG. 3A is a block diagram of an example data packet of an input/output (I/O) operation of the storage system of FIG. 1 in accordance with an illustrative embodiment;

FIG. 3B is a block diagram of an example storage array of the storage system of FIG. 1 in accordance with an illustrative embodiment;

FIG. 3C is a block diagram showing example threads of the storage system of FIG. 1 in accordance with an illustrative embodiment;

FIG. 4 is a flow diagram of an example of a process to operate the storage system of FIG. 1 in accordance with an illustrative embodiment;

FIG. 5 is a flow diagram of an example of a process to generate a performance snapshot in accordance with an illustrative embodiment;

FIG. 6 is a block diagram of illustrative data structures of a performance snapshot in accordance with an illustrative embodiment;

FIG. 7 is an illustrative task-specific directed-graph showing performance of the storage system in accordance with an illustrative embodiment; and

FIG. 8 is a block diagram of an example of a hardware device that may perform at least a portion of the processes in FIGS. 4 and 5.

DETAILED DESCRIPTION

FIG. 1 shows an example storage system 100, in accordance with illustrative embodiments. Storage system 100 may include at least one source site 102 and at least one target site 112, which may be co-located or geographically separated. Source site 102 may include one or more processors 105, storage application 106, and storage 108. In some embodiments, storage 108 may include one or more storage volumes 1351-S, that operate as active or production volumes. Source site 102 and target site 112 may be in communication with one or more hosts 113 via communication links 111 and 115, respectively.

Hosts 113 may perform input/output (I/O) operations on source-side storage 108 (e.g., read data from and write data to storage 108). In some embodiments, the I/O operations may be intercepted by and controlled by storage application 106. As changes are made to data stored on storage 108 via the I/O operations from hosts 113, or over time as storage system 100 operates, storage application 106 may perform operations to replicate data from source site 102 to target site 112 over communication link 110. In some embodiments, communication link 110 may be a long distance communication link of a storage area network (SAN), such as an Ethernet or Internet (e.g., TCP/IP) link that may employ, for example, the iSCSI protocol. In some embodiments, one or both of source site 102 and/or target site 112 may include one or more internal (e.g., short distance) communication links (shown as communication links 109 and 119), such as an InfiniBand (IB) link or Fibre Channel (FC) link. Communication link 109 may be employed to transfer data between storage volumes 1351-S of storage 108 and one or both of storage application 106 and processor(s) 105. Communication link 119 may be employed to transfer data between storage volumes 1391-z of storage 137 and one or both of replica manager 116 and processor(s) 133.

In illustrative embodiments, target site 112 may include replica manager 116 that manages a plurality of replicas 1181-N according to a policy 114 (e.g., a replication and/or retention policy). Replicas 118 may be stored in one or more volumes 1391-z of storage 137 of target site 112. A replica (or snapshot) may be created from data within storage 108 and transferred to one or more target sites 112 during a data replication cycle that may be performed based on data replication policies (e.g., policy 114) that may define various settings for data recovery operations. A data replication cycle may be asynchronous data replication performed at time-based intervals during operation of storage system 100, or may alternatively be synchronous data replication performed when data is changed on source site 102.

In illustrative embodiments, storage system 100 may include one or more consistency groups. A consistency group 147 may include one or more volumes 135 of source site 102, each associated with a corresponding volume 139 of target site 112. Consistency group 147 may treat source volumes 135 and target volumes 139 as a single logical entity for data replication and migration. Each volume 139 may store one or more associated replicas 118 that reflect the data in the consistency group 147 at a point in time (e.g., when the replica 118 was created). For example, replicas (e.g., snapshots) 118 may be generated for each source volume 135 of consistency group 147 at the same time, and stored on associated ones of target volumes 139. As shown in FIG. 1, an illustrative consistency group 147 may include two source volumes 1351 and 1352 and two target volumes 1391 and 1392. Each of target volumes 1391 and 1392 may include one or more replicas 118. In some embodiments, replicas 118 for respective source volumes 135 of consistency group 147 may be grouped into sets (e.g., a snapshot set or snapset 145).

Referring to FIG. 2, in an illustrative embodiment, apparatus 206 may form part of system 200 and include memory 208 storing program logic 210, processor 212 for executing process 214, and communications I/O interface 218, connected via a bus 216 to allow communication between memory 208, processor 212 and devices external to apparatus 206. For example, in some embodiments, communications I/O interface 218 may be coupled to apparatus 206, external media 220, one or more I/O devices 222, and a display device 224. In some embodiments, communications I/O interface 218 may couple apparatus 206 to one or more source devices 2021-202X via network 204. In some embodiments, communications I/O interface 218 may couple apparatus 206 to one or more target devices 2281-228Y via network 226. In some embodiments, network 226 of FIG. 2 may be a communication fabric between volumes of targets 228. For example, in some embodiments, network 226 may be an InfiniBand (IB) network or a Fibre Channel (FC) network.

Referring back to FIG. 1, in some embodiments, one of hosts 113 may send an I/O request (e.g., I/O request 151) to perform an I/O operation on storage 108 of source site 102. For example, I/O request 151 may be a request to read an associated amount of data from storage 108, or may be a request to write an associated amount of data to storage 108. In some embodiments, I/O request 151 may include one or more data packets. For example, FIG. 3A shows a block diagram of an illustrative data packet 310. As shown in FIG. 3A, in some embodiments, data packet 310 may include one or more of header data 312, payload data 314 and footer data 316. Payload data 314 may be the data to be written to storage 108 or data that is read from storage 108 (e.g., user data), and header data 312 and/or footer data 316 may be data associated with I/O request 151 that may be employed by storage system 100 to process I/O request 151 (e.g., source and/or destination address information, error correction information, data and/or packet format information, metadata, and other information).

In some embodiments, payload data 314 may be segmented into one or more payload data segments to be written to storage 108 (e.g., by one or more write operations 153) or read from storage 108 (e.g., by one or more read operations 159). For example, if payload data 314 is 256 KB, payload data 314 may be segmented into sixteen 16 KB payload data segments to be written to storage 108. When I/O request 151 is a write request, processor(s) 105 and/or storage application 106 may then perform one or more corresponding write operations (e.g., write operation 153) to write payload data associated with the one or more data packets (e.g., one or more payload data segments) of I/O request 151 to storage 108. When I/O request 151 is a read request, processor(s) 105 and/or storage application 106 may then read data from storage 108 in one or more packets (e.g., one or more read operations 159) to process I/O request 151 from storage 108.

In illustrative embodiments, source site 102 may send a replica (e.g., replica 155) to target site 112. Similarly to write request 151, replica 155 may include one or more data packets such as shown in FIG. 3A. Processor(s) 133 and/or replica manager 116 may then perform one or more corresponding write operations (e.g., write operation 157) to write payload data (e.g., one or more payload data segments) associated with the one or more data packets of replica 155 to storage 137. Similarly, replica manager 161 may read replica data from storage 137 by one or more read operations 161. In some embodiments, data packet 310 may be a data packet formatted in accordance with the TCP/IP and iSCSI protocols.

Referring to FIG. 3B, a block diagram of an illustrative storage array 302 is shown. For example, in illustrative embodiments, one or both of storage 108 and storage 137 may be implemented as storage array 302. As shown, in some embodiments, storage array 302 may include one or more clusters 3041-304Q (referred to generally as clusters 304) where Q may be a positive integer. In illustrative embodiments, clusters 304 may include one or more physical and/or virtual storage volumes, shown generally as storage volumes 306. For example, cluster 3041 may include storage volumes 3061,1-3061,R, where R may be a positive integer. For example, clusters 304 may include one or more physical storage volumes such as hard disk drives (HDDs), solid state drives (SSDs) such as flash drives, a hybrid magnetic and solid state drive, etc., and/or one or more virtual storage volumes, such as a cloud storage, or a combination of physical storage volumes and virtual storage volumes.

Described embodiments provide performance analysis of storage system 100. Some embodiments may employ one or more performance counters associated with resources of storage system 100 (e.g., CPU resources, operating system resources, etc.), and one or more application-specific or task-specific performance counters associated with individual applications, services or tasks of storage system 100. Described embodiments provide a manner for identifying relationships between the various performance counters and the application flow without requiring manual instrumentation upgrades with each new version of operating system (OS) software for storage system 100.

Described embodiments may employ one or more threads to perform operations of storage system 100 (e.g., operations associated with I/O request 151). For example, as shown in FIG. 3C, processors 371 (e.g., one or more or processors 105 and/or processors 133) may employ one or more threads 379. Each thread 379 may be a thread of one or more instructions 377 that are performed by storage system 100. Each thread 379 may also include context 373. Context 373 may include one or more synchronization objects 376. In some embodiments, threads 379 may optionally be in communication with one or more external synchronization objects 381. For example, synchronization objects 376 and/or 381 may include a lock, a semaphore, or an event, by which threads may communicate with one another.

Illustrative embodiments may monitor performance of threads (e.g., 379) that are grouped by the application-level task the threads perform. For example, some embodiments may group threads based on the thread's entry function and/or an additional operation code.

Some embodiments may monitor performance of tasks using directed-graphs (diagrams). The performance data may be collected in one or more points-of-interest into performance data containers. Performance data containers may be presented as nodes and edges of the directed-graph related to a specific task. For example, a performance data container may be represented as a node of a directed-graph for a specific task. An example of a performance data container that may be represented as a node is an OS synchronization object (e.g., synchronization objects 376 and/or 381 of FIG. 3C). Sequences of processor instructions (e.g., instructions 377 of FIG. 3C) between two nodes may be represented as edges of a directed-graph for a specific task. Since each node represents a system resource, data structure or a stage of processing for a given task, the directed-graph provides a visual representation of processing flows for a given task.

Referring to FIG. 6, illustrative data structures employed to track the performance of storage system 100 are shown. As shown, thread description structure 602 may include an associated TASK_ID 604 and an associated performance data container 606. OS synchronization object description structure 612 may include an associated RESOURCE_ID 614 and an associated performance data container 616. Directed-graph node key 622 may include an associated TASK_ID 624 and an associated RESOURCE_ID 626, and directed-graph edge key 632 may include an associated TASK_ID 634, an associated first RESOURCE_ID 636, and an associated second RESOURCE_ID 638 that define the sequence of instructions between two resource nodes of the directed-graph.

Referring to FIG. 7, an illustrative directed-graph 700 is shown. As shown in FIG. 7, directed-graph 700 may include one or mode nodes, for example shown as nodes 702, 706, and 710. Each of nodes 702, 706, and 710 may have an associated key (e.g., 622 of FIG. 6) that is based upon a TASK_ID and RESOURCE_ID associated with the given node. As shown, two nodes may be joined by an associated edge, such as edges 704 and 708. Each of edges 704 and 708 may have an associated key (e.g., 632 of FIG. 6) that is based upon a TASK_ID, a first RESOURCE_ID, and a second RESOURCE_ID associated with the given node.

In described embodiments, threads may be in one of three main operating states: RUNNING, READY, or SUSPENDED. The RUNNING operating state indicates that the thread is presently running, while the READY operating state indicates that the thread is ready to be performed, but is waiting for processor resources to be available, and the SUSPENDED operating state indicates that the thread is stopped (e.g., suspended) at a synchronization object. Described embodiments may update the one or more performance counters when a thread transitions between operating states.

Described embodiments may collect application level performance data without much instrumentation (e.g., low-impact) by employing the performance counters. For example, performance counters may be updated upon operating state transitions of given threads, such that updating the performance counters may not require much system resources or complex tracking mechanisms. Further, described embodiments may provide for performance tracking functionality that may be upgradable with versions of software operating on storage system 100. For example, the one or more performance counters may be implemented in a thread scheduler operating in storage system 100 (e.g., in one of processors). Upgrades to the performance counters may be accomplished by upgrading the thread scheduler, which is a stable and basic component, such that performance tracking instrumentation is automatically upgraded when the system software is upgraded.

The one or more performance counters collected for each performance data container may vary based upon a setup of storage system 100. Some embodiments may employ performance counters to collect data for each directed-graph node, and the performance counters may include counters for accumulating a number of accesses, accumulating a number of requested units (for cases when a single access contains a batch of requested units (e.g., data blocks)), accumulating suspended time, determining an average number of suspended requests, and other data. Some embodiments may employ additional performance counters to collect data for each directed-graph edge, and the performance counters may include counters for accumulating a number of passes (e.g., a number of times a given sequence of instructions have been performed), accumulating a run time (e.g., a time in the RUNNING state), accumulating a time in the READY state, accumulating a number of cooperative yields (e.g., a number of times one thread has yielded a resource to another thread), and other data.

Described embodiments may track performance of storage system 100 by periodically generating a snapshot of the performance counters. In some embodiments, a snapshot mechanism may be implemented by an independent OS process (e.g., a process operating concurrently with other OS processes of storage system 100). For example, in an illustrative embodiment, the snapshot mechanism may operate as described in U.S. Pat. No. 9,141,290, filed May 13, 2012, entitled “Snapshot Mechanism,” assigned to EMC Corporation, the teachings of which are incorporated by reference herein in their entirety. The snapshot process may utilize processor and storage resources that are not associated with high-performance flows. In other words, the snapshot process may be performed as a background and/or low-priority process of storage system 100. A snapshot interval (e.g., how frequently the snapshot process is performed) may be a tradeoff between the time-precision of the performance tracking and the system resources consumed by generating snapshots. In some embodiments, the snapshot interval may be a value set by a user of storage system 100. In some embodiments, the snapshot interval may be dynamically adjusted by storage system 100 based upon one or more operating conditions of the storage system (e.g., availability of processor 105 and/or 133, available space of storage 108 and/or 137, etc.).

Performance data containers may be identified by unique keys. In described embodiments, the keys may be based upon a globally (e.g., within storage system 100) unique task identifier (TASK_ID) associated with the task, and a globally unique resource identifier (RESOURCE_ID) associated with a resource associated with the task. For example, a thread description structure associated with each unique thread may include a field indicating the TASK_ID associated with the given thread. Similarly, each OS synchronization object (e.g., synchronization objects 376 and/or 381 of FIG. 3C) may have an associated description structure that may include a field indicating the RESOURCE_ID of the given synchronization object.

The keys for the directed-graph nodes may be two-tuples based upon the corresponding TASK_ID and RESOURCE_ID, and the keys for the directed-graph edges (e.g., sequences of processor instructions between two nodes) may be three-tuples based upon the TASK_ID and the RESOURCE IDs for each of the two nodes that define the given edge.

Referring back to FIG. 4, a flow diagram of an illustrative process for operating storage system 100 of FIG. 1 is shown as process 400. At block 402, process 400 starts, for example when storage system 100 is powered on. At block 404, storage system 100 initializes one or more resource-specific performance counters and one or more application-specific performance counters to track performance of storage system 100. At block 406, storage system 100 generates one or more threads to operate the storage system. At block 408, storage system 100 monitors a state of each thread (e.g., RUNNING, READY, or SUSPENDED). At block 410, if the state of a given thread has changed, then at block 412, the performance counters of storage system 100 may be updated.

Process 400 returns to block 406 as threads are created and processed to operate storage system 100. If, at block 410, the state of a given thread has not changed, then process 400 returns to block 408.

As indicated by the dashed line, snapshot process 414 may be performed concurrently with (e.g., in parallel with) blocks 406, 408, 410, and 412 of process 400. At block 416, a snapshot interval may be started for generating a snapshot of the performance counter data. If, at block 418, the snapshot interval is complete, then at block 420, a snapshot of the performance counter data may be generated. Block 420 is described in greater detail in regard to FIG. 5. Snapshot process 414 returns to block 416 to begin a subsequent snapshot interval. Processes 400 and 414 may continue to operate until storage system 100 is powered off.

FIG. 5 shows additional detail of block 420 of FIG. 4 for generating a snapshot of the performance counter data, shown as process 420′. As shown in FIG. 5, process 420′ may start at block 502. At block 504, storage system 100 may group one or more threads by a task associated with each thread. At block 506, performance counter data is grouped into one or more related performance data containers. For example, as described herein, a performance data container may be associated with an OS synchronization object. At block 508, one or more task-specific directed-graphs may be generated and provided to a user of storage system 100. At block 510, process 420′ completes.

Referring to FIG. 8, in some embodiments, source site 102 and/or target site 112 may be implemented as one or more computers. Computer 800 may include processor 802, volatile memory 804 (e.g., RAM), non-volatile memory 806 (e.g., a hard disk drive, a solid state drive such as a flash drive, a hybrid magnetic and solid state drive, etc.), graphical user interface (GUI) 808 (e.g., a touchscreen, a display, and so forth) and input/output (I/O) device 820 (e.g., a mouse, a keyboard, etc.). Non-volatile memory 806 stores computer instructions 812, an operating system 816 and data 818 such that, for example, the computer instructions 812 are executed by the processor 802 out of volatile memory 804 to perform at least a portion of processes 400 and 420′ (FIGS. 4 and 5). Program code may be applied to data entered using an input device of GUI 808 or received from I/O device 820.

Processes 400 and 420′ (FIGS. 4 and 5) are not limited to use with the hardware and software of FIG. 8 and may find applicability in any computing or processing environment and with any type of machine or set of machines that may be capable of running a computer program. Processes 400 and 420′ (FIGS. 4 and 5) may be implemented in hardware, software, or a combination of the two.

The processes described herein are not limited to the specific embodiments described. For example, processes 400 and 420′ are not limited to the specific processing order shown in FIGS. 4 and 5. Rather, any of the blocks of processes 400 and 420′ may be re-ordered, combined or removed, performed in parallel or in serial, as necessary, to achieve the results set forth herein.

Processor 802 may be implemented by one or more programmable processors executing one or more computer programs to perform the functions of the system. As used herein, the term “processor” describes an electronic circuit that performs a function, an operation, or a sequence of operations. The function, operation, or sequence of operations may be hard coded into the electronic circuit or soft coded by way of instructions held in a memory device. A “processor” may perform the function, operation, or sequence of operations using digital values or using analog signals. In some embodiments, the “processor” can be embodied in an application specific integrated circuit (ASIC). In some embodiments, the “processor” may be embodied in a microprocessor with associated program memory. In some embodiments, the “processor” may be embodied in a discrete electronic circuit. The “processor” may be analog, digital or mixed-signal. In some embodiments, the “processor” may be one or more physical processors or one or more “virtual” (e.g., remotely located or “cloud”) processors.

While illustrative embodiments have been described with respect to processes of circuits, described embodiments may be implemented as a single integrated circuit, a multi-chip module, a single card, or a multi-card circuit pack. Further, as would be apparent to one skilled in the art, various functions of circuit elements may also be implemented as processing blocks in a software program. Such software may be employed in, for example, a digital signal processor, micro-controller, or general purpose computer. Thus, described embodiments may be implemented in hardware, a combination of hardware and software, software, or software in execution by one or more processors.

Some embodiments may be implemented in the form of methods and apparatuses for practicing those methods. Described embodiments may also be implemented in the form of program code, for example, stored in a storage medium, loaded into and/or executed by a machine, or transmitted over some transmission medium or carrier, such as over electrical wiring or cabling, through fiber optics, or via electromagnetic radiation. A non-transitory machine-readable medium may include but is not limited to tangible media, such as magnetic recording media including hard drives, floppy diskettes, and magnetic tape media, optical recording media including compact discs (CDs) and digital versatile discs (DVDs), solid state memory such as flash memory, hybrid magnetic and solid state memory, non-volatile memory, volatile memory, and so forth, but does not include a transitory signal per se. When embodied in a non-transitory machine-readable medium, and the program code is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the method.

When implemented on a processing device, the program code segments combine with the processor to provide a unique device that operates analogously to specific logic circuits. Such processing devices may include, for example, a general purpose microprocessor, a digital signal processor (DSP), a reduced instruction set computer (RISC), a complex instruction set computer (CISC), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a programmable logic array (PLA), a microcontroller, an embedded controller, a multi-core processor, and/or others, including combinations of the above. Described embodiments may also be implemented in the form of a bitstream or other sequence of signal values electrically or optically transmitted through a medium, stored magnetic-field variations in a magnetic recording medium, etc., generated using a method and/or an apparatus as recited in the claims.

Various elements, which are described in the context of a single embodiment, may also be provided separately or in any suitable subcombination. It will be further understood that various changes in the details, materials, and arrangements of the parts that have been described and illustrated herein may be made by those skilled in the art without departing from the scope of the following claims.

Read more
PatSnap Solutions

Great research starts with great data.

Use the most comprehensive innovation intelligence platform to maximise ROI on research.

Learn More

Citation

Patents Cited in This Cited by
Title Current Assignee Application Date Publication Date
Data alignment systems and methods INTEL CORPORATION 29 December 2003 30 June 2005
System and method for increasing the effective bandwidth of a communications network ARTERA GROUP, INC. 04 June 2002 24 April 2003
Methods and apparatus for increasing data storage capacity EMC IP HOLDING COMPANY LLC 26 February 2004 01 September 2005
System and method for replicating files in a computer network GLOBALSCAPE, INC. 05 January 2005 11 August 2005
Memory efficient hashing algorithm CISCO TECHNOLGY, INC. 02 February 2004 04 August 2005
See full citation <>

More Patents & Intellectual Property

PatSnap Solutions

PatSnap solutions are used by R&D teams, legal and IP professionals, those in business intelligence and strategic planning roles and by research staff at academic institutions globally.

PatSnap Solutions
Search & Analyze
The widest range of IP search tools makes getting the right answers and asking the right questions easier than ever. One click analysis extracts meaningful information on competitors and technology trends from IP data.
Business Intelligence
Gain powerful insights into future technology changes, market shifts and competitor strategies.
Workflow
Manage IP-related processes across multiple teams and departments with integrated collaboration and workflow tools.
Contact Sales
Clsoe
US10152232 Low-impact application-level performance monitoring 1 US10152232 Low-impact application-level performance monitoring 2 US10152232 Low-impact application-level performance monitoring 3