The present invention relates to monitoring resources of a computer system.
A computer system manages access to multiple resources of the system, such as a CPU, memory, a storage device (referred to hereinafter as a disk), and a network. There are many computer monitoring tools available that monitor such resources. Monitoring tools gather information about the availability (or lack thereof) of resources and typically report such information to users or administrators. However, existing monitoring tools suffer from significant drawbacks. One of those drawbacks is described in the context of Oracle Corporation's Real Application Cluster (“RAC”).
A RAC comprises a single database that is shared by multiple instances of a database server (referred to as database instances). In such a configuration, each separate database instance reads data from and writes data to the same disk space, but each database instance maintains its own separate shared memory, which is only available to the processes of the corresponding database instance.
Currently, a RAC database instance may be evicted from a cluster because the database instance is not responding to other databases instances in the cluster either through network messaging or disk I/O. A possible reason for why this may happen is that the evicted instance has a relatively high CPU usage level. If CPU usage is relatively high, then a monitoring tool is unable to obtain the CPU in order to determine that the disk and network are not responding to other instances in the cluster. After the database instance is evicted from the cluster, there is not enough information about the machine on which the evicted instance is running because current monitoring tools (either inside or outside the database) are unable to capture the data during the period that the CPU is maxed out (e.g., 99% usage). Eviction of a database instance may also occur when other resources of the corresponding machine are heavily utilized or unresponsive, such as disk I/O, network I/O, and memory. Without the necessary information, an administrator of the cluster is unable to quickly and accurately determine why the database instance was evicted.
Based on the foregoing, there is a need to provide a computer system monitoring tool that will report exceptional events before resources of the computer system become unavailable or unresponsive. The monitoring tool should also provide an accurate description of the state of the computer system so that an analysis of the gathered statistics will yield the reason(s) why the computer system failed or became (at least temporarily) unresponsive.
The approaches described in this section are approaches that could be pursued, but not necessarily approaches that have been previously conceived or pursued. Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section.
The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:
In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, that the present invention may be practiced without these specific details. For example, although embodiments of the invention are described in the context of a database cluster, other contexts also apply, such as grid computing, a single node database system, or a desktop computer. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present invention.
Techniques for monitoring the resources of a computer system are provided. In one approach, a monitoring tool comprises a monitoring process that is given a real-time priority in the computer system. This enables the monitoring process to gather utilization data of one or more resources even when the CPU usage is relatively high and the monitoring process would have otherwise been replaced by a system process or user process with higher priority.
A monitoring process collects (or samples) data at regular intervals. In a related approach, instead of reporting average values of a particular set of collected data, the monitoring tool reports exceptional events, such as when one or more collected values exceeds a particular threshold for a resource. Exceptional events may be reported directly to a user of the computer system and/or to other processes associated with the monitoring process that may make predictions and take subsequent actions to prevent a decrease in performance of the computer system.
Although reference is made to a single monitoring process, “a monitoring process” may include multiple monitoring processes. For example, there may be a separate monitoring process designated for collecting utilization data for each resource. Therefore, there may be a first monitoring process for collecting utilization data for disk I/O, a second monitoring process for collecting utilization data for memory, a third monitoring process for collecting utilization data for a CPU, and a fourth monitoring process for collecting utilization data for network I/O.
As used hereinafter, “utilization data” is one or more values indicating the utilization, availability, and/or responsiveness of a resource. Unless otherwise specified, reference to “utilization” may also include availability and/or responsiveness. “Utilization value” refers to a single value (of the utilization data) that represents the utilization of a resource at a particular instant. An “instant” is a point in time when the monitoring process collects a utilization value.
There are many resources of a computer system that may be monitored by a monitoring tool. Examples of resources include, but are not limited to, CPU, memory, disk I/O, and network I/O.
Although memory is referred to as a single resource, memory may be divided into multiple memory areas and each memory area may be treated as a separate resource. For example, the memory of a computer system may comprise a private memory area and a shared memory area. Each memory area may be further divided into multiple memory areas. In an embodiment of the invention, one or more monitoring processes may treat each of the different memory areas as a separate resource by collecting utilization data for each of the different memory areas.
Also, although network I/O appears to refer to a single resource, network I/O may refer to multiple resources that are each treated separately. For example, a separate queue may be maintained for each node in a network to which the computer system is connected.
Utilization data may be gathered every second, or at other intervals. Embodiments of the invention are not limited to any particular way of determining or measuring resource utilization and/or availability. The utilization and/or availability of a resource may be measured in multiple ways. For example, CPU usage may be measured by determining the length of a run queue. Each element in a run queue indicates a process that is waiting for the CPU.
As another example, disk I/O may be measured by determining the length of a disk queue. Each element in a disk queue indicates a read or write request to a file system or a database associated with the computer system.
As another example, network I/O may be measured by determining the response time of a ping to a node in the network. Additionally or alternatively, a queue may be maintained by the computer system for each node in the network. Network I/O may then be measured by determining the length of the queue. Each element in a network node queue indicates a pending (e.g., unanswered) request for data or services from the corresponding node in the network.
Additionally or alternatively, for each queue discussed above, resource utilization may be measured by how long an element (e.g., the oldest element) in the queue has been waiting for the corresponding resource. Such a measurement indicates responsiveness but may also be used as a measurement of resource utilization. Responsiveness of a resource may indicate that the resource is heavily utilized or that the resource has failed and is unable to support any requests for the resource.
According to an embodiment of the invention, rather then reporting only an average of the collected utilization data, “exceptional events” are reported (either in addition to the average or as an alternative thereto). In an embodiment, an “exceptional event” occurs when the utilization of a particular resource exceeds a threshold for that resource at a particular instant.
In a related embodiment, an exceptional event may occur when utilization of a particular resource exceeds a threshold for that resource at multiple instants over a period of time. For example, an exceptional event may be CPU usage of 98% or above for 8 out of 10 consecutive instants.
In an embodiment, if an exceptional event occurs, then an alert is issued to warn of the severity and possible impact of the exceptional event. The alert may trigger an automatic response by another process associated with the monitoring process. For example, if CPU usage exceeds 98%, then another process denies requests for system resources from other nodes in the network to which the computer system is connected. Additionally or alternatively, the alert may issue immediately to an administrator or user so that the administrator or user may take steps (as they deem appropriate) to prevent significant negative effects (that may result from the high resource utilization) from occurring.
A threshold value may be specified in many ways and based on different factors. For example, a threshold value for CPU usage may be specified by a user or administrator of the computer system. Alternatively or additionally, the threshold value may be a default value that is set by the monitoring tool.
A threshold value may be based on the median utilization value of a particular resource over a period of time. Alternatively, a threshold value may be based on a number of standard deviations away from the average utilization value of the particular resource over a period of time.
According to an embodiment of the invention, a monitoring process is made to have a real-time priority in the computer system. More than one process that is executing in the computer system may have a real-time priority. A “real-time priority process” is a process that obtains the CPU whenever the process requests the CPU. Also, the memory used by a real-time priority process is pinned in memory so that the memory is never swapped or paged out. As a real-time priority process, it is guaranteed that the monitoring process will be scheduled and will obtain the CPU at its scheduled intervals in order to collect utilization data and store the utilization data for further analysis. Thus, the monitoring process may operate under many starvation situations. For example, if CPU usage is 99%, then, rather than being denied access to the CPU, the monitoring process obtains access to the CPU when the monitoring process is scheduled. The monitoring process is lightweight so that it uses a relatively small amount of memory and requires relatively few CPU cycles to collect a utilization value.
In an embodiment, utilization data that is collected is sent to a logging system. The logging system includes an interpretive engine that attempts root cause analysis and suggests appropriate actions, such as calling a workload manager or connection tool to throttle incoming requests. Thus, the logging system provides a type of feedback control.
The interpretive engine may also comprise a historical perspective and a predictor of the probability of certain events which may destabilize the computer system (and/or an associated RAC cluster), result in hangs, or cause other severe performance issues. For example, if an increase in the length of the disk queue by a factor of 10 in a few seconds tends to precede a database instance being evicted, then an alert is generated when that increase occurs and requests for access to the disk are throttled.
Current monitoring tools only collect average data over a period of time (e.g., every 5-10 seconds or more). Current monitoring tools are not concerned with exceptional events, i.e., outliers. If they were concerned with exceptional events, then those exceptional events are difficult to capture when only statistical averages are reported. Averaging data effectively removes outliers. To illustrate, consider
Therefore, the outliers (i.e., at time instants 10, 19, and 20) are removed when the collected values are averaged. Based on the average values, the traditional monitoring tool would not initiate any types alerts.
Thus, one of the significant differences that distinguish embodiments of the invention from other monitoring tools is the statistical perspective. Embodiments of the invention allow a monitoring tool to identify and report exceptional events while current monitoring tools only calculate and report statistical averages.
Furthermore, because current monitoring tools do not have real-time priority, it is difficult, if not impossible, for current monitoring tools to collect exceptional events when CPU usage is relatively high or memory is unavailable for the monitoring tool. As a result, a gap arises in the collected data. It is thus difficult to determine why, e.g., a database instance is evicted from a cluster. Data indicating one or more exceptional events is always missing during a memory or CPU starvation time period because the monitoring process that performs the collection is unable to obtain the necessary resource(s) in order to collect utilization data for any resources.
One reason why embodiments of the invention are not intuitive is because it is common practice for database designers and skilled software developers to avoid causing non-essential processes to have real-time priorities in a computer system. Many designers and developers consider monitoring processes as non-essential processes, which is why, traditionally, monitoring processes have been made a relatively low priority.
Computer system 300 may be coupled via bus 302 to a display 312, such as a cathode ray tube (CRT), for displaying information to a computer user. An input device 314, including alphanumeric and other keys, is coupled to bus 302 for communicating information and command selections to processor 304. Another type of user input device is cursor control 316, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 304 and for controlling cursor movement on display 312. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane.
The invention is related to the use of computer system 300 for implementing the techniques described herein. According to one embodiment of the invention, those techniques are performed by computer system 300 in response to processor 304 executing one or more sequences of one or more instructions contained in main memory 306. Such instructions may be read into main memory 306 from another machine-readable medium, such as storage device 310. Execution of the sequences of instructions contained in main memory 306 causes processor 304 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions to implement the invention. Thus, embodiments of the invention are not limited to any specific combination of hardware circuitry and software.
The term “machine-readable medium” as used herein refers to any medium that participates in providing data that causes a machine to operation in a specific fashion. In an embodiment implemented using computer system 300, various machine-readable media are involved, for example, in providing instructions to processor 304 for execution. Such a medium may take many forms, including but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 310. Volatile media includes dynamic memory, such as main memory 306. Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 302. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications. All such media must be tangible to enable the instructions carried by the media to be detected by a physical mechanism that reads the instructions into a machine.
Common forms of machine-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, a CD-ROM, any other optical medium, punchcards, papertape, any other physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other medium from which a computer can read.
Various forms of machine-readable media may be involved in carrying one or more sequences of one or more instructions to processor 304 for execution. For example, the instructions may initially be carried on a magnetic disk of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 300 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 302. Bus 302 carries the data to main memory 306, from which processor 304 retrieves and executes the instructions. The instructions received by main memory 306 may optionally be stored on storage device 310 either before or after execution by processor 304.
Computer system 300 also includes a communication interface 318 coupled to bus 302. Communication interface 318 provides a two-way data communication coupling to a network link 320 that is connected to a local network 322. For example, communication interface 318 may be an integrated services digital network (ISDN) card or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 318 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links may also be implemented. In any such implementation, communication interface 318 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
Network link 320 typically provides data communication through one or more networks to other data devices. For example, network link 320 may provide a connection through local network 322 to a host computer 324 or to data equipment operated by an Internet Service Provider (ISP) 326. ISP 326 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 328. Local network 322 and Internet 328 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 320 and through communication interface 318, which carry the digital data to and from computer system 300, are exemplary forms of carrier waves transporting the information.
Computer system 300 can send messages and receive data, including program code, through the network(s), network link 320 and communication interface 318. In the Internet example, a server 330 might transmit a requested code for an application program through Internet 328, ISP 326, local network 322 and communication interface 318.
The received code may be executed by processor 304 as it is received, and/or stored in storage device 310, or other non-volatile storage for later execution. In this manner, computer system 300 may obtain application code in the form of a carrier wave.
In the foregoing specification, embodiments of the invention have been described with reference to numerous specific details that may vary from implementation to implementation. Thus, the sole and exclusive indicator of what is the invention, and is intended by the applicants to be the invention, is the set of claims that issue from this application, in the specific form in which such claims issue, including any subsequent correction. Any definitions expressly set forth herein for terms contained in such claims shall govern the meaning of such terms as used in the claims. Hence, no limitation, element, property, feature, advantage or attribute that is not expressly recited in a claim should limit the scope of such claim in any way. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
Number | Name | Date | Kind |
---|---|---|---|
4318182 | Bachman et al. | Mar 1982 | A |
5113522 | Dinwiddie et al. | May 1992 | A |
5222217 | Blount et al. | Jun 1993 | A |
5283856 | Gross et al. | Feb 1994 | A |
5347632 | Filepp et al. | Sep 1994 | A |
5357612 | Alaiwan | Oct 1994 | A |
5465328 | Dievendorff et al. | Nov 1995 | A |
5627764 | Schutzman et al. | May 1997 | A |
5649102 | Yamauchi et al. | Jul 1997 | A |
5721825 | Lawson et al. | Feb 1998 | A |
5754841 | Carino, Jr. | May 1998 | A |
5774668 | Choquier et al. | Jun 1998 | A |
5790807 | Fishler et al. | Aug 1998 | A |
5802253 | Gross et al. | Sep 1998 | A |
5828835 | Isfeld et al. | Oct 1998 | A |
5852818 | Guay et al. | Dec 1998 | A |
5862325 | Reed et al. | Jan 1999 | A |
5867665 | Butman et al. | Feb 1999 | A |
5867667 | Butman et al. | Feb 1999 | A |
5870562 | Butman et al. | Feb 1999 | A |
5878056 | Black et al. | Mar 1999 | A |
5884035 | Butman et al. | Mar 1999 | A |
5890167 | Bridge, Jr. et al. | Mar 1999 | A |
5918059 | Tavallaei et al. | Jun 1999 | A |
5933604 | Inakoshi | Aug 1999 | A |
5940839 | Chen et al. | Aug 1999 | A |
5951694 | Choquier et al. | Sep 1999 | A |
5970439 | Levine et al. | Oct 1999 | A |
5995980 | Olson et al. | Nov 1999 | A |
5999931 | Breitbart et al. | Dec 1999 | A |
6026430 | Butman et al. | Feb 2000 | A |
6029205 | Alferness et al. | Feb 2000 | A |
6035379 | Raju et al. | Mar 2000 | A |
6041357 | Kunzelman et al. | Mar 2000 | A |
6058389 | Chandra et al. | May 2000 | A |
6067540 | Hyde | May 2000 | A |
6073129 | Levine et al. | Jun 2000 | A |
6088728 | Bellemore et al. | Jul 2000 | A |
6178529 | Short et al. | Jan 2001 | B1 |
6182086 | Lomet et al. | Jan 2001 | B1 |
6185555 | Sprenger et al. | Feb 2001 | B1 |
6188699 | Lang et al. | Feb 2001 | B1 |
6192378 | Abrams et al. | Feb 2001 | B1 |
6222840 | Walker et al. | Apr 2001 | B1 |
6243751 | Chatterjee et al. | Jun 2001 | B1 |
6247017 | Martin | Jun 2001 | B1 |
6304882 | Strellis et al. | Oct 2001 | B1 |
6327622 | Jindal et al. | Dec 2001 | B1 |
6334114 | Jacobs et al. | Dec 2001 | B1 |
6338074 | Poindexter et al. | Jan 2002 | B1 |
6393423 | Goedken | May 2002 | B1 |
6427146 | Chu | Jul 2002 | B1 |
6442568 | Velasco et al. | Aug 2002 | B1 |
6466950 | Ono | Oct 2002 | B1 |
6473794 | Guheen et al. | Oct 2002 | B1 |
6490574 | Bennett et al. | Dec 2002 | B1 |
6493826 | Schofield et al. | Dec 2002 | B1 |
6515968 | Combar et al. | Feb 2003 | B1 |
6519571 | Guheen et al. | Feb 2003 | B1 |
6529932 | Dadiomov et al. | Mar 2003 | B1 |
6536037 | Guheen et al. | Mar 2003 | B1 |
6539381 | Prasad et al. | Mar 2003 | B1 |
6556659 | Bowman-Amuah | Apr 2003 | B1 |
6560592 | Reid et al. | May 2003 | B1 |
6587866 | Modi et al. | Jul 2003 | B1 |
6601083 | Reznak | Jul 2003 | B1 |
6601101 | Lee et al. | Jul 2003 | B1 |
6621083 | Cole | Sep 2003 | B2 |
6651012 | Bechhoefer | Nov 2003 | B1 |
6654907 | Stanfill et al. | Nov 2003 | B2 |
6658596 | Owen | Dec 2003 | B1 |
6691155 | Gottfried | Feb 2004 | B2 |
6697791 | Hellerstein et al. | Feb 2004 | B2 |
6704831 | Avery | Mar 2004 | B1 |
6704886 | Gill et al. | Mar 2004 | B1 |
6728748 | Mangipudi et al. | Apr 2004 | B1 |
6757710 | Reed | Jun 2004 | B2 |
6769074 | Vaitzblit | Jul 2004 | B2 |
6793625 | Cavallaro et al. | Sep 2004 | B2 |
6802003 | Gross et al. | Oct 2004 | B1 |
6816907 | Mei et al. | Nov 2004 | B1 |
6826182 | Parthasarathy | Nov 2004 | B1 |
6826579 | Leymann et al. | Nov 2004 | B1 |
6850893 | Lipkin et al. | Feb 2005 | B2 |
6868413 | Grindrod et al. | Mar 2005 | B1 |
6882994 | Yoshimura et al. | Apr 2005 | B2 |
6889231 | Souder et al. | May 2005 | B1 |
6917946 | Corl, Jr. et al. | Jul 2005 | B2 |
6925476 | Multer et al. | Aug 2005 | B1 |
6980988 | Demers et al. | Dec 2005 | B1 |
7003531 | Holenstein et al. | Feb 2006 | B2 |
7031974 | Subramaniam | Apr 2006 | B1 |
7058957 | Nguyen | Jun 2006 | B1 |
7065537 | Cha et al. | Jun 2006 | B2 |
7080382 | Sexton et al. | Jul 2006 | B2 |
7089228 | Arnold et al. | Aug 2006 | B2 |
7095871 | Jones et al. | Aug 2006 | B2 |
7149738 | Kumar et al. | Dec 2006 | B2 |
7174379 | Agarwal et al. | Feb 2007 | B2 |
7177866 | Holenstein et al. | Feb 2007 | B2 |
7178050 | Fung et al. | Feb 2007 | B2 |
7243256 | Kaiya et al. | Jul 2007 | B2 |
7263590 | Todd et al. | Aug 2007 | B1 |
7269157 | Klinker et al. | Sep 2007 | B2 |
7398471 | Rambacher et al. | Jul 2008 | B1 |
7424396 | Dodeja et al. | Sep 2008 | B2 |
7506215 | Maw et al. | Mar 2009 | B1 |
7617257 | Sathyanarayan et al. | Nov 2009 | B2 |
8117505 | Sridharan et al. | Feb 2012 | B2 |
8555274 | Chawla et al. | Oct 2013 | B1 |
20010032137 | Bennett et al. | Oct 2001 | A1 |
20010047270 | Gusick et al. | Nov 2001 | A1 |
20010052137 | Klein | Dec 2001 | A1 |
20010056493 | Mineo | Dec 2001 | A1 |
20020049845 | Sreenivasan et al. | Apr 2002 | A1 |
20020052885 | Levy | May 2002 | A1 |
20020073019 | Deaton | Jun 2002 | A1 |
20020073139 | Hawkins et al. | Jun 2002 | A1 |
20020091685 | Feldman et al. | Jul 2002 | A1 |
20020112008 | Christenson et al. | Aug 2002 | A1 |
20020116457 | Eshleman et al. | Aug 2002 | A1 |
20020129157 | Varsano | Sep 2002 | A1 |
20020133507 | Holenstein et al. | Sep 2002 | A1 |
20020138582 | Chandra et al. | Sep 2002 | A1 |
20020144010 | Younis et al. | Oct 2002 | A1 |
20020161896 | Wen et al. | Oct 2002 | A1 |
20020194015 | Gordon et al. | Dec 2002 | A1 |
20020194081 | Perkowski | Dec 2002 | A1 |
20030005028 | Dritschler et al. | Jan 2003 | A1 |
20030007497 | March et al. | Jan 2003 | A1 |
20030014523 | Teloh et al. | Jan 2003 | A1 |
20030037029 | Holenstein et al. | Feb 2003 | A1 |
20030037146 | O'Neill | Feb 2003 | A1 |
20030039212 | Lloyd et al. | Feb 2003 | A1 |
20030046421 | Horvitz et al. | Mar 2003 | A1 |
20030088671 | Klinker et al. | May 2003 | A1 |
20030108052 | Inoue et al. | Jun 2003 | A1 |
20030110085 | Murren et al. | Jun 2003 | A1 |
20030135523 | Brodersen et al. | Jul 2003 | A1 |
20030135609 | Carlson et al. | Jul 2003 | A1 |
20030161468 | Iwagaki et al. | Aug 2003 | A1 |
20030177187 | Levine et al. | Sep 2003 | A1 |
20030208523 | Gopalan et al. | Nov 2003 | A1 |
20030212657 | Kaluskar et al. | Nov 2003 | A1 |
20030212670 | Yalamanchi et al. | Nov 2003 | A1 |
20030229804 | Srivastava et al. | Dec 2003 | A1 |
20030236834 | Gottfried | Dec 2003 | A1 |
20040024771 | Jain et al. | Feb 2004 | A1 |
20040024774 | Jain et al. | Feb 2004 | A1 |
20040024794 | Jain et al. | Feb 2004 | A1 |
20040024979 | Kaminsky et al. | Feb 2004 | A1 |
20040034640 | Jain et al. | Feb 2004 | A1 |
20040034664 | Jain et al. | Feb 2004 | A1 |
20040064548 | Adams et al. | Apr 2004 | A1 |
20040093512 | Sample | May 2004 | A1 |
20040103195 | Chalasani et al. | May 2004 | A1 |
20040107125 | Guheen et al. | Jun 2004 | A1 |
20040111506 | Kundu et al. | Jun 2004 | A1 |
20040117794 | Kundu | Jun 2004 | A1 |
20040133591 | Holenstein et al. | Jul 2004 | A1 |
20040176996 | Powers et al. | Sep 2004 | A1 |
20040181476 | Smith et al. | Sep 2004 | A1 |
20040236860 | Logston et al. | Nov 2004 | A1 |
20040268357 | Joy et al. | Dec 2004 | A1 |
20050010545 | Joseph | Jan 2005 | A1 |
20050021567 | Holenstein et al. | Jan 2005 | A1 |
20050021771 | Kaehn et al. | Jan 2005 | A1 |
20050033809 | McCarthy et al. | Feb 2005 | A1 |
20050125371 | Bhide et al. | Jun 2005 | A1 |
20050165925 | Dan et al. | Jul 2005 | A1 |
20050183072 | Horning et al. | Aug 2005 | A1 |
20050193024 | Beyer et al. | Sep 2005 | A1 |
20050239476 | Betrabet et al. | Oct 2005 | A1 |
20050240649 | Elkington et al. | Oct 2005 | A1 |
20050262205 | Nikolov et al. | Nov 2005 | A1 |
20050267965 | Heller | Dec 2005 | A1 |
20060036617 | Bastawala et al. | Feb 2006 | A1 |
20060112135 | Warshawsky | May 2006 | A1 |
20070100793 | Brown et al. | May 2007 | A1 |
20070162260 | Nordstrom | Jul 2007 | A1 |
20070226323 | Halpern | Sep 2007 | A1 |
20090112809 | Wolff et al. | Apr 2009 | A1 |
20090239480 | Rofougaran et al. | Sep 2009 | A1 |
20100145929 | Burger et al. | Jun 2010 | A1 |
20120072780 | Kini et al. | Mar 2012 | A1 |
20120221732 | Waldspurger | Aug 2012 | A1 |
20120271594 | Yan et al. | Oct 2012 | A1 |
Entry |
---|
Ravi Kokku et al., “Half-pipe Anchoring: An Efficient Technique for Multiple Connection Handoff,” Proceedings 10th International Conference on Network Protocols, Nov. 12, 2002, XP010632563, 10 pages. |
Ying-Dar Lin et al., “Direct Web Switch Routing with State Migration, TCP Masquerade, and Cookie Name Rewriting,” Globecom 2003, IEEE Global Telecommunications Conference, Dec. 12003, IEEE, CP010677300, pp. 3663-3667. |
Chase, Jeffrey S., et al., “Dynamic Virtual Clusters in a Grid Site Manager,” Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing, 2003, XP-010643715, 12 pgs. |
Shiva, S.G., et al., “Modular Description/Simulation/Synthesis Using DDL,” 19th Design Automation Conference 1982, IEEE Press, pp. 321-329. |
Skow, Eric, et al., “A Security Architecture for Application Session Handoff,” 2002, IEEE International Conference Proceedings, Apr. 28-May 2, 2002, vol. 1 of 5, pp. 2058-2063, XP010589848. |
Song, Henry, et al., “Browser State Repository Service,” Lecture Notes in Computer Science, vol. 2414, 2002, pp. 1-14, XP002904339. |
Spiegler, Israel, “Automating Database Construction,” ACM SIGMIS Database, vol. 14, Issue 3, Spring 1983, pp. 21-29. |
Kei Kurakawa et al., “Life Cycle Design Support Based on Environmental Information Sharing,” IEEE, Feb. 1-3, 1999, Proceedings EcoDesign '99, First International Symposium, pp. 138-142. |
Gunther, Oliver et al., “MMM: A Web-Based System for Sharing Statistical Computing Modules,” IEEE, May-Jun. 1997, vol. 1, Issue 3, pp. 59-68. |
“Automatic Performance Diagnostics” downloaded Apr. 17, 2007 from the Internet <http://oracle-docs.dartmouth.edu/dba-docs/10gdoc/server.101/b10752/diagnsis.htm > 9 pages. |
Number | Date | Country | |
---|---|---|---|
20080263556 A1 | Oct 2008 | US |