System and method for self-healing of application centric infrastructure fabric memory

Information

  • Patent Grant
  • 11055159
  • Patent Number
    11,055,159
  • Date Filed
    Wednesday, April 24, 2019
    5 years ago
  • Date Issued
    Tuesday, July 6, 2021
    2 years ago
Abstract
Disclosed is a method that includes obtaining a list of processes in an application centric infrastructure fabric, sorting the list of processes according to an amount of memory increase associated with each respective process in the list of processes to yield a sorted list, selecting a group of processes from the sorted list and collecting a respective live process core for each process in the group of processes without pausing or killing any process in the group of processes. The method includes applying an offline leak detection tool to each process in the group of processes to yield a list of leaked memory addresses for a given process of the group of processes and transmitting a message to the given process with the list of leaked memory addresses, whereby the given process calls a function to release leaked memory associated with the given process as identified in the message.
Description
TECHNICAL FIELD

The present disclosure relates to garbage collection and more specifically to a method of collecting live process cores for a group of processes that have memory leak issues, transmitting the list to a cloud-based container for running a garbage detection on the live process cores, and transmitting back a list of leak address such that a respective process can to free the memory associated with the leak address.


BACKGROUND

A data-center fabric like Application Centric Infrastructure (ACI) could contain up to 400 leaf switches, each potentially running about 50 applications (e.g., linux processes, bgp processes, ospf processes), taking the total to about 20K linux processes. Like most embedded technology, ACI is built using C and C++, both of which are prone to memory leaks due to programming errors. Memory leaks can occur since there is no native garbage collection facility.


Applications leaking even a small amount of memory, such as 1 Kb per day each, can result in 20 MB of wasted memory per day. Such memory degradation is harmful in the long run and could cause serious side effects that include increased response time and non-recoverable process crashes. Moreover, running analytics on the entire fabric memory is close to impossible due to the sheer scale and volume of memory that needs to be analyzed.


Native in-memory garbage collection is getting popular, but is not even close to implementation for C and C++ especially in real-time fabric environments which are sensitive to time delays. Though C++ does have explicit garbage collection facilities like smart pointers, there has been no progress on providing an implicit garbage collector. One of the main reasons for this could be the fear of performance impact. For example, “mark and sweep” garbage collection freezes everything in the process while it is at work. Even milliseconds of paused processing can impact real-time embedded systems.


In essence, for the millions of embedded systems that use C/C++, proper garbage collection is not yet a reality and the only solution at the moment is to kill and restart the offending process.





BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited and other advantages and features of the disclosure can be obtained, a more particular description of the principles briefly described above will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. Understanding that these drawings depict only exemplary embodiments of the disclosure and are not therefore to be considered to be limiting of its scope, the principles herein are described and explained with additional specificity and detail through the use of the accompanying drawings in which:



FIG. 1 illustrates an example system configuration;



FIG. 2 illustrates a Application Centric Infrastructure;



FIG. 3 illustrates a method embodiment;



FIG. 4 illustrates a switch and a messaging being sent to an operating system process; and



FIG. 5 illustrates and effect over time of memory leaks when the concepts disclosed herein are applied.





DESCRIPTION OF EXAMPLE EMBODIMENTS

Various embodiments of the disclosure are discussed in detail below. While specific implementations are discussed, it should be understood that this is done for illustration purposes only. A person skilled in the relevant art will recognize that other components and configurations may be used without parting from the spirit and scope of the disclosure.


Overview

Additional features and advantages of the disclosure will be set forth in the description which follows, and in part will be obvious from the description, or can be learned by practice of the herein disclosed principles. The features and advantages of the disclosure can be realized and obtained by means of the instruments and combinations particularly pointed out in the appended claims. These and other features of the disclosure will become more fully apparent from the following description and appended claims, or can be learned by the practice of the principles set forth herein.


The method includes obtaining a list of processes in an application centric infrastructure fabric, sorting the list of processes according to an amount of memory increase associated with each respective process in the list of processes to yield a sorted list, selecting a group of processes from the sorted list and collecting a respective live process core for each process in the group of processes without pausing or killing any process in the group of processes. The method includes applying an offline leak detection tool to each process in the group of processes to yield a list of leaked memory addresses for a given process of the group of processes and transmitting a message to the given process with the list of leaked memory addresses. The given process calls a function to release leaked memory associated with the given process as identified in the message.


Detailed Description

The present disclosure addresses the issues raised above. The disclosure provides a system, method and computer-readable storage device embodiments. First a general example system shall be disclosed in FIG. 1 which can provide some basic hardware components making up a server, node or other computer system.


First a general example system shall be disclosed in FIG. 1, which can provide some basic hardware components making up a server, node or other computer system. FIG. 1 illustrates a computing system architecture 100 wherein the components of the system are in electrical communication with each other using a connector 105. Exemplary system 100 includes a processing unit (CPU or processor) 110 and a system connector 105 that couples various system components including the system memory 115, such as read only memory (ROM) 120 and random access memory (RAM) 125, to the processor 110. The system 100 can include a cache of high-speed memory connected directly with, in close proximity to, or integrated as part of the processor 110. The system 100 can copy data from the memory 115 and/or the storage device 130 to the cache 112 for quick access by the processor 110. In this way, the cache can provide a performance boost that avoids processor 110 delays while waiting for data. These and other modules/services can control or be configured to control the processor 110 to perform various actions. Other system memory 115 may be available for use as well. The memory 115 can include multiple different types of memory with different performance characteristics. The processor 110 can include any general purpose processor and a hardware module or software module/service, such as service 1132, service 2134, and service 3136 stored in storage device 130, configured to control the processor 110 as well as a special-purpose processor where software instructions are incorporated into the actual processor design. The processor 110 may essentially be a completely self-contained computing system, containing multiple cores or processors, a bus (connector), memory controller, cache, etc. A multi-core processor may be symmetric or asymmetric.


To enable user interaction with the computing device 100, an input device 145 can represent any number of input mechanisms, such as a microphone for speech, a touch-sensitive screen for gesture or graphical input, keyboard, mouse, motion input, speech and so forth. An output device 135 can also be one or more of a number of output mechanisms known to those of skill in the art. In some instances, multimodal systems can enable a user to provide multiple types of input to communicate with the computing device 100. The communications interface 140 can generally govern and manage the user input and system output. There is no restriction on operating on any particular hardware arrangement and therefore the basic features here may easily be substituted for improved hardware or firmware arrangements as they are developed.


Storage device 130 is a non-volatile memory and can be a hard disk or other types of computer readable media which can store data that are accessible by a computer, such as magnetic cassettes, flash memory cards, solid state memory devices, digital versatile disks, cartridges, random access memories (RAMs) 125, read only memory (ROM) 120, and hybrids thereof.


The storage device 130 can include software services 132, 134, 136 for controlling the processor 110. Other hardware or software modules/services are contemplated. The storage device 130 can be connected to the system connector 105. In one aspect, a hardware module that performs a particular function can include the software component stored in a computer-readable medium in connection with the necessary hardware components, such as the processor 110, connector 105, display 135, and so forth, to carry out the function.


Having introduced the basic computing components which can be applicable to embodiments associated with this disclosure, the disclosure now turn to FIG. 2 which illustrates an example network environment.



FIG. 2 illustrates a diagram of example network environment 200. This figure is discussed with the concept of capturing agents on various network components. With reference to FIG. 2, fabric 212 can represent the underlay (i.e., physical network) of network environment 200. Fabric 212 can include spine routers 1-N (202A-N) (collectively “202”) and leaf routers 1-N (204A-N) (collectively “204”). Leaf routers 204 can reside at the edge of fabric 212, and can thus represent the physical network edges. Leaf routers 204 can be, for example, top-of-rack (“ToR”) switches, aggregation switches, gateways, ingress and/or egress switches, provider edge devices, and/or any other type of routing or switching device.


Leaf routers 204 can be responsible for routing and/or bridging tenant or endpoint packets and applying network policies. Spine routers 202 can perform switching and routing within fabric 212. Thus, network connectivity in fabric 212 can flow from spine routers 202 to leaf routers 204, and vice versa.


Leaf routers 204 can provide servers 1-5 (206A-E) (collectively “206”), hypervisors 1-4 (208A-208D) (collectively “208”), and virtual machines (VMs) 1-5 (210A-210E) (collectively “210”) access to fabric 212. For example, leaf routers 204 can encapsulate and decapsulate packets to and from servers 206 in order to enable communications throughout environment 200. Leaf routers 204 can also connect other devices, such as device 214, with fabric 212. Device 214 can be any network-capable device(s) or network(s), such as a firewall, a database, a server, an engine 220 (further described below), etc. Leaf routers 204 can also provide any other servers, resources, endpoints, external networks, VMs, services, tenants, or workloads with access to fabric 212.


