US20070076627A1 - Efficient accumulation of performance statistics in a multi-port network - Google Patents

Efficient accumulation of performance statistics in a multi-port network Download PDF

Info

Publication number
US20070076627A1
US20070076627A1 US11/555,818 US55581806A US2007076627A1 US 20070076627 A1 US20070076627 A1 US 20070076627A1 US 55581806 A US55581806 A US 55581806A US 2007076627 A1 US2007076627 A1 US 2007076627A1
Authority
US
United States
Prior art keywords
link
port
calculating
network
operations
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US11/555,818
Inventor
Matthew Kalos
Michael Benhase
James Chen
Patricia Lu
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Priority to US11/555,818 priority Critical patent/US20070076627A1/en
Publication of US20070076627A1 publication Critical patent/US20070076627A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/34Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3409Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment for performance assessment
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/34Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3466Performance evaluation by tracing or monitoring
    • G06F11/3485Performance evaluation by tracing or monitoring for I/O devices
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2201/00Indexing scheme relating to error detection, to error correction, and to monitoring
    • G06F2201/88Monitoring involving counting
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0604Improving or facilitating administration, e.g. storage management
    • G06F3/0605Improving or facilitating administration, e.g. storage management by facilitating the interaction with a user or administrator
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0653Monitoring storage devices or systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/067Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]

