Memcached server functionality in a cluster of data processing nodes

Information

  • Patent Grant
  • 11526304
  • Patent Number
    11,526,304
  • Date Filed
    Wednesday, November 4, 2020
    4 years ago
  • Date Issued
    Tuesday, December 13, 2022
    a year ago
Abstract
A method is performed by a first server on a chip (SoC) node that is one instance of a plurality of nodes within a cluster of nodes. An operation is performed for determine if a second one of the SoC nodes in the cluster has data stored thereon corresponding to a data identifier in response to receiving a data retrieval request including the data identifier. An operation is performed for determining if a remote memory access channel exists between the SoC node and the second one of the SoC nodes. An operation is performed for access the data from the second one of the SoC nodes using the remote memory access channel after determine that the second one of the SoC nodes has the data stored thereon and that the remote memory access channel exists between the SoC node and the second one of the SoC nodes.
Description
BACKGROUND
1. Field of the Invention

The embodiments of the present invention relate to allocation and disassociation of disparate computing resources of clustered computing nodes. More specifically, embodiments of the present invention relate to systems and methods for providing memcached server functionality in a cluster of data processing nodes such as for allowing access to cached information from one or more data processing nodes within a cluster of data processing nodes.


2. Description of Related Art

Conventionally, network systems used different topologies, e.g. Ethernet architecture employed a spanning tree type of topology. Recently, Ethernet fabric topology has been developed that provides a higher level of performance, utilization, availability and simplicity. Such Ethernet fabric topologies are flatter and self-aggregating in part because of the use of intelligent switches in the fabric that are aware of the other switches and can find shortest paths without loops. One benefit is that Ethernet fabric topologies are scalable with high performance and reliability. Ethernet fabric data center architectures are available from Juniper, Avaya, Brocade, and Cisco.


A “shared nothing architecture” is a distributed computing architecture in which each node is independent and self-sufficient. Typically, none of the nodes share memory or disk storage. A shared nothing architecture is popular for web development because of its scalability. What is deficient in typical shared nothing clusters is the ability to allow memory capacity to be provisioned based on workload on a per-node basis, to implement memcached functionality on a per-node basis across a plurality of nodes in a cluster, to load/store from remote memory, to perform remote DMA transactions, and to perform remote interrupts.


SUMMARY

The system and method of the present invention provide flexible methods of extending these distributed network systems beyond the typical shared nothing cluster to accommodate different protocols in varying network topologies. The systems and methods hereof provide the ability to load/store from remote memory, implement memcached functionality on a per-node basis across a plurality of nodes in a cluster, perform remote DMA transactions, perform remote interrupts, allow a wide range of use cases that greatly extend performance, power optimization, and functionality of shared nothing clusters. Several examples are described which include network acceleration, storage acceleration, message acceleration, and shared memory windows across a power-optimized interconnect multi-protocol fabric.


In one embodiment, a method is performed by a first server on a chip (SoC) node that is one instance of a plurality of nodes within a cluster of nodes. The method comprises a plurality of operations. An operation is performed for determine if a second one of the SoC nodes in the cluster has data stored thereon corresponding to a data identifier in response to receiving a data retrieval request including the data identifier. An operation is performed for determining if a remote memory access channel exists between the SoC node and the second one of the SoC nodes. An operation is performed for access the data from the second one of the SoC nodes using the remote memory access channel after determine that the second one of the SoC nodes has the data stored thereon and that the remote memory access channel exists between the SoC node and the second one of the SoC nodes. The operations can be performed by one or more processors that access, from memory allocated or otherwise accessible to the one or more processors, instructions that embody the operations and that are processible by the one or more processors.


In another embodiment, a non-transitory computer-readable medium has tangibly embodied thereon and accessible therefrom a set of instructions interpretable by one or more data processing devices of a first SoC node in a cluster of SoC nodes. The set of instructions is configured for causing the one or more data processing devices to implement operations for determining if a second SoC node in the cluster has data stored thereon corresponding to a data identifier, determining if a remote memory access channel exists between the first SoC node and the second SoC node, and accessing the data from the second SoC node using the remote memory access channel after determining that the second SoC node has data stored thereon and that the remote memory access channel exists between the first and second SoC nodes.


In another embodiment, a data processing system comprises a first server on a chip (SoC) node characterized by a SoC node density configuration enabling the second SoC node to serve in a role of providing information computing resources to one or more data processing systems and a second SoC node characterized by a memory configuration enabling the second SoC node to serve in a role of enabling memory resources thereof to be allocated to one or more other SoC nodes. The first SoC node is coupled to the second SoC node by a remote memory access channel. One or more processors of the first SoC node is configured for accessing and processing instructions for causing the first SoC node to determine if the second SoC node has data stored thereon corresponding to a data identifier received by the first SoC node from a particular one of the one or more data processing systems. One or more processors of the second SoC node is configured for accessing and processing instructions for causing the second SoC node to provide the data stored thereon to the first SoC node using the respective remote memory access channel.


These and other objects, embodiments, advantages and/or distinctions of the present invention will become readily apparent upon further review of the following specification, associated drawings and appended claims.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a high level diagram of a topology for a network system;



FIG. 2 is a block diagram of a network node in accordance with one embodiment of the present invention;



FIG. 3 is a block diagram of a network node in accordance with a second embodiment of the present invention;



FIG. 4 is a diagram showing local to remote address mapping;



FIG. 5 is a diagram showing validation of a remote transaction:



FIG. 6 is a schematic depicting an I/O physicalization; and



FIG. 7 is a schematic showing high performance distributed shared storage.



FIG. 8A is a diagram showing a node cluster architecture in accordance with one embodiment of the present invention.



FIG. 8B is a diagram showing a memory controller node chassis in accordance with one embodiment of the present invention.



FIG. 8C is a diagram showing a rack with a plurality of compute node chassis utilized in a rack with the memory controller node chassis of FIG. 8B in accordance with one embodiment of the present invention.



FIG. 9 is a diagram showing a memory hierarchy structure for computer nodes in accordance with one embodiment of the present invention.



FIG. 10 is a diagram showing a functional block diagram configured for implementing remote memory access functionality in accordance with one embodiment of the present invention.



FIG. 11 is a diagram showing physical address space of a particular one of the compute nodes shown in FIG. 8.



FIG. 12 is a diagram showing an embodiment of the present invention configured for providing memcached server functionality.



FIG. 13A is a diagram showing an embodiment of the present invention configured for implementing memory storage functionality using Partitioned Global Address Space (PGAS) languages.



FIG. 13B is a diagram showing a global memory space that is partitioned between participating threads for pooled memory functionality using PGAS languages.



FIG. 14A is a diagram showing an embodiment of the present invention configured for implementing hybrid memory cube (HMC) deployed near memory pools.



FIG. 14B is a diagram showing a private HMC of compute nodes coupled to a HMC deployed near memory pool.



FIG. 15 illustrates a logical view of a system on a chip (SoC).



FIG. 16 illustrates a software view of a power management unit.





DETAILED DESCRIPTION


FIG. 1 shows an example of a high-level topology of a network system 100 that illustrates compute nodes connected by a switched interconnect fabric. Network ports 101a and 101b come from the top of the fabric to external network connectivity. These network ports are typically Ethernet, but other types of networking including Infiniband are possible. Hybrid nodes 102a-n are compute nodes that comprise both computational processors as well as a fabric packet switch. The hybrid nodes 102a-n have multiple interconnect links to comprise the distributed fabric interconnect (i.e., a node interconnect fabric that provides an inter-node communication channel between a plurality of SoC nodes).


A recommended implementation for the fabric interconnect is a high-speed SerDes interconnect, such as multi-lane XAUI. In the preferred solution, a four-lane XAU interconnect is used. Each of the four lanes can also have the speed varied from 1 Gb/sec (SGMII), XAUI rate (3.125 Gb/sec), and double XAUI (6.25 Gb/sec). The actual number of lanes and variability of speeds of each lane are implementation specific, and not important to the described innovations. Other interconnect technologies can be used that have a means to adaptively change the effective bandwidth, by varying some combination of link speeds and widths. Power consumption of a link is usually related to the delivered bandwidth of the link. By reducing the delivered bandwidth of the link, either through link speed or width, the power consumption of the link can be reduced.


Related application Ser. No. 12/794,996 (incorporated by reference) describes the architecture of a power-optimized, high performance, scalable inter-processor communication fabric. FIG. 1 shows a high-level topology 100 of a network system, such as described in the '996 Related Application, that illustrates XAUI connected SoC nodes connected by the switching fabric. The 10 Gb Ethernet ports Eth0101a and Eth1101b come from the top of the tree. Most, if not all of the hybrid nodes 102a-n comprise both computational processors as well as an embedded switch as described below in conjunction with FIGS. 2-3. The hybrid nodes 102a-n have five XAUI links connected to the internal switch. The switching layers use all five XAUI links for switching. For example, as shown in FIG. 1, level 0 leaf nodes 102d, e (i.e., N0n nodes, or Nxy, where x=level and y=item number) only use one XAUI link to attach to the interconnect, leaving four high-speed ports that can be used as XAUI, 10 Gb Ethernet, PCe, SATA, etc., for attachment to I/O. The vast majority of trees and fat tree-type network systems have active nodes only as leaf nodes, and the other nodes are pure switching nodes. This approach makes routing much more straightforward. Network system 100 has the flexibility to permit every hybrid node 102a-n to be a combination computational and switch node, or just a switch node. Most tree-type implementations have I/O on the leaf nodes, but system 100 lets the I/O be on any node. In general, placing the Ethernet at the top of the tree as at 101a/101b minimizes the average number of hops to the Ethernet.


In a preferred example, the hybrid nodes 102a-n shown in the tree-oriented topology of system 100 in FIG. 1 may represent independent nodes within a computing cluster. FIG. 1 illustrates one example implementation of individual nodes 102a-n of the cluster. When looking at a conventional implementation of a topology e.g. in FIG. 1, computing nodes are usually found in the lower level leaf nodes (e.g. N00-N017), and the upper level nodes do not have computing elements but are just network switching elements (N20-N31).



FIG. 2 illustrates one example of a “personality module” 200 in accordance with the present invention which is specifically designed for Ethernet protocol. Such an Ethernet personality module 200 can be used as a hybrid node for one or more of the nodes 102a-n of FIG. 1. With the node architecture shown in FIG. 2, the CPU Cores 206 of each personality module may be optionally enabled, or could be just left powered-off. With a personality module 200 used for the upper level switching nodes (N20-N30) in FIG. 1, the modules can be operated as pure switching elements (like traditional implementations), or the CPU Cores module 206 can be enabled and used as complete compute nodes within the computing cluster.


Note that the tree oriented interconnect fabric of FIG. 1 is simply one example of a type of server interconnect fabric. The concepts and inventions described herein have no dependency on the specific topology of interconnect fabric or protocol employed.


In more detail, the personality module 200 of FIG. 2 may be used as one or more of the hybrid nodes in the network system of FIG. 1. In FIG. 2, processors 205/206 communicate with the Ethernet MAC controllers 202 via the internal SOC processor bus fabric 201. Ethernet MAC controllers 202 generate Ethernet frames. The Ethernet Bridges 203 prepend a fabric routing header to the beginning of the Ethernet Frame. The Ethernet Bridges 203 contains the layer 2 Ethernet processing and computes the routing header based upon a distributed layer 2 Ethernet switch A skilled person will appreciate that processors utilized in embodiments of the present invention (e.g., processors 205/206) are not unnecessarily limited to any particular model or brand of processor.


The Ethernet Bridges 203 in FIG. 2 receives an Ethernet frame from the Ethernet MAC controllers 202 in FIG. 2, sending an augmented routing frame to the fabric switch 204. Note that all frames that are flowing within the fabric are routing frames, not Ethernet frames. The Ethernet frame/routing frame conversion is done only as the packet is entering or leaving the fabric via a MAC Note also that the routing logic within the switch may change fields within the routing frame. The Ethernet frame is never modified (except the adding/removing of the preamble, start of frame, and inter-frame gap fields).


The routing frame is composed of several fields providing sufficient data for the fabric switch 204 of FIG. 2 to make routing and security decisions without inspection of the underlying Ethernet frame which is considered an opaque payload. The resulting routing frame is thus a catenation of the routing frame header and the payload frame.


Related application Ser. No. 12/794,996 (incorporated by reference) disclosed in more detail an Ethernet protocol focused fabric switch. In the related '996 application two primary components are described:

    • An Ethernet Routing Header processor that inspects Ethernet frames, and adds/removes the fabric switch routing header.
    • The fabric switch that is responsible for transporting the packet between nodes by only using data from the routing header.


A key attribute of the Fabric Switch, 204 in FIG. 2, is that packets may be securely routed to their destination node/port by only using data in the routing header, without any inspection of the underlying data payload. Thus the data payload is considered opaque and invariant.



FIG. 3 illustrates a preferred embodiment of a multi-protocol personality module 300 that is similar to the Ethernet protocol module of FIG. 2. The module of FIG. 3 is similar to the Ethernet fabric module of FIG. 2 in that it continues to be responsible for transporting packets between nodes by only using data from the routing header. However, the multi-protocol personality module 300 of FIG. 3 operates with multiple protocols to accommodate a network operating with different protocols. Protocol specific personality modules are added such that routing header processing is done in new and separate fabric personality modules that provide mappings from specific protocol semantics to fabric routing headers. The multi-protocol personality module 300 of FIG. 3, like the Ethernet module of FIG. 2, is responsible for adding a routing header for packets entering the fabric, and removing the routing header when packets are leaving the fabric. The routing header maintains in place as the packets are transported node to node across the fabric.


The multi-protocol personality module 300 of FIG. 3 includes a portion for processing Ethernet (302, 304) which function much like the module of FIG. 2, and a portion (e.g., components 303, 305, 306, 307) for allowing bus transactions to be transported across the fabric, offering the ability to remote memory, I/O, and interrupt transactions across the fabric. In some embodiments of the present invention, a Remote Bus Personality Module of the multi-protocol personality module 300 comprises the portion of the multi-protocol personality module 300 that allows bus transactions to be transported across the fabric thereby enabling the ability to remote memory, I/O, and interrupt transactions across the fabric. In this regard, the Remote Bus Personality Module enables functionality related to allowing bus transactions to be transported across the fabric thereby provides the ability to remote memory, I/O, and interrupt transactions across the fabric.


As can be seen from the block diagram of FIG. 3 depicting an exemplary multi-protocol module 300, the Fabric Switch 308 transports packets across nodes of inter-node fabric (i.e., an inter-node communication channel defined thereby) therebetween by inspection of only the routing header. The routing header is composed of several fields providing sufficient data for the fabric switch 308 to make routing and security decisions without inspection of the underlying opaque data payload. The resulting routing frame is thus a catenation of the routing frame header and the opaque payload frame. One example of a payload frame is an Ethernet frame. For example, as shown in Table I below, a routing frame might comprise:














TABLE 1







Routing













Frame Header
Ethernet Frame Packet















RF Header
MAC
MAC
Ethertype/
Payload (data
CRC32



destination
Source
Length
and padding)









An example of a routing header follows in Table 2, but the fields may vary by implementation:











TABLE 2






Width



Field
(Bits)
Notes

















Domain ID
5
Domain ID associated with this packet.




0 indicates that no domain has




been specified.


Mgmt
1
Specifies that the packet is allowed on


Domain

the private management domain.


Source Node
12
Source node ID


Source Port
2
0 = MAC0, 1 = MAC1, 2 = MAC_management




processor, 3 = MAC OUT


Dest Node
12
Destination node ID


Dest Port
2
0 = MAC0, 1 = MAC1, 2 = MAC_management




processor, 3 = MAC OUT


RF Type
2
Routing Frame Type (0 = Unicast, 1 = Multicast,




2 = Neighbor Multicast, 3 = Link Directed)


TTL
6
Time to Live—# of hops that this frame




has existed. Switch will drop packet




if the TTL threshold is exceeded (and notify




managment processor of exception).


Broadcast
5
Broadcast ID for this source node for


ID

this broadcast packet.


Checksum

Checksum of the frame header fields.









Since the Fabric Switch 308 makes routing decisions by inspection of only the routing header, and the data payload frame is considered both opaque and invariant, these characteristics can be leveraged to create an extensible set of personality modules. A multi-protocol personality module 300 such as shown in FIG. 3 provides a mapping from specific protocols to add and remove the fabric routing headers for that protocol.


When using a personality module 300 such as shown in FIG. 3 as a hybrid node 102a-n in the system of FIG. 1, as previously stated, all frames that are flowing within the fabric are routing frames, not Ethernet frames. The payload frame/routing frame conversion is done only as the packet is entering or leaving the fabric. Note also that the routing logic within the switch may change fields within the routing frame. The payload frame is never modified.


The Ethernet Bridge personality processor 304 in FIG. 3, is functionally identical to the Routing Header processor in Related application Ser. No. 12/794,996, but generalized from a single-protocol processor (such as FIG. 2), to a module having a number of protocol processing portions. The Ethernet Bridge Processor 304 adds the routing header as the packet comes from the Ethernet MAC 302 to the fabric switch 308, and removes the routing header as the packet comes from the fabric switch 308 to the MAC 302.


Similar to FIG. 2, the processors 312/314 communicate with the Ethernet MAC controllers 302 in FIG. 3 via the internal SOC processor bus fabric 301. Ethernet MAC controllers 302 generate Ethernet frames. The Ethernet Bridge 304 prepends a fabric routing header to the beginning of the Ethernet Frame. The Ethernet Bridge 304 contains the layer 2 Ethernet processing and computes the routing header based upon a distributed layer 2 Ethernet switch.


As disclosed above in reference to the multi-protocol personality module 300 of FIG. 3, the Remote Bus Personality Module includes the Remote Interrupt Manager 303, the Remote Address translation module 305, the Bus Bridge 306 and the Remote Bus Processor 307. In FIG. 3, the Bus Fabric 301 represents the internal bus fabric of a system on a chip (SOC) As discussed below, the SoC can be configured to provide server functionality and thus be referred to as a server on a chip. This bus fabric carries CPU mastered load/store transactions to memory and I/O, as well as I/O mastered transactions, e.g. initiated by I/O DMA controllers.


The functionality of the Remote Bus personality Module consists of

    • The Remote Address translation module 305, which converts local addresses steered to the Remote Bus Personality Module (RBPM) to [Remote Node, Remote Node Address].
    • The Bus Bridge 306, which converts a processor bus of arbitrary address and data width into a packed, potentially multi-flit packet In this regard, the Bus Bridge 306 converts a processor bus of arbitrary address and data width into packetized transfers across the fabric.
    • The Remote Bus Processor 307, which adds and removes the fabric routing header, transports bus packets from Bus Bridge 306 and interrupts from Remote Interrupt Manager 303 over the fabric in-order with guaranteed delivery.


The Remote Address translation module 305 converts local addresses steered to the RBFPM to [Remote Node, Remote Node Address]. This is depicted in more detail in FIG. 4 which shows that there is a set of mapping tables from [local address, size] to [Node ID, Remote address]. This address translation can be implemented as a custom module, typically leveraging a CAM (Content Addressable Memory). Alternatively, this stage may be implemented with a standard IP block of an I/O MMU (memory management unit) which translates the intermediate physical address in a bus transaction to a physical address. In this case, these translation tables are configured so that the resulting physical address encodes the [Remote Node ID, and Remote Address].


The Bus Bridge 306 of FIG. 3 functions to interface to and packetize the CPU/I/O bus transactions. In this regard, the Bus Bridge 306 can function as a packetizer. This Bus Bridge 306 is conceptually designed as having a layered model. In any given implementation, these layers may or may not be present, and will have tuned functionality for the bus bridging that is being implemented.


The multiple layer design of the Bus Bridge 306 is:

    • Transaction layer
      • The Transaction layer performs any necessary transforms that understand multiple bus channels or that understand the semantics of the transaction.
    • Transfer layer (also known as Transport layer)
      • The Transfer layer performs any necessary transforms within a channel related to the overall data transfer. This could include data compression.
    • Data Link layer
      • The Data Link layer performs arbitration, multiplexing and packing of channels to a physical packet representation.
      • Implements any necessary flow control.
    • Physical layer


The Physical layer performs transformation and optimization of the physical packet representation to packet size, width, and flit requirements to the fabric switch implementation. This Physical layer and/or the Link layer may actually produce multiple flits corresponding to a single physical bus packet.


The Remote Bus Processor 307 functions in a similar manner to the Ethernet Bridge Personality Processor 304 to add and remove the fabric routing header and transport bus packets from 306 to the fabric switch 308. Additionally, the Remote Bus Processor 307 connects interrupts from Remote Interrupt Manager 303 over the fabric with guaranteed delivery.


Example 1: Distributed One-Sided Cache Coherent Shared Memory Across the Fabric

In FIG. 1, one or more of the compute nodes could constitute servers, and the fabric connects two or more servers. The ability to open up memory sharing windows in another server across the fabric enables a wide-range of new capabilities that are not possible in traditional “shared nothing” clusters. In this example, the form that a load or store bus transaction issued by Server Node A is targeting a physical address in Server Node B. Such bus transactions may originate from any bus master in Node A, including processors, I/O bus masters (such as a SATA controller), or a DMA engine.



FIG. 4 illustrates the first stage of a remote shared memory access transaction using the Remote Bus Personality portion of the module of FIG. 3. As shown in FIG. 4, a bus master on Node A issues a load or store transaction to a range of physical addresses mapped to the Remote Bus Personality portion. The transaction appears as a bus transaction on FIG. 3, on Bus Fabric 301. The SOC busses of Bus Fabric 301, such as an ARM AXI, have configurable address and data widths, as an example 40 address bits, and 64-128 data bits.


The transaction flows through the Bus Bridge 306 as illustrated in FIG. 3 packetizing the bus transaction and creating one or more flits optimized for the fabric switch 308. The packetized transaction flows through the Remote Bus Processor 307 to create the routing header for the fabric. The remote bus packets are required to be delivered to destination server B in-order and with guaranteed delivery. If the underlying fabric and fabric switch do not implicitly have these characteristics, then the Remote Bus Processor 307 is required to implement in-order and guaranteed delivery.


The resulting routing frame flows into the fabric switch 308 on Node A, is routed through the intervening fabric (See FIG. 1), which may consists of multiple routing hops, and is delivered to the fabric switch on target Node B. For example, comparing FIG. 1, Node A might be node N30 and target Node B could be represented as node N014. The packet from fabric switch 308 of Node A is identified as a remote bus transaction, and is delivered to the Remote Bus Processor 307 on Node B.


Node B's Remote Bus Processor 307 implements the receiving side of in-order and guaranteed delivery in conjunction with the transmitting side. This can include notification of the sender of errors, missing flits, and request for retransmission. The Remote Bus Processor 307 of Node B then strips the routing header, sending the packetized transaction into the Bus Bridge 306. The Bus Bridge module 306 of Node B unpacks the packetized transaction (which may have included collecting multiple flits), and reconstitutes a valid transaction posted to Node B's bus. Any responses to that bus transaction are seen by this subsystem, and sent back to Node A following the same mechanism.


There are several functional and performance issues related to this cache coherency example First, coherent memory transactions issued by CPUs in node A will not snoop caches on remote nodes to maintain efficiency. Second, incoming remote transactions from a Remote Bus Personality section can be implemented as one-sided cache coherent. This means that incoming loads or stores can optionally be configured to snoop and perform coherency protocols against processor caches. Finally, this provides a powerful, easy to use cache coherent programming mode without the performance and availability problems related to a full CC-NUMA (cache coherent—non-uniform memory access) design.


Example 2: Remote Bus Personality Module—Remote Interrupts

In many SOC bus infrastructures, interrupts are individual lines that feed into an interrupt controller for the processor(s) such as the Remote Interrupt Manager 303 of FIG. 3. These individual interrupt lines are sometimes OR'd with each other to map multiple interrupt sources to a single interrupt line.


For example, if server A (such as Node N30 of FIG. 1) processor generates an interrupt on server B (such as Node N14 of FIG. 1): First, Server A writes to a remote CSR (control status register) on server B which maps to the requested interrupt, such as the an interrupt line of Interrupt Manager 303 of FIG. 3. The interrupt line is made active and interrupts the Remote Bus Processor 307 on server B.


As another example, an I/O interrupt on server A can be reflected to an interrupt on server B. An I/O controller on server A (like a SATA controller) raises an interrupt line that is being monitored by the Remote Interrupt Manager 303, FIG. 3. The Remote Interrupt Manager 303 gets woken by an interrupt line that it is being monitored Remote Interrupt Manager 303 creates a packet tagged as an interrupt packet and sends it into the Remote Bus Processor 307. This interrupt packet flows through the fabric as described above. When the interrupt packer reaches server B, the interrupt packet is delivered to Remote Bus Processor 307, which notes the specially tagged interrupt packet and sends it to the remote interrupt manager 303 of server B. Remote interrupt manager 303 causes the specified interrupt line to go active in server B.


Example 3: Remote Address Translation and Security

Referring to FIG. 3, block 314 is a management CPU core (See also Mgmt Core 205 of FIG. 2). This management CPU 314 is a key part of maintaining fabric security for remote bus transactions. The management CPU 314 maintains multi-node fabric transaction security on both sides of the transaction.