VMs 210 can be virtual machines hosted by hypervisors 208 running on servers 206. VMs 210 can include workloads running on a guest operating system on a respective server. Hypervisors 208 can provide a layer of software, firmware, and/or hardware that creates and runs the VMs 210. Hypervisors 208 can allow VMs 210 to share hardware resources on servers 206, and the hardware resources on servers 206 to appear as multiple, separate hardware platforms. Moreover, hypervisors 208 and servers 206 can host one or more VMs 210. For example, server 206A and hypervisor 208A can host VMs 210A-B.


In some cases, VMs 210 and/or hypervisors 208 can be migrated to other servers 206. For example, VM 210A can be migrated to server 206C and hypervisor 208B. Servers 206 can similarly be migrated to other locations in network environment 200. A server connected to a specific leaf router can be changed to connect to a different or additional leaf router. In some cases, some or all of servers 206, hypervisors 208, and/or VMs 210 can represent tenant space. Tenant space can include workloads, services, applications, devices, and/or resources that are associated with one or more clients or subscribers. Accordingly, traffic in network environment 200 can be routed based on specific tenant policies, spaces, agreements, configurations, etc. Moreover, addressing can vary between one or more tenants. In some configurations, tenant spaces can be divided into logical segments and/or networks and separated from logical segments and/or networks associated with other tenants.


An administrator from a device 226 can communicate with one or more application policy infrastructure controllers 218A, 218B, 218C (collectively APICs 218). The administrator can push a policy from their device 226 to one or more of the APICs 218, which can transmit the garbage collection policy to a respective Leaf node or nodes 204 according to the principles disclosed herein to perform garbage collection. A Leaf node 204 can transmit a live process core that is collected and pushed over the cloud 222 (or any network) to a container running on a server 224. The server 224 can run a garbage detection tool on the live process core and send back a list of leaked addresses. The list of leaked addresses can be received at a leaf 204 and the process can “walk” over each address in the list and call a function such as free ( ), or some other function, to perform garbage collection. The details of this process will be set forth in more detail below.


Having introduced the basic ACI environment, the disclosure turns to FIG. 3, which provides an example method embodiment according to the solution and enables a scalable, non-intrusive guard garbage collection method in traditional embedded networking devices. Absent the solution as disclosed herein, it is not possible to provide such a scalable garbage collection approach. One benefit of the approach is that it will work on already deployed network fabrics.


The present approach can run on all processes and according to the solution disclosed herein, an administrator, or a system can pick and choose which processes to apply the method to. In regular garbage collection, a process must be paused during the process of cleaning up memory leaks. According to the present approach, a respective process is not paused during the course snapshot.


In traditional approaches, garbage detection and collection are both done within a process context. According to the disclosed approach, the memory analysis, or garbage detection, is done in the cloud and collection is done within the process context using a special message as disclosed herein. Finally, in traditional garbage collection, the process is computationally expensive and can consume many CPU cycles. The approach disclosed herein is virtually nonintrusive to the running process in that much of the solution is executed in the cloud.



FIG. 3 illustrates an example method embodiment. The example method includes obtaining a list of processes in an application centric infrastructure fabric (302), sorting the list of processes according to an amount of memory increase associated with each respective process in the list of processes to yield a sorted list (304), selecting a group of processes from the sorted list (306) and collecting a respective live process core for each process in the group of processes without pausing or killing any process in the group of processes (308). The method can also include applying a leak detection tool to each process in the group of processes to yield a list of leaked memory addresses for a given process of the group of processes (310) and transmitting a message to the given process with the list of leaked memory addresses, whereby the given process calls a function to release leaked memory associated with the given process as identified in the message (312). The leak detection tool can be an offline tool. An example tool that could be used to perform the step of selecting the top “n” processes to collect the live process core could include proprietary tools such as the one disclosed in U.S. Pat. No. 9,558,055, incorporated herein by reference. Other tools could be utilized as well.


The list of processes can include all processes in the application centric infrastructure fabric or can consist of a group of selected processes from all processes within the application centric infrastructure fabric, according to a criterion. The criteria can be based on a rate of memory leak, a percentage of memory leak relative to some parameter which can be process based or ACI fabric based, cost based, workload based, predictive data based, or according to any other parameter.


In one aspect, the method includes applying the leak detection tool in a container located in a cloud computing environment. In such a scenario, the method can include transmitting the respective live process core to a container running in a cloud computing environment for applying the leak detection tool. The benefit of doing an offline memory leak detection process is that a process core's file should have all the data necessary to detect leaks. The core has the complete memory foot-print of all the processes along with all the memory that were ever allocated by it on the heap.


In another aspect, the method can include transmitting the respective live process core off-line to a container on a same (or different) switch for applying the leak detection tool. Any tool can be used to perform the individual functions disclosed herein. Any memory leak detection tool could be utilized to detect memory leaks. Any tool or process that performs the function of detecting memory leaks could be applied.


Existing technologies involve optimizing an algorithm for native in-memory garbage collection techniques. Garbage collection itself is an expensive operation and more often than not involves pausing the process in order to clean up memory. An example tool for collecting a live process without pausing the process can include Google's Coredumper library (see https://github.com/anatol/google/google-coredumper). Not only does this disclosure make garbage collection possible in C/C++ based legacy applications, but the concepts let the system do the expensive garbage detection outside the ACI fabric (inside a container in the cloud), thereby making the entire operation non intrusive.


Moreover, the concepts disclosed herein can potentially work on solutions that have currently been deployed. The approach is platform and operating system agnostic and can work across any embedded system using standard glibe library for memory allocation.


The concepts disclosed herein allow in-memory garbage collection for native C/C++ based applications with the least possible intrusion to the running system and without pausing or killing the running application. The concept enables a system to execute the expensive garbage detection (data analytics) in a container located in the cloud, in one aspect, and then send in a message in another mode the list of memory addresses that have been leaked to the a respective application process in order to be freed. FIG. 4 illustrates several components 400 including a switch 402 and a message 408 for releasing memory. The message 408 can have a list of leaks and data that could include, for example, a TCP Port identification (such as 4500), a message type (such as msg_memleak_fre) and a payload size (such as 1 Kb). The message could include a leaked memory address such as 0x43416780, for example.


Aspect of this disclosure also include predictive measures that can be developed based on machine learning or artificial intelligence such that memory leak decisions, messages or assignments can be predicted in advance and even transmitted in some cases before the memory issue arises. As shown in FIG. 4. the message 408 could be sent from an operating system switch 402 (Such as Cisco NX-OS switch) having an operating system shell 404 which can be used to transmit a special message 408 to an operating system process 406 such as (a border gateway protocol process).


Applying the approach disclosed herein can result in a sawtooth configuration of the process memory over time, as is shown in the graph 500 of FIG. 5. For example, the process memory may increase over time until an instant when a message is sent to the process to free the memory associated with the memory leak. In response to the message and implementation of the memory release, the process memory would be reduced only to start rising again until the next message is acted on to again release memory. Some of the increase in process memory could be caused by regular operation of the process as well and not due to leakage.


In some embodiments the computer-readable storage devices, mediums, and/or memories can include a cable or wireless signal containing a bit stream and the like. However, when mentioned, non-transitory computer-readable storage media expressly exclude media such as energy, carrier signals, electromagnetic waves, and signals per se.


Methods according to the above-described examples can be implemented using computer-executable instructions that are stored or otherwise available from computer readable media. Such instructions can include, for example, instructions and data which cause or otherwise configure a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. Portions of computer resources used can be accessible over a network. The computer executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, firmware, or source code. Examples of computer-readable media that may be used to store instructions, information used, and/or information created during methods according to described examples include magnetic or optical disks, flash memory, USB devices provided with non-volatile memory, networked storage devices, and so on.


Devices implementing methods according to these disclosures can include hardware, firmware and/or software, and can take any of a variety of form factors. Typical examples of such form factors include laptops, smart phones, small form factor personal computers, personal digital assistants, rackmount devices, standalone devices, and so on. Functionality described herein also can be embodied in peripherals or add-in cards. Such functionality can also be implemented on a circuit board among different chips or different processes executing in a single device, by way of further example.


The instructions, media for conveying such instructions, computing resources for executing them, and other structures for supporting such computing resources are means for providing the functions described in these disclosures.


Although a variety of examples and other information was used to explain aspects within the scope of the appended claims, no limitation of the claims should be implied based on particular features or arrangements in such examples, as one of ordinary skill would be able to use these examples to derive a wide variety of implementations. Further and although some subject matter may have been described in language specific to examples of structural features and/or method steps, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to these described features or acts. For example, such functionality can be distributed differently or performed in components other than those identified herein. Rather, the described features and steps are disclosed as examples of components of systems and methods within the scope of the appended claims. Moreover, claim language reciting “at least one of” a set indicates that one member of the set or multiple members of the set satisfy the claim.