Definitions

  • the present invention relates generally to large computer networks and, in particular, to accumulating statistics related to the performance of links associated with ports connected to the network.
  • I/O input/output
  • Statistics of interest can include the number of I/O operations a link can handle (in operations per second); the bandwidth of a link (in megabytes (MB) per second); the average number of concurrent operations using a link during a time period; the average transfer length (in MB/operation); and the average link utilization per operation (in micro-seconds/operation).
  • Such statistics may be used in real time to trigger fault procedures if a large variance from a normal value indicates the existence of a possible problem.
  • Statistics may also kept in a log to be referenced during normal maintenance or problem resolution.
  • statistics may be calculated by a network server, such as an Enterprise Storage Server® (ESS) sold by IBM® and may be maintained by one or more attached host devices.
  • ESS Enterprise Storage Server®
  • each device port may include more than one link type, such as ECKDTM (extended count key data), PPRC (peer-to-peer remote copy), and SCSI (small computer system interface). Consequently, it is desirable to generate statistics on a link type basis to provide a higher level of detail than generating statistics only by port.
  • ECKDTM extended count key data
  • PPRC peer-to-peer remote copy
  • SCSI small computer system interface
  • the present invention provides computer networks with an ability to efficiently generate link performance statistics.
  • a first counter accumulates the number of I/O operations processed by a link and a second counter accumulates the time required by the link to complete each I/O operation. The second value is then divided by the first value.
  • the number of operations per second for a link may be computed by dividing the first number by a predetermined period of time and the average number of operations using the link may be computed by dividing the second number by the predetermined period of time.
  • a third counter may be employed to accumulate the number of bytes transferred by a link during each I/O operation.
  • the average size of an I/O operation may be computed by dividing the third number by the first number and the average bandwidth per link operation may be computed by dividing the third number by the predetermined period of time.
  • Separate sets of counters are preferably associated with each of several link types associated with a single port, thereby allowing separate statistics to be generated for each link type. The generated statistics are useful for such activities as problem resolution, load balancing and capacity planning.
  • FIG. 1 is a block diagram of a data network in which the present invention may be implemented.
  • FIG. 2 is a block diagram of a multi-port, multi-link storage server.
  • FIG. 1 is a block diagram of a data network 100 in which the present invention may be implemented.
  • the network 100 includes one or more host devices 102 and 104 , a controller or server 110 and other storage servers 120 , 122 , 200 with attached data storage devices 121 , 123 and 125 .
  • Other devices 130 and 132 may also be attached to the network 100 .
  • the controller 110 may be an IBM Enterprise Storage Server and includes a processor 112 , memory 114 and counters 116 as well as appropriate network interfaces 118 .
  • the processor 112 is programmed with instructions stored in the memory 114 for managing I/O operations requested by the host devices 102 , 104 as well as for computing network I/O performance statistics.
  • the storage devices 121 , 123 , 125 may be any type of removable or fixed physical storage including, without limitation, electronic memory (such as RAM or solid state memory), hard disks, RAID arrays, tape cartridges, optical discs and other media. Removable media may be (but need not be) contained with an automated data storage library. As will be appreciated, the counters 116 may be implemented in hardware or software.
  • FIG. 2 is a block diagram of the storage server 200 .
  • the storage server 200 includes one or more ports 210 , 220 , 230 and each port may accommodate one or more network links.
  • a port 210 may accommodate three link types such as ECKD 212 , PPRC 214 and SCSI 216 .
  • link types such as ECKD 212 , PPRC 214 and SCSI 216 .
  • data transmitted/received over different link types may actually travel over a single physical path to/from the network.
  • multiplexing permits all of the links of a port to be used essentially in a simultaneous manner.
  • a first counter provides an accumulated count of the number of I/O operations processed through the link.
  • a second counter provides the accumulated utilization time (in microseconds or other appropriate unit of time) associated with each I/O operation.
  • a third counter provides an accumulated bandwidth comprising the number of bytes transferred by each I/O operation through the link.
  • the utilization time indicates how long a port processor is active with a particular I/O operation and is useful in determining the port's contribution to any delay. Using only the three counters for each port reduces the processing resources required for obtaining performance statistics. From the three counters, a variety of statistics may be computed.
  • a time period ⁇ T is selected, such as by pre-programming the controller 110 , by action of a host device, by a network administrator or by a maintenance technician.
  • the time periods selected for each of the three counters are preferably the same.
  • the time period selected should be long enough to provide meaningful values but not so long that a counter overflows and wraps around to 0 before the end of the period.
  • the time period must also be selected according to the data rate of the link. For example, one user may wish to sample rapidly at the rate of approximately ⁇ T equals one second while another user may wish to sample more slowly at the rate of ⁇ T equals 30 minutes.
  • the counters should be of sufficient size to allow for both one second sampling and 30 minute sampling without overflowing.
  • a counter capacity of 128K allows for measurement of one second samples with link data rates as low as 128KB/sec. while also allowing measurement of 30 minute samples with link data rates of 150 GB/sec. While larger counter capacities will accommodate longer sampling periods, larger counters require the use of more hardware.
  • Four-byte counters have been found to accommodate a wide range of link data rates and sampling rates.
  • each counter is sampled first at the beginning of the selected time period and then at the end of the period, thereby providing a delta value for each.
  • Initial and final readings of the first counter provide a count ⁇ A of the number of I/O operations processed through the link during the period ⁇ T.
  • Initial and final readings of the second counter provide third counter provide the utilization time ⁇ B associated with I/O operations during the period ⁇ T.
  • initial and final readings of the bandwidth ⁇ C of the link during the period ⁇ T The statistics may then be computed by the controller 110 :
  • separate counters may be included in the controller 110 to track read operation data separate from write operation data for each link, such as: number of read operations and of write operations; number of bytes read and bytes written; and the response time for read operations and for write operations.
  • the statistics may be stored and subsequently analyzed automatically or output or displayed, such as through a device 130 , for a user to analyze.

Abstract

Computer networks are provided with a resource efficient ability to generate link performance statistics. To calculate the average link utilization per I/O operation, a first counter accumulates the number of I/O operations processed by a link and a second counter accumulates the time required by the link to complete each I/O operation. The second value is then divided by the first value. The number of operations per second for a link may be computed by dividing the first number by a predetermined period of time and the average number of operations using the link may be computed by dividing the second number by the predetermined period of time. A third counter may be employed to accumulate the number of bytes transferred by a link during each I/O operation. Then, average size of an I/O operation may be computed by dividing the third number by the first number and the average bandwidth per link operation may be computed by dividing the third number by the predetermined period of time. Separate sets of counters are preferably associated with each of several link types associated with a single port, thereby allowing separate statistics to be generated for each link type. The generated statistics are useful for such activities as problem resolution, load balancing and capacity planning.