Each Remote Bus Processor 307 is allocated a range of addresses in physical address space. An exemplary process for the secure mapping of an address range from Server B into Server A's address space is as follows.

    • 1. Main OS processor on Server A (block 312 in FIG. 3) sends a mapping request of tuple (node #, physical address in node #'s address space, and window length) to local management processor.
    • 2. Management CPU 314 on Server A has the ability to accept or deny the remote mapping request. Upon local acceptance, management CPU on server A sends a secure management request with the remote mapping request to management CPU 314 on server B.
    • 3. Management CPU 314 on server B has the ability to accept or deny the remote mapping request from Server A.
    • 4. Upon acceptance, management CPU 314 on server B installs a mapping into the I/O MMU on server B, mapping an IPA window to the requested physical address. Additionally the Remote Bus Processor 307 on server B installs a mapping that designates that remote node A has access to that window.
      • Mappings can be granted as read-only, write-only, or read-write.
      • These mappings are illustrated in FIG. 5.
      • These mappings can be implemented using a standard IP block like an I/O MMU, or with custom logic typically using a CAM.
    • 5. Management CPU 314 on server B returns the base intermediate physical address of the window.
    • 6. Management CPU 314 on server A installs a mapping into the local I/O MIVIU mapping from an IPA window on server A to the server B IPA window base address.
    • 7. Management CPU 314 on server A returns the allocated local IPA address for the requested window to the requesting client on the main OS processor 312.


In the described examples, DMA engines on both the local (server A) and remote (server B) sides can be used to hardware facilitate data movement in either direction. Users are not constrained to the classic push OR pull data movement model. Further, many SOC bus transaction models have some notion of trust or security zone associated with that bus transaction. As an example, ARM AXI has the notion of TrustZone, where transactions are marked as being in Trusted World or Normal World. The Remote Bus portion in the Personality Module 300 illustrated in FIG. 3 annotates the bus transaction packet with the trust or security zone with the incoming bus transaction. When the remote server (e.g. server B) is issuing the remote transaction into the local bus fabric, a configuration option is used to define whether the transactions get issued with either the security zone of the requesting processor, or issued at a specific security zone level.


Example 4: Remote Bus Personality Module I/O Physicalization


FIG. 6 illustrates using the Remote Bus Personality portion of the Module 300 of FIG. 3 (i.e., the Remote Bus Personality Module) for I/O Physicalization. Some data center customers desire to have compute servers that have no embedded storage or I/O within the server, and then separate I/O boxes/chassis within the data center rack. The Remote Bus Personality Module of FIG. 3 allows multiple servers, designated as Srvr A, B, and C in FIG. 6, to use unmodified device drivers within the operating systems running in servers A, B, and C to access physically remote I/O devices across the server fabric. The server operating system, device drivers, and applications believe that they are communicating with server local devices. Use of the Remote Bus Personality Module of FIG. 3 allows the device/O and interrupts to the actual I/O device to be bi-directionally remoted across the fabric with no changes or visibility to software.


Device drivers running on CPUs in the Server boxes (A, B, C) of FIG. 6 access I/O registers transparently across Fabric 608 in the remoted peripheral controller cards, illustrated as remote PCIe controllers 610/612 and remote SATA controllers 614/616 in FIG. 6. Direct memory access (“DMA”) engines am located either in the server boxes, or alternatively in the I/O boxes embedded within the peripheral controllers, and the DMA traffic is remoted bi-directionally transparently across Fabric 608. Additionally, interrupts generated by the remote peripheral controllers are transparently transmitted across Fabric 608 and presented to the processors in servers A, B, or C. In this manner, the Remote Bus Personality Module enables remote memory access functionality which includes the ability to allow memory capacity to be provisioned based on workload on a per-node basis, to load/store from remote memory, to perform remote DMA transactions, and to perform remote interrupts.


The address maps, both I/O and memory, and interrupt maps are maintained and transmitted transparently across Fabric 608. In this example, the data flow is completely optimized. An example storage block transfer from SATA controller 614/616 of FIG. 6 would typically become:

    • The device driver on Srvr B is reading a block from remote SATA 614 connected SSD 620 to a pre-allocated block buffer on a physical address PA1.
    • The device driver programs and initiates the read by writing the appropriate control registers in remote SATA controller 614.
    • Remote SATA controller 614 contains an embedded DMA engine which initiates the DMA, reading the data from the remoted SSD, and landing the data directly into physical address PA1 in Srvr B's address space.
    • No network communication or additional data copies were needed in this optimized transfer.


Example 5: Remote Bus Personality Module Enabling High Performance Distributed Shared Storage


FIG. 7 illustrates an alternate distributed storage example. Distributed storage functionality is an embodiment of remote memory access functionality in which the remote memory is non-volatile memory (i.e., storage type memory), In this case the computational servers are illustrated as Srvr A, B, C. The I/O server boxes containing the storage peripherals in this use case have processors as well. This high performance shared storage example has one additional data movement from the example 4, I/O physicalization. But this example 5 adds the additional capabilities that the I/O devices and controllers can be shared by multiple servers.


In FIG. 7 a method of storage block transfer from a SATA controller is as follows.

    • The device driver on Srvr A is reading a block from remote SATA 714 connected SSD 716 to a pro-allocated block buffer on a physical address PA1.
    • The read is initiated by sending a lightweight message across Fabric 708 from Srvr A to Target I/O server 720 that contains the description of the read (device, block, size) and the physical address in Srvr A that the data should be moved to.
    • The driver on SATA device 714 on Target I/O server 720 initiates the DMA read to its local buffer from its local SATA controller.
    • Upon the completion of the DMA transfer to the I/O servers buffer, the device driver on the I/O server 720 uses a local DMA engine to initiate a fabric remoted DMA transfer from its local buffer to the physical address of the buffer in the requesting server's address space.
    • The device driver programs and initiates the read by writing the appropriate control registers in controller of remote SATA 714.


This example requires one additional data movement as compared to the I/O Physicalization example 4, but is far more efficient than a traditional network oriented SAN or NAS remote storage data movement.


The discussion now turns to disassociation of memory (e.g., preferably mutable memory) from a cluster of nodes while enabling those nodes the ability to do full load/store/barrier instructions to a memory pool (e.g., aggregation of memory resources provided at a centralized location) through allocation of memory of the memory pool to the nodes based on workload on a per-node basis. Such implementation is referred to herein as pooled memory functionality. Implementing pooled memory functionality in this manner supports allocation of memory privately on a per node basis and allocation of memory to all or a portion of the nodes in a non-coherent, shared manner. Furthermore, in view of the disclosures made herein, a skilled person will appreciate that remote memory access functionality in accordance with the present invention supports implementation of near shared memory using, for example, HMC (hybrid memory cubes) memory resources and supports implementation of far shared memory over a SoC node fabric using, for example, both HMC and DDR memory resources.


A node cluster architecture 800 is shown in FIG. 8A. The node cluster architecture 800 is configured for providing remote memory access functionality in accordance with the present invention. More specifically, the node cluster architecture 800 includes a plurality of compute nodes 805 and a plurality of memory controller nodes 810 that are connected via a fabric 815 (i.e., links extending between fabric switches of interconnected nodes). Each one of the memory controller nodes 810 has memory 820 coupled thereto. Jointly, the memory 820 attached to all or a portion of the memory control nodes 810 is referred to herein as pooled memory. Preferably, aside from resident memory provisioning, the underlying architecture of the compute nodes 805 and the memory controller nodes 810 is entirely or substantially the same.


A plurality of the compute nodes 805 can be provided on a single card (i.e., a compute node card) and a plurality of the memory controller nodes 810 can be provided on a single card (i.e., a memory controller node card). The compute node card and memory controller node card can have identical overall planar dimensions such that both types of cards have a common or identical planar form factor, Each compute node 805 and each memory controller node 810 can have a plurality of SoC units thereon that provide information processing functionality. By definition, a compute node card will be populated more densely with SoC units that will be a memory controller node card. Preferably, but not necessarily, an architecture of the SoC units of the compute node cards is substantially the same or identical to that of the memory controller node cards,


The compute nodes 805 are each provisioned (i.e., configured) with a limited amount of local memory 807 and are packaged together (i.e., integrated with each other) with the goal of optimizing compute density within a given form factor (i.e., maximizing computer density in regard to cost, performance, space, heat generation, power consumption and the like). The memory controller nodes 810 are provisioned with a relatively large amount of local memory and together provide the pooled memory resource at a chassis, rack or cluster level (i.e., to maximizing poled memory in regard to cost, performance, space, heat generation, power consumption and the like for a given form factor). Put differently, a compute node card has insufficient memory resources for enabling intended data computing performance (e.g., data processing throughput) of compute nodes thereof and a memory controller node card has insufficient node CPU resources for enabling intended data computing performance (e.g., put/get and/or load/store utilization) of the pooled memory thereof. In this regard, intended data computing functionality of the server apparatus requires that the server apparatus include at least one computer node card and at least one memory controller card.


Each compute node 805 can be allocated a portion of the pooled memory 820, which then serves as allocated memory to that particular one of the compute nodes 805. In this regard, the pooled memory 820 can be selectively allocated to and be selectively accessed by each one of the nodes (i.e., via pooled memory functionality). As shown in FIG. 8B, the one or more memory controller nodes 810 and associated pooled memory 820 (e.g., DDR as shown or HMC) can be implemented in the form of a memory controller node chassis 821. As shown in FIG. 8C, the memory controller node chassis 821 can be utilized in a rack 822 with a plurality of compute node chassis 823 that share memory resources of the memory controller node chassis 821. In this regard, one or more compute nodes 805 (or cards comprising same) and one or more memory controller nodes 810 with associated pooled memory 820 (or cards comprising same) can be referred to as a pooled memory server apparatus. It is also disclosed herein that a pooled memory server apparatus configured in accordance with the present invention can include a storage controller node chassis that is similar to the memory controller chassis except with storage resources (e.g., non-volatile storage resources such as hard disk drives) as opposed to memory resources (e.g., RAM).


In view of the disclosures made herein, a skilled person will appreciate that an underlying goal of the node cluster architecture 800 is to provide a fabric attached pool of memory (i.e., pooled memory) that can be flexibly assigned to compute nodes. For example, in the case of a dense node board such as that offered by Calxeda Inc under the trademark EnergyCard, every node of the compute node card (i.e., a plurality of nodes on a single board substrate) has a constrained, small number of DIMMs (e.g., every compute node having a constrained, small no. of DIMMs (e.g., 1)) and requires every node to have a relatively constrained amount of DRAM (e.g., every compute node to have something 4-8 GB of DRAM). But, in practical system implementations, some nodes will need different memory provisioning for specific requirements thereof (e.g., for Hadoop NameNode functionality, for Memcache functionality, for database functionality).


Pooled memory in accordance with embodiments of the present invention, which is attached to computer nodes though a fabric (i.e., fabric memory pools), support standardized dense node cards such as the Calxeda brand EnergyCard but allows them to be memory provisioned differently. In one specific implementation (shown in FIG. 8A), the bulk of the node cards in a cluster are cards with compute nodes (i.e., compute node cards). These compute node cards are configured with memory that is optimized with respect to capacity, power, and cost (e.g., one DIMM per channel). A variant of the compute node cards are cards are configured with associated pooled memory (i.e., pooled memory cards). The pooled memory cards, which are memory controller node cards in combination with associated pooled memory thereon, can be configured as maximum DRAM capacity cards. For example, the pooled memory cards can utilize multiple DIMMs per channel, RDIMMs at high densities (and higher power) or the like. This additional DRAM power is amortized across the fabric because there are likely a relatively small number of these pooled memory cards in comparison to compute node cards.


Embodiments of the present invention allow for pooled memory cards to be physically provisioned in a variety of different configurations. In support of these various physical provisioning configurations, pooled memory cards can be provisioned based on DIMM density (e.g., maximized DIMM density) or can be provisioned based on DRAM capacity (e.g., maximized DRAM capacity). In regard physical placement of the pooled memory cards, various rack and chassis positioned are envisioned. In one implementation (i.e., chassis provisioning), all or a portion of the pooled memory cards are configured for maximum DRAM capacity and serve as a chassis fabric memory pool. In another implementation (i.e., rack provisioning), a memory appliance (1U or 2U) is fabric connected within the rack using pooled memory cards are configured for maximum DRAM capacity. In another implementation (i.e., end of row provisioning), an entire rack is provided with pooled memory cards and serves as a memory rack that is at the end of a row of racks with computer nodes (i.e., compute racks). In still another implementation (i.e., distributed provisioning), all pooled memory cards are configured for maximum DRAM capacity and Linux NUMA APIs are used to create a distributed far memory pool. Additionally, Linux can even round-robin pages across the NUMA memory pool.



FIG. 9 shows a memory hierarchy structure 900 of each one of the computer nodes 805. As shown, the memory hierarchy structure 900 of each one of the computer nodes 805 has various memory resources. Of particular interest to remote memory access functionality implemented in accordance with the present invention is Remote Memory Layer 905, which introduces an additional level into the memory hierarchy structure 900 of each compute node. The Remote Memory Layer 905 enables a SoC (i.e., system) architecture where memory resources can be pooled at the cluster level and allocated amongst the nodes in a cluster (i.e., a plurality of nodes interconnected by a fabric). The Remote Memory Layer 905 allows memory capacity per node to be changed based on workload needs by changing the amount of pooled memory that is provisioned per node. This disaggregation and pooling of memory resources at the cluster level provides for better overall memory capacity utilization and lower power. Furthermore, the Remote Memory Layer 905 supports two types of accesses to remote memory that is mapped into a node's physical address space: a) coarse-grain accesses that rely in virtual-memory paging and involves transferring pages between remote and local memories and, b) fine-grain accesses that trigger cacheline transfers from the remote memory as a result of loads/stores from a node's operating system CPU to remote memory.



FIG. 10 shows a functional block diagram 1000 configured for implementing remote memory access functionality. The functional block diagram 1000 supports remote memory by a compute node 1005 (i.e., one of a plurality of computer nodes) across a fabric 1010. A Messaging Personality Module (i.e., the Messaging PM 1015) of the compute node 1005 serves as a hardware interface to remote DRAM 1020 (i.e., remote memory). The Messaging PM 1015 is connected to a cache coherent interconnect 1025 of the computer node 1005 such as through AXI Master and Slave interfaces thereof. The cache coherent interconnect 1025 has direct access to internal SRAM 1026 of the computer node 1005. Local DRAM 1127 (e.g., on a card level substrate on which the node is mounted) is coupled to the cache coherent interconnect 1025 via one or more memory controllers 129. Remote memory addresses of the remote DRAM 1020 are mapped to the Messaging PM 1005 through the AXI Master Port on the cache coherent interface 1025. Loads and stores to the remote DRAM 1020 by management cores 1030 (i.e., management processors) and operating system cores 1035 (i.e., OS processors) are diverted to the Messaging PM 1015, which then encapsulates these accesses in fabric packets and transports them to a memory controller node 1040 that serves the remote DRAM 1020 (i.e., the receiving controller node 1140). The memory controller node 1040 that serves the remote DRAM 1020 includes an instance of the Messaging PM. The receiving Messaging PM 1040 performs the requested access by reading or writing the local memory (e.g., local DRAM) of the memory controller node through its cache coherent interconnect.


In one embodiment, the functional block diagram 1000 is implemented via components of the multi-protocol personality module 300 discussed above in reference to FIG. 3. The Messaging PM 1005 can be embodied by the Remote interrupt Manager 303, the Remote Address translation module 305, the Bus Bridge 306 and the Remote Bus Processor 307. The cache coherent interconnect 1025 can be embodied by the bus fabric 301. The fabric 1010 can be implemented via one or more ports accessible to the fabric switch 308 for enabling access to the remote DRAM 1020.


In some embodiments of the present invention, the allocation of pooled memory (i.e., memory associated with one or more memory controller nodes) to individual compute nodes can managed by a cluster-level memory manager. This memory manager can be a software entity that is a standalone management entity or that is tightly integrated into other cluster-level management entities such as, for example, a job scheduler, a power management entity, etc. The allocation of the remote memory that is mapped into address space of a compute node to applications running on that computer node can be managed by an operating system (OS) or a virtual memory manager (VMM) using known virtual memory management and memory allocation techniques. For example, the OS and/or VMM can employ non-uniform memory access (NUMA) memory allocation techniques to distinguish between allocation of local memory and remote memory.


In view of the disclosures made herein, a skilled person will recognize that embodiments of the present invention enable various mechanisms of pooled memory functionality to be implemented. Pooled memory functionality is a specific implementation of remote memory access functionality. Examples of these mechanisms of pooled memory functionality include, but are not limited to, remote memory being mapped to physical address space of a node, load/store access being carried out from a CPU of a node, get/put access from user space, and DMA memory content transactions from remote memory to local memory. The benefits of these mechanisms of pooled memory functionality include, but are not limited to, disaggregated memory that can be used across multiple SoC generations, computer nodes can be assigned total memory based on workload characteristics, get/put into remote memory enables low-latency optimizations (e.g., via key/value stores, memcached, etc).


The remote memory architecture embodied within the functional block diagram 1000 can support two primary styles of pooled memory functionality. A first one of these styles of pooled memory functionality relates to shared remote memory. A second one of these styles of pooled memory functionality relates to disaggregated private memory. These use cases differ in whether an allocated portion of the pooled memory (i.e., remote memory) is mapped into the address space of a compute node and in how the allocated portion of the pooled memory is accessed.


The style of pooled memory functionality relating to shared remote memory involves remote memory get/put operations. In this style of pooled memory functionality, processor initiated bus cycles (i.e. load/stores) would not be directly remoted across the fabric. Rather, very low-latency user-space proxies for direct load/stores would be provided. These remote memory accesses represent get/put and/or load/store operations.


In the case pooled memory functionality relating to disaggregated private memory, as shown in FIG. 11, a physical address space 1105 of a particular compute node (e.g., a particular one of the compute nodes 805 shown in FIG. 8A) has local physical memory 1110 residing at its bottom portion and has the allocated remote memory (i.e., allocated remote memory 1115) mapped into its higher physical addresses. The allocated remote memory is not shared with any other nodes but is cacheable by management and OS cores of the node. Furthermore, the allocated remote memory is not directly accessible by user-space applications. In other words, accesses to allocated remote memory use physical addresses generated either by the paging mechanism implemented by the OS/VMM or by a memory management unit of the node's central processing unit. Accesses to allocated remote memory will typically higher latencies compared to accesses to local memory. This is due at least in part to memory bandwidth of the allocated remote memory being constrained by bi-section bandwidth of the fabric interconnecting the computer nodes and will likely be lower than the memory bandwidth of the local memory. Therefore, well-known memory hierarchy concepts such as caching and pre-fetching can be utilized for optimizing accesses to the allocated remote memory.


A primary goal of disaggregated private memory is to provide a fabric attached pool of memory (i.e., fabric attached pooled memory) that can be flexibly assigned to compute nodes. Native load/store transactions supported over a fabric, Examples of these native load/store transactions include, but are not limited to, transactions associated with global fabric address space, transactions associated with compute nodes carrying out read/write operations to remote memory, and transactions associated with remote DMA of memory content into physical memory of a compute node. In implementing disaggregated private memory in accordance with embodiments of the present invention, compute nodes will have private memory (e.g., private mutable memory) and can share a pool of fabric accessible memory (e.g., cacheable, non-coherent shared memory). Furthermore, fabric pool memory configured in accordance with embodiments of the present invention can be implemented within a chassis or across a largest possible fabric (e.g., across one or more rack).


Implementations of disaggregated private memory as disclosed herein can be considered as a class of remote NUMA memory (i.e., one-sided cache coherent which is also known as I/O coherent). For example, certain commercially available operating systems (e.g., Linux brand operating systems) have support for NUMA memory in the form of a NUMA subsystem, More specifically, Linux brand operating systems have NUMA awareness such as via numactl (e.g., control NUMA policy for processes or shared memory), Lib numa (e.g., NUMA policy API), and enhanced topology detection. Additionally, malloc-type memory allocation functionality is configured to ensure that the regions of memory that are allocated to a process are as physically close as possible to the core on which the process is executing, which increases memory access speeds. A node cluster architecture configured in accordance with the present invention can be configured to integrate with such a NUMA subsystem for allowing kernel and applications to have control of memory locality without having to expose new APIs and malloc-type memory allocation functionality for increasing memory access speeds.


Implementations of disaggregated private memory as disclosed herein can utilize device controllers (e.g., memory device controllers) that are physically allocated to remote nodes. This type of implementation is exemplified herein in the discussion relating to Example 4 and FIG. 6. Utilizing device controllers that are physically allocated to remote nodes allows the centralization of memory controllers and memory devices on a set of nodes. For example, the memory controllers and memory devices can be allocated to remote nodes at run-time whereby drivers continue to run on nodes acting as servers, drivers directly access remote memory controllers (e.g., of memory controller nodes), and DMA/interrupts are implemented transparent over the fabric that interconnects the nodes.


Example 6: Memcached Server Revolution


FIG. 12 illustrates an embodiment of the present invention configured for providing memcached server functionality 1200. The memcached server functionality 1200 utilizes pooled memory disclosed herein in accordance with the present invention. Memcached server functionality in accordance with the present invention is applicable to a large class of key-value store storage. Advantageously, implementation of the memcached server functionality 1200 in accordance with the present invention allows memcached clients 1205A, 1205B (e.g. web servers) to reach back to a pooled memory 1210 (i.e., memcached memory pool) to get cached values of data without having to go back to their respective database tier. For example, the pooled memory 1210 can be implemented as NUMA fabric pooled memory. The memcached clients 1205A, 1205B can be embodied by one or more compute nodes that are each allocated respective private mutable private memory 1215A, 12158 from pooled memory associated with one or more memory controller nodes. To this end, the memcached clients 1205, the pooled memory 1210, and the private mutable private memory 1215 can be embodied by the pooled memory server apparatus discussed above in reference to FIGS. 8a-8c.


The memcached clients 1205A, 1205B each map access information (e.g., a key) directly and reach into the pooled memory 1210 to obtain the data with a direct memory load. In this manner, unlike the traditional memcached approach, there is no networking needed for access memcached data. Each one of the memcached servers 1210a-e hashes into local DRAM and returns the hashed value over TCP/IP or UDP, which serves as the communication protocol between the memcached servers and each one of the memcached clients 1205.


In regard to a specific example in which a cluster of SoC nodes (i.e., including Node A and Node B) that are interconnected by a node interconnect fabric, Node A (e.g., through web server functionality thereof) requests an account lookup for Account #100. Web server request goes through a Memcached client API into a memcached client library with a cache data request for Key ID #100. The memcached client library hashes Key ID #100 to the memcached server that holds that data whereby it hashes to Node B that is providing memcached server functionality. The memcached client library determines that Node A and Node B have a remote memory capable fabric between them (e.g., are configured for providing remote memory access functionality in accordance with the present invention). The memcached client library on Node A performs a server-side hash of Key ID #100 and uses a remote memory access to node B to determine if this data is currently encached and, if so, the memory address that contains the data. In the case where it is determined that the data is currently encached, the memcached client library on Node A directly access the remote cached data from Node B's memory address space (e.g., memory address space of Node B's memcached server functionality). The memcached client library then returns the data to the requesting web server on Node A.


Example 7: High Frequency Trading Backend

In support of high frequency trading, stock exchange tick data can stream as multicast packets at rates up to 6 MB/sec or more. The tick data can be highly augmented with derived data thereof. A fabric memory pool apparatus is used to store the tick data in one place and accessed by a plurality of trading servers. Referring to the pooled memory server apparatus discussed above in reference to FIGS. 8a-8c, the fabric memory pool apparatus can be embodied in the form of the memory controller node chassis 821 and the trading servers can be embodied in the form of the compute node chassis 823, The tick data is only appended such that the tick data does not have to be multicast and replicated. Furthermore, all compute nodes of the trading servers get direct read-only shared access to the tick data (i.e., via pooled memory of the memory controller nodes) whereby the tick data is still CPU cacheable for frequently accessed data.


Example 8: Message Passing Interface Remote Memory Access (One Sided)

The underlying premise of message passing interface (MPI) remote memory access (RMA) relates to any allocated memory is private to the MPI process by default. As needed, this allocated private memory can be exposed to other processes as a public memory region. To do this, an MPI process declares a segment of its memory to be part of a window, allowing other processes to access this memory segment using one-sided operations such as PUT, GET, ACCUMULATE, and others, Processes can control the visibility of data written using one-sided operations for other processes to access using several synchronization primitives. Referring to the pooled memory server apparatus discussed above in reference to FIGS. 8a-8c, memory of the MPI process can be embodied in the form of the memory controller node chassis 821.


MPI 3rd generation (i.e., MPI-3) RMA offers two new window allocation functions. The first new window allocation function is a collective version that can be used to allocate window memory for fast access. The second new window allocation function is a dynamic version which exposes no memory but allows the user to “register” remotely-accessible memory locally and dynamically at each process. Furthermore, new atomic operations, such as fetch-and-accumulate and compare-and-swap offer new functions for well-known shared memory semantics and enable the implementation of lock-free algorithms in distributed memory.


Example 9: Partitioned Global Address Space Languages (PGAS)

Examples of common PGAS languages include, but are not limited to, Unified Parallel C, Co-Array Fortran, Titanium, X-10, and Chapel. As shown in FIG. 13A, in these PGAS languages, memory distributed over many compute nodes (i.e., distributed memory 1300) is seen as one global memory (i.e., global memory 1305) that can be accessed by all the processes without requiring explicit communication like in MPI. Hidden communication is based on one-sided communication. As shown in FIG. 138, PGAS languages introduce the concept of a global memory space 1310 that is partitioned between the participating threads 1315 (e.g., ranks in MPI) with each process being able to access both local memory (e.g., distributed memory 1300 local to a particular computer node) and remote memory (e.g., distributed memory 1300 local to a different computer node than the particular computer node). Access to local memory is via standard sequential program mechanisms whereas access to remote memory is directly supported by the new features of the PGAS language and is usually done in a “single-sided” manner (unlike the double-sided of MPI). The single-sided programming model is more natural than the MPI alternative for some algorithms. In accordance with embodiments of the present invention, RDMA and remote memory functionalities allow efficient PGAS capability to be provided. Referring to the pooled memory server apparatus discussed above in reference to FIGS. 8a-8c, the global memory 1305 can be embodied in the form of the memory controller node chassis 821.


Example 10: Disaggregated Server Resources

Currently, disaggregation of server resources is limited to separating compute resources (e.g., CPU and RAM) from storage via separate chassis that are connected via an interface such as, for example, PCIe or SAS. However, data centers and other types of server operating entities will benefit from disaggregation of CPU resources, storage resources, and memory resources. This will allow server operating entities to replace/update CPU resources, storage resources, and memory resources (i.e., server resources) at their respective lifecycle timeframe without having to replace/update one server resource at the particular lifecycle timeframe of another server resource Advantageously, embodiments of the present invention can provide for such disaggregation of CPU resources, storage resources, and memory resources. In particular, embodiments of the present invention provide for the disaggregation of RAM (i.e., memory resources) from compute node cards (i.e., CPU resources) so that CPU resources can be replaced/updated as new CPU resources (e.g., processors) are released whereas memory resources (e.g., RAM, non-volatile storage, etc) can remain in use as long as they are efficient and/or effectively functional. To this end, referring to the pooled memory server apparatus discussed above in reference to FIGS. 8a-8c, the memory resources can be embodied in the form of the memory controller node chassis 821 (i.e., a first physical enclosure unit), the CPU resources can be embodied in the form of the compute node chassis 823 (i.e., a second physical enclosure unit), and the storage resources can be embodied in the form of the storage controller node chassis (i.e., a third physical enclosure unit). Memory resources can be in the form of one or more HMCs.


Example 11: Hybrid Memory Cube (HMC) Deployed Near Memory Pool

As shown in FIG. 14A, pooled memory functionality in accordance with the present invention can be implemented in the form of HMC deployed near memory pools. In such an implementation, a HMC unit (i.e., pooled memory) is shared by a plurality of compute nodes 1410 (i.e., the shared HMC unit 1405). For example, the compute nodes 1410 can all be of a common compute node card such as the Caixeda brand EnergyCard. As shown, each one of the compute nodes 1410 can also have respective base memory 1415. In this manner, the compute nodes 1410 can have non-coherent, shared memory and, optionally, private mutable memory. Referring to the pooled memory server apparatus discussed above in reference to FIGS. 8a-8c, the HMC unit can be embodied in the form of the memory controller node chassis 821 and the compute nodes 1410. CPU resources can be embodied in the form of the compute node chassis 823 and the HMC unit 1405 can be embodied in the form of the memory controller chassis. As a skilled person will appreciate, the near memory pools implemented with HMC units do not require a fabric for data communication. As shown in FIG. 14B, each one of the compute nodes 1410 has a respective private HMC 1420. The private HMC 1420 and the shared HMC 1405 each provide HMC links for supporting communication of data therebetween (e.g., 16-lane HMC link with 40 GB/sec link capacity). For example, the HMC units can each include a cache coherent interconnect 1425 (e.g., a fabric bus) having two memory ports (e.g., 25 GB/sec link capacity each) each coupled to a respective HMC controller 1430 by a bridge 1435. In view of the disclosures made herein, a skilled person will appreciate the compute nodes 1410 can be SoC nodes that are interconnected to each other through a node interconnect fabric and that access to the memory resources of the HMC unit 1405 is made over a respective communication link of the HMC unit 1405 without traversing any communication channel of the node interconnect fabric.


Example 12: Far Memory Pool Using Pooled Memory Functionality

Pooled memory functionality in accordance with the present invention can be implemented in the form of far memory pools. In such an implementation, pooled memory is shared by a plurality of compute nodes such as those of a compute node chassis configured in accordance with the present invention. The shared memory can be in the form of cache coherent DDR or cache coherent HMC such as that of a memory controller chassis configured in accordance with the present invention. The shared memory is accessed via a fabric that interconnects the computer nodes. Preferably, but not necessarily, the compute nodes are all of a common compute node card such as the Calxeda brand EnergyCard. Each one of the compute nodes can also have respective base memory. In this manner, the compute nodes can have non-coherent, shared memory and, optionally, private mutable memory.


In summary, in view of the disclosures made herein, a skilled person will appreciate that a system on a chip (SOC) refers to integration of one or more processors, one or more memory controllers, and one or more I/O controllers onto a single silicone chip. Furthermore, in view of the disclosures made herein, the skilled person will also appreciate that a SOC configured in accordance with the present invention can be specifically implemented in a manner to provide functionalities definitive of a server. In such implementations, a SOC in accordance with the present invention can be referred to as a server on a chip. In view of the disclosures made herein, the skilled person will appreciate that a server on a chip configured in accordance with the present invention can include a server memory subsystem, a server I/O controllers, and a server node interconnect. In one specific embodiment, this server on a chip will include a multi-core CPU, one or more memory controllers that supports ECC, and one or more volume server I/O controllers that minimally includes Ethernet and SATA controllers. The server on a chip can be structured as a plurality of interconnected subsystems, including a CPU subsystem, a peripherals subsystem, a system interconnect subsystem, and a management subsystem.


An exemplary embodiment of a server on a chip that is configured in accordance with the present invention is the ECX-1000 Series server on a chip offered by Caxeda incorporated. The ECX-1000 Series server on a chip includes a SOC architecture that provides reduced power consumption and reduced space requirements. The ECX-1000 Series server on a chip is well suited for computing environments such as, for example, scalable analytics, webserving, media streaming, infrastructure, cloud computing and cloud storage. A node card configured in accordance with the present invention can include a node card substrate having a plurality of the ECX-1000 Series server on a chip instances (i.e., each a server on a chip unit) mounted on the node card substrate and connected to electrical circuitry of the node card substrate. An electrical connector of the node card enables communication of signals between the node card and one or more other instances of the node card.


The ECX-1000 Series server on a chip includes a CPU subsystem (i.e., a processor complex) that uses a plurality of ARM brand processing cores (e.g., four ARM Cortex brand processing cores), which offer the ability to seamlessly turn on-and-off up to several times per second. The CPU subsystem is implemented with server-class workloads in mind and comes with a ECC L2 cache to enhance performance and reduce energy consumption by reducing cache misses. Complementing the ARM brand processing cores is a host of high-performance server-class I/O controllers via standard interfaces such as SATA and PCI Express interfaces. Table 3 below shows technical specification for a specific example of the ECX-1000 Series server on a chip.









TABLE 3





Example of ECX-1000 Series server on a chip technical specification

















Processor
1.
Up to four ARM ® Cortex ™-A9 cores @ 1.1 to


Cores

1.4 GHz



2.
NEON ® technology extensions for multimedia




and SIMD processing



3.
Integrated FPU for floating point acceleration



4.
Calxeda brand TrustZone ® technology for




enhanced security



5.
Individual power domains per core to minimize




overall power consumption


Cache
1.
32 KB L1 instruction cache per core



2.
32 KB L1 data cache per core



3.
4 MB shared L2 cache with ECC


Fabric
1.
Integrated 80 Gb (8 × 8) crossbar switch with


Switch

through-traffic support



2.
Five (5) 10 Gb external channels, three (3) 10 Gb




internal channels



3.
Configurable topology capable of connecting up to




4096 nodes



4.
Dynamic Link Speed Control from 1 Gb to 10 Gb




to minimize power and maximize performance



5.
Network Proxy Support to maintain network




presence oven with node powered off


Management
1.
Separate embedded processor dedicated for


Engine

systems management



2.
Advanced power management with dynamic




power capping



3.
Dedicated Ethernet MAC for out-of-band




communication



4.
Supports IPMI 2.0 and DCMI management




protocols



5.
Remote console support via Serial-over-LAN




(SoL)


Integrated
1.
72-bit DDR controller with ECC support


Memory
2.
32-bit physical memory addressing


Controller
3.
Supports DDR3 (1.5 V) and DDR3L (1.35 V) at




800/1066/1333 MT/s



4.
Single and dual rank support with mirroring


PCI Express
1.
Four (4) integrated GEN2 PCIe controllers



2.
One (1) integrated Gen1 PCIe controller



3.
Support for up to two (2) PCIe ×8 lanes



4.
Support for up to four(4) PCIe ×1, ×2 or ×4 lanes


Networking
1.
Support 1 Gb and 10 Gb Ethernet


Interfaces
2.
Up to five (5) XAUI 10 Gb ports



3.
Up to six (6) 1 Gb SGMII ports (multiplexed




w/XAUI ports)



4.
Three (3) 10 Gb Ethernet MACS supporting IEEE




802.1Q VLANs, IPv4/6 checksum processing, and




TCP/UDP/ICMP checksum offload



5.
Support for shared or private management LAN


SATA
1.
Support for up to five (5) SATA disks


Controllers
2.
Compliant with Serial ATA 2.0, AHCI Revision




1.3, and eSATA specifications



3.
SATA 1.5 Gb/s and 3.0 Gb/s speeds supported


SD/eMMC
1.
Compliant with SD 3.0 Host and MMC 4.4


Controller

(eMMC) specifications



2.
Supports 1 and 4-bit SD modes and 1/4/8-bit




MMC modes



3.
Read/write rates up to 832 Mbps for MMC and up




to 416 Mbps for SD


SSystem
1.
Three (3) 12C interfaces


Integration
2.
Two (2) SPI (master) interface


Features
3.
Two (2) high-speed DART interfaces



4.
64 GPIO/Interrupt pins



5.
JTAG debug port










FIG. 15 shows a SoC unit (i.e., SoC 2200) configured in accordance with an embodiment of the present invention. More specifically, the SoC 2200 is configured for implementing discovery functionalities as disclosed herein. The SoC 2200 can be utilized in standalone manner. Alternatively, the SoC 2200 can be utilized in combination with a plurality of other SoCs on a node card such as, for example, with each one of the SoCs being associated with a respective node of the node card.


The SoC 2200 includes anode CPU subsystem 2202, a peripheral subsystem 2204, a system interconnect subsystem 2206, and a management subsystem 2208. In this regard, a SoC configured in accordance with the present invention can be logically divided into several subsystems. Each one of the subsystems includes a plurality of operation components therein that enable a particular one of the subsystems to provide functionality thereof. Furthermore, each one of these subsystems is preferably managed as independent power domains.


The node CPU subsystem 2202 of SoC 2200 provides the core CPU functionality for the SoC, and runs the primary user operating system (e.g. Ubuntu Linux). The Node CPU subsystem 2202 comprises a node CPU 2210, a L2 cache 2214, a L2 cache controller 2216, memory controller 2217, and main memory 2219. The node CPU 2210 includes 4 processing cores 2222 that share the L2 cache 2214. Preferably, the processing cores 2222 are each an ARM Cortex A9 brand processing core with an associated media processing engine (e.g., Neon brand processing engine) and each one of the processing cores 2222 can have independent L1 instruction cache and L1 data cache. Alternatively, each one of the processing cores can be a different brand of core that functions in a similar or substantially the same manner as ARM Cortex A9 brand processing core. Each one of the processing cores 2222 and its respective L1 cache is in a separate power domain. Optionally, the media processing engine of each processing core 2222 can be in a separate power domain. Preferably, all of the processing cores 2222 within the node CPU subsystem 2202 run at the same speed or are stopped (e.g., idled, dormant or powered down).


The memory controller 2217 is coupled to the L2 cache 2214 and to a peripheral switch of the peripheral subsystem 2204. Preferably, the memory controller 2217 is configured to control a plurality of different types of main memory (e.g., DDR3, DDR3L, LPDDR2). An internal interface of the memory controller 2217 can include a core data port, a peripherals data port, a data port of a power management unit (PMU) portion of the management subsystem 2208, and an asynchronous 32-bit AHB slave port. The PMU data port is desirable to ensure isolation for some low power states. The asynchronous 32-bit AHB slave port is used to configure the memory controller 2217 and access its registers. The asynchronous 32-bit AHB slave port is attached to the PMU fabric and can be synchronous to the PMU fabric in a similar manner as the asynchronous interface is at this end. In one implementation, the memory controller 2217 is an AXI interface (i.e., an Advanced eXtensible Interface).


The peripheral subsystem 2204 of SoC 2200 has the primary responsibility of providing interfaces that enable information storage and transfer functionality. This information storage and transfer functionality includes information storage and transfer both within a given SoC Node and with SoC Nodes accessibly by the given SoC Node. Examples of the information storage and transfer functionality include, but are not limited to, flash interface functionality, PCIe interface functionality, SATA interface functionality, and Ethernet interface functionality. The peripheral subsystem 2204 can also provide additional information storage and transfer functionality such as, for example, direct memory access (DMA) functionality. Each of these peripheral subsystem functionalities is provided by one or more respective controllers that interface to one or more corresponding storage media (i.e., storage media controllers).


The peripherals subsystem 2204 includes the peripheral switch and a plurality of peripheral controllers for providing the abovementioned information storage and transfer functionality. The peripheral switch can be implemented in the form of a High-Performance Matrix (HPM) that is a configurable auto-generated advanced microprocessor bus architecture 3 (i.e., AMBA protocol 3) bus subsystem based around a high-performance AXI cross-bar switch known as the AXI bus matrix, and extended by AMBA infrastructure components.


The peripherals subsystem 2204 includes flash controllers 2230 (i.e. a first type of peripheral controller). The flash controllers 2230 can provide support for any number of different flash memory configurations. A NAND flash controller such as that offered under the brand name Denali is an example of a suitable flash controller Examples of flash media include MultiMediaCard (MMC) media, embedded MultiMediaCard (eMMC) media, Secure Digital (SD) media, SLC/MLC+ECC media, and the like. Memory is an example of media (i.e., storage media) and error correcting code (ECC) memory is an example of a type of memory to which the main memory 2217 interfaces (e.g., main memory 2219).


The peripherals subsystem 2204 includes Ethernet MAC controllers 2232 (i.e. a second type of peripheral controller). Each Ethernet MAC controller 2232 can be of the universal 1Gig design configuration or the 10G design configuration. The universal 1Gig design configuration offers a preferred interface description. The Ethernet MAC controllers 2232 includes a control register set and a DMA (i.e., an AXI master and an AXI slave). Additionally, the peripherals subsystem 2204 can include an AXI2 Ethernet controller 2233. The peripherals subsystem 2204 includes a DMA controller 2234 (i.e., (i.e. a third type of peripheral controller). DMA functionality is useful only for fairly large transfers. Thus, because private memory of the management subsystem 2208 is relatively small, the assumption is that associated messages will be relatively small and can be handled by an interrupt process. If the management subsystem 2208 needs/wants large data transfer, it can power up the whole system except the cores and then DMA is available. The peripherals subsystem 2204 includes a SATA controller 2236 (i.e. a fourth type of peripheral controller). The peripherals subsystem 2204 also includes PCIe controllers 2238. As will be discussed below in greater detail, a XAUI controller of the peripherals subsystem 2204 is provided for enabling interfacing with other CPU nodes (e.g., of a common node card).


The system interconnect subsystem 2206 is a packet switch that provides intra-node and inter-node packet connectivity to Ethernet and within a cluster of nodes (e.g., small clusters up through integration with heterogeneous large enterprise data centers). The system interconnect subsystem 2206 provides a high-speed interconnect fabric, providing a dramatic increase in bandwidth and reduction in latency compared to traditional servers connected via 1 Gb Ethernet to a top of rack switch. Furthermore, the system interconnect subsystem 2206 is configured to provide adaptive link width and speed to optimize power based upon utilization.


An underlying objective of the system interconnect subsystem 2206 is support a scalable, power-optimized cluster fabric of server nodes. As such, the system interconnect subsystem 2206 has three primary functionalities. The first one of these functionalities is serving as a high-speed fabric upon which TCP/IP networking is built and upon which the operating system of the node CPU subsystem 2202 can provide transparent network access to associated network nodes and storage access to associated storage nodes. The second one of these functionalities is serving as a low-level messaging transport between associated nodes. The third one of these functionalities is serving as a transport for remote DMA between associated nodes.


The system interconnect subsystem 2206 can be connected to the node CPU subsystem 2202 and the management subsystem 2208 through a bus fabric (i.e., Ethernet AXIs) of the system interconnect subsystem 2206. An Ethernet interface of the system interconnect subsystem 2206 can be connected to peripheral interfaces (e.g., interfaces 2230, 2232, 2234, 2238) of the peripheral subsystem 2204. A fabric switch (i.e., a switch-mux) can be coupled between the XAUI link ports of the system interconnect subsystem 2206 and one or more MAC's 2243 of the system interconnect subsystem 2206. The XAUI link ports and MACs (i.e., high-speed interconnect interfaces) enabling the node that comprises the SoC 2200 to be connected to associated nodes each having their own SoC (e.g., identically configured SoCs).


The processor cores 2222 (i.e., A9 cores) of the node CPU subsystem 2202 and management processor 2270 (i.e., M3) of the management subsystem 2208 can address MACs (e.g., MAC 2243) of the system interconnect subsystem 2206. In certain embodiments, the processor cores 2222 of the node CPU subsystem 2202 will utilize a first MAC and second MAC and the management processor 2270 of the management subsystem 2208 will utilize a third MAC. To this end, MACs of the system interconnect subsystem 2206 can be configured specifically for their respective application.


The management subsystem 2208 is coupled directly to the node CPU subsystem 2202 and directly to the to the system interconnect subsystem 2206. An inter-processor communication (IPC) module (i.e., iPCM) of the management subsystem 2208, which includes IPC 2216, is coupled to the node CPU subsystem 2202, thereby directly coupling the management subsystem 2208 to the node CPU subsystem 2202. The management processor 2270 of the management subsystem 2208 is preferably, but not necessarily, an ARM Cortex brand M3 microprocessor. The management processor 2270 can have private ROM and private SRAM, The management processor 2270 can be coupled to shared peripherals and private peripherals of the management subsystem 2208. The private peripherals are only accessible by the management processor, whereas the shared peripherals are accessible by the management processor 2270 and each of the processing cores 2222. Instructions for implementing embodiments of the present invention (e.g., functionalities, processes and/or operations associated with r4emote memory access, pooled memory access, memcache, distributed memory, server resource disaggregation, and the like) can reside in non-transitory memory coupled to/allocated to the management processor 2270.


Additional capabilities arise because the management processor 2270 has visibility into all buses, peripherals, and controllers. It can directly access registers for statistics on all buses, memory controllers, network traffic, fabric links, and errors on all devices without disturbing or even the knowledge of the access by the core processing cores 2222. This allows for billing use cases where statistics can be gathered securely by the management processor without having to consume core processing resources (e.g., the processing cores 2222) to gather, and in a manner that cannot be altered by the core processor 2222.


The management processor 2270 has a plurality of responsibilities within its respective node One responsibility of the management processor 2270 is booting an operating system of the node CPU 2210. Another responsibility of the management processor 2270 is node power management. Accordingly, the management subsystem 2208 can also be considered to comprise a power management Unit (PMU) for the node and thus, is sometime referred to as such. As discussed below in greater detail, the management subsystem 2208 controls power states to various power domains of the SoC 2200 (e.g., to the processing cores 2222 by regulating clocks) The management subsystem 2208 is an “always-on” power domain. However, the management processor 2270 can turn off the clocks to the management processor 2270 and/or its private and/or shared peripherals to reduce the dynamic power. Another responsibility of the management processor 2270 is varying synchronized clocks of the node CPU subsystem 2202 (e.g., of the node CPU 2210 and a snoop control unit (SCU)). Another responsibility of the management processor 2270 is providing baseboard management control (BMC) and IPMI functionalities including console virtualization. Another responsibility of the management processor 2270 is providing router management. Another responsibility of the management processor 2270 is acting as proxy for the processing cores 2222 for interrupts and/or for network traffic. For example, a generalized interrupt controller (GIC) of the node CPU subsystem 2202 will cause interrupts intended to be received by a particular one of the processing core 2222 to be reflected to the management processor 2270 for allowing the management processor 2270 to wake the particular one of the processing cores 2222 when an interrupt needs to be processed by the particular one of the of the processing cores that is sleeping, as will be discussed below in greater detail. Another responsibility of the management processor 2270 is controlling phased lock loops (PLLs). A frequency is set in the PLL and it is monitored for lock. Once lock is achieved the output is enabled to the clock control unit (CCU). The CCU is then signaled to enable the function. The management processor 2270 is also responsible for selecting the dividers but the actual change over will happen in a single cycle in hardware. Another responsibility of the management processor 2270 is controlling a configuration of a variable internal supply used to supply electrical power to the node CPU subsystem 2202. For example, a plurality of discrete power supplies (e.g., some being of different power supplying specification than others (e.g., some having different power capacity levels)) can be selectively activated and deactivated as necessary for meeting power requirements of the node CPU subsystem 2202 (e.g., based on power demands of the processing cores 2222, the SCU, and/or the controller of the L2 cache 2214). A separate power control mechanism (e.g., switch) can be used to control power supply to each of the processing cores 2222 and separately to the SCU Another responsibility of the management processor 2270 is managing a real-time-clock (RTC) that exists on a shared peripheral bus of the management subsystem 2208. Another responsibility of the management processor 2270 is managing a watchdog timer on a private peripheral bus of the management subsystem 2208 to aid in recovery from catastrophic software failures. Still another responsibility of the management processor 2270 is managing an off-board EEPROM. The off-board EEPROM is device is used to store all or a portion of boot and node configuration information as well as all or a portion of IPMI statistics that require non-volatile storage. Each of these responsibilities of the management processor 2270 is an operational functionality managed by the management processor 2270. Accordingly, operational management functionality of each one of the subsystem refers to two or more of these responsibilities being managed by the management processor 2270.


As shown in FIG. 16, software 3300 is provided on the management processor 2270. The management processor 2270 includes a plurality of application tasks 3302, an operating system (OS)/input-output (I/O) abstraction layer 3304, a real-time operating system (RTOS) 3306, and device drivers 3308 for the various devices. The operating system (OS)/input-output (10) abstraction layer 3304 is a software layer that resides between the application tasks3302 and the real-time operating system (RTOS) 3306. The operating system (OS)/input-output (I/O) abstraction layer 3304 aids in porting acquired software into this environment. The OS abstraction portion of the operating system (OS)/input-output (I/O) abstraction layer 3304 provides posix-like message queues, semaphores and mutexes. The device abstraction portion of the operating system (OS)/input-output (I/O) abstraction layer 3304 provides a device-transparent open/close/read/write interface much like the posix equivalent for those devices used by ported software. The real-time operating system (RTOS) 3306 resides between the operating system (OS)/input-output (I/O) abstraction layer 3304 and the device drivers 3308.


The application tasks 3302 include, but are not limited to, a boot task 3310, a system management task 3312, a power management task 3314, a serial concentrator task 3316, a frame switch management task 3318 (sometimes called routing management), and a network proxy task 3320. The boot task 3310 provides the function of booting the processing cores 2222 and the management processor 2270. The system management task3312 provides the function of integrated operation of the various subsystems of the SOC 2200. The power management task 3314 provides the function of managing power utilization of the various subsystems of the SOC 2200. The serial concentrator task 3316 provides the function of managing communication from the other application tasks to a system console. This console may be directly connected to the SOC node via a DART (i.e., a universal asynchronous receiver/transmitter) or it can be connected to another node in the system. The frame switch management task 3318 (sometimes called routing management) is responsible for configuring and managing routing network functionality. As discussed in greater detail below, the network proxy task 3320 maintains network presence of one or more of the processing cores 2222 while in a low-power sleep/hibernation state and to intelligently wake one or more of the processing cores 2222 when further processing is required.


Device drivers 3308 are provided for all of the devices that are controlled by the management processor 2270. Examples of the device drivers 3308 include, but are not limited to, an I2C driver 3322, a SMI driver 3324, a flash driver 3326 (e.g., NAND type storage media), a UART driver 3328, a watchdog time (i.e., WDT) driver 3330, a general purpose input-output (i.e., GPIO) driver 332, an Ethernet driver 3334, and an IPC driver 336. In many cases, these drivers are implemented as simple function calls. In some cases where needed for software portability, however, a device-transparent open/close/read/write type I/O abstraction is provided on top of these functions.


In regard to boot processes, it is well known that multiple-stage boot loaders are often used, during which several programs of increasing complexity sequentially load one after the other in a process of chain loading. Advantageously, however, the node CPU 2210 only runs one boot loader before loading the operating system. The ability for the node CPU 2210 to only run one boot loader before loading the operating system is accomplished via the management processor 2270 preloading a boot loader image into main memory (e.g., DRAM) of the node CPU subsystem before releasing the node CPU 2210 from a reset state. More specifically, the SOC 2200 can be configured to use a unique boot process, which includes the management processor 2270 loading a suitable OS boot loader (e.g., U-Boot) into main memory, starting the node CPU 2210 main OS boot loader (e.g., UEFI or U-Boot), and then loading the OS. This eliminates the need for a boot ROM for the node CPU, a first stage boot loader for the node CPU, and dedicated SRAM for boot of the node CPU.


While the foregoing has been with reference to a particular embodiment of the invention, it will be appreciated by those skilled in the art that changes in this embodiment may be made without departing from the principles and spirit of the disclosure, the scope of which is defined by the appended claims.

Claims
  • 1. A method for use in a system comprising a first node server and a second node server, the method comprising: performing the following at the second node server, wherein the second node server comprises a memory: receiving a remote mapping request from the first node server to map a physical address in the memory to an address space of the first node server;determining whether to accept the remote mapping request;in response to determining to accept the remote mapping request, mapping the physical address in the memory to the address space of the first node server; and receiving a request from the first node server to access data stored in the physical address in the memory using the mapping.
  • 2. The method of claim 1, further comprising: in response to receiving the request, sending the data to the first node server using a remote memory access channel.
  • 3. The method of claim 2, wherein the data is sent to the first node server using a remote memory access channel.
  • 4. The method of claim 1, wherein the data is accessed directly from the physical address by the first node server.
  • 5. The method of claim 1, wherein: the first node server comprises a node density configuration enabling the first node server to provide information computing resources to one or more data processing systems; andthe second node server comprises a memory configuration enabling the second node server to enable memory resources thereof to be allocated to caching data for applications running on the one or more data processing systems.
  • 6. The method of claim 1, further comprising: in response to determining not to accept the remote mapping request, preventing the first node server from accessing the data.
  • 7. A non-transitory computer-readable medium having tangibly embodied thereon and accessible therefrom a set of instructions interpretable by one or more data processing devices of a system comprising a first node server and a second node server, wherein the set of instructions is configured to cause the one or more data processing devices of the second node server to implement operations for: receiving a remote mapping request from the first node server to map a physical address in the memory to an address space of the first node server;determining whether to accept the remote mapping request;in response to determining to accept the remote mapping request, mapping the physical address in the memory to the address space of the first node server; and receiving a request from the first node server to access data stored in the physical address in the memory using the mapping.
  • 8. The non-transitory computer-readable medium of claim 7, wherein the set of instructions is further configured to cause the one or more data processing devices of the second node server to implement an operation for: in response to receiving the request, sending the data to the first node server using a remote memory access channel.
  • 9. The non-transitory computer-readable medium of claim 8, wherein the data is sent to the first node server using a remote memory access channel.
  • 10. The non-transitory computer-readable medium of claim 7, wherein the data is accessed directly from the physical address by the first node server.
  • 11. The non-transitory computer-readable medium of claim 7, wherein: the first node server comprises a node density configuration enabling the first node server to provide information computing resources to one or more data processing systems; andthe second node server comprises a memory configuration enabling the second node server to enable memory resources thereof to be allocated to caching data for applications running on the one or more data processing systems.
  • 12. The non-transitory computer-readable medium of claim 7, wherein the set of instructions is further configured to cause the one or more data processing devices of the second node server to implement an operation for: in response to determining not to accept the remote mapping request, preventing the first node server from accessing the data.
  • 13. A system comprising: a first node server; anda second node server configured to: receive a remote mapping request from the first node server to map a physical address in the memory to an address space of the first node server;determine whether to accept the remote mapping request;in response to determining to accept the remote mapping request, map the physical address in the memory to the address space of the first node server; andreceive a request from the first node server to access data stored in the physical address in the memory using the mapping.
  • 14. The system of claim 13, wherein the second node server is further configured to: in response to receiving the request, send the data to the first node server using a remote memory access channel.
  • 15. The system of claim 13, wherein the data is accessed directly from the physical address by the first node server.
  • 16. The system of claim 13, wherein: the first node server comprises a node density configuration enabling the first node server to provide information computing resources to one or more data processing systems; andthe second node server comprises a memory configuration enabling the second node server to enable memory resources thereof to be allocated to caching data for applications running on the one or more data processing systems.
  • 17. The system of claim 13, wherein the second node server is further configured to: in response to determining not to accept the remote mapping request, prevent the first node server from accessing the data.
CROSS REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of U.S. application Ser. No. 16/198,619, filed Nov. 21, 2018, which is a continuation of U.S. application Ser. No. 15/357,332, filed Nov. 21, 2016 (now U.S. Pat. No. 10,140,245), which is a continuation of U.S. application Ser. No. 13/728,428, filed Dec. 27, 2012 (now U.S. Pat. No. 9,648,102), which is a continuation-in-part of U.S. application Ser. No. 13/453,086, filed Apr. 23, 2012 (now U.S. Pat. No. 8,599,863), which is a continuation-in-part of U.S. application Ser. No. 12/794,996, filed Jun. 7, 2010 (now abandoned), which claims priority to U.S. provisional application No. 61/256,723, filed Oct. 30, 2009, all of which have a common applicant herewith and are incorporated herein in their entirety by reference.

US Referenced Citations (1776)
Number Name Date Kind
4215406 Gomola et al. Jul 1980 A
4412288 Herman Oct 1983 A
4525780 Bratt et al. Jun 1985 A
4532893 Day et al. Aug 1985 A
4542458 Kitajima Sep 1985 A
4553202 Trufyn Nov 1985 A
4677614 Circo Jun 1987 A
4850891 Walkup et al. Jul 1989 A
4852001 Tsushima et al. Jul 1989 A
4943932 Lark et al. Jul 1990 A
5146561 Carey et al. Sep 1992 A
5168441 Onarheim Dec 1992 A
5175800 Galis et al. Dec 1992 A
5257374 Hammer et al. Oct 1993 A
5276877 Friedrich Jan 1994 A
5299115 Fields et al. Mar 1994 A
5307496 Ichinose et al. Apr 1994 A
5325526 Cameron et al. Jun 1994 A
5349682 Rosenberry Sep 1994 A
5355508 Kan Oct 1994 A
5377332 Entwistle et al. Dec 1994 A
5408663 Miller Apr 1995 A
5451936 Yang et al. Sep 1995 A
5473773 Aman et al. Dec 1995 A
5477546 Shibata Dec 1995 A
5495533 Linehan et al. Feb 1996 A
5504894 Ferguson et al. Apr 1996 A
5542000 Semba Jul 1996 A
5550970 Cline et al. Aug 1996 A
5594901 Andoh Jan 1997 A
5594908 Hyatt Jan 1997 A
5598536 Slaughter et al. Jan 1997 A
5600844 Shaw et al. Feb 1997 A
5623641 Kadoyashiki Apr 1997 A
5651006 Fujino et al. Jul 1997 A
5652841 Nemirovsky et al. Jul 1997 A
5675739 Eilert et al. Oct 1997 A
5701451 Rogers et al. Dec 1997 A
5729754 Estes Mar 1998 A
5732077 Whitehead Mar 1998 A
5734818 Kern et al. Mar 1998 A
5737009 Payton Apr 1998 A
5752030 Konno et al. May 1998 A
5757771 Li May 1998 A
5761433 Billings Jun 1998 A
5761484 Agarwal et al. Jun 1998 A
5765146 Wolf Jun 1998 A
5774660 Brendel et al. Jun 1998 A
5774668 Choquier et al. Jun 1998 A
5781187 Gephardt et al. Jul 1998 A
5781624 Mitra et al. Jul 1998 A
5787459 Stallmo et al. Jul 1998 A
5799174 Muntz et al. Aug 1998 A
5801985 Roohparvar et al. Sep 1998 A
5826082 Bishop et al. Oct 1998 A
5826236 Narimatsu et al. Oct 1998 A
5826239 Du et al. Oct 1998 A
5828888 Kozaki et al. Oct 1998 A
5832517 Knutsen, II Nov 1998 A
5854887 Kindell et al. Dec 1998 A
5862478 Cutler, Jr. et al. Jan 1999 A
5867382 McLaughlin Feb 1999 A
5874789 Su Feb 1999 A
5881238 Aman et al. Mar 1999 A
5901048 Hu May 1999 A
5908468 Hartmann Jun 1999 A
5911143 Deinhart et al. Jun 1999 A
5913921 Tosey Jun 1999 A
5918017 Attanasio et al. Jun 1999 A
5920545 Raesaenen et al. Jul 1999 A
5920863 McKeehan et al. Jul 1999 A
5930167 Lee et al. Jul 1999 A
5933417 Rottoo Aug 1999 A
5935293 Detering et al. Aug 1999 A
5950190 Yeager Sep 1999 A
5958003 Preining et al. Sep 1999 A
5961599 Kalavade et al. Oct 1999 A
5968176 Nessett et al. Oct 1999 A
5971804 Gallagher et al. Oct 1999 A
5978356 Elwalid et al. Nov 1999 A
5987611 Freund Nov 1999 A
6003061 Jones et al. Dec 1999 A
6006192 Cheng et al. Dec 1999 A
6012052 Altschuler et al. Jan 2000 A
6021425 Waldron, III et al. Feb 2000 A
6032224 Blumenau Feb 2000 A
6052707 D'Souza Apr 2000 A
6055618 Thorson Apr 2000 A
6058416 Mukherjee et al. May 2000 A
6067545 Wolff May 2000 A
6076174 Freund Jun 2000 A
6078953 Vaid et al. Jun 2000 A
6085238 Yuasa et al. Jul 2000 A
6088718 Altschuler et al. Jul 2000 A
6092178 Jindal et al. Jul 2000 A
6097882 Mogul Aug 2000 A
6098090 Burns Aug 2000 A
6101508 Wolff Aug 2000 A
6108662 Hoskins et al. Aug 2000 A
6122664 Boukobza Sep 2000 A
6141214 Ahn Oct 2000 A
6151598 Shaw et al. Nov 2000 A
6154778 Koistinen et al. Nov 2000 A
6161170 Burger et al. Dec 2000 A
6167445 Gai et al. Dec 2000 A
6175869 Ahuja et al. Jan 2001 B1
6181699 Crinion et al. Jan 2001 B1
6182142 Win et al. Jan 2001 B1
6185575 Orcutt Feb 2001 B1
6185601 Wolff Feb 2001 B1
6192414 Horn Feb 2001 B1
6195678 Komuro Feb 2001 B1
6198741 Yoshizawa et al. Mar 2001 B1
6201611 Carter et al. Mar 2001 B1
6202080 Lu et al. Mar 2001 B1
6205465 Schoening et al. Mar 2001 B1
6212542 Kahle et al. Apr 2001 B1
6223202 Bayeh Apr 2001 B1
6226677 Slemmer May 2001 B1
6226788 Schoening et al. May 2001 B1
6247056 Chou et al. Jun 2001 B1
6252878 Locklear Jun 2001 B1
6253230 Couland et al. Jun 2001 B1
6259675 Honda Jul 2001 B1
6263359 Fong et al. Jul 2001 B1
6266667 Olsson Jul 2001 B1
6269398 Leong Jul 2001 B1
6278712 Takihiro et al. Aug 2001 B1
6282561 Jones et al. Aug 2001 B1
6289382 Bowman-Amuah Sep 2001 B1
6298352 Kannan et al. Oct 2001 B1
6314114 Coyle et al. Nov 2001 B1
6314487 Hahn et al. Nov 2001 B1
6314501 Gulick et al. Nov 2001 B1
6314555 Ndumu et al. Nov 2001 B1
6317787 Boyd et al. Nov 2001 B1
6324279 Kalmanek, Jr. et al. Nov 2001 B1
6327364 Shaffer et al. Dec 2001 B1
6330008 Razdow et al. Dec 2001 B1
6330562 Boden et al. Dec 2001 B1
6330583 Reiffin Dec 2001 B1
6330605 Christensen et al. Dec 2001 B1
6333936 Johansson et al. Dec 2001 B1
6334114 Jacobs et al. Dec 2001 B1
6338085 Ramaswamy Jan 2002 B1
6338112 Wipfel et al. Jan 2002 B1
6339717 Baumgartl et al. Jan 2002 B1
6343311 Nishida et al. Jan 2002 B1
6343488 Hackfort Feb 2002 B1
6345287 Fong et al. Feb 2002 B1
6345294 O'Toole et al. Feb 2002 B1
6349295 Tedesco Feb 2002 B1
6351775 Yu Feb 2002 B1
6353844 Bitar et al. Mar 2002 B1
6363434 Eytchison Mar 2002 B1
6363488 Ginter et al. Mar 2002 B1
6366945 Fong et al. Apr 2002 B1
6370154 Wickham Apr 2002 B1
6370584 Bestavros et al. Apr 2002 B1
6373841 Goh et al. Apr 2002 B1
6374254 Cochran et al. Apr 2002 B1
6374297 Wolf et al. Apr 2002 B1
6384842 DeKoning May 2002 B1
6385302 Antonucci et al. May 2002 B1
6392989 Jardetzky et al. May 2002 B1
6393569 Orenshteyn May 2002 B1
6393581 Friedman et al. May 2002 B1
6400996 Hoffberg et al. Jun 2002 B1
6404768 Basak et al. Jun 2002 B1
6405234 Ventrone Jun 2002 B2
6418459 Gulick Jul 2002 B1
6434568 Bowman-Amuah Aug 2002 B1
6438125 Brothers Aug 2002 B1
6438134 Chow et al. Aug 2002 B1
6438594 Bowman-Amuah Aug 2002 B1
6438652 Jordan et al. Aug 2002 B1
6442137 Yu et al. Aug 2002 B1
6446192 Narasimhan et al. Sep 2002 B1
6452809 Jackson et al. Sep 2002 B1
6452924 Golden et al. Sep 2002 B1
6453349 Kano et al. Sep 2002 B1
6453383 Stoddard et al. Sep 2002 B1
6460082 Lumelsky et al. Oct 2002 B1
6463454 Lumelsky et al. Oct 2002 B1
6464261 Dybevik et al. Oct 2002 B1
6466965 Chessell et al. Oct 2002 B1
6466980 Lumelsky et al. Oct 2002 B1
6477580 Bowman-Amuah Nov 2002 B1
6487390 Virine et al. Nov 2002 B1
6490432 Wegener et al. Dec 2002 B1
6496566 Posthuma Dec 2002 B1
6496866 Attanasio et al. Dec 2002 B2
6496872 Katz et al. Dec 2002 B1
6502135 Munger et al. Dec 2002 B1
6505228 Schoening et al. Jan 2003 B1
6507586 Satran et al. Jan 2003 B1
6519571 Guheen et al. Feb 2003 B1
6520591 Jun et al. Feb 2003 B1
6526442 Stupek, Jr. et al. Feb 2003 B1
6529499 Doshi et al. Mar 2003 B1
6529932 Dadiomov et al. Mar 2003 B1
6549940 Allen et al. Apr 2003 B1
6556952 Magro Apr 2003 B1
6564261 Gudjonsson et al. May 2003 B1
6571215 Mahapatro May 2003 B1
6571391 Acharya et al. May 2003 B1
6574238 Thrysoe Jun 2003 B1
6574632 Fox et al. Jun 2003 B2
6578068 Bowman-Amuah Jun 2003 B1
6584489 Jones et al. Jun 2003 B1
6584499 Jantz et al. Jun 2003 B1
6587469 Bragg Jul 2003 B1
6587938 Eilert et al. Jul 2003 B1
6590587 Wichelman et al. Jul 2003 B1
6600898 Bonet et al. Jul 2003 B1
6601234 Bowman-Amuah Jul 2003 B1
6606660 Bowman-Amuah Aug 2003 B1
6618820 Krum Sep 2003 B1
6622168 Datta Sep 2003 B1
6626077 Gilbert Sep 2003 B1
6628649 Raj et al. Sep 2003 B1
6629081 Cornelius et al. Sep 2003 B1
6629148 Ahmed et al. Sep 2003 B1
6633544 Rexford et al. Oct 2003 B1
6636853 Stephens, Jr. Oct 2003 B1
6640145 Hoffberg et al. Oct 2003 B2
6640238 Bowman-Amuah Oct 2003 B1
6651098 Carroll et al. Nov 2003 B1
6651125 Maergner Nov 2003 B2
6661671 Franke et al. Dec 2003 B1
6661787 O'Connell et al. Dec 2003 B1
6662202 Krusche et al. Dec 2003 B1
6662219 Nishanov et al. Dec 2003 B1
6668304 Satran et al. Dec 2003 B1
6687257 Balasubramanian Feb 2004 B1
6690400 Moayyad et al. Feb 2004 B1
6690647 Tang et al. Feb 2004 B1
6701318 Fox et al. Mar 2004 B2
6704489 Kurakake Mar 2004 B1
6711691 Howard et al. Mar 2004 B1
6714778 Nykanen et al. Mar 2004 B2
6724733 Schuba et al. Apr 2004 B1
6725456 Bruno et al. Apr 2004 B1
6735188 Becker et al. May 2004 B1
6735630 Gelvin et al. May 2004 B1
6738736 Bond May 2004 B1
6745246 Erimli et al. Jun 2004 B1
6748559 Pfister Jun 2004 B1
6757723 O'Toole et al. Jun 2004 B1
6760306 Pan et al. Jul 2004 B1
6766389 Hayter et al. Jul 2004 B2
6771661 Chawla et al. Aug 2004 B1
6772211 Lu et al. Aug 2004 B2
6775701 Pan et al. Aug 2004 B1
6779016 Aziz et al. Aug 2004 B1
6781990 Puri et al. Aug 2004 B1
6785724 Drainville et al. Aug 2004 B1
6785794 Chase et al. Aug 2004 B2
6813676 Henry et al. Nov 2004 B1
6816750 Klaas Nov 2004 B1
6816903 Rakoshitz et al. Nov 2004 B1
6816905 Sheets et al. Nov 2004 B1
6823377 Wu et al. Nov 2004 B1
6826607 Gelvin et al. Nov 2004 B1
6829762 Arimilli et al. Dec 2004 B2
6832251 Gelvin et al. Dec 2004 B1
6836806 Raciborski et al. Dec 2004 B1
6842430 Melnik Jan 2005 B1
6850966 Matsuura et al. Feb 2005 B2
6857020 Chaar et al. Feb 2005 B1
6857026 Cain Feb 2005 B1
6857938 Smith et al. Feb 2005 B1
6859831 Gelvin et al. Feb 2005 B1
6859927 Moody et al. Feb 2005 B2
6862606 Major et al. Mar 2005 B1
6868097 Soda et al. Mar 2005 B1
6874031 Corbeil Mar 2005 B2
6894792 Abe May 2005 B1
6904460 Raciborski et al. Jun 2005 B1
6912533 Hornick Jun 2005 B1
6922664 Fernandez et al. Jul 2005 B1
6925431 Papaefstathiou Aug 2005 B1
6928471 Pabari et al. Aug 2005 B2
6931640 Asano et al. Aug 2005 B2
6934702 Faybishenko et al. Aug 2005 B2
6938256 Deng et al. Aug 2005 B2
6947982 McGann et al. Sep 2005 B1
6948171 Dan et al. Sep 2005 B2
6950821 Faybishenko et al. Sep 2005 B2
6950833 Costello et al. Sep 2005 B2
6952828 Greene Oct 2005 B2
6954784 Aiken et al. Oct 2005 B2
6963917 Callis et al. Nov 2005 B1
6963926 Robinson Nov 2005 B1
6963948 Gulick Nov 2005 B1
6965930 Arrowood et al. Nov 2005 B1
6966033 Gasser et al. Nov 2005 B1
6971098 Khare et al. Nov 2005 B2
6975609 Khaleghi et al. Dec 2005 B1
6977939 Joy et al. Dec 2005 B2
6978310 Rodriguez et al. Dec 2005 B1
6978447 Okmianski Dec 2005 B1
6985461 Singh Jan 2006 B2
6985937 Keshav et al. Jan 2006 B1
6988170 Barroso et al. Jan 2006 B2
6990063 Lenoski et al. Jan 2006 B1
6990677 Pietraszak et al. Jan 2006 B1
6996821 Butterworth Feb 2006 B1
6996822 Willen Feb 2006 B1
7003414 Wichelman et al. Feb 2006 B1
7006881 Hallberg et al. Feb 2006 B1
7013303 Faybishenko et al. Mar 2006 B2
7013322 Lahr Mar 2006 B2
7017186 Day Mar 2006 B2
7020695 Kundu et al. Mar 2006 B1
7020701 Gelvin et al. Mar 2006 B1
7020719 Grove et al. Mar 2006 B1
7032119 Fung Apr 2006 B2
7034686 Matsumura Apr 2006 B2
7035230 Shaffer et al. Apr 2006 B1
7035240 Balakrishnan et al. Apr 2006 B1
7035854 Hsaio et al. Apr 2006 B2
7035911 Lowery et al. Apr 2006 B2
7043605 Suzuki May 2006 B2
7058070 Tran et al. Jun 2006 B2
7058951 Bril et al. Jun 2006 B2
7065579 Traversal et al. Jun 2006 B2
7065764 Prael et al. Jun 2006 B1
7072807 Brown et al. Jul 2006 B2
7076717 Grossman et al. Jul 2006 B2
7080078 Slaughter et al. Jul 2006 B1
7080283 Songer et al. Jul 2006 B1
7080285 Kosugi Jul 2006 B2
7080378 Noland et al. Jul 2006 B1
7082606 Wood et al. Jul 2006 B2
7085825 Pishevar et al. Aug 2006 B1
7085837 Kimbrel et al. Aug 2006 B2
7085893 Krissell et al. Aug 2006 B2
7089294 Baskey et al. Aug 2006 B1
7093256 Bloks Aug 2006 B2
7095738 Desanti Aug 2006 B1
7099933 Wallace et al. Aug 2006 B1
7100192 Igawa et al. Aug 2006 B1
7102996 Amdahl et al. Sep 2006 B1
7103625 Hipp et al. Sep 2006 B1
7103664 Novaes et al. Sep 2006 B1
7117208 Tamayo et al. Oct 2006 B2
7117273 O'Toole et al. Oct 2006 B1
7119591 Lin Oct 2006 B1
7124289 Suorsa Oct 2006 B1
7124410 Berg et al. Oct 2006 B2
7126913 Patel et al. Oct 2006 B1
7127613 Pabla et al. Oct 2006 B2
7127633 Olson et al. Oct 2006 B1
7136927 Traversal et al. Nov 2006 B2
7140020 McCarthy et al. Nov 2006 B2
7143088 Green et al. Nov 2006 B2
7143153 Black et al. Nov 2006 B1
7143168 BiBiasio et al. Nov 2006 B1
7145995 Oltmanns et al. Dec 2006 B2
7146233 Aziz et al. Dec 2006 B2
7146353 Garg et al. Dec 2006 B2
7146416 Yoo et al. Dec 2006 B1
7150044 Hoefelmeyer et al. Dec 2006 B2
7154621 Rodriguez et al. Dec 2006 B2
7155478 Ims et al. Dec 2006 B2
7155502 Galloway et al. Dec 2006 B1
7165107 Pouyoul et al. Jan 2007 B2
7165120 Giles et al. Jan 2007 B1
7167920 Traversal et al. Jan 2007 B2
7168049 Day Jan 2007 B2
7170315 Bakker et al. Jan 2007 B2
7171415 Kan et al. Jan 2007 B2
7171476 Maeda et al. Jan 2007 B2
7171491 O'Toole et al. Jan 2007 B1
7171593 Whittaker Jan 2007 B1
7177823 Lam et al. Feb 2007 B2
7180866 Chartre et al. Feb 2007 B1
7185046 Ferstl et al. Feb 2007 B2
7185073 Gai et al. Feb 2007 B1
7185077 O'Toole et al. Feb 2007 B1
7188145 Lowery et al. Mar 2007 B2
7188174 Rolia et al. Mar 2007 B2
7191244 Jennings et al. Mar 2007 B2
7197549 Salama et al. Mar 2007 B1
7197559 Goldstein et al. Mar 2007 B2
7197561 Lovy et al. Mar 2007 B1
7197565 Abdelaziz et al. Mar 2007 B2
7203063 Bash et al. Apr 2007 B2
7203746 Harrop Apr 2007 B1
7203753 Yeager et al. Apr 2007 B2
7206819 Schmidt Apr 2007 B2
7206841 Traversal et al. Apr 2007 B2
7206934 Pabla et al. Apr 2007 B2
7213047 Yeager et al. May 2007 B2
7213050 Shaffer et et al. May 2007 B1
7213062 Raciborski et al. May 2007 B1
7213065 Watt May 2007 B2
7216173 Clayton et al. May 2007 B2
7222187 Yeager et al. May 2007 B2
7222343 Heyrman et al. May 2007 B2
7225249 Barry et al. May 2007 B1
7225442 Dutta et al. May 2007 B2
7228350 Hong et al. Jun 2007 B2
7231445 Aweya et al. Jun 2007 B1
7233569 Swallow Jun 2007 B1
7233669 Swallow Jun 2007 B2
7236915 Algieri et al. Jun 2007 B2
7237243 Sutton et al. Jun 2007 B2
7242501 Ishimoto Jul 2007 B2
7243351 Kundu Jul 2007 B2
7249179 Romero et al. Jul 2007 B1
7251222 Chen et al. Jul 2007 B2
7251688 Leighton et al. Jul 2007 B2
7254608 Yeager et al. Aug 2007 B2
7257655 Burney et al. Aug 2007 B1
7260846 Day Aug 2007 B2
7263288 Islam Aug 2007 B1
7263560 Abdelaziz et al. Aug 2007 B2
7274705 Chang et al. Sep 2007 B2
7275018 Abu-El-Zeet et al. Sep 2007 B2
7275102 Yeager et al. Sep 2007 B2
7275249 Miller et al. Sep 2007 B1
7278008 Case et al. Oct 2007 B1
7278142 Bandhole et al. Oct 2007 B2
7278582 Siegel et al. Oct 2007 B1
7281045 Aggarwal et al. Oct 2007 B2
7283838 Lu Oct 2007 B2
7284109 Paxie et al. Oct 2007 B1
7289619 Vivadelli et al. Oct 2007 B2
7289985 Zeng et al. Oct 2007 B2
7293092 Sukegawa Nov 2007 B2
7296268 Darling et al. Nov 2007 B2
7299294 Bruck et al. Nov 2007 B1
7305464 Phillipi et al. Dec 2007 B2
7308496 Yeager et al. Dec 2007 B2
7308687 Trossman et al. Dec 2007 B2
7310319 Awsienko et al. Dec 2007 B2
7313793 Traut et al. Dec 2007 B2
7315887 Liang et al. Jan 2008 B1
7320025 Steinberg et al. Jan 2008 B1
7324555 Chen et al. Jan 2008 B1
7325050 O+3 Connor et al. Jan 2008 B2
7328243 Yeager et al. Feb 2008 B2
7328264 Babka Feb 2008 B2
7328406 Kalinoski et al. Feb 2008 B2
7334108 Case et al. Feb 2008 B1
7334230 Chung et al. Feb 2008 B2
7337333 O+3 Conner et al. Feb 2008 B2
7337446 Sankaranarayan et al. Feb 2008 B2
7340500 Traversal et al. Mar 2008 B2
7340578 Khanzode Mar 2008 B1
7340777 Szor Mar 2008 B1
7343467 Brown et al. Mar 2008 B2
7349348 Johnson et al. Mar 2008 B1
7350186 Coleman et al. Mar 2008 B2
7353276 Bain et al. Apr 2008 B2
7353362 Georgiou et al. Apr 2008 B2
7353495 Somogyi Apr 2008 B2
7356655 Allen et al. Apr 2008 B2
7356770 Jackson Apr 2008 B1
7363346 Groner et al. Apr 2008 B2
7366101 Varier et al. Apr 2008 B1
7366719 Shaw Apr 2008 B2
7370092 Aderton et al. May 2008 B2
7373391 Iinuma May 2008 B2
7373524 Motsinger et al. May 2008 B2
7376693 Neiman et al. May 2008 B2
7380039 Miloushev et al. May 2008 B2
7382154 Ramos et al. Jun 2008 B2
7383433 Yeager et al. Jun 2008 B2
7386586 Headley et al. Jun 2008 B1
7386611 Dias et al. Jun 2008 B2
7386850 Mullen Jun 2008 B2
7386888 Liang et al. Jun 2008 B2
7389310 Bhagwan et al. Jun 2008 B1
7392325 Grove et al. Jun 2008 B2
7392360 Aharoni Jun 2008 B1
7395536 Verbeke et al. Jul 2008 B2
7395537 Brown Jul 2008 B1
7398216 Barnett et al. Jul 2008 B2
7398471 Rambacher Jul 2008 B1
7401114 Block et al. Jul 2008 B1
7401152 Traversal et al. Jul 2008 B2
7401153 Traversal et al. Jul 2008 B2
7401355 Supnik et al. Jul 2008 B2
7403994 Vogl et al. Jul 2008 B1
7409433 Lowery et al. Aug 2008 B2
7412492 Waldspurger Aug 2008 B1
7412703 Cleary et al. Aug 2008 B2
7415709 Hipp et al. Aug 2008 B2
7418518 Grove et al. Aug 2008 B2
7418534 Hayter et al. Aug 2008 B2
7421402 Chang et al. Sep 2008 B2
7421500 Talwar et al. Sep 2008 B2
7423971 Mohaban et al. Sep 2008 B1
7426489 Van Soestbergen et al. Sep 2008 B2
7426546 Breiter et al. Sep 2008 B2
7428540 Coates et al. Sep 2008 B1
7433304 Galloway et al. Oct 2008 B1
7437460 Chidambaran et al. Oct 2008 B2
7437540 Paolucci et al. Oct 2008 B2
7437730 Goyal Oct 2008 B2
7441261 Slater et al. Oct 2008 B2
7447147 Nguyen et al. Nov 2008 B2
7447197 Terrell et al. Nov 2008 B2
7451199 Kandefer et al. Nov 2008 B2
7451201 Alex et al. Nov 2008 B2
7454467 Girouard et al. Nov 2008 B2
7461134 Ambrose Dec 2008 B2
7463587 Rajsic et al. Dec 2008 B2
7464159 Luoffo et al. Dec 2008 B2
7464160 Iszlai et al. Dec 2008 B2
7466712 Makishima et al. Dec 2008 B2
7466810 Quon et al. Dec 2008 B1
7467225 Anerousis et al. Dec 2008 B2
7467306 Cartes et al. Dec 2008 B2
7467358 Kang et al. Dec 2008 B2
7475419 Basu et al. Jan 2009 B1
7483945 Blumofe Jan 2009 B2
7484008 Gelvin et al. Jan 2009 B1
7484225 Hugly et al. Jan 2009 B2
7487254 Walsh et al. Feb 2009 B2
7487509 Hugly et al. Feb 2009 B2
7492720 Pruthi et al. Feb 2009 B2
7502747 Pardo et al. Mar 2009 B1
7502884 Shah et al. Mar 2009 B1
7503045 Aziz et al. Mar 2009 B1
7505463 Schuba Mar 2009 B2
7512649 Faybishenko et al. Mar 2009 B2
7512894 Hintermeister Mar 2009 B1
7516221 Souder et al. Apr 2009 B2
7516455 Matheson et al. Apr 2009 B2
7519677 Lowery et al. Apr 2009 B2
7519843 Buterbaugh et al. Apr 2009 B1
7526479 Zenz Apr 2009 B2
7529835 Agronow et al. May 2009 B1
7533141 Nadgi et al. May 2009 B2
7533161 Hugly et al. May 2009 B2
7533172 Traversal et al. May 2009 B2
7533385 Barnes May 2009 B1
7536541 Isaacson May 2009 B2
7543052 Klein Jun 2009 B1
7546553 Bozak et al. Jun 2009 B2
7551614 Teisberg et al. Jun 2009 B2
7554930 Gaddis et al. Jun 2009 B2
7555666 Brundridge et al. Jun 2009 B2
7562143 Fellenstein et al. Jul 2009 B2
7568199 Bozak et al. Jul 2009 B2
7570943 Sorvari et al. Aug 2009 B2
7571438 Jones et al. Aug 2009 B2
7574523 Traversal et al. Aug 2009 B2
7577722 Khandejar et al. Aug 2009 B1
7577834 Traversal et al. Aug 2009 B1
7577959 Nguyen et al. Aug 2009 B2
7580382 Amis et al. Aug 2009 B1
7580919 Hannel Aug 2009 B1
7583607 Steele et al. Sep 2009 B2
7583661 Chaudhuri Sep 2009 B2
7584274 Bond et al. Sep 2009 B2
7586841 Vasseur Sep 2009 B2
7590746 Slater et al. Sep 2009 B2
7590747 Coates et al. Sep 2009 B2
7594011 Chandra Sep 2009 B2
7594015 Bozak et al. Sep 2009 B2
7596144 Pong Sep 2009 B2
7596784 Abrams et al. Sep 2009 B2
7599360 Edsall et al. Oct 2009 B2
7606225 Xie et al. Oct 2009 B2
7606245 Ma et al. Oct 2009 B2
7610289 Muret et al. Oct 2009 B2
7613796 Harvey et al. Nov 2009 B2
7616646 Ma et al. Nov 2009 B1
7620057 Aloni et al. Nov 2009 B1
7620635 Hornick Nov 2009 B2
7620706 Jackson Nov 2009 B2
7624118 Schipunov et al. Nov 2009 B2
7624194 Kakivaya et al. Nov 2009 B2
7627691 Buchsbaum et al. Dec 2009 B1
7631066 Schatz et al. Dec 2009 B1
7640353 Shen et al. Dec 2009 B2
7640547 Neiman et al. Dec 2009 B2
7644215 Wallace et al. Jan 2010 B2
7657535 Moyaux et al. Feb 2010 B2
7657597 Arora et al. Feb 2010 B2
7657626 Zwicky Feb 2010 B1
7657677 Huang et al. Feb 2010 B2
7657756 Hall Feb 2010 B2
7660887 Reedy et al. Feb 2010 B2
7660922 Harriman Feb 2010 B2
7664110 Lovett et al. Feb 2010 B1
7665090 Tormasov et al. Feb 2010 B1
7668809 Kelly et al. Feb 2010 B1
7673164 Agarwal Mar 2010 B1
7680933 Fatula, Jr. Mar 2010 B2
7685281 Saraiya et al. Mar 2010 B1
7685599 Kanai et al. Mar 2010 B2
7685602 Tran et al. Mar 2010 B1
7689661 Lowery et al. Mar 2010 B2
7693976 Perry et al. Apr 2010 B2
7693993 Sheets et al. Apr 2010 B2
7694076 Lowery et al. Apr 2010 B2
7694305 Karlsson et al. Apr 2010 B2
7698386 Amidon et al. Apr 2010 B2
7698398 Lai Apr 2010 B1
7698430 Jackson Apr 2010 B2
7701948 Rabie et al. Apr 2010 B2
7707088 Schmelzer Apr 2010 B2
7710936 Morales Barroso May 2010 B2
7711652 Schmelzer May 2010 B2
7716193 Krishnamoorthy May 2010 B2
7716334 Rao et al. May 2010 B2
7719834 Miyamoto et al. May 2010 B2
7721125 Fung May 2010 B2
7725583 Jackson May 2010 B2
7730220 Hasha et al. Jun 2010 B2
7730262 Lowery et al. Jun 2010 B2
7730488 Ilzuka et al. Jun 2010 B2
7739308 Baffler et al. Jun 2010 B2
7739541 Rao et al. Jun 2010 B1
7742425 El-Damhougy Jun 2010 B2
7742476 Branda et al. Jun 2010 B2
7743147 Suorsa et al. Jun 2010 B2
7747451 Keohane et al. Jun 2010 B2
RE41440 Briscoe et al. Jul 2010 E
7751433 Dollo et al. Jul 2010 B2
7752258 Lewin et al. Jul 2010 B2
7752624 Crawford, Jr. et al. Jul 2010 B2
7756658 Kulkarni et al. Jul 2010 B2
7757236 Singh Jul 2010 B1
7760720 Pullela et al. Jul 2010 B2
7761557 Fellenstein et al. Jul 2010 B2
7761687 Blumrich et al. Jul 2010 B2
7765288 Bainbridge et al. Jul 2010 B2
7765299 Romero Jul 2010 B2
7769620 Fernandez et al. Aug 2010 B1
7769803 Birdwell et al. Aug 2010 B2
7770120 Baudisch Aug 2010 B2
7774331 Barth et al. Aug 2010 B2
7774495 Pabla et al. Aug 2010 B2
7778234 Cooke et al. Aug 2010 B2
7782813 Wheeler et al. Aug 2010 B2
7783777 Pabla et al. Aug 2010 B1
7783786 Lauterbach Aug 2010 B1
7783910 Felter et al. Aug 2010 B2
7788403 Darugar et al. Aug 2010 B2
7788477 Huang et al. Aug 2010 B1
7791894 Bechtolsheim Sep 2010 B2
7792113 Foschiano et al. Sep 2010 B1
7793288 Sameske Sep 2010 B2
7796399 Clayton et al. Sep 2010 B2
7796619 Feldmann et al. Sep 2010 B1
7797367 Gelvin et al. Sep 2010 B1
7797393 Qiu et al. Sep 2010 B2
7801132 Ofek et al. Sep 2010 B2
7802017 Uemura et al. Sep 2010 B2
7805448 Andrzejak et al. Sep 2010 B2
7805575 Agarwal et al. Sep 2010 B1
7810090 Gebhart Oct 2010 B2
7813822 Hoffberg Oct 2010 B1
7827361 Karlsson et al. Nov 2010 B1
7830820 Duke et al. Nov 2010 B2
7831839 Hatakeyama Nov 2010 B2
7840353 Ouksel et al. Nov 2010 B2
7840703 Arimilli et al. Nov 2010 B2
7844687 Gelvin et al. Nov 2010 B1
7844787 Ranganathan et al. Nov 2010 B2
7848262 El-Damhougy Dec 2010 B2
7849139 Wolfson et al. Dec 2010 B2
7849140 Abdel-Aziz et al. Dec 2010 B2
7853880 Porter Dec 2010 B2
7860999 Subramanian et al. Dec 2010 B1
7865614 Lu et al. Jan 2011 B2
7886023 Johnson Feb 2011 B1
7889675 Mack-Crane et al. Feb 2011 B2
7890571 Kriegsman Feb 2011 B1
7890701 Lowery et al. Feb 2011 B2
7891004 Gelvin et al. Feb 2011 B1
RE42262 Stephens, Jr. Mar 2011 E
7899047 Cabrera et al. Mar 2011 B2
7900206 Joshi et al. Mar 2011 B1
7904569 Gelvin et al. Mar 2011 B1
7925795 Tamir et al. Apr 2011 B2
7930397 Midgley Apr 2011 B2
7934005 Fascenda Apr 2011 B2
7958262 Hasha et al. Jun 2011 B2
7970929 Mahalingaiah Jun 2011 B1
7971204 Jackson Jun 2011 B2
7975032 Lowery et al. Jul 2011 B2
7975035 Popescu et al. Jul 2011 B2
7975110 Spaur et al. Jul 2011 B1
7984137 O'Toole, Jr. et al. Jul 2011 B2
7984183 Andersen et al. Jul 2011 B2
7991817 Dehon et al. Aug 2011 B2
7991922 Hayter et al. Aug 2011 B2
7992151 Warrier et al. Aug 2011 B2
7995501 Jetcheva et al. Aug 2011 B2
7996510 Vicente Aug 2011 B2
8000288 Wheeler et al. Aug 2011 B2
8014408 Habelha et al. Sep 2011 B2
8018860 Cook Sep 2011 B1
8019832 De Sousa et al. Sep 2011 B2
8032634 Eppstein Oct 2011 B1
8037202 Yeager et al. Oct 2011 B2
8037475 Jackson Oct 2011 B1
8041773 Abu-Ghazaleh et al. Oct 2011 B2
8055788 Chan et al. Nov 2011 B1
8060552 Hinni et al. Nov 2011 B2
8060760 Shetty et al. Nov 2011 B2
8060775 Sharma et al. Nov 2011 B1
8073978 Sengupta et al. Dec 2011 B2
8078708 Wang et al. Dec 2011 B1
8079118 Gelvin et al. Dec 2011 B2
8082400 Chang et al. Dec 2011 B1
8090880 Hasha et al. Jan 2012 B2
8095600 Hasha et al. Jan 2012 B2
8095601 Hasha et al. Jan 2012 B2
8103543 Zwicky Jan 2012 B1
8108455 Yeager et al. Jan 2012 B2
8108508 Goh et al. Jan 2012 B1
8108512 Howard et al. Jan 2012 B2
8108930 Hoefelmeyer et al. Jan 2012 B2
8122269 Houlihan et al. Feb 2012 B2
8132034 Lambert et al. Mar 2012 B2
8135812 Lowery et al. Mar 2012 B2
8140658 Gelvin et al. Mar 2012 B1
8151103 Jackson Apr 2012 B2
8155113 Agarwal Apr 2012 B1
8156362 Branover et al. Apr 2012 B2
8160077 Traversal et al. Apr 2012 B2
8161391 McCleiland et al. Apr 2012 B2
8165120 Maruccia et al. Apr 2012 B2
8166063 Andersen et al. Apr 2012 B2
8166204 Basu et al. Apr 2012 B2
8170040 Konda May 2012 B2
8171136 Petite May 2012 B2
8176189 Traversal et al. May 2012 B2
8176490 Jackson May 2012 B1
8180996 Fullerton et al. May 2012 B2
8185776 Gentes et al. May 2012 B1
8189612 Lemaire et al. May 2012 B2
8194659 Ban Jun 2012 B2
8196133 Kakumani et al. Jun 2012 B2
8199636 Rouyer et al. Jun 2012 B1
8204992 Arora et al. Jun 2012 B2
8205044 Lowery et al. Jun 2012 B2
8205103 Kazama et al. Jun 2012 B2
8205210 Cleary et al. Jun 2012 B2
8244671 Chen et al. Aug 2012 B2
8260893 Bandhole et al. Sep 2012 B1
8261349 Peng Sep 2012 B2
8266321 Johnston-Watt et al. Sep 2012 B2
8271628 Lowery et al. Sep 2012 B2
8271980 Jackson Sep 2012 B2
8275881 Fellenslein et al. Sep 2012 B2
8302100 Deng et al. Oct 2012 B2
8321048 Coss et al. Nov 2012 B1
8346591 Fellenstein et al. Jan 2013 B2
8346908 Vanyukhin et al. Jan 2013 B1
8359397 Traversal et al. Jan 2013 B2
8370898 Jackson Feb 2013 B1
8379425 Fukuoka et al. Feb 2013 B2
8380846 Abu-Ghazaleh et al. Feb 2013 B1
8386622 Jacobson Feb 2013 B2
8392515 Kakivaya et al. Mar 2013 B2
8396757 Fellenslein et al. Mar 2013 B2
8397092 Karnowski Mar 2013 B2
8402540 Kapoor et al. Mar 2013 B2
8407428 Cheriton et al. Mar 2013 B2
8413155 Jackson Apr 2013 B2
8417715 Bruckhaus et al. Apr 2013 B1
8417813 Kakivaya et al. Apr 2013 B2
8458333 Stoica et al. Jun 2013 B1
8463867 Robertson et al. Jun 2013 B2
8464250 Ansel Jun 2013 B1
8484382 Das et al. Jul 2013 B2
8495201 Klincewicz Jul 2013 B2
8504663 Lowery et al. Aug 2013 B2
8504791 Cheriton et al. Aug 2013 B2
8516470 van Rietschote Aug 2013 B1
8544017 Prael et al. Sep 2013 B1
8554920 Chen et al. Oct 2013 B2
8560639 Murphy et al. Oct 2013 B2
8572326 Murphy et al. Oct 2013 B2
RE44610 Krakirian et al. Nov 2013 E
8584129 Czajkowski Nov 2013 B1
8589517 Hoefelmeyer et al. Nov 2013 B2
8599863 Davis Dec 2013 B2
8601595 Gelvin et al. Dec 2013 B2
8606800 Lagad et al. Dec 2013 B2
8615602 Li et al. Dec 2013 B2
8626820 Levy Jan 2014 B1
8631130 Jackson Jan 2014 B2
8684802 Gross et al. Apr 2014 B1
8701121 Saffre Apr 2014 B2
8726278 Shawver et al. May 2014 B1
8737410 Davis May 2014 B2
8738860 Griffin et al. May 2014 B1
8745275 Ikeya et al. Jun 2014 B2
8745302 Davis et al. Jun 2014 B2
8782120 Jackson Jul 2014 B2
8782231 Jackson Jul 2014 B2
8782321 Harriman et al. Jul 2014 B2
8782654 Jackson Jul 2014 B2
8812400 Faraboschi et al. Aug 2014 B2
8824485 Biswas et al. Sep 2014 B2
8854831 Arnouse Oct 2014 B2
8863143 Jackson Oct 2014 B2
8903964 Breslin Dec 2014 B2
8930536 Jackson Jan 2015 B2
8954584 Subbarayan et al. Feb 2015 B1
9008079 Davis et al. Apr 2015 B2
9038078 Jackson May 2015 B2
9054990 Davis Jun 2015 B2
9060060 Lobig Jun 2015 B2
9069611 Jackson Jun 2015 B2
9069929 Borland Jun 2015 B2
9075655 Davis et al. Jul 2015 B2
9075657 Jackson Jul 2015 B2
9077654 Davis Jul 2015 B2
9092594 Borland Jul 2015 B2
9112813 Jackson Aug 2015 B2
9116755 Jackson Aug 2015 B2
9128767 Jackson Sep 2015 B2
9152455 Jackson Oct 2015 B2
9176785 Jackson Nov 2015 B2
9231886 Jackson Jan 2016 B2
9262225 Davis Feb 2016 B2
9268607 Jackson Feb 2016 B2
9288147 Kern Mar 2016 B2
9304896 Chandra et al. Apr 2016 B2
9311269 Davis Apr 2016 B2
9367802 Arndt et al. Jun 2016 B2
9405584 Davis Aug 2016 B2
9413687 Jackson Aug 2016 B2
9454403 Davis Sep 2016 B2
9465771 Davis et al. Oct 2016 B2
9479463 Davis Oct 2016 B2
9491064 Jackson Oct 2016 B2
9509552 Davis Nov 2016 B2
9575805 Jackson Feb 2017 B2
9585281 Schnell Feb 2017 B2
9602573 Abu-Ghazaleh et al. Mar 2017 B1
9619296 Jackson Apr 2017 B2
9648102 Davis et al. May 2017 B1
9680770 Davis Jun 2017 B2
9749326 Davis Aug 2017 B2
9778959 Jackson Oct 2017 B2
9785479 Jackson Oct 2017 B2
9792249 Borland Oct 2017 B2
9825860 Hu Nov 2017 B2
9866477 Davis Jan 2018 B2
9876735 Davis Jan 2018 B2
9886322 Jackson Feb 2018 B2
9929976 Davis Mar 2018 B2
9959140 Jackson May 2018 B2
9959141 Jackson May 2018 B2
9961013 Jackson May 2018 B2
9965442 Borland May 2018 B2
9977763 Davis May 2018 B2
9979672 Jackson May 2018 B2
10021806 Schnell Jul 2018 B2
10050970 Davis Aug 2018 B2
10135731 Davis Nov 2018 B2
10140245 Davis et al. Nov 2018 B2
10277531 Jackson Apr 2019 B2
10311014 Dalton Jun 2019 B2
10333862 Jackson Jun 2019 B2
10379909 Jackson Aug 2019 B2
10445146 Jackson Oct 2019 B2
10445148 Jackson Oct 2019 B2
10585704 Jackson Mar 2020 B2
10608949 Jackson Mar 2020 B2
10733028 Jackson Aug 2020 B2
10735505 Abu-Ghazaleh et al. Aug 2020 B2
10871999 Jackson Dec 2020 B2
10951487 Jackson Mar 2021 B2
10977090 Jackson Apr 2021 B2
11132277 Dalton Sep 2021 B2
11134022 Jackson Sep 2021 B2
11144355 Jackson Oct 2021 B2
11356385 Jackson Jun 2022 B2
11467883 Jackson Oct 2022 B2
20010015733 Sklar Aug 2001 A1
20010023431 Horiguchi Sep 2001 A1
20010034752 Kremien Oct 2001 A1
20010037311 McCoy et al. Nov 2001 A1
20010044667 Nakano Nov 2001 A1
20010044759 Kutsumi Nov 2001 A1
20010046227 Matsuhira et al. Nov 2001 A1
20010051929 Suzuki Dec 2001 A1
20010052016 Skene et al. Dec 2001 A1
20010052108 Bowman-Amuah Dec 2001 A1
20020002578 Yamashita Jan 2002 A1
20020002636 Vange et al. Jan 2002 A1
20020004833 Tonouchi Jan 2002 A1
20020004912 Fung Jan 2002 A1
20020007389 Jones et al. Jan 2002 A1
20020010783 Primak et al. Jan 2002 A1
20020018481 Mor et al. Feb 2002 A1
20020031364 Suzuki et al. Mar 2002 A1
20020032716 Nagato Mar 2002 A1
20020035605 Kenton Mar 2002 A1
20020040391 Chaiken et al. Apr 2002 A1
20020049608 Hartsell et al. Apr 2002 A1
20020052909 Seeds May 2002 A1
20020052961 Yoshimine et al. May 2002 A1
20020059094 Hosea et al. May 2002 A1
20020059274 Hartsell et al. May 2002 A1
20020062377 Hillman et al. May 2002 A1
20020062451 Scheidt et al. May 2002 A1
20020065864 Hartsell et al. May 2002 A1
20020083299 Van Huben et al. Jun 2002 A1
20020083352 Fujimoto et al. Jun 2002 A1
20020087611 Tanaka et al. Jul 2002 A1
20020087699 Karagiannis et al. Jul 2002 A1
20020090075 Gabriel Jul 2002 A1
20020091786 Yamaguchi et al. Jul 2002 A1
20020093915 Larson Jul 2002 A1
20020097732 Worster et al. Jul 2002 A1
20020099842 Jennings et al. Jul 2002 A1
20020103886 Rawson, III Aug 2002 A1
20020107903 Richter et al. Aug 2002 A1
20020107962 Richter et al. Aug 2002 A1
20020116234 Nagasawa Aug 2002 A1
20020116721 Dobes et al. Aug 2002 A1
20020120741 Webb et al. Aug 2002 A1
20020124128 Qiu Sep 2002 A1
20020129160 Habelha Sep 2002 A1
20020133537 Lau et al. Sep 2002 A1
20020133821 Shteyn Sep 2002 A1
20020138459 Mandal Sep 2002 A1
20020138635 Redlich et al. Sep 2002 A1
20020143855 Traversat Oct 2002 A1
20020143944 Traversal et al. Oct 2002 A1
20020147663 Walker et al. Oct 2002 A1
20020147771 Traversal et al. Oct 2002 A1
20020147810 Traversal et al. Oct 2002 A1
20020151271 Tatsuji Oct 2002 A1
20020152299 Traversal et al. Oct 2002 A1
20020152305 Jackson et al. Oct 2002 A1
20020156699 Gray et al. Oct 2002 A1
20020156891 Ulrich et al. Oct 2002 A1
20020156893 Pouyoul et al. Oct 2002 A1
20020156904 Gullotta et al. Oct 2002 A1
20020156984 Padovano Oct 2002 A1
20020159452 Foster et al. Oct 2002 A1
20020161869 Griffin et al. Oct 2002 A1
20020161917 Shapiro et al. Oct 2002 A1
20020166117 Abrams et al. Nov 2002 A1
20020172205 Tagore-Brage et al. Nov 2002 A1
20020173984 Robertson et al. Nov 2002 A1
20020174165 Kawaguchi Nov 2002 A1
20020174227 Hartsell et al. Nov 2002 A1
20020184310 Traversal et al. Dec 2002 A1
20020184311 Traversal et al. Dec 2002 A1
20020184357 Traversal et al. Dec 2002 A1
20020184358 Traversal et al. Dec 2002 A1
20020186656 Vu Dec 2002 A1
20020188657 Traversal et al. Dec 2002 A1
20020194384 Habelha Dec 2002 A1
20020194412 Bottom Dec 2002 A1
20020196611 Ho et al. Dec 2002 A1
20020196734 Tanaka et al. Dec 2002 A1
20020198734 Greene et al. Dec 2002 A1
20020198923 Hayes Dec 2002 A1
20030004772 Dutta et al. Jan 2003 A1
20030005130 Cheng Jan 2003 A1
20030005162 Habelha Jan 2003 A1
20030007493 Oi et al. Jan 2003 A1
20030009506 Bril et al. Jan 2003 A1
20030014503 Legout et al. Jan 2003 A1
20030014524 Tormasov Jan 2003 A1
20030014539 Reznick Jan 2003 A1
20030018766 Duvvuru Jan 2003 A1
20030018803 El Batt et al. Jan 2003 A1
20030028585 Yeager et al. Feb 2003 A1
20030028642 Agarwal et al. Feb 2003 A1
20030028645 Romagnoli Feb 2003 A1
20030028656 Babka Feb 2003 A1
20030033547 Larson et al. Feb 2003 A1
20030036820 Yellepeddy et al. Feb 2003 A1
20030039246 Guo et al. Feb 2003 A1
20030041141 Abdelaziz et al. Feb 2003 A1
20030041266 Ke et al. Feb 2003 A1
20030041308 Ganesan et al. Feb 2003 A1
20030050924 Faybishenko et al. Mar 2003 A1
20030050959 Faybishenko et al. Mar 2003 A1
20030050989 Marinescu et al. Mar 2003 A1
20030051127 Miwa Mar 2003 A1
20030055894 Yeager et al. Mar 2003 A1
20030055898 Yeager et al. Mar 2003 A1
20030058277 Bowman-Amuah Mar 2003 A1
20030061260 Rajkumar Mar 2003 A1
20030061261 Greene Mar 2003 A1
20030061262 Hahn et al. Mar 2003 A1
20030065703 Aborn Apr 2003 A1
20030065784 Herrod Apr 2003 A1
20030069918 Lu et al. Apr 2003 A1
20030069949 Chan et al. Apr 2003 A1
20030072263 Peterson Apr 2003 A1
20030074090 Becka Apr 2003 A1
20030076832 Ni Apr 2003 A1
20030088457 Keil et al. May 2003 A1
20030093255 Freyensee et al. May 2003 A1
20030093624 Arimilli et al. May 2003 A1
20030097429 Wu et al. May 2003 A1
20030097439 Strayer et al. May 2003 A1
20030101084 Perez May 2003 A1
20030103413 Jacobi, Jr. et al. Jun 2003 A1
20030105655 Kimbrel et al. Jun 2003 A1
20030105721 Ginter et al. Jun 2003 A1
20030110262 Hasan et al. Jun 2003 A1
20030112792 Cranor et al. Jun 2003 A1
20030115562 Martin Jun 2003 A1
20030120472 Lind Jun 2003 A1
20030120701 Pulsipher et al. Jun 2003 A1
20030120704 Tran et al. Jun 2003 A1
20030120710 Pulsipher et al. Jun 2003 A1
20030120780 Zhu Jun 2003 A1
20030126013 Shand Jul 2003 A1
20030126200 Wolff Jul 2003 A1
20030126202 Watt Jul 2003 A1
20030126265 Aziz et al. Jul 2003 A1
20030126283 Prakash et al. Jul 2003 A1
20030131043 Berg et al. Jul 2003 A1
20030131209 Lee Jul 2003 A1
20030135509 Davis Jul 2003 A1
20030135615 Wyatt Jul 2003 A1
20030135621 Romagnoli Jul 2003 A1
20030140190 Mahony et al. Jul 2003 A1
20030144894 Robertson et al. Jul 2003 A1
20030149685 Trossman et al. Aug 2003 A1
20030154112 Neiman et al. Aug 2003 A1
20030158884 Alford Aug 2003 A1
20030158940 Leigh Aug 2003 A1
20030159083 Fukuhara et al. Aug 2003 A1
20030169269 Sasaki et al. Sep 2003 A1
20030172191 Williams Sep 2003 A1
20030177050 Crampton Sep 2003 A1
20030177121 Moona et al. Sep 2003 A1
20030177334 King et al. Sep 2003 A1
20030182421 Faybishenko et al. Sep 2003 A1
20030182425 Kurakake Sep 2003 A1
20030182429 Jagels Sep 2003 A1
20030185229 Shachar et al. Oct 2003 A1
20030187907 Ito Oct 2003 A1
20030188083 Kumar et al. Oct 2003 A1
20030191795 Bernardin et al. Oct 2003 A1
20030191857 Terrell et al. Oct 2003 A1
20030193402 Post et al. Oct 2003 A1
20030195931 Dauger Oct 2003 A1
20030200109 Honda et al. Oct 2003 A1
20030200258 Hayashi Oct 2003 A1
20030202520 Witkowski et al. Oct 2003 A1
20030202709 Simard et al. Oct 2003 A1
20030204773 Petersen et al. Oct 2003 A1
20030204786 Dinker Oct 2003 A1
20030210694 Jayaraman et al. Nov 2003 A1
20030212738 Wookey et al. Nov 2003 A1
20030212792 Raymond Nov 2003 A1
20030216951 Ginis et al. Nov 2003 A1
20030217129 Knittel et al. Nov 2003 A1
20030227934 White Dec 2003 A1
20030231624 Alappat et al. Dec 2003 A1
20030231647 Petrovykh Dec 2003 A1
20030233378 Butler et al. Dec 2003 A1
20030233446 Earl Dec 2003 A1
20030236745 Hartsell et al. Dec 2003 A1
20040003077 Bantz et al. Jan 2004 A1
20040003086 Parham et al. Jan 2004 A1
20040009751 Michaelis Jan 2004 A1
20040010544 Slater et al. Jan 2004 A1
20040010550 Gopinath Jan 2004 A1
20040010592 Carver et al. Jan 2004 A1
20040013113 Singh et al. Jan 2004 A1
20040015579 Cooper et al. Jan 2004 A1
20040015973 Skovira Jan 2004 A1
20040017806 Yazdy et al. Jan 2004 A1
20040017808 Forbes et al. Jan 2004 A1
20040030741 Wolton et al. Feb 2004 A1
20040030743 Hugly et al. Feb 2004 A1
20040030794 Hugly et al. Feb 2004 A1
20040030938 Barr et al. Feb 2004 A1
20040034873 Zenoni Feb 2004 A1
20040039815 Evans et al. Feb 2004 A1
20040044718 Ferstl et al. Mar 2004 A1
20040044727 Abdelaziz et al. Mar 2004 A1
20040054630 Ginter et al. Mar 2004 A1
20040054777 Ackaouy et al. Mar 2004 A1
20040054780 Romero Mar 2004 A1
20040054807 Harvey et al. Mar 2004 A1
20040064511 Abdel-Aziz et al. Apr 2004 A1
20040064512 Arora et al. Apr 2004 A1
20040064568 Arora et al. Apr 2004 A1
20040064817 Shibayama et al. Apr 2004 A1
20040066782 Nassar Apr 2004 A1
20040068676 Larson et al. Apr 2004 A1
20040068730 Miller et al. Apr 2004 A1
20040071147 Roadknight et al. Apr 2004 A1
20040073650 Nakamura Apr 2004 A1
20040073854 Windl Apr 2004 A1
20040073908 Benejam et al. Apr 2004 A1
20040081148 Yamada Apr 2004 A1
20040083287 Gao et al. Apr 2004 A1
20040088347 Yeager et al. May 2004 A1
20040088348 Yeager et al. May 2004 A1
20040088369 Yeager et al. May 2004 A1
20040098391 Robertson et al. May 2004 A1
20040098447 Verbeke et al. May 2004 A1
20040103078 Smedberg et al. May 2004 A1
20040103305 Ginter et al. May 2004 A1
20040103339 Chalasani et al. May 2004 A1
20040103413 Mandava et al. May 2004 A1
20040011761 Hensley Jun 2004 A1
20040107123 Haffner Jun 2004 A1
20040107273 Biran et al. Jun 2004 A1
20040107281 Bose et al. Jun 2004 A1
20040109428 Krishnamurthy Jun 2004 A1
20040111307 Demsky et al. Jun 2004 A1
20040111612 Choi et al. Jun 2004 A1
20040117610 Hensley Jun 2004 A1
20040117768 Chang et al. Jun 2004 A1
20040121777 Schwarz et al. Jun 2004 A1
20040122970 Kawaguchi et al. Jun 2004 A1
20040128495 Hensley Jul 2004 A1
20040128670 Robinson et al. Jul 2004 A1
20040133620 Habelha Jul 2004 A1
20040133640 Yeager et al. Jul 2004 A1
20040133665 Deboer et al. Jul 2004 A1
20040133703 Habetha Jul 2004 A1
20040135780 Nims Jul 2004 A1
20040139202 Talwar et al. Jul 2004 A1
20040139464 Ellis et al. Jul 2004 A1
20040141521 George Jul 2004 A1
20040143664 Usa et al. Jul 2004 A1
20040148326 Nadgir Jul 2004 A1
20040148390 Cleary et al. Jul 2004 A1
20040150664 Baudisch Aug 2004 A1
20040151181 Chu Aug 2004 A1
20040153563 Shay et al. Aug 2004 A1
20040158637 Lee Aug 2004 A1
20040162871 Pabla et al. Aug 2004 A1
20040165588 Pandya Aug 2004 A1
20040172464 Nag Sep 2004 A1
20040179528 Powers et al. Sep 2004 A1
20040181370 Froehlich et al. Sep 2004 A1
20040181476 Smith et al. Sep 2004 A1
20040189677 Amann et al. Sep 2004 A1
20040193674 Kurosawa et al. Sep 2004 A1
20040194098 Chung et al. Sep 2004 A1
20040196308 Blomquist Oct 2004 A1
20040199566 Carlson Oct 2004 A1
20040199621 Lau Oct 2004 A1
20040199646 Susai et al. Oct 2004 A1
20040199918 Skovira Oct 2004 A1
20040203670 King et al. Oct 2004 A1
20040204978 Rayrole Oct 2004 A1
20040205101 Radhakrishnan Oct 2004 A1
20040205206 Naik et al. Oct 2004 A1
20040210624 Andrzejak et al. Oct 2004 A1
20040210632 Carlson Oct 2004 A1
20040210693 Zeitler et al. Oct 2004 A1
20040213395 Ishii et al. Oct 2004 A1
20040215780 Kawato Oct 2004 A1
20040215864 Arimilli et al. Oct 2004 A1
20040215991 McAfee et al. Oct 2004 A1
20040216121 Jones et al. Oct 2004 A1
20040218615 Griffin et al. Nov 2004 A1
20040221038 Clarke et al. Nov 2004 A1
20040236852 Birkestrand et al. Nov 2004 A1
20040243378 Schnatterly et al. Dec 2004 A1
20040243466 Trybinski et al. Dec 2004 A1
20040244006 Kaufman et al. Dec 2004 A1
20040260701 Lehikoinen Dec 2004 A1
20040260746 Brown et al. Dec 2004 A1
20040267486 Percer et al. Dec 2004 A1
20040267897 Hill et al. Dec 2004 A1
20040267901 Gomez Dec 2004 A1
20040268035 Ueno Dec 2004 A1
20040268315 Gouriou Dec 2004 A1
20050010465 Drew et al. Jan 2005 A1
20050010608 Horikawa Jan 2005 A1
20050015378 Gammel et al. Jan 2005 A1
20050015621 Ashley et al. Jan 2005 A1
20050018604 Dropps et al. Jan 2005 A1
20050018606 Dropps et al. Jan 2005 A1
20050018663 Dropps et al. Jan 2005 A1
20050021291 Retich Jan 2005 A1
20050021371 Basone et al. Jan 2005 A1
20050021606 Davies et al. Jan 2005 A1
20050021728 Sugimoto Jan 2005 A1
20050021759 Gupta et al. Jan 2005 A1
20050021862 Schroeder et al. Jan 2005 A1
20050022188 Tameshige et al. Jan 2005 A1
20050027863 Talwar et al. Feb 2005 A1
20050027864 Bozak et al. Feb 2005 A1
20050027865 Bozak et al. Feb 2005 A1
20050027870 Trebes et al. Feb 2005 A1
20050030954 Dropps et al. Feb 2005 A1
20050033742 Kamvar et al. Feb 2005 A1
20050033890 Lee Feb 2005 A1
20050034070 Meir et al. Feb 2005 A1
20050038808 Kutch Feb 2005 A1
20050038835 Chidambaran et al. Feb 2005 A1
20050044195 Westfall Feb 2005 A1
20050044205 Sankaranarayan et al. Feb 2005 A1
20050044226 McDermott et al. Feb 2005 A1
20050044228 Birkestrand et al. Feb 2005 A1
20050049884 Hunt et al. Mar 2005 A1
20050050057 Mital et al. Mar 2005 A1
20050050200 Mizoguchi Mar 2005 A1
20050050270 Horn et al. Mar 2005 A1
20050054354 Roman et al. Mar 2005 A1
20050055322 Masters et al. Mar 2005 A1
20050055694 Lee Mar 2005 A1
20050055697 Buco Mar 2005 A1
20050055698 Sasaki et al. Mar 2005 A1
20050060360 Doyle et al. Mar 2005 A1
20050060608 Marchand Mar 2005 A1
20050065826 Baker et al. Mar 2005 A1
20050066302 Kanade Mar 2005 A1
20050066358 Anderson et al. Mar 2005 A1
20050071843 Guo et al. Mar 2005 A1
20050076145 Ben-Zvi et al. Apr 2005 A1
20050077921 Percer et al. Apr 2005 A1
20050080845 Gopinath Apr 2005 A1
20050080891 Cauthron Apr 2005 A1
20050080930 Joseph Apr 2005 A1
20050086300 Yeager et al. Apr 2005 A1
20050091505 Riley et al. Apr 2005 A1
20050097560 Rolia et al. May 2005 A1
20050102396 Hipp May 2005 A1
20050102400 Nakahara May 2005 A1
20050102683 Branson May 2005 A1
20050105538 Perera et al. May 2005 A1
20050108407 Johnson et al. May 2005 A1
20050108703 Hellier May 2005 A1
20050113203 Mueller et al. May 2005 A1
20050114478 Popescu et al. May 2005 A1
20050114551 Basu et al. May 2005 A1
20050114862 Bisdikian et al. May 2005 A1
20050120160 Plouffe et al. Jun 2005 A1
20050125213 Chen et al. Jun 2005 A1
20050125537 Martins et al. Jun 2005 A1
20050125538 Tawil Jun 2005 A1
20050131898 Fatula, Jr. Jun 2005 A1
20050132378 Horvitz et al. Jun 2005 A1
20050132379 Sankaran et al. Jun 2005 A1
20050138618 Gebhart Jun 2005 A1
20050141424 Lim et al. Jun 2005 A1
20050144315 George et al. Jun 2005 A1
20050149940 Calinescu et al. Jul 2005 A1
20050154861 Arimilli et al. Jul 2005 A1
20050155033 Luoffo et al. Jul 2005 A1
20050156732 Matsumura Jul 2005 A1
20050160137 Ishikawa et al. Jul 2005 A1
20050163143 Kalantar et al. Jul 2005 A1
20050165925 Dan et al. Jul 2005 A1
20050169179 Antal Aug 2005 A1
20050172291 Das et al. Aug 2005 A1
20050177600 Eilam et al. Aug 2005 A1
20050187866 Lee Aug 2005 A1
20050188088 Fellenstein et al. Aug 2005 A1
20050188089 Lichtenstein et al. Aug 2005 A1
20050188091 Szabo et al. Aug 2005 A1
20050190236 Ishimoto Sep 2005 A1
20050192771 Fischer et al. Sep 2005 A1
20050193103 Drabik Sep 2005 A1
20050193231 Scheuren Sep 2005 A1
20050195075 McGraw Sep 2005 A1
20050197877 Kaiinoski Sep 2005 A1
20050198200 Subramanian et al. Sep 2005 A1
20050202922 Thomas Sep 2005 A1
20050203761 Barr Sep 2005 A1
20050204040 Ferri et al. Sep 2005 A1
20050209892 Miller Sep 2005 A1
20050210470 Chung et al. Sep 2005 A1
20050213507 Banerjee et al. Sep 2005 A1
20050213560 Duvvury Sep 2005 A1
20050222885 Chen et al. Oct 2005 A1
20050228852 Santos et al. Oct 2005 A1
20050228856 Swildens Oct 2005 A1
20050228892 Riley et al. Oct 2005 A1
20050234846 Davidson et al. Oct 2005 A1
20050235137 Barr et al. Oct 2005 A1
20050235150 Kaler et al. Oct 2005 A1
20050240688 Moerman et al. Oct 2005 A1
20050243867 Petite Nov 2005 A1
20050246705 Etelson et al. Nov 2005 A1
20050249341 Mahone et al. Nov 2005 A1
20050256942 McCardle et al. Nov 2005 A1
20050256946 Childress et al. Nov 2005 A1
20050259397 Bash et al. Nov 2005 A1
20050259683 Bishop et al. Nov 2005 A1
20050262495 Fung et al. Nov 2005 A1
20050262508 Asano et al. Nov 2005 A1
20050267948 Mckinley et al. Dec 2005 A1
20050268063 Diao et al. Dec 2005 A1
20050278392 Hansen et al. Dec 2005 A1
20050278760 Dewar et al. Dec 2005 A1
20050283534 Bigagli et al. Dec 2005 A1
20050283782 Lu et al. Dec 2005 A1
20050283822 Appleby et al. Dec 2005 A1
20050288961 Tabrizi Dec 2005 A1
20050289540 Nguyen et al. Dec 2005 A1
20060002311 Iwanaga et al. Jan 2006 A1
20060008256 Khedouri et al. Jan 2006 A1
20060010445 Petersen et al. Jan 2006 A1
20060013132 Garnett et al. Jan 2006 A1
20060013218 Shore et al. Jan 2006 A1
20060015555 Douglass et al. Jan 2006 A1
20060015637 Chung Jan 2006 A1
20060015773 Singh et al. Jan 2006 A1
20060023245 Sato et al. Feb 2006 A1
20060028991 Tan et al. Feb 2006 A1
20060029053 Roberts et al. Feb 2006 A1
20060031379 Kasriel et al. Feb 2006 A1
20060031547 Tsui et al. Feb 2006 A1
20060031813 Bishop et al. Feb 2006 A1
20060036743 Deng et al. Feb 2006 A1
20060037016 Saha et al. Feb 2006 A1
20060039246 King et al. Feb 2006 A1
20060041444 Flores et al. Feb 2006 A1
20060047920 Moore et al. Mar 2006 A1
20060048157 Dawson et al. Mar 2006 A1
20060053215 Sharma Mar 2006 A1
20060053216 Deokar et al. Mar 2006 A1
20060056291 Baker et al. Mar 2006 A1
20060059253 Goodman et al. Mar 2006 A1
20060063690 Billiauw et al. Mar 2006 A1
20060069671 Conley et al. Mar 2006 A1
20060069774 Chen et al. Mar 2006 A1
20060069926 Ginter et al. Mar 2006 A1
20060074925 Bixby Apr 2006 A1
20060074940 Craft et al. Apr 2006 A1
20060088015 Kakivaya et al. Apr 2006 A1
20060089894 Balk et al. Apr 2006 A1
20060090003 Kakivaya et al. Apr 2006 A1
20060090025 Tufford et al. Apr 2006 A1
20060090136 Miller et al. Apr 2006 A1
20060095917 Black-Ziegelbein et al. May 2006 A1
20060097863 Horowitz et al. May 2006 A1
20060112184 Kuo May 2006 A1
20060112308 Crawford May 2006 A1
20060117208 Davidson Jun 2006 A1
20060117317 Crawford et al. Jun 2006 A1
20060120411 Basu Jun 2006 A1
20060126619 Teisberg et al. Jun 2006 A1
20060126667 Smith et al. Jun 2006 A1
20060129667 Anderson Jun 2006 A1
20060129687 Goldszmidt et al. Jun 2006 A1
20060136235 Keohane et al. Jun 2006 A1
20060136570 Pandya Jun 2006 A1
20060136908 Gebhart et al. Jun 2006 A1
20060136928 Crawford et al. Jun 2006 A1
20060136929 Miller et al. Jun 2006 A1
20060140211 Huang et al. Jun 2006 A1
20060143350 Miloushev et al. Jun 2006 A1
20060149695 Bossman et al. Jul 2006 A1
20060153191 Rajsic et al. Jul 2006 A1
20060155740 Chen et al. Jul 2006 A1
20060155912 Singh et al. Jul 2006 A1
20060156273 Narayan et al. Jul 2006 A1
20060159088 Aghvami et al. Jul 2006 A1
20060161466 Trinon et al. Jul 2006 A1
20060161585 Clarke et al. Jul 2006 A1
20060165040 Rathod Jul 2006 A1
20060168107 Balan et al. Jul 2006 A1
20060168224 Midgley Jul 2006 A1
20060173730 Birkestrand Aug 2006 A1
20060174342 Zaheer et al. Aug 2006 A1
20060179241 Clark et al. Aug 2006 A1
20060189349 Montulli et al. Aug 2006 A1
20060190775 Aggarwal et al. Aug 2006 A1
20060190975 Gonzalez Aug 2006 A1
20060200773 Nocera et al. Sep 2006 A1
20060206621 Toebes Sep 2006 A1
20060208870 Dousson Sep 2006 A1
20060212332 Jackson Sep 2006 A1
20060212333 Jackson Sep 2006 A1
20060212334 Jackson Sep 2006 A1
20060212740 Jackson Sep 2006 A1
20060218301 O'Toole et al. Sep 2006 A1
20060224725 Bali et al. Oct 2006 A1
20060224740 Sievers-Tostes Oct 2006 A1
20060224741 Jackson Oct 2006 A1
20060227810 Childress et al. Oct 2006 A1
20060229920 Favorel et al. Oct 2006 A1
20060230140 Aoyama et al. Oct 2006 A1
20060230149 Jackson Oct 2006 A1
20060236368 Raja et al. Oct 2006 A1
20060236371 Fish Oct 2006 A1
20060248141 Mukherjee Nov 2006 A1
20060248197 Evans et al. Nov 2006 A1
20060248359 Fung Nov 2006 A1
20060250971 Gammenthaler et al. Nov 2006 A1
20060251419 Zadikian et al. Nov 2006 A1
20060253570 Biswas et al. Nov 2006 A1
20060259734 Sheu et al. Nov 2006 A1
20060265508 Angel et al. Nov 2006 A1
20060265609 Fung Nov 2006 A1
20060268742 Chu Nov 2006 A1
20060271552 McChesney et al. Nov 2006 A1
20060271928 Gao et al. Nov 2006 A1
20060277278 Hegde Dec 2006 A1
20060282505 Hasha et al. Dec 2006 A1
20060282547 Hasha et al. Dec 2006 A1
20060294238 Naik et al. Dec 2006 A1
20070003051 Kiss et al. Jan 2007 A1
20070006001 Isobe et al. Jan 2007 A1
20070011224 Mena et al. Jan 2007 A1
20070011302 Groner et al. Jan 2007 A1
20070022425 Jackson Jan 2007 A1
20070028244 Landis et al. Feb 2007 A1
20070033292 Sull et al. Feb 2007 A1
20070033533 Sull et al. Feb 2007 A1
20070041335 Znamova et al. Feb 2007 A1
20070043591 Meretei Feb 2007 A1
20070044010 Sull et al. Feb 2007 A1
20070047195 Merkin et al. Mar 2007 A1
20070050777 Hutchinson et al. Mar 2007 A1
20070061441 Landis et al. Mar 2007 A1
20070067366 Landis Mar 2007 A1
20070067435 Landis et al. Mar 2007 A1
20070076653 Park et al. Apr 2007 A1
20070081315 Mondor et al. Apr 2007 A1
20070083899 Compton et al. Apr 2007 A1
20070088822 Coile et al. Apr 2007 A1
20070094486 Moore et al. Apr 2007 A1
20070094665 Jackson Apr 2007 A1
20070094691 Gazdzinski Apr 2007 A1
20070109968 Hussain et al. May 2007 A1
20070118496 Bornhoevd May 2007 A1
20070124344 Rajakannimariyan et al. May 2007 A1
20070130397 Tsu Jun 2007 A1
20070143824 Shahbazi Jun 2007 A1
20070150426 Asher et al. Jun 2007 A1
20070150444 Chesnais et al. Jun 2007 A1
20070155406 Dowling et al. Jul 2007 A1
20070174390 Silvain et al. Jul 2007 A1
20070180310 Johnson et al. Aug 2007 A1
20070180380 Khavari et al. Aug 2007 A1
20070204036 Mohaban et al. Aug 2007 A1
20070209072 Chen Sep 2007 A1
20070220520 Tajima Sep 2007 A1
20070226313 Li et al. Sep 2007 A1
20070226795 Conti et al. Sep 2007 A1
20070233828 Gilbert et al. Oct 2007 A1
20070240162 Coleman et al. Oct 2007 A1
20070253017 Czyszczewski et al. Nov 2007 A1
20070260716 Gnanasambandam et al. Nov 2007 A1
20070264986 Warrillow et al. Nov 2007 A1
20070266136 Esfahany et al. Nov 2007 A1
20070271375 Hwang Nov 2007 A1
20070280230 Park Dec 2007 A1
20070286009 Norman Dec 2007 A1
20070288585 Sekiguchi et al. Dec 2007 A1
20070297350 Eilam et al. Dec 2007 A1
20070299946 El-Damhougy et al. Dec 2007 A1
20070299947 El-Damhougy et al. Dec 2007 A1
20070299950 Kulkarni et al. Dec 2007 A1
20080013453 Chiang et al. Jan 2008 A1
20080016198 Johnston-Watt et al. Jan 2008 A1
20080034082 McKinney Feb 2008 A1
20080040463 Brown et al. Feb 2008 A1
20080052437 Loffink et al. Feb 2008 A1
20080059782 Kruse et al. Mar 2008 A1
20080075089 Evans et al. Mar 2008 A1
20080082663 Mouli et al. Apr 2008 A1
20080089358 Basso et al. Apr 2008 A1
20080104231 Dey et al. May 2008 A1
20080104264 Duerk et al. May 2008 A1
20080126523 Tantrum May 2008 A1
20080140771 Vass et al. Jun 2008 A1
20080140930 Hotchkiss Jun 2008 A1
20080155070 El-Damhougy et al. Jun 2008 A1
20080155100 Ahmed et al. Jun 2008 A1
20080159745 Segal Jul 2008 A1
20080162691 Zhang et al. Jul 2008 A1
20080168451 Challenger et al. Jul 2008 A1
20080183865 Appleby et al. Jul 2008 A1
20080183882 Flynn et al. Jul 2008 A1
20080184248 Barua et al. Jul 2008 A1
20080186965 Zheng et al. Aug 2008 A1
20080199133 Takizawa et al. Aug 2008 A1
20080212273 Bechtolsheim Sep 2008 A1
20080212276 Bottom et al. Sep 2008 A1
20080215730 Sundaram et al. Sep 2008 A1
20080216082 Eilam et al. Sep 2008 A1
20080217021 Lembcke et al. Sep 2008 A1
20080222434 Shimizu et al. Sep 2008 A1
20080235443 Chow et al. Sep 2008 A1
20080235702 Eilam et al. Sep 2008 A1
20080239649 Bradicich Oct 2008 A1
20080243634 Dworkin et al. Oct 2008 A1
20080250181 Li et al. Oct 2008 A1
20080255953 Chang et al. Oct 2008 A1
20080259555 Bechtolsheim et al. Oct 2008 A1
20080259788 Wang et al. Oct 2008 A1
20080263131 Hinni et al. Oct 2008 A1
20080263558 Lin et al. Oct 2008 A1
20080266793 Lee Oct 2008 A1
20080270599 Tamir et al. Oct 2008 A1
20080270731 Bryant et al. Oct 2008 A1
20080279167 Cardei et al. Nov 2008 A1
20080288646 Hasha et al. Nov 2008 A1
20080288659 Hasha et al. Nov 2008 A1
20080288660 Balasubramanian et al. Nov 2008 A1
20080288664 Pettey et al. Nov 2008 A1
20080288683 Ramey Nov 2008 A1
20080288873 McCardle et al. Nov 2008 A1
20080289029 Kim et al. Nov 2008 A1
20080301226 Cleary et al. Dec 2008 A1
20080301379 Pong Dec 2008 A1
20080301794 Lee Dec 2008 A1
20080310848 Yasuda et al. Dec 2008 A1
20080313369 Verdoorn et al. Dec 2008 A1
20080313482 Karlapalem et al. Dec 2008 A1
20080320121 Altaf et al. Dec 2008 A1
20080320161 Maruccia et al. Dec 2008 A1
20090010153 Filsfils et al. Jan 2009 A1
20090021907 Mann et al. Jan 2009 A1
20090043809 Fakhouri et al. Feb 2009 A1
20090043888 Jackson Feb 2009 A1
20090044036 Merkin Feb 2009 A1
20090049443 Powers et al. Feb 2009 A1
20090055542 Zhoa et al. Feb 2009 A1
20090055691 Ouksel et al. Feb 2009 A1
20090063443 Arimilli et al. Mar 2009 A1
20090063690 Verthein et al. Mar 2009 A1
20090064287 Bagepalli et al. Mar 2009 A1
20090070771 Yuyitung et al. Mar 2009 A1
20090080428 Witkowski et al. Mar 2009 A1
20090083390 Abu-Ghazaleh et al. Mar 2009 A1
20090089410 Vicente et al. Apr 2009 A1
20090094380 Qiu et al. Apr 2009 A1
20090097200 Sharma et al. Apr 2009 A1
20090100133 Giulio et al. Apr 2009 A1
20090103501 Farrag et al. Apr 2009 A1
20090105059 Dorry et al. Apr 2009 A1
20090113056 Tameshige et al. Apr 2009 A1
20090113130 He et al. Apr 2009 A1
20090133129 Jeong et al. May 2009 A1
20090135751 Hodges et al. May 2009 A1
20090135835 Gallatin et al. May 2009 A1
20090138594 Fellenstein et al. May 2009 A1
20090158070 Gruendler Jun 2009 A1
20090172423 Song et al. Jul 2009 A1
20090178132 Hudis et al. Jul 2009 A1
20090182836 Aviles Jul 2009 A1
20090187425 Thompson et al. Jul 2009 A1
20090198958 Arimilli et al. Aug 2009 A1
20090204834 Hendin et al. Aug 2009 A1
20090204837 Raval et al. Aug 2009 A1
20090210356 Abrams et al. Aug 2009 A1
20090210495 Wolfson et al. Aug 2009 A1
20090216881 Lovy et al. Aug 2009 A1
20090216910 Duchesneau Aug 2009 A1
20090216920 Lauterbach et al. Aug 2009 A1
20090217329 Riedl et al. Aug 2009 A1
20090219827 Chen et al. Sep 2009 A1
20090222884 Shaji et al. Sep 2009 A1
20090225360 Shirai Sep 2009 A1
20090225751 Koenck et al. Sep 2009 A1
20090234917 Despotovic et al. Sep 2009 A1
20090234962 Strong et al. Sep 2009 A1
20090234974 Arndt et al. Sep 2009 A1
20090235104 Fung Sep 2009 A1
20090238349 Pezzutti Sep 2009 A1
20090240547 Fellenstein et al. Sep 2009 A1
20090248943 Jiang et al. Oct 2009 A1
20090251867 Sharma Oct 2009 A1
20090259606 Seah et al. Oct 2009 A1
20090259863 Williams et al. Oct 2009 A1
20090259864 Li et al. Oct 2009 A1
20090265045 Coxe, III Oct 2009 A1
20090271656 Yokota et al. Oct 2009 A1
20090276666 Haley et al. Nov 2009 A1
20090279518 Falk et al. Nov 2009 A1
20090282274 Langgood et al. Nov 2009 A1
20090282419 Mejdrich et al. Nov 2009 A1
20090285136 Sun et al. Nov 2009 A1
20090287835 Jacobson et al. Nov 2009 A1
20090292824 Marashi et al. Nov 2009 A1
20090300608 Ferris et al. Dec 2009 A1
20090313390 Ahuja et al. Dec 2009 A1
20090316687 Kruppa et al. Dec 2009 A1
20090319684 Kakivaya et al. Dec 2009 A1
20090327079 Parker et al. Dec 2009 A1
20090327489 Swildens et al. Dec 2009 A1
20100005331 Somasundaram et al. Jan 2010 A1
20100008038 Coglitore Jan 2010 A1
20100008365 Porat Jan 2010 A1
20100026408 Shau Feb 2010 A1
20100036945 Allibhoy et al. Feb 2010 A1
20100040053 Gottumukkula et al. Feb 2010 A1
20100049822 Davies et al. Feb 2010 A1
20100049931 Jacobson et al. Feb 2010 A1
20100051391 Jahkonen Mar 2010 A1
20100070675 Yamazaki Mar 2010 A1
20100088205 Robertson Apr 2010 A1
20100091676 Moran et al. Apr 2010 A1
20100103837 Jungck et al. Apr 2010 A1
20100106987 Lambert et al. Apr 2010 A1
20100114531 Korn et al. May 2010 A1
20100118880 Kunz et al. May 2010 A1
20100121932 Joshi et al. May 2010 A1
20100121947 Pirzada et al. May 2010 A1
20100122251 Karc May 2010 A1
20100125742 Ohtani May 2010 A1
20100125915 Hall et al. May 2010 A1
20100131324 Ferris et al. May 2010 A1
20100131624 Ferris May 2010 A1
20100138481 Behrens Jun 2010 A1
20100153546 Clubb et al. Jun 2010 A1
20100158005 Mukhopadhyay et al. Jun 2010 A1
20100161909 Nation et al. Jun 2010 A1
20100165983 Aybay et al. Jul 2010 A1
20100169477 Stienhans et al. Jul 2010 A1
20100169479 Jeong et al. Jul 2010 A1
20100169888 Hare et al. Jul 2010 A1
20100174604 Mattingly et al. Jul 2010 A1
20100174813 Hildreth et al. Jul 2010 A1
20100198972 Umbehocker Aug 2010 A1
20100198985 Kanevsky Aug 2010 A1
20100217801 Leighton et al. Aug 2010 A1
20100218194 Dallman et al. Aug 2010 A1
20100220732 Hussain et al. Sep 2010 A1
20100223332 Maxemchuk et al. Sep 2010 A1
20100228848 Kis et al. Sep 2010 A1
20100235234 Shuster Sep 2010 A1
20100250914 Abdul et al. Sep 2010 A1
20100265650 Chen et al. Oct 2010 A1
20100281166 Buyya et al. Nov 2010 A1
20100281246 Bristow et al. Nov 2010 A1
20100299548 Chadirchi et al. Nov 2010 A1
20100302129 Kastrup et al. Dec 2010 A1
20100308897 Evoy et al. Dec 2010 A1
20100312910 Lin et al. Dec 2010 A1
20100312969 Yamazaki et al. Dec 2010 A1
20100318665 Demmer et al. Dec 2010 A1
20100318812 Auradkar et al. Dec 2010 A1
20100325371 Jagadish et al. Dec 2010 A1
20100332262 Horvitz et al. Dec 2010 A1
20110023104 Franklin Jan 2011 A1
20110026397 Saltsidis et al. Feb 2011 A1
20110029644 Gelvin et al. Feb 2011 A1
20110029652 Chhuor et al. Feb 2011 A1
20110035491 Gelvin et al. Feb 2011 A1
20110055627 Zawacki et al. Mar 2011 A1
20110058573 Balakavi et al. Mar 2011 A1
20110075369 Sun et al. Mar 2011 A1
20110082928 Hasha et al. Apr 2011 A1
20110090633 Rabinovitz Apr 2011 A1
20110103391 Davis May 2011 A1
20110113115 Chang et al. May 2011 A1
20110119344 Eustis May 2011 A1
20110123014 Smith May 2011 A1
20110138046 Bonnier et al. Jun 2011 A1
20110145393 Ben-Zvi et al. Jun 2011 A1
20110153953 Khemani et al. Jun 2011 A1
20110154318 Oshins et al. Jun 2011 A1
20110167110 Hoffberg et al. Jul 2011 A1
20110173295 Bakke et al. Jul 2011 A1
20110173612 El Zur et al. Jul 2011 A1
20110179134 Mayo et al. Jul 2011 A1
20110185370 Tamir et al. Jul 2011 A1
20110191514 Wu et al. Aug 2011 A1
20110191610 Agarwal et al. Aug 2011 A1
20110197012 Liao et al. Aug 2011 A1
20110210975 Wong et al. Sep 2011 A1
20110213869 Korsunsky et al. Sep 2011 A1
20110231510 Korsunsky et al. Sep 2011 A1
20110231564 Korsunsky et al. Sep 2011 A1
20110238841 Kakivaya et al. Sep 2011 A1
20110238855 Korsunsky et al. Sep 2011 A1
20110239014 Karnowski Sep 2011 A1
20110271159 Ahn et al. Nov 2011 A1
20110273840 Chen Nov 2011 A1
20110274108 Fan Nov 2011 A1
20110295991 Aida Dec 2011 A1
20110296141 Daffron Dec 2011 A1
20110307887 Huang et al. Dec 2011 A1
20110314465 Smith et al. Dec 2011 A1
20110320540 Oostlander et al. Dec 2011 A1
20110320690 Petersen et al. Dec 2011 A1
20120011500 Faraboschi et al. Jan 2012 A1
20120020207 Corti et al. Jan 2012 A1
20120036237 Hasha et al. Feb 2012 A1
20120050981 Xu et al. Mar 2012 A1
20120054469 Ikeya et al. Mar 2012 A1
20120054511 Brinks et al. Mar 2012 A1
20120072997 Carlson et al. Mar 2012 A1
20120081850 Regimbal et al. Apr 2012 A1
20120096211 Davis et al. Apr 2012 A1
20120099265 Reber Apr 2012 A1
20120110055 Van Biljon et al. May 2012 A1
20120110180 Van Biljon et al. May 2012 A1
20120110188 Van Biljon et al. May 2012 A1
20120110651 Van Biljon et al. May 2012 A1
20120117229 Van Biljon et al. May 2012 A1
20120131201 Matthews et al. May 2012 A1
20120137004 Smith May 2012 A1
20120151476 Vincent Jun 2012 A1
20120155168 Kim et al. Jun 2012 A1
20120159116 Lim et al. Jun 2012 A1
20120167083 Suit Jun 2012 A1
20120167084 Suit Jun 2012 A1
20120167094 Suit Jun 2012 A1
20120185334 Sarkar et al. Jul 2012 A1
20120191860 Traversal et al. Jul 2012 A1
20120198252 Kirschtein et al. Aug 2012 A1
20120207165 Davis Aug 2012 A1
20120218901 Jungck et al. Aug 2012 A1
20120226788 Jackson Sep 2012 A1
20120239479 Amaro et al. Sep 2012 A1
20120278378 Lehane et al. Nov 2012 A1
20120278430 Lehane et al. Nov 2012 A1
20120278464 Lehane et al. Nov 2012 A1
20120296974 Tabe et al. Nov 2012 A1
20120297042 Davis et al. Nov 2012 A1
20120324005 Nalawade Dec 2012 A1
20130010639 Armstrong et al. Jan 2013 A1
20130024645 Cheriton et al. Jan 2013 A1
20130031331 Cheriton et al. Jan 2013 A1
20130036236 Morales et al. Feb 2013 A1
20130058250 Casado et al. Mar 2013 A1
20130060839 Van Biljon et al. Mar 2013 A1
20130066940 Shao Mar 2013 A1
20130073602 Meadway et al. Mar 2013 A1
20130073724 Parashar et al. Mar 2013 A1
20130094499 Davis et al. Apr 2013 A1
20130097351 Davis Apr 2013 A1
20130097448 Davis et al. Apr 2013 A1
20130107444 Schnell May 2013 A1
20130111107 Chang et al. May 2013 A1
20130124417 Spears et al. May 2013 A1
20130145375 Kang Jun 2013 A1
20130148667 Hama et al. Jun 2013 A1
20130163605 Chandra et al. Jun 2013 A1
20130247064 Jackson Sep 2013 A1
20130268653 Deng et al. Oct 2013 A1
20130275703 Schenfeld et al. Oct 2013 A1
20130286840 Fan Oct 2013 A1
20130290643 Lim Oct 2013 A1
20130290650 Chang et al. Oct 2013 A1
20130298134 Jackson Nov 2013 A1
20130305093 Jayachandran et al. Nov 2013 A1
20130318269 Dalal et al. Nov 2013 A1
20140052866 Jackson Feb 2014 A1
20140082614 Klein et al. Mar 2014 A1
20140104778 Schnell Apr 2014 A1
20140122833 Davis et al. May 2014 A1
20140135105 Quan et al. May 2014 A1
20140143773 Ciano et al. May 2014 A1
20140317292 Odom Oct 2014 A1
20140359044 Davis et al. Dec 2014 A1
20140359323 Fullerton et al. Dec 2014 A1
20140365596 Kanevsky Dec 2014 A1
20150012679 Davis et al. Jan 2015 A1
20150039840 Chandra et al. Feb 2015 A1
20150103826 Davis Apr 2015 A1
20150229586 Jackson Aug 2015 A1
20150293789 Jackson Oct 2015 A1
20150301880 Allu Oct 2015 A1
20150381521 Jackson Dec 2015 A1
20160161909 Wada Jun 2016 A1
20170115712 Davis Apr 2017 A1
20180018149 Cook Jan 2018 A1
20180054364 Jackson Feb 2018 A1
20190260689 Jackson Aug 2019 A1
20190286610 Dalton Sep 2019 A1
20200073722 Jackson Mar 2020 A1
20200159449 Davis et al. May 2020 A1
20200379819 Jackson Dec 2020 A1
Foreign Referenced Citations (52)
Number Date Country
2496783 Mar 2004 CA
112008001875 Aug 2013 DE
60216001 Jul 2017 DE
0268435 May 1988 EP
0605106 Jul 1994 EP
0 859 314 Aug 1998 EP
1331564 Jul 2003 EP
1365545 Nov 2003 EP
1492309 Dec 2004 EP
1865684 Dec 2007 EP
2391744 Feb 2004 GB
2392265 Feb 2004 GB
8-212084 Aug 1996 JP
2002-207712 Jul 2002 JP
2005-165568 Jun 2005 JP
2005-223753 Aug 2005 JP
2005-536960 Dec 2005 JP
2006-309439 Nov 2006 JP
20040107934 Dec 2004 KR
M377621 Apr 2010 TW
201017430 May 2010 TW
WO1998011702 Mar 1998 WO
WO1998058518 Dec 1998 WO
WO 1999015999 Apr 1999 WO
WO1999057660 Nov 1999 WO
WO2000014938 Mar 2000 WO
WO2000025485 May 2000 WO
WO2000060825 Oct 2000 WO
WO2001009791 Feb 2001 WO
WO2001014987 Mar 2001 WO
WO2001015397 Mar 2001 WO
WO2001039470 May 2001 WO
WO2001044271 Jun 2001 WO
WO2003046751 Jun 2003 WO
WO2003060798 Sep 2003 WO
WO2004021109 Mar 2004 WO
WO-2004021641 Mar 2004 WO
WO2004046919 Jun 2004 WO
WO2004070547 Aug 2004 WO
WO2004092884 Oct 2004 WO
WO-2005013143 Feb 2005 WO
WO2005017763 Feb 2005 WO
WO2005017783 Feb 2005 WO
WO2005089245 Sep 2005 WO
WO2005091136 Sep 2005 WO
WO2006036277 Apr 2006 WO
WO2006107531 Oct 2006 WO
WO2006108187 Oct 2006 WO
WO2006112981 Oct 2006 WO
WO-2008000193 Jan 2008 WO
WO-2011044271 Apr 2011 WO
WO-2012037494 Mar 2012 WO
Non-Patent Literature Citations (520)
Entry
US 7,774,482 B1, 08/2010, Szeto et al. (withdrawn)
Caesar et al., “Design and Implementation of a Routing Control Platform,” UseniX, NSDI '05 Paper, Technical Program, obtained from the Internet, on Apr. 13, 2021, at URL <https://www.usenix.org/legacy/event/nsdi05/tech/full_papers/caesar/caesar_html/>, 23 pages.
Advanced Switching Technology Tech Brief, published 2005, 2 pages.
Chapter 1 Overview of the Origin Family Architecture from Origin and OnyX2 Theor of Operations Manual, published 1997, 18 pages.
Cisco MDS 9000 Family Multiprotocol Services Module, published 2006, 13 pages.
Comparing the I2C BUS to the SMBUS, Maxim Integrated, Dec. 1, 2000, p. 1.
Das et al., “Unifying Packet and Circuit Switched Networks,” IEEE Globecom Workshops 2009, Nov. 30, 2009, pp. 1-6.
Deering, “IP Multicast Extensions for 4.3BSD UNIX and related Systems,” Jun. 1999, 5 pages.
Elghany et al., “High Throughput High Performance NoC Switch,” NORCHIP 2008, Nov. 2008, pp. 237-240.
Extended European Search Report for EP 10827330.1, dated Jun. 5, 2013.
Final Office Action on U.S. Appl. No. 12/794,996, dated Jun. 19, 2013.
Final Office Action on U.S. Appl. No. 12/889,721 dated Aug. 2, 2016.
Final Office Action on U.S. Appl. No. 12/889,721, dated Apr. 17, 2014.
Final Office Action on U.S. Appl. No. 12/889,721, dated May 22, 2015.
Final Office Action on U.S. Appl. No. 13/234,054 dated May 31, 2017.
Final Office Action on U.S. Appl. No. 13/234,054, dated Apr. 16, 2015.
Final Office Action on U.S. Appl. No. 13/234,054, dated Jan. 26, 2016.
Final Office Action on U.S. Appl. No. 13/475,713, dated Oct. 17, 2014.
Final Office Action on U.S. Appl. No. 13/475,722, dated Oct. 20, 2014.
Final Office Action on U.S. Appl. No. 13/527,498, dated Nov. 17, 2014.
Final Office Action on U.S. Appl. No. 13/527,505, dated Dec. 5, 2014.
Final Office Action on U.S. Appl. No. 13/624,725 dated Mar. 10, 2016.
Final Office Action on U.S. Appl. No. 13/624,725, dated Nov. 4, 2015.
Final Office Action on U.S. Appl. No. 13/624,725, dated Nov. 13, 2013.
Final Office Action on U.S. Appl. No. 13/624,731, dated Jul. 25, 2014.
Final Office Action on U.S. Appl. No. 13/624,731, dated Nov. 12, 2013.
Final Office Action on U.S. Appl. No. 13/662,759, dated Feb. 22, 2016.
Final Office Action on U.S. Appl. No. 13/692,741, dated Mar. 11, 2015.
Final Office Action on U.S. Appl. No. 13/705,340, dated Aug. 2, 2013.
Final Office Action on U.S. Appl. No. 13/705,414, dated Aug. 9, 2013.
Final Office Action on U.S. Appl. No. 13/728,428 dated May 6, 2016.
Final Office Action on U.S. Appl. No. 14/052,723, dated Dec. 3, 2015.
Final Office Action on U.S. Appl. No. 14/106,697 dated Feb. 2, 2016.
Final Office Action on U.S. Appl. No. 14/106,698, dated Aug. 19, 2015.
Final Office Action on U.S. Appl. No. 14/334,178, dated Nov. 4, 2015.
Final Office Action on U.S. Appl. No. 14/334,931, dated Jul. 9, 2015.
Final Office Action on U.S. Appl. No. 14/809,723 dated Aug. 25, 2017.
Final Office Action on U.S. Appl. No. 15/281,462 dated Jun. 13, 2017.
Final Office Action on U.S. Appl. No. 15/281,462 dated Apr. 6, 2018.
Final Office Action on U.S. Appl. No. 15/357,332 dated May 9, 2018.
fpga4fun.com, “What is JTAG?”, 2 pages, Jan. 31, 2010.
From AT to BTX: Motherboard Form Factor, Webopedia, Apr. 29, 2005, p. 1.
Grecu et al., “A Scalable Communication-Centric SoC Interconnect Architecture” Proceedings 5th International Symposium on Quality Electronic Design, 2005, pp. 343, 348 (full article included).
Hossain et al., “Extended Butterfly Fat Tree Interconnection (EFTI) Architecture for Network on CHIP,” 2005 IEEE Pacific Rim Conference on Communicatinos, Computers and Signal Processing, Aug. 2005, pp. 613-616.
HP ProLiant SL6500 Scalable System, Family data sheet, HP Technical sheet, Sep. 2010 4 pages.
HP Virtual Connect Traffic Flow—Technology brief, Jan. 2012, 22 pages.
International Preliminary Reporton Patentability for PCT/US2009/044200, dated Nov. 17, 2010.
International Preliminary Report on Patentability for PCT/US2012/038986 dated Nov. 26, 2013.
International Preliminary Reporton Patentability for PCT/US2012/061747, dated Apr. 29, 2014.
International Preliminary Report on Patentability issued on PCT/US12/62608, dated May 6, 2014.
International Search Report and Written Opinion for PCT/US12/38987, dated Aug. 16, 2012.
International Search Report and Written Opinion for PCT/US12/61747, dated Mar. 1, 2013.
International Search Report and Written Opinion for PCT/US12/62608, dated Jan. 18, 2013.
International Search Report and Written Opinion for PCT/US2010/053227, dated May 10, 2012.
International Search Report and Written Opinion for PCT/US2010/053227, dated Dec. 16, 2010.
International Search Report and Written Opinion for PCT/US2011/051996, dated Jan. 19, 2012.
International Search Report and Written Opinion on PCT/US09/44200, dated Jul. 1, 2009.
International Search Report and Written Opinion on PCT/US2012/038986, dated Mar. 14, 2013.
Jansen et al., “SATA-IO to Develop Specification for Mini Interface Connector” Press Release Sep. 21, 2009, Serial ATA3 pages.
Nawathe et al., “Implementation of an 8-Core, 64-Thread, Power Efficient SPARC Server on a Chip”, IEEE Journal of Solid-State Circuits, vol. 43, No. 1, Jan. 2008, pp. 6-20.
Non-Final Action on U.S. Appl. No. 13/728,362, dated Feb. 21, 2014.
Non-Final Office Action on U.S. Appl. No. 12/794,996, dated Sep. 17, 2012.
Non-Final Office Action on U.S. Appl. No. 12/889,721, dated Feb. 24, 2016.
Non-Final Office Action on U.S. Appl. No. 12/889,721, dated Jul. 2, 2013.
Non-Final Office Action on U.S. Appl. No. 12/889,721, dated Oct. 11, 2012.
Non-Final Office Action on U.S. Appl. No. 12/889,721, dated Sep. 29, 2014.
Non-Final Office Action on U.S. Appl. No. 13/234,054 dated Oct. 20, 2016.
Non-Final Office Action on U.S. Appl. No. 13/234,054, dated Aug. 6, 2015.
Non-Final Office Action on U.S. Appl. No. 13/234,054, dated Oct. 23, 2014.
Non-Final Office Action on U.S. Appl. No. 13/284,855, dated Dec. 19, 2013.
Non-Final Office Action on U.S. Appl. No. 13/453,086, dated Mar. 12, 2013.
Non-Final Office Action on U.S. Appl. No. 13/475,713, dated Apr. 1, 2014.
Non-Final Office Action on U.S. Appl. No. 13/475,722, dated Jan. 17, 2014.
Non-Final Office Action on U.S. Appl. No. 13/527,498, dated May 8, 2014.
Non-Final Office Action on U.S. Appl. No. 13/527,505, dated May 8, 2014.
Non-Final Office Action on U.S. Appl. No. 13/624,725, dated Apr. 23, 2015.
Non-Final Office Action on U.S. Appl. No. 13/624,725, dated Jan. 10, 2013.
Non-final office action on U.S. Appl. No. 13/624,731 dated Jan. 29, 2013.
Non-Final Office Action on U.S. Appl. No. 13/662,759, dated Nov. 6, 2014.
Non-Final Office Action on U.S. Appl. No. 13/692,741, dated Jul. 1, 2015.
Non-Final Office Action on U.S. Appl. No. 13/692,741, dated Sep. 4, 2014.
Non-Final Office Action on U.S. Appl. No. 13/705,286, dated May 13, 2013.
Non-Final Office Action on U.S. Appl. No. 13/705,340, dated Mar. 12, 2014.
Non-Final Office Action on U.S. Appl. No. 13/705,340, dated Mar. 29, 2013.
Non-Final Office Action on U.S. Appl. No. 13/705,414, dated Apr. 9, 2013.
Non-Final Office Action on U.S. Appl. No. 13/705,428, dated Jul. 10, 2013.
Non-Final Office Action on U.S. Appl. No. 13/728,308, dated May 14, 2015.
Non-Final Office Action on U.S. Appl. No. 13/728,428, dated Jun. 12, 2015.
Non-Final Office Action on U.S. Appl. No. 14/052,723, dated May 1, 2015.
Non-Final Office Action on U.S. Appl. No. 14/106,697, dated Aug. 17, 2015.
Non-Final Office Action on U.S. Appl. No. 14/106,698, dated Feb. 12, 2015.
Non-Final Office Action on U.S. Appl. No. 14/334,178 dated Dec. 18, 2015.
Non-Final Office Action on U.S. Appl. No. 14/334,931 dated Dec. 11, 2015.
Non-Final Office Action on U.S. Appl. No. 14/334,931, dated Jan. 5, 2015.
Non-Final Office Action on U.S. Appl. No. 14/725,543 dated Apr. 7, 2016.
Non-Final Office Action on U.S. Appl. No. 14/753,948 dated Nov. 4, 2016.
Non-Final Office Action on U.S. Appl. No. 14/809,723 dated Dec. 30, 2016.
Non-Final Office Action on U.S. Appl. No. 15/042,489 dated Jan. 9, 2018.
Non-Final Office Action on U.S. Appl. No. 15/078,115 dated Sep. 5, 2017.
Non-Final Office Action on U.S. Appl. No. 15/254,111 dated Jun. 20, 2017.
Non-Final Office Action on U.S. Appl. No. 15/270,418 dated Apr. 21, 2017.
Non-Final Office Action on U.S. Appl. No. 15/281,462 dated Dec. 15, 2017.
Non-Final Office Action on U.S. Appl. No. 15/281,462 dated Feb. 10, 2017.
Non-Final Office Action on U.S. Appl. No. 15/357,332 dated Nov. 9, 2017.
Notice of Allowance issued on U.S. Appl. No. 14/052,723, dated Feb. 8, 2017.
Notice of Allowance on U.S. Appl. No. 13/234,054, dated Sep. 19, 2017.
Notice of Allowance on U.S. Appl. No. 13/284,855, dated Jul. 14, 2014.
Notice of Allowance on U.S. Appl. No. 13/453,086, dated Jul. 18, 2013.
Notice of Allowance on U.S. Appl. No. 13/475,713, dated Feb. 5, 2015.
Notice of Allowance on U.S. Appl. No. 13/475,722, dated Feb. 27, 2015.
Notice of Allowance on U.S. Appl. No. 13/527,498, dated Feb. 23, 2015.
Notice of Allowance on U.S. Appl. No. 13/527,505, dated Mar. 6, 2015.
Notice of Allowance on U.S. Appl. No. 13/624,725, dated Mar. 30, 2016.
Notice of Allowance on U.S. Appl. No. 13/624,731, dated Mar. 5, 2015.
Notice of Allowance on U.S. Appl. No. 13/662,759 dated May 10, 2016.
Notice of Allowance on U.S. Appl. No. 13/692,741 dated Dec. 4, 2015.
Notice of Allowance on U.S. Appl. No. 13/705,340, dated Dec. 3, 2014.
Notice of Allowance on U.S. Appl. No. 13/705,340, dated Mar. 16, 2015.
Notice of Allowance on U.S. Appl. No. 13/705,386, dated Jan. 24, 2014.
Notice of Allowance on U.S. Appl. No. 13/705,414, dated Nov. 4, 2013.
Notice of Allowance on U.S. Appl. No. 13/728,308 dated Oct. 7, 2015.
Notice of Allowance on U.S. Appl. No. 13/728,428 dated Jul. 18, 2016.
Notice of Allowance on U.S. Appl. No. 14/052,723 dated Feb. 8, 2017.
Notice of Allowance on U.S. Appl. No. 14/106,697 dated Oct. 24, 2016.
Notice of Allowance on U.S. Appl. No. 14/334,178 dated Jun. 8, 2016.
Notice of Allowance on U.S. Appl. No. 14/334,178 dated Aug. 19, 2016.
Notice of Allowance on U.S. Appl. No. 14/334,931 dated May 20, 2016.
Notice of Allowance on U.S. Appl. No. 14/725,543 dated Jul. 21, 2016.
Notice of Allowance on U.S. Appl. No. 14/753,948 dated Jun. 14, 2017.
Notice of Allowance on U.S. Appl. No. 14/809,723 dated Jan. 11, 2018.
Notice of Allowance on U.S. Appl. No. 15/042,489 dated Jul. 16, 2018.
Notice of Allowance on U.S. Appl. No. 15/078,115 dated Jan. 8, 2018.
Notice of Allowance on U.S. Appl. No. 15/254,111 dated Sep. 1, 2017.
Notice of Allowance on U.S. Appl. No. 15/254,111 dated Nov. 13, 2017.
Notice of Allowance on U.S. Appl. No. 15/270,418 dated Nov. 2, 2017.
Notice of Allowance on U.S. Appl. No. 15/357,332 dated Jul. 12, 2018.
Notice of Allowance on U.S. Appl. No. 15/360,668, dated May 5, 2017.
Notice of Allowance on U.S. Appl. No. 15/430,959 dated Mar. 15, 2018.
Notice of Allowance on U.S. Appl. No. 15/672,418 dated Apr. 4, 2018.
Notice of Allowance U.S. Appl. No. 13/728,308, dated Oct. 7, 2015.
Office Action on Taiwan Application 100133390, dated Aug. 25, 2015 (English translation not available).
Office Action on Taiwan Application 101139729, dated May 25, 2015 (English translation not available).
Pande et al., “Design of a Switch for Network on Chip Applications,” May 25-28, 2003 Proceedings of the 2003 International Symposium on Circuits and Systems, vol. 5, pp. V217-V220.
Reexamination Report on Japanese Application 2012-536877, dated Jan. 22, 2015 (English Translation not available).
Search Report on EP Application 10827330.1, dated Feb. 12, 2015.
Venaas, “IPv4 Multicast Address Space Registry,” 2013, http://www.iana.org/assignments/multicast-addresses/multicast-addresses.x-html.
Bader et al.; “Applications”; The International Journal of High Performance Computing Applications, vol. 15, No. ; pp. 181-185; Summer 2001.
Coomer et al.; “Introduction to the Cluster Grid—Part 1”; Sun Microsystems White Paper; 19 pages; Aug. 2002.
Joseph et al.; “Evolution of grid computing architecture and grid adoption models”; IBM Systems Journal, vol. 43, No. 4; 22 pages; 2004.
Smith et al.; “Grid computing”; MIT Sloan Management Review, vol. 46, Iss. 1.; 5 pages; Fall 2004.
“Microsoft Computer Dictionary, 5th Ed.”; Microsoft Press; 3 pages; 2002.
“Random House Concise Dictionary of Science & Computers”; 3 pages; Helicon Publishing; 2004.
U.S. Appl. No. 11/279,007, filed Apr. 2006, Jackson.
U.S. Appl. No. 13/705,340, filed Apr. 2012, Davis et al.
U.S. Appl. No. 13/899,751, filed May 2013, Chandra.
U.S. Appl. No. 13/935,108, filed Jul. 2013, Davis.
U.S. Appl. No. 13/959,428, filed Aug. 2013, Chandra.
U.S. Appl. No. 60/662,240, filed Mar. 2005, Jackson.
U.S. Appl. No. 60/552,653, filed Apr. 2005, Jackson.
A Language Modeling Framework for Resource Selection and Results Merging Si et al. CIKM 2002, Proceedings of the eleventh international conference on Iformation and Knowledge Management.
Alhusaini et al. “A framework for mapping with resource co-allocation in heterogeneous computing systems,” Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No. PR00556), Cancun, Mexico, 2000, pp. 273-286. (Year: 2000).
Ali et al., “Task Execution Time Modeling for Heterogeneous Computing System”, IEEE, 2000, pp. 1-15.
Amiri et al., “Dynamic Function Placement for Data-Intensive Cluster Computing,” Jun. 2000.
Banicescu et al., “Competitive Resource management in Distributed Computing Environments with Hectiling”, 1999, High Performance Computing Symposium, p. 1-7 (Year: 1999).
Banicescu et al., “Efficient Resource Management for Scientific Applications in Distributed Computing Environment” 1998, Mississippi State Univ. Dept. of Comp. Science, p. 45-54. (Year: 1998).
Buyya et al., “An Evaluation of Economy-based Resource Trading and Scheduling on Computational Power Grids for Parameter Sweep Applications,” Active Middleware Services, 2000, 10 pages.
Chase et al., “Dynamic Virtual Clusters in a Grid Site Manager”, Proceedings of the 12.sup.th IEEE International Symposium on High Performance Distributed Computing (HPDC'03), 2003.
Chen et al., “A flexible service model for advance reservation”, Computer Networks, Elsevier science publishers, vol. 37, No. 3-4, pp. 251-262. Nov. 5, 2001.
Exhibit 1002, Declaration of Dr. Andrew Wolfe, Ph.D., document filed on behalf of Unified Patents, LLC, in Case No. IPR2022-00136, 110 pages, Declaration dated Nov. 29, 2021.
Exhibit 1008, Declaration of Kevin Jakel, document filed on behalf of Unified Patents, LLC, in Case No. IPR2022-00136, 7 pages, Declaration dated Nov. 4, 2021.
Foster et al., “A Distributed Resource Management Architecture that Supports Advance Reservations and Co-Allocation,” Seventh International Workshop on Quality of Service (IWQoS '99), 1999, pp. 27-36.
Furmento et al. “An Integrated Grid Environment for Component Applications”, Proceedings of the Second International Workshop on Grid Computing table of contents, 2001, pp. 26-37.
He XiaoShan; QoS Guided Min-Min Heuristic for Grid Task Scheduling; Jul. 2003, vol. 18, No. 4, pp. 442-451 J. Comput. Sci. & Technol.
Huy Tuong Le, “The Data-AWare Resource Broker” Research Project Thesis, University of Adelaide, Nov. 2003, pp. 1-63.
IBM Tivoli “IBM Directory Integrator and Tivoli Identity Manager Integration” Apr. 2, 2003, pp. 1-13 online link “http:publib.boulder.ibm.com/tividd/td/ITIM/SC32-1683-00/en_US/HTML/idi_integration/index.html” (Year: 2003).
Intel, Architecture Guide: Intel® Active Management Technology, Intel.com, Oct. 10, 2008, pp. 1-23, (Year 2008).
Kafil et al., “Optimal Task Assignment in Herterogenous Computing Systems,” IEEE, 1997, pp. 135-146.
Kuan-Wei Cheng, Chao-Tung Yang, Chuan-Lin Lai and Shun-Chyi Change, “A parallel loop self-scheduling on grid computing environments,” 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 2004, pp. 409-414 (Year: 2004).
Luo Si et al. “A Language Modeling Framework for Resource Selection and Results Merging”, Conference on Information and Knowledge Management. 2002 ACM pp. 391-397.
Maheswaran et al., “Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems,” IEEE, 2000, pp. 1-15.
Mateescu et al., “Quality of service on the grid via metascheduling with resource co-scheduling and co-reservation,” The International Journal of High Performance Computing Applications, 2003, 10 pages.
Notice of Allowance on U.S. Appl. No. 10/530,577, dated Oct. 15, 2015.
Notice of Allowance on U.S. Appl. No. 11/207,438 dated Jan. 3, 2012.
Notice of Allowance on U.S. Appl. No. 11/276,852 dated Nov. 26, 2014.
Notice of Allowance on U.S. Appl. No. 11/276,853, dated Apr. 5, 2016.
Notice of Allowance on U.S. Appl. No. 11/276,854, dated Mar. 6, 2014.
Notice of Allowance on U.S. Appl. No. 11/276,855, dated Sep. 13, 2013.
Notice of Allowance on U.S. Appl. No. 11/616,156, dated Mar. 25, 2014.
Notice of Allowance on U.S. Appl. No. 11/718,867 dated May 25, 2012.
Notice of Allowance on U.S. Appl. No. 12/573,967, dated Jul. 20, 2015.
Notice of Allowance on U.S. Appl. No. 13/621,987 dated Jun. 4, 2015.
Notice of Allowance on U.S. Appl. No. 13/705,286 dated Feb. 24, 2016.
Notice of Allowance on U.S. Appl. No. 13/758,164, dated Apr. 15, 2015.
Notice of Allowance on U.S. Appl. No. 13/760,600 dated Feb. 26, 2018.
Notice of Allowance on U.S. Appl. No. 13/760,600 dated Jan. 9, 2018.
Notice of Allowance on U.S. Appl. No. 13/855,241, dated Oct. 27, 2020.
Notice of Allowance on U.S. Appl. No. 13/855,241, dated Sep. 14, 2020.
Notice of Allowance on U.S. Appl. No. 14/106,254 dated May 25, 2017.
Notice of Allowance on U.S. Appl. No. 14/137,921 dated Aug. 12, 2021 and Jul. 16, 2021.
Notice of Allowance on U.S. Appl. No. 14/137,940 dated Jan. 30, 2019.
Notice of Allowance on U.S. Appl. No. 14/154,912 dated Apr. 25, 2019.
Notice of Allowance on U.S. Appl. No. 14/154,912, dated Apr. 3, 2019.
Notice of Allowance on U.S. Appl. No. 14/154,912, dated Feb. 7, 2019.
Notice of Allowance on U.S. Appl. No. 14/331,718 dated Jun. 7, 2017.
Notice of Allowance on U.S. Appl. No. 14/331,772, dated Jan. 10, 2018.
Notice of Allowance on U.S. Appl. No. 14/454,049, dated Jan. 20, 2015.
Notice of Allowance on U.S. Appl. No. 14/590,102, dated Jan. 22, 2018.
Notice of Allowance on U.S. Appl. No. 14/704,231, dated Sep. 2, 2015.
Notice of Allowance on U.S. Appl. No. 14/709,642 dated Mar. 19, 2019.
Notice of Allowance on U.S. Appl. No. 14/709,642, dated May 9, 2019.
Notice of Allowance on U.S. Appl. No. 14/791,873 dated Dec. 20, 2018.
Notice of Allowance on U.S. Appl. No. 14/827,927 dated Jan. 21, 2022 and Dec. 9, 2021.
Notice of Allowance on U.S. Appl. No. 14/833,673, dated Dec. 2, 2016.
Notice of Allowance on U.S. Appl. No. 14/842,916 dated Oct. 2, 2017.
Notice of Allowance on U.S. Appl. No. 14/872,645 dated Oct. 13, 2016.
Notice of Allowance on U.S. Appl. No. 14/987,059, dated Feb. 14, 2020.
Notice of Allowance on U.S. Appl. No. 14/987,059, dated Jul. 8, 2019.
Notice of Allowance on U.S. Appl. No. 14/987,059, dated Nov. 7, 2019.
Notice of Allowance on U.S. Appl. No. 15/049,542 dated Feb. 28, 2018.
Notice of Allowance on U.S. Appl. No. 15/049,542 dated Jan. 4, 2018.
Notice of Allowance on U.S. Appl. No. 15/345,017 dated Feb. 2, 2021.
Notice of Allowance on U.S. Appl. No. 15/478,467 dated May 30, 2019.
Notice of Allowance on U.S. Appl. No. 15/717,392 dated Mar. 22, 2019.
Notice of Allowance on U.S. Appl. No. 15/726,509, dated Sep. 25, 2019.
Office Action issued on U.S. Appl. No. 11/276,855, dated Jul. 22, 2010.
Office Action on U.S. Appl. No. 10/530,577, dated May 29, 2015.
Office Action on U.S. Appl. No. 11/207,438 dated Aug. 31, 2010.
Office Action on U.S. Appl. No. 11/207,438 dated Mar. 15, 2010.
Office Action on U.S. Appl. No. 11/276,852, dated Feb. 10, 2009.
Office Action on U.S. Appl. No. 11/276,852, dated Jan. 16, 2014.
Office Action on U.S. Appl. No. 11/276,852, dated Jun. 26, 2012.
Office Action on U.S. Appl. No. 11/276,852, dated Mar. 17, 2011.
Office Action on U.S. Appl. No. 11/276,852, dated Mar. 4, 2010.
Office Action on U.S. Appl. No. 11/276,852, dated Mar. 5, 2013.
Office Action on U.S. Appl. No. 11/276,852, dated Oct. 4, 2010.
Office Action on U.S. Appl. No. 11/276,852, dated Oct. 5, 2011.
Office Action on U.S. Appl. No. 11/276,852, dated Oct. 16, 2009.
Office Action on U.S. Appl. No. 11/276,853, dated Apr. 4, 2014.
Office Action on U.S. Appl. No. 11/276,853, dated Aug. 7, 2009.
Office Action on U.S. Appl. No. 11/276,853, dated Dec. 28, 2009.
Office Action on U.S. Appl. No. 11/276,853, dated Dec. 8, 2008.
Office Action on U.S. Appl. No. 11/276,853, dated Jul. 12, 2010.
Office Action on U.S. Appl. No. 11/276,853, dated May 26, 2011.
Office Action on U.S. Appl. No. 11/276,853, dated Nov. 23, 2010.
Office Action on U.S. Appl. No. 11/276,853, dated Oct. 16, 2009.
Office Action on U.S. Appl. No. 11/276,854, dated Apr. 18, 2011.
Office Action on U.S. Appl. No. 11/276,854, dated Aug. 1, 2012.
Office Action on U.S. Appl. No. 11/276,854, dated Jun. 10, 2009.
Office Action on U.S. Appl. No. 11/276,854, dated Jun. 5, 2013.
Office Action on U.S. Appl. No. 11/276,854, dated Jun. 8, 2010.
Office Action on U.S. Appl. No. 11/276,854, dated Nov. 26, 2008.
Office Action on U.S. Appl. No. 11/276,854, dated Oct. 27, 2010.
Office Action on U.S. Appl. No. 11/276,855, dated Aug. 13, 2009.
Office Action on U.S. Appl. No. 11/276,855, dated Dec. 30, 2008.
Office Action on U.S. Appl. No. 11/276,855, dated Dec. 31, 2009.
Office Action on U.S. Appl. No. 11/276,855, dated Dec. 7, 2010.
Office Action on U.S. Appl. No. 11/276,855, dated Jan. 26, 2012.
Office Action on U.S. Appl. No. 11/276,855, dated Jul. 22, 2010.
Office Action on U.S. Appl. No. 11/276,855, dated Jun. 27, 2011.
Office Action on U.S. Appl. No. 11/616,156, dated Jan. 18, 2011.
Office Action on U.S. Appl. No. 11/616,156, dated Oct. 13, 2011.
Office Action on U.S. Appl. No. 11/616,156, dated Sep. 17, 2013.
Office Action on U.S. Appl. No. 11/718,867 dated Dec. 29, 2009.
Office Action on U.S. Appl. No. 11/718,867 dated Jan. 8, 2009.
Office Action on U.S. Appl. No. 11/718,867 dated Jul. 11, 2008.
Office Action on U.S. Appl. No. 11/718,867 dated Jun. 15, 2009.
Office Action on U.S. Appl. No. 12/573,967, dated Apr. 1, 2014.
Office Action on U.S. Appl. No. 12/573,967, dated Aug. 13, 2012.
Office Action on U.S. Appl. No. 12/573,967, dated Mar. 1, 2012.
Office Action on U.S. Appl. No. 12/573,967, dated Nov. 21, 2014.
Office Action on U.S. Appl. No. 12/573,967, dated Oct. 10, 2013.
Office Action on U.S. Appl. No. 13/621,987 dated Feb. 27, 2015.
Office Action on U.S. Appl. No. 13/621,987 dated Oct. 8, 2014.
Office Action on U.S. Appl. No. 13/705,386, dated May 13, 2013.
Office Action on U.S. Appl. No. 13/760,600 dated Aug. 30, 2016.
Office Action on U.S. Appl. No. 13/760,600 dated Jan. 23, 2017.
Office Action on U.S. Appl. No. 13/760,600 dated Jun. 15, 2017.
Office Action on U.S. Appl. No. 13/760,600 dated Mar. 15, 2016.
Office Action on U.S. Appl. No. 13/760,600 dated Oct. 19, 2015.
Office Action on U.S. Appl. No. 13/760,600, dated Apr. 10, 2015.
Office Action on U.S. Appl. No. 13/855,241, dated Jan. 13, 2016.
Office Action on U.S. Appl. No. 13/855,241, dated Jul. 6, 2015.
Office Action on U.S. Appl. No. 13/855,241, dated Jun. 27, 2019.
Office Action on U.S. Appl. No. 13/855,241, dated Mar. 30, 2020.
Office Action on U.S. Appl. No. 13/855,241, dated Sep. 15, 2016.
Office Action on U.S. Appl. No. 14/106,254 dated Aug. 12, 2016.
Office Action on U.S. Appl. No. 14/106,254 dated Feb. 15, 2017.
Office Action on U.S. Appl. No. 14/106,254, dated May 2, 2016.
Office Action on U.S. Appl. No. 14/137,921 dated Feb. 4, 2021.
Office Action on U.S. Appl. No. 14/137,921 dated Jun. 25, 2020.
Office Action on U.S. Appl. No. 14/137,921 dated May 31, 2017.
Office Action on U.S. Appl. No. 14/137,921 dated May 6, 2016.
Office Action on U.S. Appl. No. 14/137,921 dated Oct. 6, 2016.
Office Action on U.S. Appl. No. 14/137,921 dated Oct. 8, 2015.
Office Action on U.S. Appl. No. 14/137,940 dated Aug. 10, 2018.
Office Action on U.S. Appl. No. 14/137,940 dated Jan. 25, 2018.
Office Action on U.S. Appl. No. 14/137,940 dated Jun. 3, 2016.
Office Action on U.S. Appl. No. 14/137,940 dated Jun. 9, 2017.
Office Action on U.S. Appl. No. 14/137,940 dated Nov. 3, 2016.
Office Action on U.S. Appl. No. 14/154,912, dated Dec. 7, 2017.
Office Action on U.S. Appl. No. 14/154,912, dated Jul. 20, 2017.
Office Action on U.S. Appl. No. 14/154,912, dated May 8, 2018.
Office Action on U.S. Appl. No. 14/154,912, dated Oct. 11, 2018.
Office Action on U.S. Appl. No. 14/331,718 dated Feb. 28, 2017.
Office Action on U.S. Appl. No. 14/331,772, dated Aug. 11, 2017.
Office Action on U.S. Appl. No. 14/590,102, dated Aug. 15, 2017.
Office Action on U.S. Appl. No. 14/691,120 dated Mar. 10, 2022.
Office Action on U.S. Appl. No. 14/691,120 dated Mar. 30, 2020.
Office Action on U.S. Appl. No. 14/691,120 dated Oct. 3, 2019.
Office Action on U.S. Appl. No. 14/691,120 dated Oct. 20, 2020.
Office Action on U.S. Appl. No. 14/691,120 dated Sep. 29, 2021.
Office Action on U.S. Appl. No. 14/691,120, dated Aug. 27, 2018.
Office Action on U.S. Appl. No. 14/691,120, dated Feb. 12, 2018.
Office Action on U.S. Appl. No. 14/691,120, dated Mar. 2, 2017.
Office Action on U.S. Appl. No. 14/691,120, dated Mar. 22, 2019.
Office Action on U.S. Appl. No. 14/691,120, dated Sep. 13, 2017.
Office Action on U.S. Appl. No. 14/709,642 dated Feb. 7, 2018.
Office Action on U.S. Appl. No. 14/709,642 dated Feb. 17, 2016.
Office Action on U.S. Appl. No. 14/709,642 dated Jul. 12, 2017.
Office Action on U.S. Appl. No. 14/709,642 dated Sep. 12, 2016.
Office Action on U.S. Appl. No. 14/751,529 dated Aug. 9, 2017.
Office Action on U.S. Appl. No. 14/751,529 dated Oct. 3, 2018.
Office Action on U.S. Appl. No. 14/751,529, dated Jun. 6, 2016.
Office Action on U.S. Appl. No. 14/751,529, dated Nov. 14, 2016.
Office Action on U.S. Appl. No. 14/791,873 dated May 14, 2018.
Office Action on U.S. Appl. No. 14/827,927 dated Jan. 19, 2021.
Office Action on U.S. Appl. No. 14/827,927 dated Jan. 31, 2020.
Office Action on U.S. Appl. No. 14/827,927 dated May 16, 2018.
Office Action on U.S. Appl. No. 14/827,927 dated May 16, 2019.
Office Action on U.S. Appl. No. 14/827,927 dated Sep. 9, 2019.
Office Action on U.S. Appl. No. 14/827,927, dated Aug. 28, 2018.
Office Action on U.S. Appl. No. 14/827,927, dated Jan. 31, 2019.
Office Action on U.S. Appl. No. 14/833,673, dated Feb. 11, 2016.
Office Action on U.S. Appl. No. 14/833,673, dated Jun. 10, 2016.
Office Action on U.S. Appl. No. 14/833,673, dated Sep. 24, 2015.
Office Action on U.S. Appl. No. 14/842,916 dated May 5, 2017.
Office Action on U.S. Appl. No. 14/872,645 dated Feb. 16, 2016.
Office Action on U.S. Appl. No. 14/872,645 dated Jun. 29, 2016.
Office Action on U.S. Appl. No. 14/987,059, dated Jan. 31, 2019.
Office Action on U.S. Appl. No. 14/987,059, dated May 11, 2018.
Office Action on U.S. Appl. No. 14/987,059, dated Oct. 11, 2018.
Office Action on U.S. Appl. No. 15/345,017 dated Aug. 24, 2020.
Office Action on U.S. Appl. No. 15/345,017 dated Aug. 9, 2019.
Office Action on U.S. Appl. No. 15/345,017 dated Jan. 31, 2019.
Office Action on U.S. Appl. No. 15/345,017 dated Jul. 11, 2018.
Office Action on U.S. Appl. No. 15/345,017 dated Mar. 20, 2020.
Office Action on U.S. Appl. No. 15/345,017 dated Nov. 29, 2019.
Office Action on U.S. Appl. No. 15/478,467, dated Jan. 11, 2019.
Office Action on U.S. Appl. No. 15/478,467, dated Jul. 13, 2018.
Office Action on U.S. Appl. No. 15/717,392 dated Dec. 3, 2018.
Office Action on U.S. Appl. No. 15/717,392 dated Jul. 5, 2018.
Office Action on U.S. Appl. No. 15/726,509, dated Jun. 3, 2019.
PCT/US2005/008296—International Search Report dated Aug. 3, 2005 for PCT Application No. PCT/US2005/008296, 1 page.
PCT/US2005/008297—International Search Report for Application No. PCT/US2005/008297, dated Sep. 29, 2005.
PCT/US2005/040669—International Preliminary Examination Report for PCT/US2005/040669, dated Apr. 29, 2008.
PCT/US2005/040669—Written Opinion for PCT/US2005/040669, dated Sep. 13, 2006.
PCT/US2010/053227—International Preliminary Report on Patentability for PCT/US2010/053227, dated May 10, 2012.
Petition for Inter Partes Review of U.S. Pat. No. 8,271,980, Challenging Claims 1-5 and 14-15, document filed on behalf of Unified Patents, LLC, in Case No. IPR2022-00136, 92 pages, Petition document dated Nov. 29, 2021.
Roblitz et al., “Resource Reservations with Fuzzy Requests”, Con-currency and computation: Practice and Experience, 2005.
Snell et al., “The Performance Impact of Advance Reservation Meta-Scheduling”, Springer-Verlag, Berlin, 2000, pp. 137-153.
Stankovic et al., “The Case for Feedback Control Real-Time Scheduling” 1999, IEEE pp. 1-13.
Takahashi et al. “A Programming Interface for Network Resource Management,” 1999 IEEE, pp. 34-44.
Tanaka et al. “Resource Manager for Globus-Based Wide-Area Cluster Computing,” 1999 IEEE, 8 pages.
U.S. Appl. No. 60/552,653, filed Apr. 19, 2005.
U.S. Appl. No. 60/662,240, filed Mar. 16, 2005, Jackson.
Liu, Simon: “Securing the Clouds: Methodologies and Practices.” Encyclopedia of Cloud Computing (2016): 220. (Year: 2016).
Notice of Allowance on U.S. Appl. No. 14/827,927 dated Apr. 25, 2022.
Notice of Allowance on U.S. Appl. No. 16/913,745, dated Jun. 9, 2022.
Notice of Allowance on U.S. Appl. No. 17/700,808, dated May 26, 2022 and Jun. 6, 2022.
Office Action on U.S. Appl. No. 16/913,745 dated Jan. 13, 2022.
Office Action on U.S. Appl. No. 17/089,207 dated Jan. 28, 2022.
Office Action on U.S. Appl. No. 17/201,245 dated Mar. 18, 2022.
Office Action on U.S. Appl. No. 17/697,235 dated May 25, 2022.
Office Action on U.S. Appl. No. 17/697,368 dated Jun. 7, 2022.
Office Action on U.S. Appl. No. 17/697,403 dated Jun. 7, 2022.
Office Acton on U.S. Appl. No. 16/537,256 dated Dec. 23, 2021.
Office Acton on U.S. Appl. No. 16/913,708 dated Jun. 7, 2022.
Office Acton on U.S. Appl. No. 17/722,037 dated Jun. 13, 2022.
Notice of Allowance on U.S. Appl. No. 17/722,062 dated Jun. 15, 2022.
IQSearchText-202206090108.txt, publication dated Apr. 6, 2005, 2 pages.
Notice of Allowance on U.S. Appl. No. 17/700,767 dated Jun. 27, 2022.
Office Action on U.S. Appl. No. 17/722,076 dated Jun. 22, 2022.
Office Action on U.S. Appl. No. 17/412,832, dated Oct. 14, 2022.
Notice of Allowance on U.S. Appl. No. 16/913,708 dated Aug. 24, 2022.
Office Action on U.S. Appl. No. 17/697,368 dated Oct. 18, 2022.
Office Action on U.S. Appl. No. 17/697,403 dated Oct. 18, 2022.
Notice of Allowance on U.S. Appl. No. 17/700,767 dated Jul. 11 2022.
Notice of Allowance on U.S. Appl. No. 17/700,767 dated Oct. 14, 2022.
Notice of Allowance on U.S. Appl. No. 17/722,062 dated Oct. 7, 2022.
Office Action on U.S. Appl. No. 14/691,120, dated Sep. 8, 2022.
Office Action on U.S. Appl. No. 16/537,256 dated Jul. 7, 2022.
Notice of Allowance on U.S. Appl. No. 16/913,745, dated Sep. 27, 2022.
Notice of Allowance on U.S. Appl. No. 17/089,207, dated Jul. 7, 2022.
Office Action on U.S. Appl. No. 17/171,152 dated Aug. 16, 2022.
Office Action on U.S. Appl. No. 17/201,231 dated Oct. 5, 2022.
Notice of Allowance on U.S. Appl. No. 17/201,245 dated Sep. 14, 2022.
Notice of Allowance on U.S. Appl. No. 17/201,245, dated Sep. 22, 2022.
Office Action on U.S. Appl. No. 17/697,235 dated Sep. 20, 2022.
Notice of Allowance on U.S. Appl. No. 17/700,808, dated Sep. 14, 2022.
Notice of Allowance on U.S. Appl. No. 17/700,808, dated Sep. 26, 2022.
Notice of Allowance on U.S. Appl. No. 17/700,847, dated Jul. 7, 2022.
Office Action on U.S. Appl. No. 17/711,214, dated Jul. 8, 2022.
Office Action on U.S. Appl. No. 17/711,242, dated Jul. 28, 2022.
Notice of Allowance on U.S. Appl. No. 17/722,037, dated Jul. 18, 2022.
Office Action on U.S. Appl. No. 17/835,159 dated Aug, 31, 2022.
Reexamination Report on Japanese Application 2012-536877, dated Jan. 22, 2015, including English Translation, cited by applicant.
Abdelwahed, Sherif et al., “A Control-Based Framework for Self-Managing Distributed Computing Systems”, WOSS'04 Oct. 31-Nov. 1, 2004 Newport Beach, CA, USA. Copyright 2004 ACM 1-58113-989-6/04/0010. cited by applicant.
Abdelzaher, Tarek, et al., “Performance Guarantees for Web Server End- Systems: A Control-Theoretical Approach”, IEEE Transactions on Parallel and Distributed Svstems. vol. 13. No. 1. Jan. 2002. cited by applicant.
Amini, A. Shaikh, and H. Schulzrinne, “Effective Peering for Multi-provider Content Delivery Services”, In Proceedings of 23.sup.rd Annual IEEE Conference on Computer Communications (INFOCOM'04), pp. 850-861, 2004. cited by applicant.
Amir and D. Shaw, “WALRUS—A Low Latency, High Throughput Web Service Using Internet-wide Replication”, In Proceedings of the 19.sup.th International Conference on Distributed Computing Systems Workshop, 1998. cited by applicant.
Appleby, K., et al., “Oceano-SLA Based Management of a Computing Utility”, IBM T.J. Watson Research Center, P.O.Box 704, Yorktown Heights, New York 10598, USA. Proc. 7th IFIP/IEEE Int'l Symp. Integrated Network Management, IEEE Press 2001. cited by applicant.
Aweya, James et al., “An adaptive load balancing scheme for web servers”, International Journal of Network Management 2002; 12: 3-39 (DOI: 10.1002/nem.421). Copyright 2002 John Wilev & Sons. Ltd. cited by applicant.
Azuma, T. Okamoto, G. Hasegawa, and M. Murata, “Design, Implementation and Evaluation of Resource Management System for Internet Servers”, IOS Press, Journal of High Speed Networks, vol. 14 Issue 4, pp. 301-316, Oct. 2005. cited by applicant.
Baentsch, Michael et al., “World Wide Web Caching: The Application-Level View of the Internet”, Communications Magazine, IEEE, vol. 35, Issue 6, pp. 170-178, Jun. 1997. cited by applicant.
Banga, Gaurav et al., “Resource Containers: A New Facility for Resource Management in Server Systems”, Rice University, originally published in the Proceedings of the 3.sup.rd Symposium on Operating Systems Design and Implementation, New Orleans, Louisiana, Feb. 1999. cited by applicant.
Belloum, A et al., “A Scalable Web Server Architecture”, World Wide Web Internet and Web Information Systems, 5, 5-23, 2002 Kluwer Academic Publishers. Manufactured in The Netherlands. 2000. cited by applicant.
Benkner, Siegfried, et al., “VGE- A Service-Oriented Grid Environment for On-Demand Supercomputing”, Institute for Software Science, University of Vienna, Nordbergstrasse 15/C/3, A-1090 Vienna, Austria. Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing. Pages 11-18. 2004.
Bent, Leeann et al., “Characterization of a Large Web Site Population with Implications for Content Delivery”, WWW2004, May 17-22, 2004, New York, New York, USA ACM 1-58113-844-X/04/0005, pp. 522-533. cited by applicant.
Bian, Qiyong, et al., “Dynamic Flow Switching, A New Communication Service for ATM Networks”, 1997. cited by applicant.
Bradford, S. Milliner, and M. Dumas, “Experience Using a Coordination-based Architecture for Adaptive Web Content Provision”, In Coordination, pp. 140-156. Springer, 2005. cited by applicant.
Braumandl, R. et al., “ObjectGlobe: Ubiquitous query processing on the Internet”, Universitat Passau, Lehrstuhl fur Informatik, 94030 Passau, Germany. Technische Universitaat Muunchen, Institutfur Informatik, 81667 Munchen, Germany. Edited by F. Casati, M.-C. Shan, D. Georgakopoulos. Published online Jun. 7, 2001—.sub.—cSpringer-Verlag 2001. cited by applicant.
Cardellini, Valeria et al., “Geographic Load Balancing for Scalable Distributed Web Systems”, Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 20-27. 2000. cited by applicant.
Cardellini, Valeria et al., “The State of the Art in Locally Distributed Web-Server Systems”, ACM Computing Surveys, vol. 34, No. 2, Jun. 2002, pp. 263-311. cited by applicant.
Casalicchio, Emiliano, et al., “Static and Dynamic Scheduling Algorithms for Scalable Web Server Farm”, University of Roma Tor Vergata, Roma, Italy, 00133.2001. In Proceedings of the IEEE 9.sup.th EuromicroWorkshop on Parallel and Distributed Processing, pp. 369-376, 2001.
Chandra, Abhishek et al., “Dynamic Resource Allocation for Shared Data Centers Using Online Measurements” Proceedings of the 11th international conference on Quality of service, Berkeley, CA, USA pp. 381-398. 2003. cited by applicant.
Chandra, Abhishek et al., “Quantifying the Benefits of Resource Multiplexing in On-Demand Data Centers”, Department of Computer Science, University of Massachusetts Amherst, 2003. cited by applicant.
Chawla, Hamesh et al., “HydraNet: Network Support for Scaling of Large-Scale Services”,Proceedings of 7th International Conference on Computer Communications and Networks, 1998. Oct. 1998. cited by applicant.
Chellappa, Ramnath et al., “Managing Computing Resources in Active Intranets”, International Journal of Network Management, 2002, 12:117-128 (DQI:10.1002/nem.427). cited by applicant.
Chen and G. Agrawal, “Resource Al ocation in a Middleware for Streaming Data”, In Proceedings of the 2.sup.nd Workshop on Middleware for Grid Computing (MGC '04), pp. 5-10, Toronto, Canada, Oct. 2004. cited by applicant.
Chen, et al., “Replicated Servers Allocation for Multiple Information Sources in a Distributed Environment”, Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, Sep. 2000. cited by applicant.
Chen, Thomas, “Increasing the Observability of Internet Behavior”, Communications of the ACM, vol. 44, No. 1, pp. 93-98, Jan. 2001. cited by applicant.
Chen, Xiangping et al., “Performance Evaluation of Service Differentiating Internet Servers”, IEEE Transactions on Computers, vol. 51, No. 11, pp. 1368-1375, Nov. 2002. cited by applicant.
Clark, et al., “Providing Scalable Web Service Using Multicast Delivery”, College of Computing, Georgia Institute of Technology, Atlanta, GA 30332-0280, 1995. cited by applicant.
Clarke and G. Coulson, “An Architecture for Dynamically Extensible Operating Systems”, In Proceedings of the 4th International Conference on Configurable Distributed Systems (ICCDS'98), Annapolis, MD, May 1998. cited by applicant.
Colajanni, Michele et al., “Analysis of Task Assignment Policies in Sea able Distributed Web-server Systems”, IEEE Transactions on Parallel and Distributed Systes, vol. 9, No. 6, Jun. 1998. cited by applicant.
Colajanni, P. Yu, V. Cardellini, M. Papazoglou, M. Takizawa, B. Cramer and S. Chanson, “Dynamic Load Balancing in Geographically Distributed Heterogeneous Web Servers”, In Proceedings of the 18.sup.th International Conference on Distributed Computing Systems, pp. 295-302, May 1998. cited by applicant.
Conti, Marco et al., “Quality of Service Issues in Internet Web Services”, IEEE Transactions on Computers, vol. 51, No. 6, pp. 593-594, Jun. 2002. cited by applicant.
Conti, Marco, et al., “Client-side content delivery policies in replicated web services: parallel access versus single server approach”, Istituto di Informatica e Telematica (IIT), Italian National Research Council (CNR), Via G. Moruzzi, I. 56124 Pisa, Italy, Performance Evaluation 59 (2005) 137-157, Available online Sep. 11, 2004. cited by applicant.
Devarakonda, V.K. Naik, N. Rajamanim, “Policy-based multi-datacenter resource management”, In 6.sup.th IEEE International Workshop on Policies for Distributed Systems and Networks, pp. 247-250, Jun. 2005. cited by applicant.
Dilley, John, et al., “Globally Distributed Content Delivery”, IEEE Internet Computing, 1089-7801/02/$17.00 .COPYRGT. 2002 IEEE, pp. 50-58, Sep.-Oct. 2002. cited by applicant.
Doyle, J. Chase, 0. Asad, W. Jin, and A. Vahdat, “Model-Based Resource Provisioning in a Web Service Utility”, In Proceedings of the Fourth USENIX Symposium on Internet Technologies and Systems (USITS), Mar. 2003. cited by applicant.
Edited by William Gropp, Ewing Lusk and Thomas Sterling, “Beowulf Cluster Computing with Linux,” Massachusetts Institute of Technology, 2003. cited by applicant.
Ercetin, Ozgur et al., “Market-Based Resource Allocation for Content Delivery in the Internet”, IEEE Transactions on Computers, vol. 52, No. 12, pp. 1573-1585, Dec. 2003. cited by applicant.
Fan, Li, et al., “Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol”, IEEE/ACM Transactions on networking, vol. 8, No. 3, Jun. 2000. cited by applicant.
Feldmann, Anja, et al., “Efficient Policies for Carrying Web Traffic Over Flow-Switched Networks”, IEEE/ACM Transactions on Networking, vol. 6, No. 6, Dec. 1998. cited by applicant.
Feldmann, Anja, et al., “Reducing Overhead in Flow-Switched Networks: An Empirical Study of Web Traffic”, AT&T Labs-Research, Florham Park, NJ, 1998. cited by applicant.
Fong, L.L. et al., “Dynamic Resource Management in an eUtility”, IBM T. J. Watson Research Center, 0-7803-7382-0/02/$17.00 .COPYRGT. 2002 IEEE. cited by applicant.
Foster, Ian et al., “The Anatomy of the Grid-Enabling Scalable Virtual Organizations”, To appear: Inti J. Supercomputer Applications, 2001. cited by applicant.
Fox, Armando et al., “Cluster-Based Scalable Network Services”, University of California at Berkeley, SOSP-Oct. 16, 1997 Saint-Malo, France, ACM 1997. cited by applicant.
Furmento et al., “Building computational communities from federated resources.” European Conference on Parallel, Springer, Berlin, Heidelberg, pp. 855-863. (Year: 2001).
Garg, Rahul, et al., “A Sla Framework for QoS Provisioning and Dynamic Capacity Allocation”, 2002. cited by applicant.
Gayek, P., et al., “A Web Content Serving Utility”, IBM Systems Journal, vol. 43, No. 1, pp. 43-63. 2004. cited by applicant.
Genova, Zornitza et al., “Challenges in URL Switching for Implementing Globally Distributed Web Sites”, Department of Computer Science and Engineering, University of South Florida, Tampa, Florida 33620. 0-7695-077 I-9/00 $10.00-IEEE. 2000. cited by applicant.
Grajcar, Martin, “Genetic List Scheduling Algorithm for Scheduling and Allocation on a Loosely Coupled Heterogeneous Multiprocessor System”, Proceedings of the 36.sup.th annual ACM/IEEE Design Automation Conference, New Orleans, Louisiana, pp. 280-285. 1999. cited by applicant.
Grimm, Robert et al., “System Support for Pervasive Applications”, ACM Transactions on Computer Systems, vol. 22, No. 4, Nov. 2004, pp. 421-486. cited by applicant.
Guo, L. Bhuyan, R. Kumar and S. Basu, “QoS Aware Job Scheduling in a Cluster-Based Web Server for Multimedia Applications”, In Proceedings of the 19.sup.th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05), Apr. 2005. cited by applicant.
Gupta, A., Kleinberg, J., Kumar, A., Rastogi, R. & Yener, B. “Provisioning a virtual private network: a network design problem for multicommodity flow,” Proceedings of the thirty-third annual ACM symposium on Theory of computing [online], Jul. 2001, pp. 389-398, abstract [retrieved on Jun. 14, 2007],Retrieved from the Tnternet:<URL:http://portal.acm.org/citation.cfm?id=380830&dl=ACM&coll- -FGUIDE>. cited by applicant.
Haddad and E. Paquin, “Mosix: A Cluster Load-Balancing Solution for Linux”, In Linux Journal, vol. 2001 Issue 85es, Article No. 6, May 2001. cited by applicant.
Hadjiefthymiades, Stathes et al., “Using Proxy Cache Relocation to Accelerate Web Browsing in Wireless/Mobile Communications”, University of Athens, Dept. of Informatics and Telecommunications, Panepistimioupolis, llisia, Athens, 15784, Greece. WWW10, May 1-5, 2001, Hong Kong, cited by applicant.
He XiaoShan; QoS Guided Min-Min Heuristic for Grud Task Scheduling; Jul. 2003, vol. 18, No. 4, pp. 442-451 J. Comput. Sci. & Technol. cited by applicant.
HP “OpenView OS Manager using Radia software”, 5982-7478EN, Rev 1, Nov. 2005; (HP_Nov_2005.pdf; pp. 1-4).
Hu, E.C et al., “Adaptive Fast Path Architecture”, Copyright 2001 by International Business Machines Corporation, pp. 191-206, IBM J. Res. & Dev. vol. 45 No. Mar. 2, 2001. cited by applicant.
Huang, S. Sebastine and T. Abdelzaher, “An Architecture for Real-Time Active Content Distribution”, In Proceedings of the 16.sup.th Euromicro Conference on Real-Time Systems (ECRTS 04), pp. 271-280, 2004. cited by applicant.
IBM Tivoli Workload Scheduler job Scheduling Console User's Guide Feature Level 1.2 (Maintenance Release Oct. 2003). Oct. 2003, IBM Corporation, http://publib.boulder.IBM.com/tividd/td/TWS/SH19-4552-01/en.sub.-US/PDF/-jsc.sub.-user.pdf. cited by applicant.
J. Chase, D. Irwin, L. Grit, J. Moore and S. Sprenkle, “Dynamic Virtual Clusters in a Grid Site Manager”, In Proceedings of the 12.sup.th IEEE International Symposium on High Performance Distributed Computing, pp. 90-100, 2003. cited by applicant.
Jackson et al., “Grid Computing: Beyond Enablement”,; Cluster Resource, Inc., Jan. 21, 2005.
Jann, Joefon et al., “Web Applications and Dynamic Reconfiguration in UNIX Servers”, IBM, Thomos J. Watson Research Center, Yorktown' Heights, New York 10598, 0-7803-7756-7/03/$17.00. 2003 IEEE. pp. 186-194. cited by applicant.
Jarek Nabrzyski, Jennifer M. Schopf and Jan Weglarz, “Grid Resources Management, State of the Art and Future Trends,” Kluwer Academic Publishers, 2004. cited by applicant.
Jiang, Xuxian et al., “SODA: a Service-On-Demand Architecture for Application Service Hosting Utility Platforms”, Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing (HPDC'03) 1082-8907/03 $17.00 .COPYRGT. 2003 IEEE, cited by applicant.
Kant, Krishna et al., “Server Capacity Planning for Web Traffic Workload”, IEEE Transactions on Knowledge and Data Engineering, vol. 11, No. 5, Sep./Oct. 1999, pp. 731-474. cited by applicant.
Kapitza, F. J. Hauck, and H. P. Reiser, “Decentralized, Adaptive Services: The AspectlX Approach for a Flexible and Secure Grid Environment”, In Proceedings of the Grid Services Engineering and Management Conferences (GSEM, Erfurt, Germany, Nov. 2004), pp. 107-118, LNCS 3270, Springer, 2004. cited by applicant.
Kavas et al., “Comparing Windows NT, Linux, and QNX as the Basis for Cluster Systems”, Concurrency and Computation Practice & Experience Wiley UK, vol. 13, No. 15, pp. 1303-1332, Dec. 25, 2001.
Koulopoulos, D et al., “PLEIADES: An Internet-based parallel/distributed system”, Software-Practice and Experience 2002; 32:1035-1049 (DOI: 10.1002/spe.468). cited by applicant.
Kuz, Ihor et al., “A Distributed-Object Infrastructure for Corporate Websites”, Delft University of Technology Vrije Universiteit Vrije Universiteit Delft, The Netherlands, 0-7695-0819-7/00 $10.00 0 2000 IEEE.
Lars C. Wolf et al. “Concepts for Resource Reservation in Advance” Multimedia Tools and Applications. [Online] 1997, pp. 255-278, XP009102070 The Netherlands Retreived from the Internet: URL http://www.springerlink.com/content/h25481221mu22451/fulltext.pdf [retrieved on Jun. 23, 2008]. cited by applicant.
Leinberger, W et al., “Gang Scheduling for Distributed Memory Systems”, University of Minnesota-Computer Science and Engineering-Technical Report, Feb. 16, 2000, vol. TR 00-014. cited by applicant.
Liao, Raymond, et al., “Dynamic Core Provisioning for Quantitative Differentiated Services”, IEEE/ACM Transactions on Networking, vol. 12, No. 3, pp. 429-442, Jun. 2004. cited by applicant.
Liu et al. “Design and Evaluation of a Resouce Selection Framework for Grid Applicaitons” High Performance Distributed Computing. 2002. HPDC-11 2002. Proceeding S. 11.sup.th IEEE International Symposium on Jul. 23-26, 2002, Piscataway, NJ, USA IEEE, Jul. 23, 2002, pp. 63-72, XP010601162 Isbn: 978-0-7695-1686-8. cited by applicant.
Lowell, David et al., “Devirtualizable Virtual Machines Enabling General, SingleNode, Online Maintenance”, ASPLQS'04, Oct. 9-13, 2004, Boston, Massachusetts, USA, pp. 211-223, Copyright 2004 ACM, cited by applicant.
Lu, Chenyang et al., “A Feedback Control Approach for Guaranteeing Relative Delays in Web Servers”, Department of Computer Science, University of Virginia, Charlottesville, VA 22903, 0-7695-1134-1/01 $10.00.2001 IEEE, cited by applicant.
Mahon, Rob et al., “Cooperative Design in Grid Services”, The 8th International Conference on Computer Supported Cooperative Work in Design Proceedings. pp. 406-412. IEEE 2003. cited by applicant.
Mccann, Julie, et al., “Patia: Adaptive Distributed Webserver (A Position Paper)”, Department of Computing, Imperial College London, SW1 2BZ, Uk. 2003. cited by applicant.
Montez, Carlos et al., “Implementing Quality of Service in Web Servers”, LCMI-Depto de Automacao e Sistemas-Univ. Fed. de Santa Catarina, Caixa Postal 476-88040-900-Florianopolis-SC-Brasil, 1060-9857/02 $17.00. 2002 IEEE. cited by applicant.
Naik, S. Sivasubramanian and S. Krishnan, “Adaptive Resource Sharing in a Web Services Environment”, In Proceedings of the 5.sup.th ACM/IFIP/USENIX International Conference on Middleware (Middleware '04), pp. 311-330, Springer-Verlag New York, Inc. New York, Ny, USA, 2004. cited by applicant.
Nakrani and C. Tovey, “On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers”, Adaptive Behavior, vol. 12, No. 3-4, pp. 223-240, Dec. 2004. cited by applicant.
Pacifici, Giovanni et al., “Performance Management for Cluster Based Web Services”, IBM Tj Watson Research Center, May 13, 2003. cited by applicant.
Ranjan, J. Rolia, H. Fu, and E. Knightly, “QoS-driven Server Migration for Internet Data Centers”, In Proceedings of the Tenth International Workshop on Quality of Service (IWQoS 2002), May 2002. cited by applicant.
Rashid, Mohammad, et al., “An Analytical Approach to Providing Controllable Differentiated Quality of Service in Web Servers”, IEEE Transactions on Parallel and Distributed Systems, vol. 16, No. 11, pp. 1022-1033, Nov. 2005. cited by applicant.
Raunak, Mohammad et al., “Implications of Proxy Caching for Provisioning Networks and Servers”, IEEE Journal on Selected Areas in Communications, vol. 20, No. 7, pp. 1276-1289, Sep. 2002. cited by applicant.
Reed, Daniel et al., “The Next Frontier: Interactive and Closed Loop Performance Steering”, Department of Computer Science, University of Illinois, Urbana, Illinois 61801, International Conference on Parallel Processing Workshop, 1996. cited by applicant.
Reumann, John et al., “Virtual Services: A New Abstraction for Server Consolidation”, Proceedings of 2000 USENIX Annual Technical Conference, San Diego, California, Jun. 18-23, 2000. cited by applicant.
Rolia, S. Singhal, and R. Friedrich, “Adaptive Internet data centers”, In Proceedings of the International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet (SSGRR '00), Jul. 2000. cited by applicant.
Rolia, X. Zhu, and M. Arlitt, “Resource Access Management for a Utility Hosting Enterprise Applications”, In Proceedings of the 8th IFIP/IEEE International Symposium on Integrated Network Management (IM), pp. 549-562, Colorado Springs, Colorado, USA, Mar. 2003. cited by applicant.
Roy, Alain, “Advance Reservation API”, University of Wisconsin-Madison, GFD-E.5, Scheduling Working Group, May 23, 2002. cited by applicant.
Ryu, Kyung Dong et al., “Resource Policing to Support Fine-Grain Cycle Stealing in Networks of Workstations”, IEEE Transactions on Parallel and Distributed Systems, vol. 15, No. 10, pp. 878-892, Oct. 2004. cited by applicant.
Sacks, Lionel et al., “Active Robust Resource Management in Cluster Computing Using Policies”, Journal of Network and Systems Management, vol. 11, No. 3, pp. 329-350, Sep. 2003. cited by applicant.
Shaikh, Anees et al., “Implementation of a Service Platform for Online Games”, Network Software and Services, IBM T.J. Watson Research Center, Hawthorne, NY 10532, SIGCQMM'04 Workshops, Aug. 30 & Sep. 3, 2004, Portland, Oregon, USA. Copyright 2004 ACM, cited by applicant.
Shen, H. Tang, T. Yang, and L. Chu, “Integrated Resource Management for Cluster-based Internet Services”, In Proceedings of the 5.sup.th Symposium on Operating Systems Design and Implementation (OSDI '02), pp. 225-238, Dec. 2002. cited by applicant.
Shen, L. Chu, and T. Yang, “Supporting Cluster-based Network Services on Functionally Symmetric Software Architecture”, In Proceedings of the Acm/IEEE SC2004 Conference, Nov. 2004. cited by applicant.
Si et al., “Language Modeling Framework for Resource Selection and Results Merging”, SIKM 2002, Proceedings of the eleventh international conference on Information and Knowledge Management, cited by applicant.
Sit, Yiu-Fai et al., “Cyclone: A High-Performance Cluster-Based Web Server with Socket Cloning”, Department of Computer Science and Information Systems, The University of Hong Kong, Cluster Computing vol. 7, issue 1, pp. 21-37, Jul. 2004, Kluwer Academic Publishers.
Sit, Yiu-Fai et al., “Socket Cloning for Cluster-BasedWeb Servers”, Department of Computer Science and Information Systems, The University of Hong Kong, Proceedings of the IEEE International Conference on Cluster Computing, IEEE 2002. cited by applicant.
Snell, Quinn et al., “An Enterprise-Based Grid Resource Management System”, Brigham Young University, Provo, Utah 84602, Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing, 2002. cited by applicant.
Soldatos, John, et al., “On the Building Blocks of Quality of Service in Heterogeneous IP Networks”, IEEE Communications Surveys, The Electronic Magazine of Original Peer-Reviewed Survey Articles, vol. 7, No. 1. First Quarter 2005. cited by applicant.
Stone et al., UNIX Fault Management: A Guide for System Administration, Dec. 1, 1999, Isbn 0-13-026525-X, http://www.informit.com/content/images/013026525X/samplechapter/013026525-.pdf. cited by applicant.
Supercluster Research and Development Group, “Maui Administrator's Guide”, Internet citation, 2002. cited by applicant.
Tang, Wenting et al., “Load Distribution via Static Scheduling and Client Redirection for Replicated Web Servers”, Department of Computer Science and Engineering, 3115 Engineering Building, Michigan State University, East Lansing, Ml 48824-1226, Proceedings of the 2000 International Workshop on Parallel Processing, pp. 127-133, IEEE 2000. cited by applicant.
Taylor, M. Surridge, and D. Marvin, “Grid Resources for Industrial Applications”, In Proceedings of the IEEE International Conference on Web Services (ICWS 04), pp. 402-409, San Diego, California, Jul. 2004. cited by applicant.
Urgaonkar, Bhuvan, et al., “Share: Managing CPU and Network Bandwidth in Shared Clusters”, IEEE Transactions on Parallel and Distributed Systems, vol. 15, No. 1, pp. 2-17, Jan. 2004. cited by applicant.
Vidyarthi, A. K. Tripathi, B. K. Sarker, A. Dhawan, and L. T. Yang, “Cluster-Based Multiple Task Allocation in Distributed Computing System”, In Proceedings of the 18.sup.th International Parallel and Distributed Processing Symposium KIPDPS'04), p. 239, Santa Fe, New Mexico, Apr. 2004. cited by applicant.
Villela, p. Pradhan, and D. Rubenstein, “Provisioning Servers in the Application Tier for E-commerce Systems”, In Proceedings of the 12.sup.th IEEE International Workshop on Quality of Service (IWQoS '04), pp. 57-66, Jun. 2004. cited by applicant.
Wang, Z., et al., “Resource Allocation for Elastic Traffic: Architecture and Mechanisms”, Bell Laboratories, Lucent Technologies, Network Operations and Management Symposium, 2000. 2000 IEEE/IFIP, pp. 157-170. Apr. 2000. cited by applicant.
Wesley et al., “Taks Allocation and Precedence Relations for Distributed Real-Time Systems”, IEEE Transactions on Computers, vol. C-36, No. 6, pp. 667-679. Jun. 1987. cited by applicant.
Wolf et al. “Concepts for Resource Reservation in Advance” Multimedia Tools and Applications, 1997. cited by examiner.
Workshop on Performance and Architecture of Web Servers (PAWS-2000) Jun. 17-18, 2000, Santa Clara, CA (Held in conjunction with SIGMETRICS-2000). cited by applicant.
Xu, Jun, et al., “Sustaining Availability of Web Services under Distributed Denial of Service Attacks”, IEEE Transactions on Computers, vol. 52, No. 2, pp. 195-208, Feb. 2003. cited by applicant.
Xu, Zhiwei et al., “Cluster and Grid Superservers: The Dawning Experiences in China”, Institute of Computing Technology, Chinese Academy of Sciences, P.O. Box 2704, Beijing 100080, China. Proceedings of the 2001 IEEE International Conference on Cluster Computing. IEEE 2002. cited by applicant.
Yang, Chu-Sing, et al., “Building an Adaptable, Fault Tolerant, and Highly Manageable Web Server on Clusters of Non-dedicated Workstations”, Department of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan, R.O.C.. 2000. cited by applicant.
Zeng, Daniel et al., “Efficient Web Content Delivery Using Proxy Caching Techniques”, IEEE Transactions on Systems, Man, and Cybernetics-Part C Applications and Reviews, vol. 34, No. 3, pp. 270-280, Aug. 2004. cited by applicant.
Zhang, Qian et al., “Resource Allocation for Multimedia Streaming Over the Internet”, IEEE Transactions on Multimedia, vol. 3, No. 3, pp. 339-355, Sep. 2001. cited by applicant.
Related Publications (1)
Number Date Country
20210117130 A1 Apr 2021 US
Provisional Applications (1)
Number Date Country
61256723 Oct 2009 US
Continuations (3)
Number Date Country
Parent 16198619 Nov 2018 US
Child 17089207 US
Parent 15357332 Nov 2016 US
Child 16198619 US
Parent 13728428 Dec 2012 US
Child 15357332 US
Continuation in Parts (2)
Number Date Country
Parent 13453086 Apr 2012 US
Child 13728428 US
Parent 12794996 Jun 2010 US
Child 13453086 US