It should be understood that features or configurations herein with reference to one embodiment or example can be implemented in, or combined with, other embodiments or examples herein. That is, terms such as “embodiment”, “variation”, “aspect”, “example”, “configuration”, “implementation”, “case”, and any other terms which may connote an embodiment, as used herein to describe specific features or configurations, are not intended to limit any of the associated features or configurations to a specific or separate embodiment or embodiments, and should not be interpreted to suggest that such features or configurations cannot be combined with features or configurations described with reference to other embodiments, variations, aspects, examples, configurations, implementations, cases, and so forth. In other words, features described herein with reference to a specific example (e.g., embodiment, variation, aspect, configuration, implementation, case, etc.) can be combined with features described with reference to another example. Precisely, one of ordinary skill in the art will readily recognize that the various embodiments or examples described herein, and their associated features, can be combined with each other. For example, while some specific protocols such as 802.11 and 802.3 are mentioned in the examples above, the principles could apply to any communication protocol and does not have to be limited to these particular protocols. Any configuration in which received data is acknowledged through an ACK signal could implement the concepts disclosed herein.


A phrase such as an “aspect” does not imply that such aspect is essential to the subject technology or that such aspect applies to all configurations of the subject technology. A disclosure relating to an aspect may apply to all configurations, or one or more configurations. A phrase such as an aspect may refer to one or more aspects and vice versa. A phrase such as a “configuration” does not imply that such configuration is essential to the subject technology or that such configuration applies to all configurations of the subject technology. A disclosure relating to a configuration may apply to all configurations, or one or more configurations. A phrase such as a configuration may refer to one or more configurations and vice versa. The word “exemplary” is used herein to mean “serving as an example or illustration.” Any aspect or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs.


Moreover, claim language reciting “at least one of” a set indicates that one member of the set or multiple members of the set satisfy the claim. For example, claim language reciting “at least one of A, B, and C” or “at least one of A, B, or C” means A alone, B alone, C alone, A and B together, A and C together, B and C together, or A, B and C together.

Claims
  • 1. A method comprising: collecting a respective live process core for each process in a group of processes without pausing or killing any process in the group of processes;applying a leak detection tool to each process in the group of processes to yield a list of leaked memory addresses for a given process of the group of processes; andtransmitting a message to the given process with the list of leaked memory addresses, whereby the given process calls a function to release leaked memory associated with the given process as identified in the message.
  • 2. The method of claim 1, wherein the group of processes comprises all processes in an application centric infrastructure fabric.
  • 3. The method of claim 1, wherein the group of processes comprises a group of selected processes from all processes within an application centric infrastructure fabric, according to a criteria.
  • 4. The method of claim 1, wherein applying the leak detection tool occurs in a container located in a cloud computing environment.
  • 5. The method of claim 1, further comprising: transmitting the respective live process core off-line to a container on a same switch for applying the leak detection tool.
  • 6. The method of claim 1, further comprising: transmitting the respective live process core to a container running in a cloud computing environment for applying the leak detection tool.
  • 7. A system comprising: at least one processor; anda computer-readable media storing instructions which, when executed by the at least one processor, cause the at least one processor to perform operations comprising: collecting a respective live process core for each process in a group of processes without pausing or killing any process in the group of processes;applying a leak detection tool to each process in the group of processes to yield a list of leaked memory addresses for a given process of the group of processes; andtransmitting a message to the given process with the list of leaked memory addresses, whereby the given process calls a function to release leaked memory associated with the given process as identified in the message.
  • 8. The system of claim 7, wherein the group of processes comprises all processes in an application centric infrastructure fabric.
  • 9. The system of claim 7, wherein the group of processes comprises a group of selected processes from all processes within an application centric infrastructure fabric, according to a criteria.
  • 10. The system of claim 7, wherein applying the leak detection tool occurs in a container located in a cloud computing environment.
  • 11. The system of claim 7, wherein the computer-readable media stores additional instructions which, when executed by the at least one processor, cause the at least one processor to perform operations further comprising: transmitting the respective live process core off-line to a container on a same switch for applying the leak detection tool.
  • 12. The system of claim 7, wherein the computer-readable media stores additional instructions which, when executed by the at least one processor, cause the at least one processor to perform operations further comprising: transmitting the respective live process core to a container running in a cloud computing environment for applying the leak detection tool.
  • 13. A non-transitory computer-readable media storing instructions which, when executed by a processor, cause the processor to perform operations comprising: collecting a respective live process core for each process in a group of processes without pausing or killing any process in the group of processes;applying a leak detection tool to each process in the group of processes to yield a list of leaked memory addresses for a given process of the group of processes; andtransmitting a message to the given process with the list of leaked memory addresses, whereby the given process calls a function to release leaked memory associated with the given process as identified in the message.
  • 14. The non-transitory computer-readable media of claim 13, wherein the group of processes comprises all processes in an application centric infrastructure fabric.
  • 15. The non-transitory computer-readable media of claim 13, wherein the group of processes comprises a group of selected processes from all processes within an application centric infrastructure fabric, according to a criteria.
  • 16. The non-transitory computer-readable media of claim 13, wherein applying the leak detection tool occurs in a container located in a cloud computing environment.
  • 17. The non-transitory computer-readable media of claim 13, wherein the non-transitory computer-readable media stores additional instructions which, when executed by the processor, cause the processor to perform operations further comprising: transmitting the respective live process core off-line to a container on a same switch for applying the leak detection tool.
  • 18. The non-transitory computer-readable media of claim 13, wherein the non-transitory computer-readable media stores additional instructions which, when executed by the processor, cause the processor to perform operations further comprising: transmitting the respective live process core to a container running in a cloud computing environment for applying the leak detection tool.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 15/654,906, filed on Jul. 20, 2017, the content of which is incorporated herein by reference in its entirety.