Description

    CROSS-REFERENCED APPLICATIONS
  • This application is a divisional application of, and claims priority from, commonly-assigned and co-pending U.S. patent Ser. No. 10/911,904, entitled EFFICIENT ACCUMULATION OF PERFORMANCE STATISTICS IN A MULTI-PORT NETWORK, filed Aug. 4, 2004, which application is incorporated herein by reference.
  • TECHNICAL FIELD
  • The present invention relates generally to large computer networks and, in particular, to accumulating statistics related to the performance of links associated with ports connected to the network.
  • BACKGROUND ART
  • In large data network environments, it is important to be able to obtain statistics about the performance of input/output (I/O) operations on the physical network, such as the links which connected ports of different network devices. Statistics of interest can include the number of I/O operations a link can handle (in operations per second); the bandwidth of a link (in megabytes (MB) per second); the average number of concurrent operations using a link during a time period; the average transfer length (in MB/operation); and the average link utilization per operation (in micro-seconds/operation).
  • Such statistics may be used in real time to trigger fault procedures if a large variance from a normal value indicates the existence of a possible problem. Statistics may also kept in a log to be referenced during normal maintenance or problem resolution. Typically, statistics may be calculated by a network server, such as an Enterprise Storage Server® (ESS) sold by IBM® and may be maintained by one or more attached host devices. However, due to the large number of links between components in a network, collecting data and sampling the collected data to compute statistics can consume a large amount of valuable network resources. Consequently, it is desirable to provide for more efficient data collection and statistic generation.
  • Moreover, each device port may include more than one link type, such as ECKD™ (extended count key data), PPRC (peer-to-peer remote copy), and SCSI (small computer system interface). Consequently, it is desirable to generate statistics on a link type basis to provide a higher level of detail than generating statistics only by port.
  • SUMMARY OF THE INVENTION
  • The present invention provides computer networks with an ability to efficiently generate link performance statistics. To calculate the average link utilization per I/O operation, a first counter accumulates the number of I/O operations processed by a link and a second counter accumulates the time required by the link to complete each I/O operation. The second value is then divided by the first value. The number of operations per second for a link may be computed by dividing the first number by a predetermined period of time and the average number of operations using the link may be computed by dividing the second number by the predetermined period of time. A third counter may be employed to accumulate the number of bytes transferred by a link during each I/O operation. Then, the average size of an I/O operation may be computed by dividing the third number by the first number and the average bandwidth per link operation may be computed by dividing the third number by the predetermined period of time. Separate sets of counters are preferably associated with each of several link types associated with a single port, thereby allowing separate statistics to be generated for each link type. The generated statistics are useful for such activities as problem resolution, load balancing and capacity planning.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a block diagram of a data network in which the present invention may be implemented; and
  • FIG. 2 is a block diagram of a multi-port, multi-link storage server.
  • DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
  • FIG. 1 is a block diagram of a data network 100 in which the present invention may be implemented. The network 100 includes one or more host devices 102 and 104, a controller or server 110 and other storage servers 120, 122, 200 with attached data storage devices 121, 123 and 125. Other devices 130 and 132 may also be attached to the network 100. The controller 110 may be an IBM Enterprise Storage Server and includes a processor 112, memory 114 and counters 116 as well as appropriate network interfaces 118. The processor 112 is programmed with instructions stored in the memory 114 for managing I/O operations requested by the host devices 102, 104 as well as for computing network I/O performance statistics. The storage devices 121, 123, 125 may be any type of removable or fixed physical storage including, without limitation, electronic memory (such as RAM or solid state memory), hard disks, RAID arrays, tape cartridges, optical discs and other media. Removable media may be (but need not be) contained with an automated data storage library. As will be appreciated, the counters 116 may be implemented in hardware or software.
  • FIG. 2 is a block diagram of the storage server 200. The storage server 200 includes one or more ports 210, 220, 230 and each port may accommodate one or more network links. For example, a port 210 may accommodate three link types such as ECKD 212, PPRC 214 and SCSI 216. Although shown separately in FIG. 2, data transmitted/received over different link types may actually travel over a single physical path to/from the network. Moreover, multiplexing permits all of the links of a port to be used essentially in a simultaneous manner.
  • For each link of each port, there are preferably three corresponding counters in the controller 110. A first counter provides an accumulated count of the number of I/O operations processed through the link. A second counter provides the accumulated utilization time (in microseconds or other appropriate unit of time) associated with each I/O operation. And, a third counter provides an accumulated bandwidth comprising the number of bytes transferred by each I/O operation through the link. The utilization time indicates how long a port processor is active with a particular I/O operation and is useful in determining the port's contribution to any delay. Using only the three counters for each port reduces the processing resources required for obtaining performance statistics. From the three counters, a variety of statistics may be computed.
  • Before statistics can be computed, the counters must be sampled. A time period ΔT is selected, such as by pre-programming the controller 110, by action of a host device, by a network administrator or by a maintenance technician. The time periods selected for each of the three counters are preferably the same. The time period selected should be long enough to provide meaningful values but not so long that a counter overflows and wraps around to 0 before the end of the period. The time period must also be selected according to the data rate of the link. For example, one user may wish to sample rapidly at the rate of approximately ΔT equals one second while another user may wish to sample more slowly at the rate of ΔT equals 30 minutes. Thus, the counters should be of sufficient size to allow for both one second sampling and 30 minute sampling without overflowing. A counter capacity of 128K allows for measurement of one second samples with link data rates as low as 128KB/sec. while also allowing measurement of 30 minute samples with link data rates of 150 GB/sec. While larger counter capacities will accommodate longer sampling periods, larger counters require the use of more hardware. Four-byte counters have been found to accommodate a wide range of link data rates and sampling rates.
  • In operation, each counter is sampled first at the beginning of the selected time period and then at the end of the period, thereby providing a delta value for each. Initial and final readings of the first counter provide a count ΔA of the number of I/O operations processed through the link during the period ΔT. Initial and final readings of the second counter provide third counter provide the utilization time ΔB associated with I/O operations during the period ΔT. And, initial and final readings of the bandwidth ΔC of the link during the period ΔT. The statistics may then be computed by the controller 110:
      • Average link utilization per operation through the link equals ΔB/ΔA
      • I/O operations per second equals ΔA/ΔT;
      • Average number of concurrent operations using the link equals ΔB/ΔT;
      • Bandwidth in MB/sec equals ΔC/ΔT; and
      • Average bandwidth per operation through the link equals ΔC/ΔA.
  • If desired, separate counters may be included in the controller 110 to track read operation data separate from write operation data for each link, such as: number of read operations and of write operations; number of bytes read and bytes written; and the response time for read operations and for write operations. After being computed, the statistics may be stored and subsequently analyzed automatically or output or displayed, such as through a device 130, for a user to analyze.
  • The objects of the invention have been fully realized through the embodiments disclosed herein. Those skilled in the art will appreciate that the various aspects of the invention may be achieved through different embodiments without departing from the essential function of the invention. The particular embodiments are illustrative and not meant to limit the scope of the invention as set forth in the following claims.

Claims (11)

1. A method for computing statistics in a multi-port data network, comprising:
for each port in the network:
accumulating a number A of I/O operations processed by a link coupled to the port; and
accumulating a time B required by the link to complete each I/O operation;
selecting a time period ΔT during which statistics are desired;
for each port in the network, calculating the average link utilization per operation ΔB/ΔA; and
outputting the statistics for analysis.
2. The method of claim 1, further comprising:
for each port in the network, accumulating a number C of bytes transferred during each I/O operation; and
for each port in the network:
calculating operations per second ΔA/ΔT, where ΔA equals the number of I/O operations processed by the link during the time period ΔT;
calculating average number of operations using the link ΔB/ΔT, where ΔB equals the time required by the link to complete each I/O operation during the time period ΔT;
calculating MB/sec ΔC/ΔT, where ΔC equals the number of bytes transferred during each I/O operation processed by the link during the time period ΔT; and
calculating the average bandwidth per operation ΔC/ΔA.
3. The method of claim 1, wherein:
a plurality of link types are associated with each of at least two ports in the network; and
the steps of accumulating and calculating comprise accumulating and calculating for each link associated with each port.
4. The method of claim 3, wherein the link types are selected from the group comprising ECKD links, PPRC links and SCSI links.
5. The method of claim 1, wherein calculating is performed by a storage server attached to the network.
6. The method of claim 1, wherein selecting the time period ΔT comprises receiving input from a system administrator.
7. A computer program product of a computer readable medium usable with a programmable computer, the computer program product having computer-readable code embodied therein for for computing statistics in a multi-port data network, the computer-readable code comprising instructions for:
for each port in the network:
accumulating a number A of I/O operations processed by a link coupled to the port; and
accumulating a time B required by the link to complete each I/O operation;
selecting a time period ΔT during which statistics are desired;
for each port in the network calculating the average link utilization per operation ΔB/ΔA; and
outputting the statistics for analysis.
8. The computer program product of claim 7,
for each port in the network, accumulating a number C of bytes transferred during each I/O operation; and
for each port in the network:
calculating operations per second ΔA/ΔT, where ΔA equals the number of I/O operations processed by the link during the time period ΔT;
calculating average number of operations using the link ΔB/ΔT, where ΔB equals the time required by the link to complete each I/O operation during the time period ΔT;
calculating MB/sec ΔC/ΔT, where ΔC equals the number of bytes transferred during each I/O operation processed by the link during the time period ΔT; and
calculating the average bandwidth per operation ΔC/ΔA.
9. The computer program product of claim 7, wherein:
a plurality of link types are associated with each of at least two ports in the network; and
the instructions for accumulating and calculating comprise instructions for accumulating and calculating for each link associated with each port.
10. The computer program product of claim 9, wherein the link types are selected from the group comprising ECKD links, PPRC links and SCSI links.
11. The computer program product of claim 7, wherein the instructions for selecting the time period ΔT comprise instructions for receiving input from a system administrator.
US11/555,818 2004-08-04 2006-11-02 Efficient accumulation of performance statistics in a multi-port network Abandoned US20070076627A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US11/555,818 US20070076627A1 (en) 2004-08-04 2006-11-02 Efficient accumulation of performance statistics in a multi-port network

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US10/911,904 US7117118B2 (en) 2004-08-04 2004-08-04 Efficient accumulation of performance statistics in a multi-port network
US11/555,818 US20070076627A1 (en) 2004-08-04 2006-11-02 Efficient accumulation of performance statistics in a multi-port network

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US10/911,904 Division US7117118B2 (en) 2004-08-04 2004-08-04 Efficient accumulation of performance statistics in a multi-port network