US Referenced Citations (581)
Number Name Date Kind
4688695 Hirohata Aug 1987 A
5263003 Cowles et al. Nov 1993 A
5339445 Gasztonyi Aug 1994 A
5430859 Norman et al. Jul 1995 A
5457746 Dolphin Oct 1995 A
5535336 Smith et al. Jul 1996 A
5588012 Oizumi Dec 1996 A
5617421 Chin et al. Apr 1997 A
5680579 Young et al. Oct 1997 A
5690194 Parker et al. Nov 1997 A
5740171 Mazzola et al. Apr 1998 A
5742604 Edsall et al. Apr 1998 A
5764636 Edsall Jun 1998 A
5809285 Hilland Sep 1998 A
5812814 Sukegawa Sep 1998 A
5812950 Tom Sep 1998 A
5838970 Thomas Nov 1998 A
5999930 Wolff Dec 1999 A
6035105 McCloghrie et al. Mar 2000 A
6043777 Bergman et al. Mar 2000 A
6101497 Ofek Aug 2000 A
6148414 Brown et al. Nov 2000 A
6185203 Berman Feb 2001 B1
6188694 Fine et al. Feb 2001 B1
6202135 Kedem et al. Mar 2001 B1
6208649 Kloth Mar 2001 B1
6209059 Ofer et al. Mar 2001 B1
6219699 McCloghrie et al. Apr 2001 B1
6219753 Richardson Apr 2001 B1
6223250 Yokono Apr 2001 B1
6226771 Hilla et al. May 2001 B1
6260120 Blumenau et al. Jul 2001 B1
6266705 Ullum et al. Jul 2001 B1
6269381 St. Pierre et al. Jul 2001 B1
6269431 Dunham Jul 2001 B1
6295575 Blumenau et al. Sep 2001 B1
6400730 Latif et al. Jun 2002 B1
6408406 Parris Jun 2002 B1
6542909 Tamer et al. Apr 2003 B1
6542961 Matsunami et al. Apr 2003 B1
6553390 Gross et al. Apr 2003 B1
6564252 Hickman et al. May 2003 B1
6647474 Yanai Moshe et al. Nov 2003 B2
6675258 Bramhall et al. Jan 2004 B1
6683883 Czeiger et al. Jan 2004 B1
6694413 Mimatsu et al. Feb 2004 B1
6708227 Cabrera et al. Mar 2004 B1
6715007 Williams et al. Mar 2004 B1
6728791 Young Apr 2004 B1
6772231 Reuter et al. Aug 2004 B2
6820099 Huber et al. Nov 2004 B1
6847647 Wrenn Jan 2005 B1
6848759 Doornbos et al. Feb 2005 B2
6850955 Sonoda et al. Feb 2005 B2
6876656 Brewer et al. Apr 2005 B2
6880062 Ibrahim et al. Apr 2005 B1
6898670 Nahum May 2005 B2
6907419 Pesola et al. Jun 2005 B1
6912668 Brown et al. Jun 2005 B1
6952734 Gunlock et al. Oct 2005 B1
6976090 Ben-Shaul et al. Dec 2005 B2
6978300 Beukema et al. Dec 2005 B1
6983303 Pellegrino et al. Jan 2006 B2
6986015 Testardi Jan 2006 B2
6986069 Oehler et al. Jan 2006 B2
7051056 Rodriguez-Rivera May 2006 B2
7069465 Chu et al. Jun 2006 B2
7073017 Yamamoto Jul 2006 B2
7108339 Berger Sep 2006 B2
7149858 Kiselev Dec 2006 B1
7171514 Coronado et al. Jan 2007 B2
7171668 Molloy et al. Jan 2007 B2
7174354 Andreasson Feb 2007 B2
7200144 Terrell et al. Apr 2007 B2
7222255 Claessens et al. May 2007 B1
7237045 Beckmann et al. Jun 2007 B2
7240188 Takata et al. Jul 2007 B2
7246260 Brown et al. Jul 2007 B2
7266718 Idei et al. Sep 2007 B2
7269168 Roy et al. Sep 2007 B2
7277431 Walter et al. Oct 2007 B2
7277948 Igarashi et al. Oct 2007 B2
7305658 Hamilton et al. Dec 2007 B1
7328434 Swanson et al. Feb 2008 B2
7340555 Ashmore et al. Mar 2008 B2
7346751 Prahlad et al. Mar 2008 B2
7352706 Klotz et al. Apr 2008 B2
7353305 Pangal et al. Apr 2008 B2
7359321 Sindhu et al. Apr 2008 B1
7383381 Faulkner et al. Jun 2008 B1
7403987 Marinelli et al. Jul 2008 B1
7433326 Desai et al. Oct 2008 B2
7433948 Edsall Oct 2008 B2
7434105 Rodriguez-Rivera et al. Oct 2008 B1
7441154 Klotz et al. Oct 2008 B2
7447839 Uppala Nov 2008 B2
7487321 Muthiah et al. Feb 2009 B2
7500053 Kavuri et al. Mar 2009 B1
7512744 Banga et al. Mar 2009 B2
7542681 Cornell et al. Jun 2009 B2
7558872 Senevirathne et al. Jul 2009 B1
7587570 Sarkar et al. Sep 2009 B2
7631023 Kaiser et al. Dec 2009 B1
7643505 Colloff Jan 2010 B1
7654625 Amann et al. Feb 2010 B2
7657796 Kaiser et al. Feb 2010 B1
7668981 Nagineni et al. Feb 2010 B1
7669071 Cochran et al. Feb 2010 B2
7689384 Becker Mar 2010 B1
7694092 Mizuno Apr 2010 B2
7697554 Ofer et al. Apr 2010 B1
7706303 Bose et al. Apr 2010 B2
7707481 Kirschner et al. Apr 2010 B2
7716648 Vaidyanathan et al. May 2010 B2
7752360 Galles Jul 2010 B2
7757059 Ofer et al. Jul 2010 B1
7774329 Peddy et al. Aug 2010 B1
7774839 Nazzal Aug 2010 B2
7793138 Rastogi et al. Sep 2010 B2
7827538 Trotter Nov 2010 B2
7840730 D'Amato et al. Nov 2010 B2
7843906 Chidambaram et al. Nov 2010 B1
7895428 Boland, IV et al. Feb 2011 B2
7904599 Bennett Mar 2011 B1
7930494 Goheer et al. Apr 2011 B1
7975175 Votta et al. Jul 2011 B2
7979670 Saliba et al. Jul 2011 B2
7984259 English Jul 2011 B1
8031703 Gottumukkula et al. Oct 2011 B2
8032621 Upalekar et al. Oct 2011 B1
8051197 Mullendore et al. Nov 2011 B2
8086755 Duffy, IV et al. Dec 2011 B2
8161134 Mishra et al. Apr 2012 B2
8196018 Forhan et al. Jun 2012 B2
8205951 Boks Jun 2012 B2
8218538 Chidambaram et al. Jul 2012 B1
8230066 Heil Jul 2012 B2
8234377 Cohn Jul 2012 B2
8266238 Zimmer et al. Sep 2012 B2
8272104 Chen et al. Sep 2012 B2
8274993 Sharma et al. Sep 2012 B2
8290919 Kelly et al. Oct 2012 B1
8297722 Chambers et al. Oct 2012 B2
8301746 Head et al. Oct 2012 B2
8335231 Kloth et al. Dec 2012 B2
8341121 Claudatos et al. Dec 2012 B1
8345692 Smith Jan 2013 B2
8352941 Protopopov et al. Jan 2013 B1
8392760 Kandula et al. Mar 2013 B2
8423718 Tsai et al. Apr 2013 B2
8442059 de la Iglesia et al. May 2013 B1
8479211 Marshall et al. Jul 2013 B1
8495356 Ashok et al. Jul 2013 B2
8514868 Hill Aug 2013 B2
8532108 Li et al. Sep 2013 B2
8560663 Baucke et al. Oct 2013 B2
8619599 Even Dec 2013 B1
8626891 Guru et al. Jan 2014 B2
8630983 Sengupta et al. Jan 2014 B2
8660129 Brendel et al. Feb 2014 B1
8661299 Ip Feb 2014 B1
8677485 Sharma et al. Mar 2014 B2
8683296 Anderson et al. Mar 2014 B2
8706772 Hartig et al. Apr 2014 B2
8719804 Jain May 2014 B2
8725854 Edsall May 2014 B2
8768981 Milne et al. Jul 2014 B1
8775773 Acharya et al. Jul 2014 B2
8793372 Ashok et al. Jul 2014 B2
8805918 Chandrasekaran et al. Aug 2014 B1
8805951 Faibish et al. Aug 2014 B1
8832330 Lancaster Sep 2014 B1
8855116 Rosset et al. Oct 2014 B2
8856339 Mestery et al. Oct 2014 B2
8868474 Leung et al. Oct 2014 B2
8887286 Dupont et al. Nov 2014 B2
8898385 Jayaraman et al. Nov 2014 B2
8909928 Ahmad et al. Dec 2014 B2
8918510 Gmach et al. Dec 2014 B2
8918586 Todd et al. Dec 2014 B1
8924720 Raghuram et al. Dec 2014 B2
8930747 Levijarvi et al. Jan 2015 B2
8935500 Gulati et al. Jan 2015 B1
8949677 Brundage et al. Feb 2015 B1
8996837 Bono et al. Mar 2015 B1
9003086 Schuller et al. Apr 2015 B1
9007922 Mittal et al. Apr 2015 B1
9009427 Sharma et al. Apr 2015 B2
9009704 McGrath et al. Apr 2015 B2
9075638 Barnett et al. Jul 2015 B2
9141554 Candelaria Sep 2015 B1
9141785 Mukkara et al. Sep 2015 B2
9164795 Vincent Oct 2015 B1
9176677 Fradkin et al. Nov 2015 B1
9201704 Chang et al. Dec 2015 B2
9203784 Chang et al. Dec 2015 B2
9207882 Rosset et al. Dec 2015 B2
9207929 Katsura Dec 2015 B2
9213612 Candelaria Dec 2015 B2
9223564 Munireddy et al. Dec 2015 B2
9223634 Chang et al. Dec 2015 B2
9244761 Yekhanin et al. Jan 2016 B2
9250969 Lager-Cavilla et al. Feb 2016 B2
9264494 Factor et al. Feb 2016 B2
9270754 Iyengar et al. Feb 2016 B2
9280487 Candelaria Mar 2016 B2
9304815 Vasanth et al. Apr 2016 B1
9313048 Chang et al. Apr 2016 B2
9374270 Nakil et al. Jun 2016 B2
9378060 Jansson et al. Jun 2016 B2
9396251 Boudreau et al. Jul 2016 B1
9448877 Candelaria Sep 2016 B2
9471348 Zuo et al. Oct 2016 B2
9501473 Kong et al. Nov 2016 B1
9503523 Rosset et al. Nov 2016 B2
9565110 Mullendore et al. Feb 2017 B2
9575828 Agarwal et al. Feb 2017 B2
9582377 Dhoolam et al. Feb 2017 B1
9614763 Dong et al. Apr 2017 B2
9658868 Hill May 2017 B2
9658876 Chang et al. May 2017 B2
9733868 Chandrasekaran et al. Aug 2017 B2
9763518 Charest et al. Sep 2017 B2
9824005 Helliwell Nov 2017 B1
9830240 George et al. Nov 2017 B2
9853873 Dasu et al. Dec 2017 B2
9940068 Schorn et al. Apr 2018 B2
10303534 Ganapathy May 2019 B2
20020049980 Hoang Apr 2002 A1
20020053009 Selkirk et al. May 2002 A1
20020073276 Howard et al. Jun 2002 A1
20020083120 Soltis Jun 2002 A1
20020095547 Watanabe et al. Jul 2002 A1
20020103889 Markson et al. Aug 2002 A1
20020103943 Lo et al. Aug 2002 A1
20020112113 Karpoff et al. Aug 2002 A1
20020120741 Webb et al. Aug 2002 A1
20020138675 Mann Sep 2002 A1
20020156971 Jones et al. Oct 2002 A1
20030023885 Potter et al. Jan 2003 A1
20030026267 Oberman et al. Feb 2003 A1
20030055933 Ishizaki et al. Mar 2003 A1
20030056126 O'Connor et al. Mar 2003 A1
20030065986 Fraenkel et al. Apr 2003 A1
20030084359 Bresniker et al. May 2003 A1
20030118053 Edsall et al. Jun 2003 A1
20030131105 Czeiger et al. Jul 2003 A1
20030131165 Asano et al. Jul 2003 A1
20030131182 Kumar et al. Jul 2003 A1
20030140134 Swanson et al. Jul 2003 A1
20030140210 Testardi Jul 2003 A1
20030149763 Heitman et al. Aug 2003 A1
20030154271 Baldwin et al. Aug 2003 A1
20030159058 Eguchi et al. Aug 2003 A1
20030174725 Shankar Sep 2003 A1
20030189395 Doornbos et al. Oct 2003 A1
20030210686 Terrell et al. Nov 2003 A1
20040024961 Cochran et al. Feb 2004 A1
20040030857 Krakirian et al. Feb 2004 A1
20040039939 Cox et al. Feb 2004 A1
20040054776 Klotz et al. Mar 2004 A1
20040057389 Klotz et al. Mar 2004 A1
20040059807 Klotz et al. Mar 2004 A1
20040088574 Walter et al. May 2004 A1
20040117438 Considine et al. Jun 2004 A1
20040123029 Dalai et al. Jun 2004 A1
20040128470 Hetzler et al. Jul 2004 A1
20040128540 Roskind Jul 2004 A1
20040153863 Klotz et al. Aug 2004 A1
20040190901 Fang Sep 2004 A1
20040215749 Tsao Oct 2004 A1
20040230848 Mayo et al. Nov 2004 A1
20040250034 Yagawa et al. Dec 2004 A1
20050033936 Nakano et al. Feb 2005 A1
20050036499 Dutt et al. Feb 2005 A1
20050050211 Kaul et al. Mar 2005 A1
20050050270 Horn et al. Mar 2005 A1
20050053073 Kloth et al. Mar 2005 A1
20050055428 Terai et al. Mar 2005 A1
20050060574 Klotz et al. Mar 2005 A1
20050060598 Klotz et al. Mar 2005 A1
20050071851 Opheim Mar 2005 A1
20050076113 Klotz et al. Apr 2005 A1
20050091426 Horn et al. Apr 2005 A1
20050114611 Durham et al. May 2005 A1
20050114615 Ogasawara et al. May 2005 A1
20050117522 Basavaiah et al. Jun 2005 A1
20050117562 Wrenn Jun 2005 A1
20050138287 Ogasawara et al. Jun 2005 A1
20050169188 Cometto et al. Aug 2005 A1
20050185597 Le et al. Aug 2005 A1
20050188170 Yamamoto Aug 2005 A1
20050198523 Shanbhag et al. Sep 2005 A1
20050235072 Smith et al. Oct 2005 A1
20050283658 Clark et al. Dec 2005 A1
20060015861 Takata et al. Jan 2006 A1
20060015928 Setty et al. Jan 2006 A1
20060034302 Peterson Feb 2006 A1
20060045021 Deragon et al. Mar 2006 A1
20060075191 Lolayekar et al. Apr 2006 A1
20060098672 Schzukin et al. May 2006 A1
20060117099 Mogul Jun 2006 A1
20060136684 Le et al. Jun 2006 A1
20060184287 Belady et al. Aug 2006 A1
20060198319 Schondelmayer et al. Sep 2006 A1
20060215297 Kikuchi Sep 2006 A1
20060230227 Ogasawara et al. Oct 2006 A1
20060242332 Johnsen et al. Oct 2006 A1
20060251111 Kloth et al. Nov 2006 A1
20070005297 Beresniewicz et al. Jan 2007 A1
20070067593 Satoyama et al. Mar 2007 A1
20070079068 Draggon Apr 2007 A1
20070091903 Atkinson Apr 2007 A1
20070094465 Sharma et al. Apr 2007 A1
20070101202 Garbow May 2007 A1
20070121519 Cuni et al. May 2007 A1
20070136541 Herz et al. Jun 2007 A1
20070162969 Becker Jul 2007 A1
20070211640 Palacharla et al. Sep 2007 A1
20070214316 Kim Sep 2007 A1
20070250838 Belady et al. Oct 2007 A1
20070258380 Chamdani et al. Nov 2007 A1
20070263545 Foster et al. Nov 2007 A1
20070276884 Hara et al. Nov 2007 A1
20070283059 Ho et al. Dec 2007 A1
20080016412 White et al. Jan 2008 A1
20080034149 Sheen Feb 2008 A1
20080052459 Chang et al. Feb 2008 A1
20080059698 Kabir et al. Mar 2008 A1
20080114933 Ogasawara et al. May 2008 A1
20080126509 Subramanian et al. May 2008 A1
20080126734 Murase May 2008 A1
20080168304 Flynn et al. Jul 2008 A1
20080201616 Ashmore Aug 2008 A1
20080244184 Lewis et al. Oct 2008 A1
20080256082 Davies et al. Oct 2008 A1
20080267217 Colville et al. Oct 2008 A1
20080288661 Galles Nov 2008 A1
20080294888 Ando et al. Nov 2008 A1
20090063766 Matsumura et al. Mar 2009 A1
20090083484 Basham et al. Mar 2009 A1
20090089567 Boland, IV et al. Apr 2009 A1
20090094380 Qiu et al. Apr 2009 A1
20090094664 Butler et al. Apr 2009 A1
20090125694 Innan et al. May 2009 A1
20090193223 Saliba et al. Jul 2009 A1
20090201926 Kagan et al. Aug 2009 A1
20090222733 Basham et al. Sep 2009 A1
20090240873 Yu et al. Sep 2009 A1
20090282471 Green et al. Nov 2009 A1
20090323706 Germain et al. Dec 2009 A1
20100011365 Gerovac et al. Jan 2010 A1
20100030995 Wang et al. Feb 2010 A1
20100046378 Knapp et al. Feb 2010 A1
20100083055 Ozonat Apr 2010 A1
20100174968 Charles et al. Jul 2010 A1
20100318609 Lahiri et al. Dec 2010 A1
20100318837 Murphy et al. Dec 2010 A1
20110010394 Carew et al. Jan 2011 A1
20110022691 Banerjee et al. Jan 2011 A1
20110029824 Schöler et al. Feb 2011 A1
20110035494 Pandey et al. Feb 2011 A1
20110075667 Li et al. Mar 2011 A1
20110087848 Trent Apr 2011 A1
20110119556 de Buen May 2011 A1
20110142053 Van Der Merwe et al. Jun 2011 A1
20110161496 Nicklin Jun 2011 A1
20110173303 Rider Jul 2011 A1
20110228679 Varma et al. Sep 2011 A1
20110231899 Pulier et al. Sep 2011 A1
20110239039 Dieffenbach et al. Sep 2011 A1
20110252274 Kawaguchi et al. Oct 2011 A1
20110252276 Tsai et al. Oct 2011 A1
20110255540 Mizrahi et al. Oct 2011 A1
20110276584 Cotner et al. Nov 2011 A1
20110276675 Singh et al. Nov 2011 A1
20110276951 Jain Nov 2011 A1
20110299539 Rajagopal et al. Dec 2011 A1
20110307450 Hahn et al. Dec 2011 A1
20110313973 Srivas et al. Dec 2011 A1
20120023319 Chin et al. Jan 2012 A1
20120030401 Cowan et al. Feb 2012 A1
20120054367 Ramakrishnan et al. Mar 2012 A1
20120072578 Alam Mar 2012 A1
20120072985 Davne et al. Mar 2012 A1
20120075999 Ko et al. Mar 2012 A1
20120084445 Brock et al. Apr 2012 A1
20120084782 Chou et al. Apr 2012 A1
20120096134 Suit Apr 2012 A1
20120130874 Mane et al. May 2012 A1
20120131174 Ferris et al. May 2012 A1
20120134672 Banerjee May 2012 A1
20120144014 Natham et al. Jun 2012 A1
20120159112 Tokusho et al. Jun 2012 A1
20120167094 Suit Jun 2012 A1
20120173581 Hartig et al. Jul 2012 A1
20120173589 Kwon et al. Jul 2012 A1
20120177039 Berman Jul 2012 A1
20120177041 Berman Jul 2012 A1
20120177042 Berman Jul 2012 A1
20120177043 Berman Jul 2012 A1
20120177044 Berman Jul 2012 A1
20120177045 Berman Jul 2012 A1
20120177370 Berman Jul 2012 A1
20120179909 Sagi et al. Jul 2012 A1
20120201138 Yu et al. Aug 2012 A1
20120210041 Flynn et al. Aug 2012 A1
20120254440 Wang Oct 2012 A1
20120257501 Kucharczyk Oct 2012 A1
20120265976 Spiers et al. Oct 2012 A1
20120281706 Agarwal et al. Nov 2012 A1
20120297088 Wang et al. Nov 2012 A1
20120303618 Dutta et al. Nov 2012 A1
20120311106 Morgan Dec 2012 A1
20120311568 Jansen Dec 2012 A1
20120320788 Venkataramanan et al. Dec 2012 A1
20120324114 Dutta et al. Dec 2012 A1
20120331119 Bose et al. Dec 2012 A1
20130003737 Sinicrope Jan 2013 A1
20130013664 Baird et al. Jan 2013 A1
20130028135 Berman Jan 2013 A1
20130036212 Jibbe et al. Feb 2013 A1
20130036213 Hasan et al. Feb 2013 A1
20130036449 Mukkara et al. Feb 2013 A1
20130054888 Bhat et al. Feb 2013 A1
20130061089 Valiyaparambil et al. Mar 2013 A1
20130067162 Jayaraman et al. Mar 2013 A1
20130080823 Roth et al. Mar 2013 A1
20130086340 Fleming et al. Apr 2013 A1
20130100858 Kamath et al. Apr 2013 A1
20130111540 Sabin May 2013 A1
20130138816 Kuo et al. May 2013 A1
20130138836 Cohen et al. May 2013 A1
20130139138 Kakos May 2013 A1
20130144933 Hinni et al. Jun 2013 A1
20130145220 Lv Jun 2013 A1
20130152076 Patel Jun 2013 A1
20130152175 Hromoko et al. Jun 2013 A1
20130163426 Beliveau et al. Jun 2013 A1
20130163606 Bagepalli et al. Jun 2013 A1
20130179941 McGloin et al. Jul 2013 A1
20130182712 Aguayo et al. Jul 2013 A1
20130185433 Zhu et al. Jul 2013 A1
20130191106 Kephart et al. Jul 2013 A1
20130198730 Munireddy et al. Aug 2013 A1
20130208888 Agrawal et al. Aug 2013 A1
20130212130 Rahnama Aug 2013 A1
20130223236 Dickey Aug 2013 A1
20130238641 Mandelstein et al. Sep 2013 A1
20130266307 Garg et al. Oct 2013 A1
20130268922 Tiwari et al. Oct 2013 A1
20130275470 Cao et al. Oct 2013 A1
20130297655 Narasayya et al. Nov 2013 A1
20130297769 Chang et al. Nov 2013 A1
20130318134 Bolik et al. Nov 2013 A1
20130318288 Khan et al. Nov 2013 A1
20140006708 Huynh et al. Jan 2014 A1
20140016493 Johnsson et al. Jan 2014 A1
20140019684 Wei et al. Jan 2014 A1
20140025770 Warfield et al. Jan 2014 A1
20140029441 Nydell Jan 2014 A1
20140029442 Wallman Jan 2014 A1
20140039683 Zimmermann et al. Feb 2014 A1
20140040473 Ho et al. Feb 2014 A1
20140040883 Tompkins Feb 2014 A1
20140047201 Mehta Feb 2014 A1
20140053264 Dubrovsky et al. Feb 2014 A1
20140059187 Rosset et al. Feb 2014 A1
20140059266 Ben-Michael et al. Feb 2014 A1
20140086253 Yong Mar 2014 A1
20140089273 Borshack et al. Mar 2014 A1
20140095556 Lee et al. Apr 2014 A1
20140096249 Dupont et al. Apr 2014 A1
20140105009 Vos et al. Apr 2014 A1
20140108474 David et al. Apr 2014 A1
20140109071 Ding et al. Apr 2014 A1
20140112122 Kapadia et al. Apr 2014 A1
20140123207 Agarwal et al. May 2014 A1
20140156557 Zeng et al. Jun 2014 A1
20140164666 Yand Jun 2014 A1
20140164866 Bolotov et al. Jun 2014 A1
20140172371 Zhu et al. Jun 2014 A1
20140173060 Jubran et al. Jun 2014 A1
20140173195 Rosset et al. Jun 2014 A1
20140173579 McDonald et al. Jun 2014 A1
20140189278 Peng Jul 2014 A1
20140198794 Mehta et al. Jul 2014 A1
20140211661 Gorkemli et al. Jul 2014 A1
20140215265 Mohanta et al. Jul 2014 A1
20140215590 Brand Jul 2014 A1
20140219086 Cantu' et al. Aug 2014 A1
20140222953 Karve et al. Aug 2014 A1
20140229790 Goss et al. Aug 2014 A1
20140244585 Sivasubramanian et al. Aug 2014 A1
20140244897 Goss et al. Aug 2014 A1
20140245435 Belenky Aug 2014 A1
20140269390 Ciodaru et al. Sep 2014 A1
20140281700 Nagesharao et al. Sep 2014 A1
20140297941 Rajani et al. Oct 2014 A1
20140307578 DeSanti Oct 2014 A1
20140317206 Lomelino et al. Oct 2014 A1
20140324862 Bingham et al. Oct 2014 A1
20140325208 Resch et al. Oct 2014 A1
20140331276 Frascadore et al. Nov 2014 A1
20140348166 Yang et al. Nov 2014 A1
20140351656 Moser Nov 2014 A1
20140355450 Bhikkaji et al. Dec 2014 A1
20140366155 Chang et al. Dec 2014 A1
20140376550 Khan et al. Dec 2014 A1
20150003450 Salam et al. Jan 2015 A1
20150003458 Li et al. Jan 2015 A1
20150003463 Li et al. Jan 2015 A1
20150010001 Duda et al. Jan 2015 A1
20150016461 Qiang Jan 2015 A1
20150030024 Venkataswami et al. Jan 2015 A1
20150046123 Kato Feb 2015 A1
20150063353 Kapadia et al. Mar 2015 A1
20150067001 Koltsidas Mar 2015 A1
20150082432 Eaton et al. Mar 2015 A1
20150092824 Wicker, Jr. et al. Apr 2015 A1
20150120907 Niestemski et al. Apr 2015 A1
20150121131 Kiselev et al. Apr 2015 A1
20150127979 Doppalapudi May 2015 A1
20150142840 Baldwin et al. May 2015 A1
20150169313 Katsura Jun 2015 A1
20150180672 Kuwata Jun 2015 A1
20150207763 Bertran Ortiz et al. Jun 2015 A1
20150205974 Talley et al. Jul 2015 A1
20150222444 Sarkar Aug 2015 A1
20150229546 Somaiya et al. Aug 2015 A1
20150248366 Bergsten et al. Sep 2015 A1
20150248418 Bhardwaj et al. Sep 2015 A1
20150254003 Lee et al. Sep 2015 A1
20150254088 Chou et al. Sep 2015 A1
20150261446 Lee Sep 2015 A1
20150263993 Kuch et al. Sep 2015 A1
20150269048 Marr et al. Sep 2015 A1
20150277804 Arnold et al. Oct 2015 A1
20150281067 Wu Oct 2015 A1
20150303949 Jafarkhani et al. Oct 2015 A1
20150341237 Cuni et al. Nov 2015 A1
20150341239 Bertran Ortiz et al. Nov 2015 A1
20150358136 Medard Dec 2015 A1
20150379150 Duda Dec 2015 A1
20160004611 Lakshman et al. Jan 2016 A1
20160011936 Luby Jan 2016 A1
20160011942 Golbourn et al. Jan 2016 A1
20160054922 Awasthi et al. Feb 2016 A1
20160062820 Jones et al. Mar 2016 A1
20160070652 Sundararaman et al. Mar 2016 A1
20160087885 Tripathi et al. Mar 2016 A1
20160088083 Bharadwaj et al. Mar 2016 A1
20160119159 Zhao et al. Apr 2016 A1
20160119421 Semke et al. Apr 2016 A1
20160139820 Fluman et al. May 2016 A1
20160149639 Pham et al. May 2016 A1
20160205189 Mopur et al. Jul 2016 A1
20160210161 Rosset et al. Jul 2016 A1
20160231928 Lewis et al. Aug 2016 A1
20160274926 Narasimhamurthy et al. Sep 2016 A1
20160285760 Dong Sep 2016 A1
20160292359 Tellis et al. Oct 2016 A1
20160294983 Kliteynik et al. Oct 2016 A1
20160334998 George et al. Nov 2016 A1
20160366094 Mason et al. Dec 2016 A1
20160378624 Jenkins, Jr. et al. Dec 2016 A1
20160380694 Guduru Dec 2016 A1
20170010874 Rosset Jan 2017 A1
20170010930 Dutta et al. Jan 2017 A1
20170019475 Metz et al. Jan 2017 A1
20170068630 Iskandar et al. Mar 2017 A1
20170168970 Sajeepa et al. Jun 2017 A1
20170177860 Suarez et al. Jun 2017 A1
20170212858 Chu et al. Jul 2017 A1
20170273019 Park et al. Sep 2017 A1
20170277655 Das et al. Sep 2017 A1
20170337097 Sipos et al. Nov 2017 A1
20170340113 Charest et al. Nov 2017 A1
20170371558 George et al. Dec 2017 A1
20180097707 Wright et al. Apr 2018 A1
20180121178 Distefano et al. May 2018 A1
Foreign Referenced Citations (9)
Number Date Country
2228719 Sep 2010 EP
2439637 Apr 2012 EP
2680155 Jan 2014 EP
2350028 May 2001 GB
2000-242434 Sep 2000 JP
1566104 Jan 2017 TW
WO 2004077214 Sep 2004 WO
WO 2016003408 Jan 2016 WO
WO 2016003489 Jan 2016 WO
Non-Patent Literature Citations (82)
Entry
Author Unknown, “5 Benefits of a Storage Gateway in the Cloud,” Blog, TwinStrata, Inc., posted Jul. 10, 2012, 4 pages, https://web.archive.org/web/20120725092619/http://blog.twinstrata.com/2012/07/10//5-benefits-of-a-storage-gateway-in-the-cloud.
Author Unknown, “Configuration Interface for IBM System Storage DS5000, IBM DS4000, and IBM DS3000 Systems,” IBM San Volume Controller Version 7.1, IBM® System Storage® San Volume Controller Information Center, Jun. 16, 2013, 3 pages.
Author Unknown, “Coraid EtherCloud, Software-Defined Storage with Scale-Out Infrastructure,” Solution Brief, 2013, 2 pages, Coraid, Redwood City, California, U.S.A.
Author Unknown, “Coraid Virtual DAS (VDAS) Technology: Eliminate Tradeoffs between DAS and Networked Storage,” Coraid Technology Brief, ©2013 Cora id, Inc., Published on or about Mar. 20, 2013, 2 pages.
Author Unknown, “Creating Performance-based SAN SLAs Using Finisar's NetWisdom” May 2006, 7 pages, Finisar Corporation, Sunnyvale, California, U.S.A.
Author Unknown, “Data Center, Metro Cloud Connectivity: Integrated Metro SAN Connectivity in 16 Gbps Switches,” Brocade Communication Systems, Inc., Apr. 2011, 14 pages.
Author Unknown, “Data Center, SAN Fabric Administration Best Practices Guide, Support Perspective,” Brocade Communication Systems, Inc., May 2013, 21 pages.
Author Unknown, “delphi—Save a CRC value in a file, without altering the actual CRC Checksum?” Stack Overflow, stackoverflow.com, Dec. 23, 2011, XP055130879, 3 pages http://stackoverflow.com/questions/8608219/save-a-crc-value-in-a-file-wihout-altering-the-actual-crc-checksum.
Author Unknown, “EMC UNISPHERE: Innovative Approach to Managing Low-End and Midrange Storage; Redefining Simplicity in the Entry-Level and Midrange Storage Markets,” Data Sheet, EMC Corporation; published on or about Jan. 4, 2013 [Retrieved and printed Sep. 12, 2013] 6 pages http://www.emc.com/storage/vnx/unisphere.htm.
Author Unknown, “HP XP Array Manager Software—Overview & Features,” Storage Device Management Software; Hewlett-Packard Development Company, 3 pages; © 2013 Hewlett-Packard Development Company, L.P.
Author Unknown, “Joint Cisco and VMWare Solution for Optimizing Virtual Desktop Delivery: Data Center 3.0: Solutions to Accelerate Data Center Virtualization,” Cisco Systems, Inc. and VMware, Inc., Sep. 2008, 10 pages.
Author Unknown, “Network Transformation with Software-Defined Networking and Ethernet Fabrics,” Positioning Paper, 2012, 6 pages, Brocade Communications Systems.
Author Unknown, “Recreating Real Application Traffic in Junosphere Lab,” Solution Brief, Juniper Networks, Dec. 2011, 3 pages.
Author Unknown, “Shunra for HP Softwarer, Enabiling Confidence in Application Performance Before Deployment,” 2010, 2 pages.
Author Unknown, “Software Defined Networking: The New Norm for Networks,” White Paper, Open Networking Foundation, Apr. 13, 2012, 12 pages.
Author Unknown, “Software Defined Storage Networks an Introduction,” White Paper, Doc # 01-000030-001 Rev. A, Dec. 12, 2012, 8 pages; Jeda Networks, Newport Beach, California, U.S.A.
Author Unknown, “Standard RAID Levels,” Wikipedia, the Free Encyclopedia, last updated Jul. 18, 2014, 7 pages; http//en.wikipedia.org/wiki/Standard_RAID_levels.
Author Unknown, “Storage Infrastructure for the Cloud,” Solution Brief, © 2012, 3 pages; coraid, Redwood City, California, U.S.A.
Author Unknown, “Storage Area Network—NPIV: Emulex Virtual HBA and Brocade, Proven Interoperability and Proven Solution,” Technical Brief, Apr. 2008, 4 pages, Emulex and Brocade Communications Systems.
Author Unknown, “The Fundamentals of Software-Defined Storage, Simplicity at Scale for Cloud-Architectures” Solution Brief, 2013, 3 pages; Coraid, Redwood City, California, U.S.A.
Author Unknown, “VirtualWisdom® SAN Performance Probe Family Models: Probe FC8, HD, and HD48,” Virtual Instruments Data Sheet, Apr. 2014 Virtual Instruments. All Rights Reserved; 4 pages.
Author Unknown, “Xgig Analyzer: Quick Start Feature Guide 4.0,” Feb. 2008, 24 pages, Finisar Corporation, Sunnyvale, California, U.S.A.
Author Unknown, “Sun Storage Common Array Manager Installation and Setup Guide,” Software Installation and Setup Guide Version 6.7.x 821-1362-10, Appendix D: Configuring In-Band Management, Sun Oracle; retrieved and printed Sep. 12, 2013, 15 pages.
Author Unknown, “Vblock Solution for SAP: Simplified Provisioning for Operation Efficiency,” VCE White Paper, VCE—The Virtual Computing Environment Company, Aug. 2011, 11 pages.
Aweya, James, et al., “Multi-level active queue management with dynamic thresholds,” Elsevier, Computer Communications 25 (2002) pp. 756-771.
Berman, Stuart, et al., “Start-Up Jeda Networks in Software Defined Storage Network Technology,” Press Release, Feb. 25, 2013, 2 pages, http://www.storagenewsletter.com/news/startups/ieda-networks.
Borovick, Lucinda, et al., “White Paper, Architecting the Network for the Cloud,” IDC Analyze the Future, Jan. 2011, pp. 1-8.
Chakrabarti, Kaushik, et al., “Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases,” ACM Transactions on Database Systems, vol. 27, No. 2, Jun. 2009, pp. 188-228.
Chandola, Varun, et al., “A Gaussian Process Based Online Change Detection Algorithm for Monitoring Periodic Time Series,” Proceedings of the Eleventh Siam International Conference on Data Mining, SDM 2011, Apr. 28-30, 2011, 12 pages.
Cisco Systems, Inc. “N-Port Virtualization in the Data Center,” Cisco White Paper, Cisco Systems, Inc., Mar. 2008, 7 pages.
Cisco Systems, Inc., “Best Practices in Deploying Cisco Nexus 1000V Series Switches on Cisco UCS B and C Series Cisco UCS Manager Servers,” White Paper, Cisco Systems, Inc., Apr. 2011, 36 pages.
Cisco Systems, Inc., “Cisco Prime Data Center Network Manager 6.1,” At-A-Glance, © 2012, 3 pages.
Cisco Systems, Inc., “Cisco Prime Data Center Network Manager,” Release 6.1 Data Sheet, © 2012, 10 pages.
Cisco Systems, Inc., “Cisco Unified Network Services: Overcome Obstacles to Cloud-Ready Deployments,” White Paper, Cisco Systems, Inc., Jan. 2011, 6 pages.
Clarke, Alan, et al., “Open Data Center Alliance Usage: Virtual Machine (VM) Interoperability in a Hybrid Cloud Environment Rev. 1.2,” Open Data Center Alliance, Inc., 2013, pp. 1-18.
Cummings, Roger, et al., Fibre Channel—Fabric Generic Requirements (FC-FG), Dec. 4, 1996, 33 pages, American National Standards Institute, Inc., New York, New York, U.S.A.
Farber, Franz, et al. “An In-Memory Database System for Multi-Tenant Applications,” Proceedings of 14th Business, Technology and Web (BTW) Conference on Database Systems for Business, Technology, and Web, Feb. 28 to Mar. 4, 2011, 17 pages, University of Kaiserslautern, Germany.
Guo, Chang Jie, et al., “IBM Resarch Report: Data Integration and Composite Business Services, Part 3, Building a Multi-Tenant Data Tier with with [sic] Access Control and Security,” RC24426 (C0711-037), Nov. 19, 2007, 20 pages, IBM.
Hatzieleftheriou, Andromachi, et al., “Host-side Filesystem Journaling for Durable Shared Storage,” 13th USENIX Conference on File and Storage Technologies (FAST '15), Feb. 16-19, 2015, 9 pages; https://www.usenix.org/system/files/conference/fast15/fast15-paper-hatzieleftheriou.pdf.
Hedayat, K., et al., “A Two-Way Active Measurement Protocol (TWAMP),” Network Working Group, RFC 5357, Oct. 2008, 26 pages.
Horn, C., et al., “Online anomaly detection with expert system feedback in social networks,” 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), May 22-27, 2011, 2 pages, Prague; [Abstract only].
Hosterman, Cody, et al., “Using EMC Symmetrix Storage inVMware vSph ere Environments,” Version 8.0, EMC2Techbooks, EMC Corporation; published on or about Jul. 8, 2008, 314 pages; [Retrieved and printed Sep. 12, 2013].
Hu, Yuchong, et al., “Cooperative Recovery of Distributed Storage Systems from Multiple Losses with Network Coding,” University of Science & Technology of China, Feb. 2010, 9 pages.
Keogh, Eamonn, et al., “Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases,” KAIS Long Paper submitted May 16, 2000; 19 pages.
Kolyshkin, Kirill, “Virtualization in Linux,” Sep. 1, 2006, pp. 1-5.
Kovar, Joseph F., “Startup Jeda Networks Takes SDN Approach to Storage Networks,” CRN Press Release, Feb. 22, 2013, 1 page, http://www.crn.com/240149244/printablearticle.htm.
Lampson, Butler, W., et al., “Crash Recovery in a Distributed Data Storage System,” Jun. 1, 1979, 28 pages.
Lewis, Michael E., et al., “Design of an Advanced Development Model Optical Disk-Based Redundant Array of Independent Disks (RAID) High Speed Mass Storage Subsystem,” Final Technical Report, Oct. 1997, pp. 1-211.
Lin, Jessica, “Finding Motifs in Time Series,” SIGKDD'02 Jul. 23,-26, 2002, 11 pages, Edmonton, Alberta, Canada.
Linthicum, David, “VM Import could be a game changer for hybrid clouds”, InfoWorld, Dec. 23, 2010, 4 pages.
Long, Abraham Jr., “Modeling the Reliability of RAID Sets,” Dell Power Solutions, May 2008, 4 pages.
Ma, Ao, et al., “RAIDShield: Characterizing, Monitoring, and Proactively Protecting Against Disk Failures,” FAST '15, 13th USENIX Conference on File and Storage Technologies, Feb. 16-19, 2015, 17 pages, Santa Clara, California, U.S.A.
Mahalingam, M., et al., “Virtual eXtensible Local Area Network (VXLAN): A Framework for Overlaying Virtualized Layer 2 Networks over Layer 3 Networks,” Independent Submission, RFC 7348, Aug. 2014, 22 pages; http://www.hip.at/doc/rfc/rfc7348.html.
McQuerry, Steve, “Cisco UCS M-Series Modular Servers for Cloud-Scale Workloads,” White Paper, Cisco Systems, Inc., Sep. 2014, 11 pages.
Monia, Charles, et al., IFCP—A Protocol for Internet Fibre Channel Networking, draft-monia-ips-ifcp-00.txt, Dec. 12, 2000, 6 pages.
Mueen, Abdullah, et al., “Online Discovery and Maintenance of Time Series Motifs,” KDD'10 the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Jul. 25-28, 2010, 10 pages, Washington, DC, U.S.A.
Muglia, Bob, “Decoding SDN,” Jan. 14, 2013, Juniper Networks, pp. 1-7, http://forums.juniper.net/t5/The-New-Network/Decoding-SDN/ba-p/174651.
Murray, Joseph F., et al., “Machine Learning Methods for Predicting Failures in Hard Drives: A Multiple-Instance Application,” Journal of Machine Learning Research 6 (2005), pp. 783-816; May 2005, 34 pages.
Nelson, Mark, “File Verification Using CRC,” Dr. Dobb's Journal, May 1, 1992, pp. 1-18, XP055130883.
Pace, Alberto, “Technologies for Large Data Management in Scientific Computing,” International Journal of Modern Physics C., vol. 25, No. 2, Feb. 2014, 72 pages.
Petersen, Chris, “Introducing Lightning: A flexible NVMe JBOF,” Mar. 9, 2016, 6 pages.
Pinheiro, Eduardo, et al., “Failure Trends in a Large Disk Drive Population,” FAST '07, 5th USENIX Conference on File and Storage Technologies, Feb. 13-16, 2007, 13 pages, San Jose, California, U.S.A.
Raginsky, Maxim, et al., “Sequential Anomaly Detection in the Presence of Noise and Limited Feedback,” arXiv:0911.2904v4 [cs.LG] Mar. 13, 2012, 19 pages.
Saidi, Ali G., et al., “Performance Validation of Network-Intensive Workloads on a Full-System Simulator,” Interaction between Operating System and Computer Architecture Workshop, (IOSCA 2005), Austin, Texas, Oct. 2005, 10 pages.
Sajassi, A., et al., “BGP MPLS Based Ethernet VPN,” Network Working Group, Oct. 18, 2014, 52 pages.
Sajassi, Ali, et al., “A Network Virtualization Overlay Solution using EVPN,” L2VPN Workgroup, Nov. 10, 2014, 24 pages; http://tools.ietf.org/pdf/draft-ietf-bess-evpn-overlay-00.pdf.
Sajassi, Ali, et al., “Integrated Routing and Bridging in EVPN,” L2VPN Workgroup, Nov. 11, 2014, 26 pages; http://tools.ietf.org/pdf/draft-ietf-bess-evpn-inter-subnet-fowarding-00.pdf.
Schroeder, Bianca, et al., “Disk failures in the real world: What does an MTTF of 1,000,000 hours mean to you?” FAST '07: 5th USENIX Conference on File and Storage Technologies, Feb. 13-16, 2007, 16 pages, San Jose, California, U.S.A.
Shue, David, et al., “Performance Isolation and Fairness for Multi-Tenant Cloud Storage,” USENIX Association, 10th USENIX Symposium on Operating Systems Design Implementation (OSDI '12), 2012, 14 pages; https://www.usenix.org/system/files/conference/osdi12/osdi12-final-215.pdf.
Staimer, Marc, “Inside Cisco Systems' Unified Computing System,” Dragon Slayer Consulting, Jul. 2009, 5 pages.
Stamey, John, et al., “Client-Side Dynamic Metadata in Web 2.0,” SIGDOC '07, Oct. 22-24, 2007, pp. 155-161.
Swami, Vijay, “Simplifying SAN Management for VMWare Boot from SAN, Utilizing Cisco UCS and Palo,” posted May 31, 2011, 6 pages.
Tate, Jon, et al., “Introduction to Storage Area Networks and System Networking,” Dec. 2017, 302 pages, ibm.com/redbooks.
Vuppala, Vibhavasu, et al., “Layer-3 Switching Using Virtual Network Ports,” Computer Communications and Networks, 1999, Proceedings, Eight International Conference in Boston, MA, USA, Oct. 11-13, 1999, Piscataway, NJ, USA, IEEE, ISBN: 0-7803-5794-9, pp. 642-648.
Wang, Feng, et al. “OBFS: A File System for Object-Based Storage Devices,” Storage System Research Center, MSST. vol. 4., Apr. 2004, 18 pages.
Weil, Sage A., “Ceph: Reliable, Scalable, and High-Performance Distributed Storage,” Dec. 2007, 239 pages, University of California, Santa Cruz.
Weil, Sage A., et al. “Crush: Controlled, Scalable, Decentralized Placement of Replicated Data.” Proceedings of the 2006 ACM/IEEE conference on Supercomputing. ACM, Nov. 11, 2006, 12 pages.
Weil, Sage A., et al. “Ceph: A Scalable, High-performance Distributed File System,” Proceedings of the 7th symposium on Operating systems design and implementation. USENIX Association, Nov. 6, 2006, 14 pages.
Wu, Joel, et al., “The Design, and Implementation of AQuA: An Adaptive Quality of Service Aware Object-Based Storage Device,” Department of Computer Science, MSST, May 17, 2006, 25 pages; http://storageconference.us/2006/Presentations/30Wu.pdf.
Xue, Chendi, et al. “A Standard framework for Ceph performance profiling with latency breakdown,” Ceph, Jun. 30, 2015, 3 pages.
Zhou, Zihan, et al., “Stable Principal Component Pursuit,” arXiv:1001.2363v1 [cs.IT], Jan. 14, 2010, 5 pages.
Zhu, Yunfeng, et al., “A Cost-based Heterogeneous Recovery Scheme for Distributed Storage Systems with RAID-6 Codes,” University of Science & Technology of China, 2012, 12 pages.
Related Publications (1)
Number Date Country
20190250972 A1 Aug 2019 US
Continuations (1)
Number Date Country
Parent 15654906 Jul 2017 US
Child 16393067 US