Publications (1)

Publication Number Publication Date
US20070076627A1 true US20070076627A1 (en) 2007-04-05

Family

ID=35910839

Family Applications (2)

Application Number Title Priority Date Filing Date
US10/911,904 Expired - Fee Related US7117118B2 (en) 2004-08-04 2004-08-04 Efficient accumulation of performance statistics in a multi-port network
US11/555,818 Abandoned US20070076627A1 (en) 2004-08-04 2006-11-02 Efficient accumulation of performance statistics in a multi-port network

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US10/911,904 Expired - Fee Related US7117118B2 (en) 2004-08-04 2004-08-04 Efficient accumulation of performance statistics in a multi-port network

Country Status (1)

Country Link
US (2) US7117118B2 (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7543128B2 (en) * 2006-07-25 2009-06-02 Hewlett-Packard Development Company, L.P. Method and apparatus for repurposing compute resources to implement, or not implement, storage access protocols
US7643953B2 (en) * 2007-03-07 2010-01-05 Microsoft Corporation Determination of incremental value in server processed data
US8918496B2 (en) 2007-04-30 2014-12-23 Hewlett-Packard Development Company, L.P. System and method for generating synthetic workload traces
US8543711B2 (en) 2007-04-30 2013-09-24 Hewlett-Packard Development Company, L.P. System and method for evaluating a pattern of resource demands of a workload
US8046767B2 (en) * 2007-04-30 2011-10-25 Hewlett-Packard Development Company, L.P. Systems and methods for providing capacity management of resource pools for servicing workloads
US8326970B2 (en) * 2007-11-05 2012-12-04 Hewlett-Packard Development Company, L.P. System and method for modeling a session-based system with a transaction-based analytic model
US20100070656A1 (en) * 2008-09-12 2010-03-18 Atto Technology, Inc. System and method for enhanced load balancing in a storage system
GB2499237A (en) * 2012-02-10 2013-08-14 Ibm Managing a network connection for use by a plurality of application program processes

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6327515B1 (en) * 1999-12-29 2001-12-04 Pitney Bowes Inc. Performance tuning of an inserter system based upon a rolling average of page counts for mailpieces to be processed
US20010056485A1 (en) * 2000-03-28 2001-12-27 Barrett Thomas H. Methods, systems and computer program products for dynamic scheduling and matrix collecting of data about samples
US20020110149A1 (en) * 2001-02-14 2002-08-15 Roberts Jeffrey S. System and method for transferring data over a network
US20020177910A1 (en) * 2000-04-19 2002-11-28 Quarterman John S. Performance measurement system for large computer network
US20030018641A1 (en) * 2001-07-23 2003-01-23 Gotwals Jacob K. Method and system for automatically prioritizing and analyzing performance data for one or more, system configurations
US20030018960A1 (en) * 2001-07-23 2003-01-23 Hacking Lance E. System and a method of sorting perfomance data from one or more system configurations
US20030088579A1 (en) * 2001-10-12 2003-05-08 Brown Douglas P. Collecting statistics in a database system
US6596030B2 (en) * 1995-10-27 2003-07-22 At&T Corp. Identifying changes in on-line data repositories
US20030186651A1 (en) * 2002-03-27 2003-10-02 Weston Thomas E. Method and apparatus for minimizing setup time for a mobile station

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6596030B2 (en) * 1995-10-27 2003-07-22 At&T Corp. Identifying changes in on-line data repositories
US6327515B1 (en) * 1999-12-29 2001-12-04 Pitney Bowes Inc. Performance tuning of an inserter system based upon a rolling average of page counts for mailpieces to be processed
US20010056485A1 (en) * 2000-03-28 2001-12-27 Barrett Thomas H. Methods, systems and computer program products for dynamic scheduling and matrix collecting of data about samples
US20020177910A1 (en) * 2000-04-19 2002-11-28 Quarterman John S. Performance measurement system for large computer network
US20020110149A1 (en) * 2001-02-14 2002-08-15 Roberts Jeffrey S. System and method for transferring data over a network
US20030018641A1 (en) * 2001-07-23 2003-01-23 Gotwals Jacob K. Method and system for automatically prioritizing and analyzing performance data for one or more, system configurations
US20030018960A1 (en) * 2001-07-23 2003-01-23 Hacking Lance E. System and a method of sorting perfomance data from one or more system configurations
US20030088579A1 (en) * 2001-10-12 2003-05-08 Brown Douglas P. Collecting statistics in a database system
US20030186651A1 (en) * 2002-03-27 2003-10-02 Weston Thomas E. Method and apparatus for minimizing setup time for a mobile station

Also Published As

Publication number Publication date
US7117118B2 (en) 2006-10-03
US20060041664A1 (en) 2006-02-23

Similar Documents

Publication Publication Date Title
US20070076627A1 (en) Efficient accumulation of performance statistics in a multi-port network
US6886020B1 (en) Method and apparatus for storage system metrics management and archive
EP2698712B1 (en) Computer program, method, and information processing apparatus for analyzing performance of computer system
US7558850B2 (en) Method for managing input/output (I/O) performance between host systems and storage volumes
Vazhkudai et al. Using regression techniques to predict large data transfers
US7082441B1 (en) Method and storage and manipulation of storage system metrics
US7734768B2 (en) System and method for adaptively collecting performance and event information
US7076397B2 (en) System and method for statistical performance monitoring
US5379406A (en) Performance and measurement system which logs reduced data pertaining to groups of processes
US7680916B2 (en) System for improving the performance of a computer software application in a server network
US8015327B1 (en) Techniques for monitoring and managing wait queues
US20140089735A1 (en) Computer System Input/Output Management
US9223622B2 (en) Capacity planning of multi-tiered applications from application logs
JP2006313551A (en) System and method for editing and storing data
JP2006107126A (en) Method for collecting/preserving storage network performance information, computer system, and program
Thereska et al. Informed data distribution selection in a self-predicting storage system
US20040181709A1 (en) Method, system, and article of manufacture for fault determination
US20090100195A1 (en) Methods and Apparatus for Autonomic Compression Level Selection for Backup Environments
CN101576844A (en) Method and system for testing software system performances
US8281102B2 (en) Computer-readable recording medium storing management program, management apparatus, and management method
CN104618192B (en) Method and device for testing database audit equipment
US6593862B1 (en) Method for lossily compressing time series data
US10802943B2 (en) Performance management system, management device, and performance management method
JP2011186712A (en) Performance analysis apparatus, performance analysis method and performance analysis program
Moon et al. Metadata management of terabyte datasets from an IP backbone network: Experience and challenges

Legal Events

Date Code Title Description
STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO PAY ISSUE FEE