Performance and power optimized computer system architectures and methods leveraging power optimized tree fabric interconnect

Information

  • Patent Grant
  • 9876735
  • Patent Number
    9,876,735
  • Date Filed
    Thursday, September 15, 2011
    13 years ago
  • Date Issued
    Tuesday, January 23, 2018
    7 years ago
Abstract
A performance and power optimized computer system architecture and method leveraging power optimized tree fabric interconnect are disclosed. One embodiment builds low power server clusters leveraging the fabric with tiled building blocks while another embodiment implements storage solutions or cooling solutions. Yet another embodiment uses the fabric to switch non-Ethernet packets, switch multiple protocols for network processors and other devices.
Description
BACKGROUND


FIGS. 1 and 2 show a classic data center network aggregation as is currently well known. FIG. 1 shows a diagrammatical view of a typical network data center architecture 100 wherein top level switches 101a-n are at the tops of racks 102a-n filled with blade servers 107a-n interspersed with local routers 103a-f. 105a-b and additional rack units 108a-n contain additional servers 104e-k and routers 106a-g. FIG. 2 shows an exemplary physical view 110 of a system with peripheral servers 111a-bn arranged around edge router systems 112a-h, which are placed around centrally located core switching systems 113. Typically such an aggregation 110 has 1-Gb Ethernet from the rack servers to their top of rack switches, and often 10 Gb Ethernet ports to the edge and core routers.





BRIEF DESCRIPTION OF THE DRAWINGS


FIGS. 1 and 2 illustrate a typical data center network aggregation;



FIG. 3 illustrates a network aggregation using a server in accordance with one embodiment;



FIG. 4 illustrates a data center in a rack according to one embodiment;



FIG. 5 shows a high level topology of a network system with a switching fabric;



FIG. 6 illustrates a server board that composes multiple server nodes interconnected with the described point-to-point interconnect;



FIGS. 6a-6c illustrates another example of the fabric topology;



FIG. 7 illustrates an example of a passive backplane connected to one or more node boards and two aggregation boards;



FIG. 8 shows an example of extending the fabric across shelves and linking shelves across a server rack;



FIG. 9a shows an exemplary server 700 with a disk form factor;



FIGS. 9b and 9c show exemplary arrays of disk-server combination according to one embodiment using a storage server 1-node SATA board;



FIG. 9d illustrates a standard 3.5 inch drive;



FIG. 9e illustrates an implementation of multiple server nodes in a standard 3.5 inch disk drive form factor;



FIG. 10 illustrates an implementation of deeply integrated servers with storage;



FIG. 11 illustrates an implementation of a dense packing of storage and servers leveraging an existing 3.5 inch JBOD storage box;



FIG. 12 illustrates an implementation of a server node instanced in the same form factor of a 2.5 inch drive;



FIG. 13 illustrates an implementation of rack chimney cooling;



FIG. 13a shows an exemplary illustration of the heat convection used in the chimney rack cooling shown in FIG. 13;



FIG. 14 illustrates server nodes that are placed diagonally with respect to each other to minimize self-heating across server nodes;



FIG. 15 shows an exemplary 16-node system according to one embodiment with heat waves rising from printed circuit boards;



FIG. 16 shows a higher-density variant of the 16-node system with nodes similarly arranged to minimize self-heating across the nodes;



FIG. 17 illustrates the internal architecture of a server node fabric switch;



FIG. 18 illustrates a server node that includes a PCIe controller connected to the internal CPU bus fabric;



FIG. 18a illustrates a system with multiple protocol bridges using the fabric switch;



FIG. 19 illustrates integration of the server fabric with a network processor;



FIG. 20 illustrates the fabric switch and a FPGA that provides services such as IP Virtual Server (IPVS);



FIG. 21 illustrates a way to build OpenFlow flow processing into the Calxeda fabric;



FIG. 22 illustrates one example of an integration of the power optimized fabric switch to an existing processor via PCIe; and



FIG. 23 illustrates one example of an integration of the power optimized fabric switch to an existing processor via Ethernet.





DETAILED DESCRIPTION OF ONE OR MORE EMBODIMENTS

A performance and power optimized computer system architecture and method leveraging power optimized tree fabric interconnect are disclosed. One embodiment builds low power server clusters leveraging the fabric with tiled building blocks while another embodiment implements storage solutions or cooling solutions. Yet another embodiment uses the fabric to switch other things.


Co-pending patent application Ser. No. 12/794,996 describes the architecture of a power optimized server communication fabric that support routings using a tree-like or graph topology that supports multiple links per node, where each link is designated as an Up, Down, or Lateral link, within the topology. The system uses a segmented MAC architecture which may have a method of re-purposing MAC IP addresses for inside MACs and outside MACs, and leveraging what would normally be the physical signaling for the MAC to feed into the switch. The Calxeda XAUI system interconnect reduces power, wires and the size of the rack. There is no need for high powered, expensive Ethernet switches and high-power Ethernet Phys on the individual servers. It dramatically reduces cables (cable complexity, costs, significant source of failures). It also enables a heterogeneous server mixture inside the rack, supporting any equipment that uses Ethernet or SATA or PCIe. In this architecture, power savings is primarily from two architectural aspects: 1) the minimization of Ethernet Phys across the fabric, replacing them with point to point XAUI interconnects between nodes, and 2) the ability to dynamically adjust the XAUI width and speed of the links based upon load.



FIG. 3 shows a network aggregation 200. This network supports 10-Gb/sec Ethernet communication 201 (thick lines) between aggregation router 202 and three racks 203a-c. In rack 203a the Calxeda interconnect fabric provides multiple high-speed 10 Gb paths, represented by thick lines, between servers 206a-d on shelves within a rack. The embedded switch in servers 206a-d can replace a top-of-rack switch, thus saving a dramatic amount of power and cost, while still providing a 10 Gb Ethernet port to the aggregation router. The Calxeda switching fabric can integrate traditional Ethernet (1 Gb or 10 Gb) into the Calxeda XAUI fabric, and the Calxeda servers can act as a top of rack switch for third-party Ethernet connected servers.


Middle rack 203b shows another scenario where Calxeda servers 206e,f can integrate into existing data center racks that contain a top-of-rack switch 208a. In this case, the IT group can continue to have their other servers connected via 1 Gb Ethernet up to the existing top-of-rack switch. Calxeda internal servers can be connected via Calxeda 10 Gb XAUI fabric, and they can integrate up to the existing top-of-rack switch with either a 1 Gb or 10 Gb Ethernet interconnect. Rack 203c, on the right, is the current way that data center racks are traditionally deployed. The thin red lines represent 1 Gb Ethernet. So, the current deployments of data center racks is traditionally 1 Gb Ethernet up to the top-of-rack switch 308b, and then 10 Gb (thick red line 201) out from the top of rack switch to the aggregation router. Note that all servers are present in an unknown quantity, while they are pictured here in finite quantities for purposes of clarity and simplicity. Also, using the enhanced Calxeda servers, no additional routers are needed, as they operate their own XAUI switching fabric, discussed below.



FIG. 4 shows an overview of an exemplary “data center in a rack” 400, according to one embodiment. It has 10-Gb Ethernet PHY 401a-n and 1-Gb private Ethernet PHY 402. Large computers (power servers) 403a-n support search; data mining; indexing; Hadoop, a Java software framework; MapReduce, a software framework introduced by Google to support distributed computing on large data sets on clusters of computers; cloud applications; etc. Computers (servers) 404a-n with local flash and/or solid-state disk (SSD) support search, MySQL, CDN, software-as-a-service (SaaS), cloud applications, etc. A single, large, slow-speed fan 405 augments the convection cooling of the vertically mounted servers above it. Data center 400 has an array 406 of hard disks, e.g., in a Just a Bunch of Disks (JBOD) configuration, and, optionally, Calxeda servers in a disk form factor (the green boxes in arrays 406 and 407), optionally acting as disk controllers. Hard disk servers or Calxeda disk servers may be used for web servers, user applications, and cloud applications, etc. Also shown are an array 407 of storage servers and historic servers 408a, b (any size, any vendor) with standard Ethernet interfaces for legacy applications.



FIG. 5 shows a high-level topology 500 of the network system described in co-pending patent application Ser. No. 12/794,996 that illustrates XAUI connected SoC nodes connected by the switching fabric. The 10 Gb Ethernet ports Eth0501a and Eth1501b come from the top of the tree. Ovals 502a-n are Calxeda nodes that comprise both computational processors as well as the embedded switch. The nodes have five XAUI links connected to the internal switch. The switching layers use all five XAUI links for switching. Level 0 leaf nodes 502d, 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, PCIe, SATA, etc., for attachment to I/O. The vast majority of trees and fat trees have active nodes only as leaf nodes, and the other nodes are pure switching nodes. This approach makes routing much more straightforward. Topology 500 has the flexibility to permit every node 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 topology 500 let the I/O be on any node. In general, placing the Ethernet at the top of the tree minimizes the average number of hops to the Ethernet.


Building Power Optimized Server Fabric Boards Using Tiled Building Blocks


FIG. 6 illustrates a server board that composes multiple server nodes interconnected with the described point-to-point interconnect. The server board has:

    • Each of the ovals in this diagram is a standalone server node that includes processor, memory, I/O, and the fabric switch.
    • The fabric switch has the ability to dynamically modify the width (number of lanes) and speed of each lane for each link independently.
    • The 14 node board example shows two Ethernet escapes from the fabric. These Ethernet escapes would usually be routed to a standard Ethernet switch or router. These Ethernet escapes can be either standard 1 Gb or 10 Gb Ethernet.
    • The 14 node example topology is a butterfly fat tree which provides redundant paths to allow adaptive routing to both route around faults and route around localized hot spots.
    • The 3 node aggregator board allows the composition of large server fabrics with only two board tiles.
    • For redundancy, add 2nd aggregator
    • In/Out:
      • PCIe connector for smooth-stone fabric
      • Optionally Ethernet support (Off, 1, 2, 5, 10 or 20 Gbs)
      • Ethernet decision based on bandwidth required for application
    • The nodes on the aggregator board can be either just switching nodes, or full computational nodes including switching.
    • The board in/out may be PCIe connector that supports two x4 XAUI (2 smooth-stone fabric link) and/or optional Ethernet support (Off, 1, 2, 10 or 20 Gbs).
    • Example fabric topologies like the 14-node example minimize the number of links that span off the board to minimize connectors (size and number) and associated costs, while still retaining Ethernet escapes and multi-path redundancy.
    • Two aggregator boards can be used to achieve path redundancy when extending the fabric.
    • Power savings can be achieved with static link configuration
      • Lower layer nodes in the figure (noted as Leaf Nodes) can be run at 1 Gb/sec.
      • 1st layer switching nodes in the figure (noted as Layer 1 Switches) would then have an incoming bandwidth from the Leaf Nodes of 3 Gb/sec. This allows a static link configuration between the Layer 1 and Layer 2 switches of either 2.5 or 5 Gb/sec.
      • The links extending off the Layer 2 Switches layer can then run at 10 Gb/sec.
      • In this topology, since the bulk of the nodes are Leaf Nodes, the bulk of the links are running at the slowest rate (1 Gb/sec in this example), thus minimizing networking power consumption.
      • Allows Ethernet escapes to be pulled at any node in the fabric allowing fabric designers to trade off needed bandwidth of the Ethernet escapes, the number of ports utilized by top of rack switches, and the costs and power associated with the Ethernet ports.
    • Power savings can be further optimized via dynamic link configuration driven by link utilization. In this example, each link and associated port of the fabric switch contains bandwidth counters, with configurable threshold events that allow for the reconfiguration of the link width and speed, both up and down, based upon the dynamic link utilization.
    • Since in many common server use cases, the Ethernet traffic is primarily node to external Ethernet and not node to node, the proposed tree fabric structure, and specifically the butterfly fat tree example, minimizes the number of hops across the fabric to Ethernet, thus minimizing latency. This allows the creation of large low latency fabrics to Ethernet while utilizing switches that have a relatively small (in this example 5) number of switching ports.
    • The integration of server 209a in FIG. 2 illustrates another novel system use of the defined server fabric. In this case, to take advantage of the performance and power management of the server fabric, and to minimize port utilization on the top of rack switch, this figure shows a heterogeneous integration of existing servers onto the defined server fabric such that Ethernet traffic from existing servers can be gateway'ed into the fabric, allowing communication with nodes within the fabric, as well as having 209a Ethernet traffic carried through the fabric to the uplink Ethernet port 201.



FIGS. 6a-6c illustrates another example of the fabric topology that is a forty eight node fabric topology that consists of 12 cards, where each card contains 4 nodes, connecting into a system board. This topology provides some redundant links are provided, but without heavy redundancy. The topology has four Ethernet gateway escapes and each of these could be either 1 Gb or 10 Gb, but not all of these Ethernet gateways need to be used or connected. In the example shown, eight fabric links are brought off the quad-node card and, in one example, a PCIe x16 connector is used to bring 4 fabric links off the card.


Summary/Overview of Building Power Optimized Server Fabric Boards Using Tiled Building Blocks

    • 1. A server tree fabric that allows an arbitrary number of Ethernet escapes across a server interconnect fabric, to minimize the number of Ethernet Phys utilized to save power and costs associated with the Ethernet Phys, associated cables, and ports consumed on top of rack Ethernet switches/routers.
    • 2. The switching nodes can be either pure switching nodes saving power by turning off computational subsystems, or can be used as complete computational subsystems including fabric switching. Referring to FIG. 17, in one implementation, multiple power domains are used separate the computational subsystem, block 905, from the management processor, block 906, and the fabric switch, the remainder of the blocks. This allows the SOC to be configured with the computational subsystem, block 905, powered off, retaining management processing in block 906, and hardware packet switching and routing done by the fabric switch.
    • 3. The Butterfly Fat Tree topology server fabric provides for minimal number of links within a board (saving power and costs), minimal number of links spanning boards (saving power and costs) while allowing for redundant link paths both within and across boards.
    • 4. The proposed base board and aggregator board allows scalable fault-resilient server fabrics to be composed with only two board building blocks.
    • 5. Tree oriented server fabrics, and variants like the example butterfly fat tree, allow for static link width and speed specification that can be determined by the aggregate bandwidth of children nodes of that node, allowing for easy link configuration while minimizing interconnect power.
    • 6. Power savings can be further optimized via dynamic link configuration driven by link utilization. In this example, each link and associated port of the fabric switch contains bandwidth counters, with configurable threshold events that allow for the reconfiguration of the link width and speed, both up and down, based upon the dynamic link utilization.
    • 7. Since in many common server use cases, the Ethernet traffic is primarily node to external Ethernet and not node to node, the proposed tree fabric structure, and specifically the butterfly fat tree example, minimizes the number of hops across the fabric to Ethernet, thus minimizing latency. This allows the creation of large low latency fabrics to Ethernet while utilizing switches that have a relatively small (in this example 5) number of switching ports.
    • 8. Allows heterogenous server integration to the fabric carrying Ethernet traffic from existing servers into and through the defined server communication fabric.


Building Power Optimized Server Shelves and Racks Using Tiled Building Blocks

Now these board “tiles” can be composed to construct shelves and racks of fabric connected server nodes. FIG. 7 shows an example of how a passive backplane can connect 8 14-node boards and two aggregation boards to compose a shelf consisting of 236 server nodes. Each board may be, for example, 8.7″ tall+mechanical<10.75″ for 6 U, interleave heat sinks for density and 16 boards fit in a 19 inch wide rack. The backplane may be simple/cheap with a PCIe connectors and routing wherein the routing may be XAUI signals (blue&green)+Power which is very simple without wires. Ethernet connections shown at 8 board aggregation point.



FIG. 8 shows an example of extending the fabric across shelves, linking shelves across a server rack. The Ethernet escapes can be pulled at any node in the fabric, in this example, they are pulled from the passive interconnect backplane connecting the multi-node blades.


Summary/Overview of Building Power Optimized Server Shelves and Racks Using Tiled Building Blocks

    • 1. Utilization of a PCIe connector to bring out the Ethernet escapes and XAUI links off a board to connect boards together with a point to point server fabric, utilizing not the PCIe signaling, but using the physical connector for the power and XAUI signals of the board, while maintaining redundant communication paths for fail-over and hotspot reduction.
    • 2. XAUI point-to-point server interconnect fabric formed with a fully passive backplane.
    • 3. Ethernet escapes across a fabric spanning the rack at every level of tree, not just at the top of the tree.
    • 4. Ethernet escapes across the fabric can be dynamically enabled and disabled to match bandwidth with optimized power usage.
    • 5. Node to node traffic, including system management traffic stays on the fabric spanning a rack without ever traversing through a top of rack Ethernet switch.


Storage


FIG. 9a shows an exemplary server 700 with a disk form factor, typically such as a standard 2.3-inch or 3.5-inch hard disk drive (HDD) with SCSI or SATA drive, according to one embodiment. Server board 701 fits in the same infrastructure as disk drive 702 in a current disk rack. Server 701 is a full server, with DDR, server-on-a-chip SoC, optional flash, local power management, SATA connections to disks (1-16 . . . limited by connector size). Its output could be Ethernet or Calxeda's fabric (XAUI), with two XAUI outputs for fail-over. Optionally, it could use PCIe instead of SATA (SSDs or other things that need PCIe), with 1 through 4 nodes to balance compute vs. storage needs. Such a server could do RAID implementation as well as LAMP stack server applications. Use of Calxeda ServerNode™ on each disk would offer a full LAMP stack server with 4 GB of DDR3, and multiple SATA interfaces. Optionally, a second node for 8 GB of DDR could be added if needed.



FIGS. 9b and 9c show exemplary arrays 710 and 720, respectively, of disk-server combinations 700a-n, according to one embodiment, using a storage server 1-node SATA board as discussed above. Connection by some high speed network or interconnect, either standard or proprietary, eliminates the need for a large Ethernet switch, saving power, cost, heat and area. Each board 701 is smaller than the height and depth of the disk. The array may be arranged with alternating disks and board, as shown in FIG. 7b, or one board can server multiple disks, for example, in a disk, disk, board, disk, disk arrangement, as shown in FIG. 7c. Thus computing power may be matched to disk ratio in flexible fashion. Connectivity of boards 701a-n may be on a per node basis, with SATA used to hook to disk and multiple SATAs to hook to multiple disks. It may also be on a node to node basis, with two XAUIs in the fabric configuration, as discussed earlier, as well as in application 61/256,723 in each node, for redundancy. Nodes are connected through the XAUI fabric. Such connections could be of a tree or fat-tree topology, i.e., node to node to node to node, with deterministic, oblivious, or adaptive routing moving data in the correct direction. Alternatively, an all-proprietary interconnect could be used, going to other processing units. Some ports could go to an Ethernet output or any other I/O conduit. Each node could go directly to Ethernet, inside the “box,” or XAUI to an XAUI aggregator (switch) then to PHY, or XAUI to PHY. Or any combination of the above could be used. In yet other cases, SATA connections could be replaced with PCIe connections, using SSDs with PCIe connections. Some SSDs are going into disk form factors with PCIe or SATA. Or PCIe and SATA could be mixed. Ethernet out of the box could be used instead of XAUI for system interconnection. In some cases, for example, standard SATA connectors may be used, but in other cases higher-density connectors with proprietary wiring through a proprietary backplane could be made.


In yet another case, a server function could be within a disk drive, offering a full server plus a disk in a single disk drive form factor. For example, the ServerNode™ could be put on the board inside a disk. This approach could be implemented with XAUI or Ethernet connectivity. In such a case, a server-on-a-chip approach known to the inventor could be used as a disk controller plus server. FIG. 9d illustrates this concept. A standard 3.5 inch drive is shown in FIG. 9d, item 9d0. It has an integrated circuit card 9d1 that controls the disk drive. A significant amount of space is unused within the drive, noted by 9d2 in which the Calxeda low-power, small server node PCB can be formed to fit within this unused space within the disk drive.



FIG. 9e illustrates an implementation of putting multiple server nodes in a standard 3.5 inch disk drive form factor. In this case, connectors from the server PCB to the backplane exports the XAUI based server fabric interconnect to provide network and inter-server communication fabric, as well as 4 SATA ports for connection to adjacent SATA drives.



FIG. 10 illustrates an implementation for deeply integrating servers with storage. Server node (101) shows a complete low-power server that integrates computational cores, DRAM, integrated I/O, and the fabric switch. In this example, server node 101 is shown in the same form factor as a standard 2½ inch disk drive (102). (103) illustrates combining these server nodes and disk drives in a paired one-to-one fashion, where each server node has it's own local storage. (104) shows the server node controlling 4 disk drives. System (105) illustrates combining these storage servers via the unifying server fabric, and then in this example pulling four 10-Gb/sec Ethernet escapes from the fabric to connect to an Ethernet switch or router.



FIG. 11 illustrates a concrete realization of this dense packing of storage and servers by illustrating a usage leveraging an existing 3.5 inch JBOD (Just a Bunch of Disks) storage box. In this case the JBOD mechanicals including disk housing is unchanged, but storage nodes are shown paired one-to-one with disk drives within the unmodified JBOD box. This illustrates a concept where the server nodes are pluggable modules that plug into an underlying motherboard that contains the fabric links. In this illustration, this standard JBOD box houses 23 3.5 inch disks (shown as rectangles in the logical view), and this figure shows 31 server nodes (shown as ovals/circles in the logical view) contained within the JBOD box controlling the 23 disks, and exposing two 10 Gb/sec Ethernet links (shown as dark wide lines in the logical view). This tightly integrated server/storage concept takes an off-the-shelf storage only JBOD box, and then adds 31 server nodes in the same form factor communicating over the power optimized fabric. This maps very well to applications that prefer to have local storage.



FIG. 12 shows a related concept that leverages the fact that the server nodes can be instanced in the same form factor of a 2.5 inch drive. In this case, they are integrated into a 2.5 inch JBOD that has 46 disks. This concept shows 64 server nodes integrated in the same form factor of the JBOD storage. In this example, two 10 Gb Ethernet links are pulled from the fabric, as well as a 1 Gb/sec management Ethernet link.


Summary/Overview of Storage

    • 1. Utilization of a PCIe connector to bring out the Ethernet escapes and XAUI links off a board to connect boards together with a point to point server fabric, utilizing not the PCIe signaling, but using the physical connector for the power and XAUI signals of the board, while maintaining redundant communication paths for fault resilience and load balancing.
    • 2. Utilization of the defined server fabric to transform existing JBOD storage systems by pairing small form-factor low-power fabric-enabled server nodes with the disks providing very high-density compute servers, tightly paired with local storage, integrated via the power and performance optimized server fabric to create new high-performance computational server and storage server solutions without impact the physical and mechanical design of the JBOD storage system.
    • 3. For use in a high density computing system, a method of encapsulating complete servers in the form factors of hard disk drives, for the purposes of replacing some of the drives with additional servers.
    • 4. As in claim 3, wherein the servers are connected via and additional switching fabric to a network
    • 5. As in claim 3, wherein the backplane in the enclosure holding the drives is replaced with a backplane suitable for creating at least one internal switching pathway.
    • 6. For use in a high-density storage system, a method of integrating a low-power server PCB into the empty space within a standard 3.5 inch disk drive, providing integrated compute capabilities within the disk drive.


Cooling of Rack Integrated Low-Power Servers

One aspect of driving to low-power computer server solutions is the management of heat, cooling, and air movement through the rack and across the boards. Minimization of fans is one aspect of lowering total cost of ownership (TCO) of low-power servers. Fans add cost, complexity, reduce reliability due to the moving parts, consume a significant amount of power, and produce a significant amount of noise. Reduction and removal of fans can provide significant benefits in reliability, TCO, and power consumption.



FIG. 13 illustrates a novel implementation of rack chimney cooling that supports chimney cooling through the entire rack or in just a segment of the rack. An important aspect is the single fan in a chimney rack concept, which uses natural convection upward with help from one fan. A large fan, cooling the entire rack, can be slow speed. It may be positioned at the bottom, or within the rack below the vertically mounted convection cooled subset of the rack. As cool air comes in the bottom, the fan pushes it through the chimney and out the top. Because all boards are vertical, there is no horizontal blockage. Although in this example, the fan is shown at the bottom of the rack, it can be anywhere in the system. That is, the system could have horizontal blocking with “classic” cooling—under the vent and fan—leaving the top as a vertical chimney. This vertical, bottom-cooled approach can work on a small system. The fan can be variable speed and temperature dependent.



FIG. 13a shows an exemplary illustration of the novel principles of heat convection 500 used in the chimney rack concept. Placing the components at an angled alignment causes heat streams 501a-n to rise from heat-emanating Double Data Rate (DDR) memory chips 503a-n on a printed circuit board 502, so those heat emanating chips don't form heat backup or mutual heat ups. In this example, the DDR chips are placed diagonally with one another, not stacked vertically, because they tend to heat one another. Also, the DDR chips are placed above, not below, the large computing chips 504a, such as ASICs, SOCs, or processors, because they would tend to heat the SOCs. And the coolest chips, the flash chips 506, is placed below the SOCs. Likewise, nodes are not stacked vertically, as discussed below. FIG. 14 extends this concept to show how server nodes are placed diagonally with respect to each other to minimize self-heating across server nodes.



FIG. 15 shows an exemplary 16-node system, according to one embodiment, with heat waves rising from printed circuit boards. For a typical 16-node system, individual are arranged so that the heat rising from each unit does not heat the unit above. The overall enclosure would typically be longer, less tall, and less dense. Also, rather than mount PCBs diagonally as shown, PCBs could be squarely aligned and be rectangular, but components could be placed in a diagonal alignment to minimize mutual heating. PCBs in different rows could either have complementary layouts or could be staggered accordingly to reduce mutual heating. Similarly, FIG. 16 shows a higher-density variant of the 16-node system with nodes similarly arranged to minimize self-heating across the nodes.


An additional cooling concept for racks of low power servers is to use a pneumatic air pressure differential to create an upward air flow, without requiring fans. The technique for doing this is to create an sealed rack with an extended vertical vent pipe for the air. This vent pipe must be tall enough (approximately 20-30 feet+) to create sufficient air pressure differential to create the upward air flow. This provides a totally passive air movement and cooling system for the rack of low power servers.


Summary/Overview of Cooling of Rank Mounted Low Power Servers

    • 1. For use in a high density computing system, a method of placing heat-emanating components on a vertically placed mounting board,
    • wherein none of the heat-emanating component is placed directly above or below another heat-emanating component,
    • 2. As claim 1, wherein the components are arranged in a substantially diagonal arrangement across the mounting board
    • 3. As in claim 1, wherein the components are arranged in several substantially cross diagonal arrangements across the mounting board
    • 4. As in claims 1, 2 and 3, wherein the mounting board is a Printed Circuit Board


Server Fabric Switching of Non-Ethernet Packets

As described in co-pending patent application Ser. No. 12/794,996, FIG. 17 illustrates the internal architecture of a server node fabric switch. FIG. 17 shows a block diagram of an exemplary switch 900 according to one aspect of the system and method disclosed herein. It has four areas of interest 910a-d. Area 910a corresponds to Ethernet packets between the CPUs and the inside MACs. Area 910b corresponds to Ethernet frames at the Ethernet physical interface at the inside MACs, that contains the preamble, start of frame, and inter-frame gap fields. Area 910c corresponds to Ethernet frames at the Ethernet physical interface at the outside MAC, that contains the preamble, start of frame, and inter-frame gap fields. Area 910d corresponds to Ethernet packets between the processor of routing header 901 and outside MAC 904. This segmented MAC architecture is asymmetric. The inside MACs have the Ethernet physical signaling interface into the routing header processor, and the outside MAC has an Ethernet packet interface into the routing header processor. Thus the MAC IP is re-purposed for inside MACs and outside MACs, and what would normally be the physical signaling for the MAC to feed into the switch is leveraged. MAC configuration is such that the operating system device drivers of A9 cores 905 manage and control inside Eth0 MAC 902 and inside ETH1 MAC 903. The device driver of management processor 906 manages and controls Inside Eth2 MAC 907. Outside Eth MAC 904 is not controlled by a device driver. MAC 904 is configured in Promiscuous mode to pass all frames without any filtering for network monitoring. Initialization of this MAC is coordinated between the hardware instantiation of the MAC and any other necessary management processor initialization. Outside Eth MAC 904 registers are visible to both A9905 and management processor 906 address maps. Interrupts for Outside Eth MAC 904 are routable to either the A9 or management processor.


It is key to node that the Routing Header processor 910d adds a fabric routing header to the packet when packets are received from a MAC headed to the switch, and removes the fabric routing header when the packet is received from the switch heading to a MAC. The fabric switch itself only routes on node IDs, and other information, contained in the fabric routing header, and does no packet inspection of the original packet.


Distributed PCIe Fabric



FIG. 18 illustrates a server node that includes a PCIe controller connected to the internal CPU bus fabric. This allows for the creation of a novel PCIe switching fabric that leverages the high performance, power optimized server fabric to create a scalable, high-performance, power optimized PCIe fabric.


The technique follows:

    • PCIe controller 902 connects to Mux 902a allowing the PCIe controller to connect directly to the external PCIe Phy, or to the PCIe Routing Header Processor 910c. When Mux 902a is configured to direct PCIe traffic to the local PCIe Phy, this is equivalent to the standard local PCIe connection. When Mux 902a is configured to direct PCIe traffic to the PCIe Routing Header Processor 910c, this enables the novel PCIe distributed fabric switch mechanism.
    • PCIe Routing Header Processor 910c utilizes the embedded routing information within the packet (address, ID, or implicit) to create the fabric routing header that maps that PCIe packet route to the destination fabric node PCIe controller.
    • This provides similar advantages to the distributed PCIe fabric that the server fabric provides to networking.
    • PCIe transactions sourced from the processor cores (905) can be routed to local PCIe Phy (via either the Mux bypass or via the switch), can be routed to any other node on the fabric, directly to the inside PCIe controller (902) or to the outside PCIe controller/Phy (904).
    • Likewise, incoming PCIe transactions enter the outside PCIe controller (904), get tagged with the fabric routing header by the PCIe Routing Header Processor (910), and then the fabric transports the PCIe packet to its final target.


Distributed Bus Protocol Fabric


FIG. 18a illustrates an additional extension that shows that multiple protocol bridges can take advantage of the fact that the fabric switch routes on the routing header, not directly on the underlying packet payload (e.g. a layer 2 Ethernet frame). In this illustration, 3 protocol bridges are shown: Ethernet, PCIe, and a Bus Protocol bridge.


The role of the bus protocol bridge is to take the processor or internal SOC fabric protocol, packetize it, add a Calxeda fabric routing header, and then route it through the Calxeda fabric.


As a tangible example, consider a bus protocol such as AMBA AXI, HyperTransport, or QPI (Quick Path Interconnect) within an SOC.


Consider the following data flow:

    • A processor on the internal SOC bus fabric issues a memory load (or store) request.
    • The physical address target for the memory operation has been mapped to a remote node on the fabric.
    • The bus transaction traverses through the bus protocol bridge:
      • The bus transaction is packetized
      • The physical address for the memory transaction is mapped to a remote node, that node ID is used when building the routing header.
      • A routing frame is built by the bus protocol bridge consisting of a routing header with the remote node ID, and the payload being the packetized bus transaction.
    • The bus transaction routing frame passes through the Fabric Switch, traverses through the fabric, and is received by the target node's frame switch.
    • The target node bus protocol bridge unpacks the packetized bus transaction, issues the bus transaction into the target SOC fabric, completes the memory load, and returns the result through the same steps, with the result flowing back to the originating node.


Network Processor Integration with Server Fabric


FIG. 19 shows an illustration of integrating the server fabric with Network Processors (911). There are several use cases for the integration of the server fabric with Network Processors, including:

    • The Network processors can serve as network packet processing accelerators to both the local processors (905), as well as any other processor on the fabric.
    • Can be a Network Processor centric design, where the incoming packets from the external Ethernet are targeted to the Network Processors, and the Network Processors and the Control Plane processing can be offloaded to the larger processor cores (905).
    • The server fabric can serve as a communication fabric between the network processors.


To enable these novel use cases, the network processors are assigned a MAC address. In the switch architecture shown in FIG. 19, there are not Routing Header Processors attached to Port 1-4. So agents connected directly to Ports 1-4 need to inject packets that have the Fabric Switch Header prepended to payload packet. The Network Processor adds fabric switch integration to their design by:

    • Outgoing packets from the Network Processor are tagged with the fabric switch header, which encodes the Destination Node ID from the Destination MAC.
    • Incoming packets to the Network Processor from the Fabric Switch have the fabric switch header removed before Ethernet packet processing.


Foreign Device Integration with Server Fabric


FIG. 19 shows an illustration of integrating the server fabric with arbitrary Foreign Devices (912). By Foreign Device, we mean any processor, DSP, GPU, I/O, or communication or processing device that needs an inter-device communication fabric. A typical use case would be a large processing system composed of DSP or GPU processors that need an interconnect fabric between the DSP or GPU processors.


The Fabric Switch routes packets based upon the fabric routing header, and does no packet inspection of the packet payload. The packet payload has no assumptions of being formatted as an Ethernet frame, and is treated completely as an opaque payload.


This allows Foreign Devices (e.g. DSP or GPU processors) to attach to the fabric switch and leverage the scalable, high performance, power optimized communication fabric by:

    • Adding a routing frame header contained the destination node ID of the packet to an arbitrary packet payload sending to the frame switch.
    • Stripping the routing frame header when receiving a packet from the frame switch.


Load Balancing

When considering a fabric topology such as illustrated in FIG. 5, each of the nodes in the fabric export at least one MAC address and IP address to provide external Ethernet connectivity through the gateway nodes shown in 501a and 501b.


Exposing these fine grained MAC and IP addresses is advantageous for large scale web operations that use hardware load balancers because it provides a flat list of MAC/IP addresses for the load balancers to operate against, with the internal structure of the fabric being invisible to the load balancers.


But, smaller data centers can be potentially over-whelmed with a potentially large number of new MAC/IP addresses that a high-density low-power server can provide. It is advantageous to be able to provide the option for load balancing to insulate external data center infrastructure from having to deal individually with a large number of IP addresses for tiers such as web serving.


Consider FIG. 20 where we have taken one port on the fabric switch and have added a FPGA that provides services such as IP Virtual Server (IPVS). This IP virtualization can be done a range of network levels including Layer 4 (Transport) and Layer 7 (Application). In many cases, it is advantageous for load balancing to be done at layer 7 for data center tiers such as web serving such that a http session state can be maintained locally by a specific web server node. The IPVS FPGA is only attached to the gateway nodes (nodes 501a and 501b in FIG. 5).


In this example, the fabric illustrated in FIG. 5, when augmented with the IPVS FPGAs on the gateway nodes, can export a single IP address per gateway node. The IPVS FPGA then load balances the incoming requests (e.g. HTTP requests) to the nodes within the fabric. With layer 4 load balancing, the IPVS FPGA can be done stateless, and use algorithms including round robin across nodes, or instancing a max number of requests per node before using the next node. With layer 7 load balancing, the IPVS FPGA will need to maintain state such that application sessions can be targeted to specific nodes.


The resulting flow becomes:

    • Incoming request (e.g. HTTP request) enters the gateway node (Port 0) in FIG. 20.
    • The fabric switch routing tables have been configured to direct the incoming traffic from Port 0 to the IPVS FPGA port on the fabric switch.
    • The IPVS FPGA rewrites the routing header to target a specific node within the fabric, and forwards the resulting packet to the target node.
    • The target node processes the request, and sends the results normally out the gateway node.


OpenFlow/Software Defined Networking Enabled Fabric

OpenFlow is a communications protocol that gives access to the forwarding plane of a switch or router over the network. OpenFlow allows the path of network packets through the network of switches to be determined by software running on a separate server. This separation of the control from the forwarding allows for more sophisticated traffic management than feasible today using ACLs and routing protocols. OpenFlow is considered an implementation of the general approach of Software Defined Networking.



FIG. 21 shows a way to build OpenFlow (or more generally software defined networking (SDF)) flow processing into the Calxeda fabric. Each of the gateway nodes would instance an OpenFlow enabled FPGA on a port of the gateway node's fabric switch. The OpenFlow FPGA needs an out-of-band path to the control plane processor, this can be done by a separate networking port on the OpenFlow FPGA, or can be done by simply claiming another port off the fabric switch to talk to the control plane processor.


The resulting flow becomes:

    • Incoming request enters the gateway node (Port 0) in FIG. 20.
    • The fabric switch routing tables have been configured to direct the incoming traffic from Port 0 to the OpenFlow/SDF FPGA port on the fabric switch.
    • The OpenFlow/SDF FPGA implements standard OpenFlow processing, including optionally contacting the control plane processor if necessary. The OpenFlow/SDF FPGA rewrites the routing header to target a specific node within the fabric (by MAC address), and forwards the resulting packet to the target node.
    • The target node processes the request, and sends the results back to the OpenFlow FPGA where it implements any outgoing flow processing.


Integration of Power Optimized Fabric to Standard Processors Via PCIe

The power optimized server fabric depicted in FIG. 5 and described previously provide compelling advantages to existing standard processors and can be integrated as an integrated chip solution with existing processors. Standard desktop and server processors often support PCIe interfaces either directly, or via an integrated chipset. FIG. 22 illustrates one example of an integration of the power optimized fabric switch to an existing processor via PCIe. Item 22a depicts a standard processor that supports one or more PCIe interfaces, either directly, or via an integrated chipset. Item 22b depicts the disclosed fabric switch with integrated Ethernet MAC controllers to which a PCIe interface has been integrated. Item 22b may typically be integrated together utilizing a FPGA or ASIC implementation of the PCIe integrated fabric switch.


In this disclosure, the nodes depicted in FIG. 5 can be a heterogenous combination of power-optimized server SOCs with the integrated fabric switch, as well as this disclosed integration of PCIe connected standard processor to a PCIe interfaced module containing the Ethernet MACs and the fabric switch.


Integration of Power Optimized Fabric to Standard Processors Via Ethernet

The power optimized server fabric depicted in FIG. 5 and described previously provide compelling advantages to existing standard processors and can be integrated as an integrated chip solution with existing processors. Standard desktop and server processors often support Ethernet interfaces via an integrated chip, or potentially provided within an SOC. FIG. 23 illustrates one example of an integration of the power optimized fabric switch to an existing processor via Ethernet. Item 23a depicts a standard processor that supports an Ethernet interface, either by means of an SOC, or via an integrated chip. Item 23b depicts the disclosed fabric switch without the integrated inside Ethernet MAC controllers. Item 23b may typically be integrated together utilizing a FPGA or ASIC implementation of the integrated fabric switch.


In this disclosure, the nodes depicted in FIG. 5 can be a heterogenous combination of power-optimized server SOCs with the integrated fabric switch, as well as this disclosed integration of Ethernet connected standard processor to the integrated fabric switch implemented in an FPGA or ASIC.


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 computing device comprising: a plurality of server nodes interconnected by a plurality of fabric links to form a server fabric, wherein the plurality of server nodes are grouped on a server board; andone or more Ethernet escapes from the server fabric, wherein the one or more Ethernet escapes are configured to connect the server fabric to one or more ports external to the server fabric, and wherein the one or more Ethernet escapes are further configured to be pulled at any node in the plurality of server nodes to conserve bandwidth and power;wherein a speed of each of the plurality of fabric links is configured to be dynamically adjustable based on a utilization of a particular fabric link to optimize power; andwherein each server node that is grouped on the server board includes: a processor;a memory;an input/output circuit; andan internal fabric switch, wherein the internal fabric switch is located on the server node and is configured to connect the server node to the server fabric and to switch information in the server fabric.
  • 2. The computing device of claim 1, further comprising an aggregate of a set of server boards, wherein each of the server boards includes one or more of the plurality of server nodes, and wherein the set of server boards are interconnected to form a server.
  • 3. The computing device of claim 1, wherein the internal fabric switches are configured to switch Ethernet layer 2 packets appended with routing headers.
  • 4. The computing device of claim 1, wherein a speed of each of the plurality of fabric links is set to optimize power.
  • 5. The computing device of claim 1, wherein the speed is dynamically adjustable based on an instantaneous utilization of a particular fabric link or an average utilization of the particular fabric link.
  • 6. The computing device of claim 2, wherein one or more of the plurality of fabric links and the one or more Ethernet escapes each comprise a peripheral component interconnect express (PCIe) connector that is connected to the set of server boards.
  • 7. The computing device of claim 1, further comprising a passive backplane that comprises a point-to-point server interconnect fabric.
  • 8. The computing device of claim 1, wherein the server fabric has a topology of a tree, and wherein the one or more Ethernet escapes are disposed at each level of the tree.
  • 9. The computing device of claim 1, wherein each of the one or more Ethernet escapes is configured to be enabled or disabled in accordance with a bandwidth that is configured to match with optimized power usage.
  • 10. The computing device of claim 1, wherein data between the plurality of server nodes is configured to route in the server fabric but not the one or more Ethernet escapes.
  • 11. The computing device of claim 3, wherein each of the plurality of server nodes is configured to have computational components thereon turned off in response to power reducing.
  • 12. The computing device of claim 1, further comprising a plurality of server boards that are configured to form a rack or a backplane.
  • 13. The computing device of claim 12, further comprising a plurality of shelves that are configured to compose a rack.
  • 14. A computing device, comprising: a storage device of a form factor; anda server node of the same form factor as the storage device, wherein the server node is connected to other server nodes by a plurality of fabric links, wherein a speed of each of the plurality of fabric links is configured to dynamically adjustable based on an utilization of a particular fabric link to optimize power, and wherein the server node includes: a processor;a memory;an input/output circuit;an internal fabric switch, wherein the internal fabric switch is located on the server node and is configured to connect the server node to a network and to switch information in the network; andone or more serial advanced technology attachment (SATA) interfaces configured to connect to the storage device;wherein the server node is configured to control the storage device.
  • 15. The computing device of claim 14, further comprising an array of storage devices and an array of server nodes, wherein the array of server nodes are interconnected to each other.
  • 16. The computing device of claim 14, wherein the server node is disposed within the storage device.
  • 17. The computing device of claim 14, wherein the server node is connected to the storage device, and wherein the storage device is a local storage for the server node.
  • 18. The computing device of claim 14, further comprising a plurality of storage devices, wherein each of the plurality of storage devices is connected to one of the one or more SATA interfaces, and wherein the server node is further configured to control the plurality of storage devices.
  • 19. The computing device of claim 14, further comprising a plurality of server nodes and a plurality of storage devices, wherein the plurality of server nodes are interconnected to form a server fabric, and wherein the plurality of server nodes are configured to control the plurality of storage devices.
  • 20. The computing device of claim 14, further comprising one or more Ethernet escapes and a link, wherein the one or more Ethernet escapes and the link each comprise a peripheral component interconnect express (PCIe) connector.
  • 21. A method for producing a high density computing system, the method comprising: encapsulating a server node into a form factor of a disk drive and positioning the server node at an angled alignment to facilitate cooling, wherein the server node is connected to other server nodes by a plurality of fabric links, wherein a speed of each of the plurality of fabric links is configured to be dynamically adjustable based on an utilization of a particular fabric link to optimize power, and wherein the server node includes: a processor;a memory;an input/output circuit;an internal fabric switch, wherein the internal fabric switch is located on the server node and is configured to connect the server node to a network and to switch information in the network; andone or more serial advanced technology attachment (SATA) interfaces connected to the disk drive; andcontrolling, by the server node, the disk drive.
  • 22. The method of claim 21, further comprising creating at least one internal switching pathway on a backplane of the disk drive.
  • 23. A method for producing a high density computing system, the method comprising: integrating a server node into a disk drive of a standard form factor and positioning the server node at an angled alignment relative to the disk drive to facilitate cooling, wherein the server node is connected to other server nodes by a plurality of fabric links, wherein a speed of each of the plurality of fabric links is configured to be dynamically adjustable based on an utilization of a particular fabric link to optimize power, andwherein the server node includes: a processor;a memory;an input/output circuit;an internal fabric switch, wherein the internal fabric switch is located on the server node and is configured to connect the server node to a network and to switch information in the network; andone or more serial advanced technology attachment (SATA) interfaces connected to the disk drive; andcontrolling, by the server node, the disk drive.
  • 24. The computing device of claim 1, wherein each server node of the plurality of server nodes is positioned at an angled alignment relative to the server board.
  • 25. The computing device of claim 14, further comprising a server board, wherein each server node is positioned on the server board at an angled alignment relative to the server board.
PRIORITY CLAIMS/RELATED APPLICATIONS

This application claims priority under 35 USC 120 to U.S. patent application Ser. No. 12/794,996 filed on Jun. 7, 2010 and entitled “System and Method for High-Performance, Low-Power Data Center Interconnect Fabric”, the entirety of which is incorporated herein by reference. In addition, this patent application claims the benefit under 35 USC 119(e) and 120 of U.S. Provisional Patent Application Ser. No. 61/383,585 filed on Sep. 16, 2010 and entitled “Performance and Power Optimized Computer System Architectures and Methods Leveraging Power Optimized Tree Fabric Interconnect”, the entirety of which is incorporated herein by reference.

US Referenced Citations (364)
Number Name Date Kind
5451936 Yang et al. Sep 1995 A
5594908 Hyatt Jan 1997 A
5623641 Kadoyashiki Apr 1997 A
5781187 Gephardt et al. Jul 1998 A
5901048 Hu May 1999 A
5908468 Hartmann Jun 1999 A
5968176 Nessett et al. Oct 1999 A
5971804 Gallagher et al. Oct 1999 A
6055618 Thorson Apr 2000 A
6141214 Ahn Oct 2000 A
6181699 Crinion et al. Jan 2001 B1
6192414 Horn Feb 2001 B1
6198741 Yoshizawa et al. Mar 2001 B1
6314487 Hahn et al. Nov 2001 B1
6314501 Gulick et al. Nov 2001 B1
6373841 Goh et al. Apr 2002 B1
6442137 Yu Aug 2002 B1
6446192 Narasimhan et al. Sep 2002 B1
6452809 Jackson et al. Sep 2002 B1
6507586 Satran et al. Jan 2003 B1
6556952 Magro Apr 2003 B1
6574238 Thrysoe Jun 2003 B1
6661671 Franke et al. Dec 2003 B1
6711691 Howard et al. Mar 2004 B1
6766389 Hayter et al. Jul 2004 B2
6813676 Henry et al. Nov 2004 B1
6816750 Klaas Nov 2004 B1
6842430 Melnik Jan 2005 B1
6857026 Cain Feb 2005 B1
6963926 Robinson Nov 2005 B1
6963948 Gulick Nov 2005 B1
6977939 Joy et al. Dec 2005 B2
6988170 Barroso et al. Jan 2006 B2
6990063 Lenoski et al. Jan 2006 B1
7020695 Kundu et al. Mar 2006 B1
7032119 Fung Apr 2006 B2
7080078 Slaughter et al. Jul 2006 B1
7080283 Songer et al. Jul 2006 B1
7095738 Desanti Aug 2006 B1
7119591 Lin Oct 2006 B1
7143153 Black et al. Nov 2006 B1
7165120 Giles et al. Jan 2007 B1
7170315 Bakker et al. Jan 2007 B2
7180866 Chartre et al. Feb 2007 B1
7203063 Bash et al. Apr 2007 B2
7257655 Burney et al. Aug 2007 B1
7263288 Islam Aug 2007 B1
7274705 Chang et al. Sep 2007 B2
7278582 Siegel et al. Oct 2007 B1
7310319 Awsienko et al. Dec 2007 B2
7325050 O'Connor et al. Jan 2008 B2
7337333 O'Conner et al. Feb 2008 B2
7340777 Szor Mar 2008 B1
7353362 Georgiou et al. Apr 2008 B2
7382154 Ramos et al. Jun 2008 B2
7386888 Liang et al. Jun 2008 B2
7418534 Hayter et al. Aug 2008 B2
7437540 Paolucci et al. Oct 2008 B2
7447147 Nguyen Nov 2008 B2
7447197 Terrell et al. Nov 2008 B2
7466712 Makishima et al. Dec 2008 B2
7467306 Cartes et al. Dec 2008 B2
7467358 Kang et al. Dec 2008 B2
7502884 Shah et al. Mar 2009 B1
7519843 Buterbaugh et al. Apr 2009 B1
7555666 Brundridge et al. Jun 2009 B2
7583661 Chaudhuri Sep 2009 B2
7586841 Vasseur Sep 2009 B2
7596144 Pong Sep 2009 B2
7599360 Edsall et al. Oct 2009 B2
7606225 Xie et al. Oct 2009 B2
7606245 Ma et al. Oct 2009 B2
7616646 Ma Nov 2009 B1
7620057 Aloni et al. Nov 2009 B1
7644215 Wallace et al. Jan 2010 B2
7657677 Huang et al. Feb 2010 B2
7657756 Hall Feb 2010 B2
7660922 Harriman Feb 2010 B2
7664110 Lovett et al. Feb 2010 B1
7673164 Agarwal Mar 2010 B1
7710936 Morales Barroso May 2010 B2
7719834 Miyamoto et al. May 2010 B2
7721125 Fung May 2010 B2
7751433 Dollo et al. Jul 2010 B2
7760720 Pullela et al. Jul 2010 B2
7761687 Blumrich et al. Jul 2010 B2
7783910 Felter et al. Aug 2010 B2
7791894 Bechtolsheim Sep 2010 B2
7792113 Foschiano et al. Sep 2010 B1
7796399 Clayton Sep 2010 B2
7801132 Ofek et al. Sep 2010 B2
7802017 Uemura et al. Sep 2010 B2
7805575 Agarwal et al. Sep 2010 B1
7831839 Hatakeyama Nov 2010 B2
7840703 Arimilli et al. Nov 2010 B2
7865614 Lu et al. Jan 2011 B2
7925795 Tamir Apr 2011 B2
7934005 Fascenda Apr 2011 B2
7970929 Mahalingaiah Jun 2011 B1
7975110 Spaur et al. Jul 2011 B1
7991817 Dehon et al. Aug 2011 B2
7991922 Hayter et al. Aug 2011 B2
7992151 Warrier et al. Aug 2011 B2
8019832 De Sousa et al. Sep 2011 B2
8045328 Chen Oct 2011 B1
8060760 Shetty et al. Nov 2011 B2
8060775 Sharma et al. Nov 2011 B1
8082400 Chang et al. Dec 2011 B1
8108508 Goh et al. Jan 2012 B1
8122269 Houlihan et al. Feb 2012 B2
8132034 Lambert et al. Mar 2012 B2
8155113 Agarwal Apr 2012 B1
8156362 Branover et al. Apr 2012 B2
8165120 Maruccia et al. Apr 2012 B2
8170040 Konda May 2012 B2
8180996 Fullerton et al. May 2012 B2
8189612 Lemaire et al. May 2012 B2
8194659 Ban Jun 2012 B2
8199636 Rouyer et al. Jun 2012 B1
8205103 Kazama et al. Jun 2012 B2
8379425 Fukuoka et al. Feb 2013 B2
8397092 Karnowski Mar 2013 B2
8407428 Cheriton et al. Mar 2013 B2
8504791 Cheriton et al. Aug 2013 B2
RE44610 Krakirian et al. Nov 2013 E
8599863 Davis Dec 2013 B2
8684802 Gross et al. Apr 2014 B1
8738860 Griffin et al. May 2014 B1
8745275 Ikeya et al. Jun 2014 B2
8745302 Davis et al. Jun 2014 B2
8782321 Harriman et al. Jul 2014 B2
8812400 Faraboschi et al. Aug 2014 B2
8824485 Biswas et al. Sep 2014 B2
8854831 Arnouse Oct 2014 B2
8903964 Breslin Dec 2014 B2
9008079 Davis et al. Apr 2015 B2
9311269 Davis et al. Apr 2016 B2
9465771 Davis et al. Oct 2016 B2
20010046227 Matsuhira et al. Nov 2001 A1
20020004912 Fung Jan 2002 A1
20020040391 Chaiken et al. Apr 2002 A1
20020083352 Fujimoto et al. Jun 2002 A1
20020097732 Worster et al. Jul 2002 A1
20020107903 Richter et al. Aug 2002 A1
20020124128 Qiu Sep 2002 A1
20020159452 Foster et al. Oct 2002 A1
20020161917 Shapiro et al. Oct 2002 A1
20020172205 Tagore-Brage et al. Nov 2002 A1
20020186656 Vu Dec 2002 A1
20020194412 Bottom Dec 2002 A1
20020196611 Ho et al. Dec 2002 A1
20030007493 Oi et al. Jan 2003 A1
20030033547 Larson et al. Feb 2003 A1
20030041266 Ke et al. Feb 2003 A1
20030076832 Ni Apr 2003 A1
20030093255 Freyensee et al. May 2003 A1
20030093624 Arimilli et al. May 2003 A1
20030110262 Hasan et al. Jun 2003 A1
20030140190 Mahony et al. Jul 2003 A1
20030158940 Leigh Aug 2003 A1
20030159083 Fukuhara et al. Aug 2003 A1
20030172191 Williams Sep 2003 A1
20030188083 Kumar et al. Oct 2003 A1
20030193402 Post et al. Oct 2003 A1
20030202520 Witkowski Oct 2003 A1
20030231624 Alappat et al. Dec 2003 A1
20040013113 Singh et al. Jan 2004 A1
20040017806 Yazdy et al. Jan 2004 A1
20040017808 Forbes et al. Jan 2004 A1
20040030938 Barr et al. Feb 2004 A1
20040068676 Larson et al. Apr 2004 A1
20040111612 Choi et al. Jun 2004 A1
20040141521 George Jul 2004 A1
20040165588 Pandya Aug 2004 A1
20040210693 Zeitler et al. Oct 2004 A1
20040215864 Arimilli et al. Oct 2004 A1
20040215991 McAfee et al. Oct 2004 A1
20040267486 Percer et al. Dec 2004 A1
20050015378 Gammel et al. Jan 2005 A1
20050018604 Dropps et al. Jan 2005 A1
20050018606 Dropps et al. Jan 2005 A1
20050018663 Dropps Jan 2005 A1
20050021606 Davies et al. Jan 2005 A1
20050021728 Sugimoto Jan 2005 A1
20050030954 Dropps Feb 2005 A1
20050033742 Kamvar et al. Feb 2005 A1
20050033890 Lee Feb 2005 A1
20050044195 Westfall Feb 2005 A1
20050077921 Percer et al. Apr 2005 A1
20050105538 Perera et al. May 2005 A1
20050141424 Lim et al. Jun 2005 A1
20050228852 Santos et al. Oct 2005 A1
20050240688 Moerman et al. Oct 2005 A1
20060002311 Iwanaga et al. Jan 2006 A1
20060013218 Shore et al. Jan 2006 A1
20060023245 Sato et al. Feb 2006 A1
20060029053 Roberts et al. Feb 2006 A1
20060090025 Tufford et al. Apr 2006 A1
20060136570 Pandya Jun 2006 A1
20060140211 Huang et al. Jun 2006 A1
20060174342 Zaheer et al. Aug 2006 A1
20060179241 Clark et al. Aug 2006 A1
20060236371 Fish Oct 2006 A1
20060248359 Fung Nov 2006 A1
20060259734 Sheu et al. Nov 2006 A1
20060265609 Fung Nov 2006 A1
20070006001 Isobe et al. Jan 2007 A1
20070047195 Merkin et al. Mar 2007 A1
20070076653 Park et al. Apr 2007 A1
20070081315 Mondor et al. Apr 2007 A1
20070094486 Moore et al. Apr 2007 A1
20070109968 Hussain et al. May 2007 A1
20070130397 Tsu Jun 2007 A1
20070174390 Silvain et al. Jul 2007 A1
20070180310 Johnson et al. Aug 2007 A1
20070209072 Chen Sep 2007 A1
20070226795 Conti et al. Sep 2007 A1
20070280230 Park Dec 2007 A1
20070286009 Norman Dec 2007 A1
20070288585 Sekiguchi et al. Dec 2007 A1
20080013453 Chiang et al. Jan 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
20080089358 Basso et al. Apr 2008 A1
20080104264 Duerk et al. May 2008 A1
20080140771 Vass et al. Jun 2008 A1
20080140930 Hotchkiss Jun 2008 A1
20080159745 Segal Jul 2008 A1
20080162691 Zhang et al. Jul 2008 A1
20080183882 Flynn 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
20080217021 Lembcke et al. Sep 2008 A1
20080222434 Shimizu et al. Sep 2008 A1
20080235443 Chow et al. Sep 2008 A1
20080239649 Bradicich et al. Oct 2008 A1
20080243634 Dworkin et al. Oct 2008 A1
20080250181 Li et al. Oct 2008 A1
20080259555 Bechtolsheim et al. Oct 2008 A1
20080259788 Wang et al. Oct 2008 A1
20080266793 Lee Oct 2008 A1
20080270599 Tamir et al. Oct 2008 A1
20080288660 Balasubramanian et al. Nov 2008 A1
20080288664 Pettey et al. Nov 2008 A1
20080288683 Ramey Nov 2008 A1
20080301794 Lee Dec 2008 A1
20080310848 Yasuda et al. Dec 2008 A1
20080313369 Verdoorn et al. Dec 2008 A1
20080320161 Maruccia et al. Dec 2008 A1
20090021907 Mann et al. Jan 2009 A1
20090044036 Merkin Feb 2009 A1
20090063443 Arimilli et al. Mar 2009 A1
20090064287 Bagepalli et al. Mar 2009 A1
20090080428 Witkowski et al. Mar 2009 A1
20090097200 Sharma 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
20090158070 Gruendler Jun 2009 A1
20090172423 Song 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
20090216920 Lauterbach et al. Aug 2009 A1
20090219827 Chen et al. Sep 2009 A1
20090222884 Shaji et al. Sep 2009 A1
20090225751 Koenck et al. Sep 2009 A1
20090235104 Fung Sep 2009 A1
20090248943 Jiang et al. Oct 2009 A1
20090251867 Sharma 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
20090313390 Ahuja 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
20100040053 Gottumukkula et al. Feb 2010 A1
20100049822 Davies et al. Feb 2010 A1
20100051391 Jahkonen Mar 2010 A1
20100106987 Lambert et al. Apr 2010 A1
20100118880 Kunz et al. May 2010 A1
20100125742 Ohtani May 2010 A1
20100125915 Hall et al. May 2010 A1
20100138481 Behrens Jun 2010 A1
20100158005 Mukhopadhyay et al. Jun 2010 A1
20100161909 Nation et al. Jun 2010 A1
20100165983 Aybay Jul 2010 A1
20100169479 Jeong et al. Jul 2010 A1
20100198972 Umbehocker Aug 2010 A1
20100198985 Kanevsky et al. Aug 2010 A1
20100218194 Dallman et al. Aug 2010 A1
20100220732 Hussain et al. Sep 2010 A1
20100250914 Abdul et al. Sep 2010 A1
20100265650 Chen et al. Oct 2010 A1
20100281246 Bristow et al. Nov 2010 A1
20100299548 Chadirchi et al. Nov 2010 A1
20100308897 Evoy et al. Dec 2010 A1
20100312910 Lin et al. Dec 2010 A1
20100312969 Yamazaki et al. Dec 2010 A1
20100318812 Auradkar et al. Dec 2010 A1
20110023104 Franklin Jan 2011 A1
20110026397 Saltsidis et al. Feb 2011 A1
20110029652 Chhuor et al. Feb 2011 A1
20110058573 Balakavi et al. Mar 2011 A1
20110075369 Sun et al. Mar 2011 A1
20110090633 Rabinovitz Apr 2011 A1
20110103391 Davis et al. 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
20110185370 Tamir 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
20110239014 Karnowski Sep 2011 A1
20110271159 Ahn et al. Nov 2011 A1
20110273840 Chen Nov 2011 A1
20110295991 Aida Dec 2011 A1
20110296141 Daffron Dec 2011 A1
20110320690 Petersen et al. Dec 2011 A1
20120011500 Faraboschi et al. Jan 2012 A1
20120020207 Corti et al. Jan 2012 A1
20120050981 Xu et al. Mar 2012 A1
20120054469 Ikeya et al. Mar 2012 A1
20120054511 Brinks et al. Mar 2012 A1
20120081850 Regimbal et al. Apr 2012 A1
20120096211 Davis et al. Apr 2012 A1
20120099265 Reber Apr 2012 A1
20120131201 Matthews et al. May 2012 A1
20120155168 Kim et al. Jun 2012 A1
20120198252 Kirschtein et al. Aug 2012 A1
20120207165 Davis Aug 2012 A1
20120297042 Davis et al. Nov 2012 A1
20130010639 Armstrong et al. Jan 2013 A1
20130024645 Cheriton et al. Jan 2013 A1
20130031331 Cheriton et al. Jan 2013 A1
20130058250 Casado et al. Mar 2013 A1
20130094499 Davis et al. Apr 2013 A1
20130097448 Davis et al. Apr 2013 A1
20130111107 Chang et al. May 2013 A1
20130148667 Hama et al. Jun 2013 A1
20130163605 Chandra et al. Jun 2013 A1
20130290643 Lim et al. Oct 2013 A1
20130290650 Chang et al. Oct 2013 A1
20130318269 Dalal et al. Nov 2013 A1
20140122833 Davis et al. May 2014 A1
20140359044 Davis et al. Dec 2014 A1
20140365596 Kanevsky et al. Dec 2014 A1
20150039840 Chandra et al. Feb 2015 A1
20150103826 Davis Apr 2015 A1
Foreign Referenced Citations (9)
Number Date Country
2005-223753 Aug 2005 JP
2005-536960 Dec 2005 JP
M377621 Apr 2010 TW
201017430 May 2010 TW
WO-2004021641 Mar 2004 WO
WO-2005013143 Feb 2005 WO
WO-2008000193 Jan 2008 WO
WO-2011044271 Apr 2011 WO
WO-2012037494 Mar 2012 WO
Non-Patent Literature Citations (120)
Entry
Advanced Switching Technology Tech Brief, published 2005, 2 pages.
Chapter 1 Overview of the Origin Family Architecture from Origin and Onyx2 Theory 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.
Deering, “IP Multicast Extensions for 4.3BSD UNIX and related Systems,” Jun. 1999, 5 pages.
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. 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/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/624,731, dated Nov. 12, 2013.
fpga4fun.com,“What is JTAG?”, 2 pages, Jan. 31, 2010.
From AT to BTX: Motherboard Form Factor, Webopedia, Apr. 29, 2005, p. 1.
HP Virtual Connect Traffic Flow—Technology brief, Jan. 2012, 22 pages.
International Preliminary Report on Patentability for PCT/US2012/038986 dated Nov. 26, 2013.
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/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 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. 13/475,722, dated Jan. 17, 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. 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/527,505, dated May 8, 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/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/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.
Notice of Allowance on U.S. Appl. No. 13/453,086, dated Jul. 18, 2013.
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.
Venaas, “IPv4 Multicast Address Space Registry,” 2013, http://www.iana.org/assignments/multicast-addresses/multicast-addresses.xhtml.
PCT/US2011/051996, International Search Report dated Jan. 19, 2012 (2 pages).
PCT/US2011/051996, Written Opinion dated Jan. 19, 2012 (9 pages).
Final Office Action on U.S. Appl. No. 13/527,505, dated Dec. 5, 2014.
Notice of Allowance on U.S. Appl. No. 13/705340, dated Dec. 3, 2014.
Non-Final Office Action on U.S. Appl. No. 14/106,698, dated Feb. 12, 2015.
Notice of Allowance on U.S. Appl. No. 13/475,713, dated Feb. 5, 2015.
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.
Final Office Action on U.S. Appl. No. 13/692,741, dated Mar. 11, 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,731, dated Mar. 5, 2015.
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. 14/052,723, dated May 1, 2015.
Non-Final Office Action on U.S. Appl. No. 13/728,308, dated May 14, 2015.
Final Office Action on U.S. Appl. No. 12/889,721, dated May 22, 2015.
Final Office Action on U.S. Appl. No. 12/889,721, dated Apr. 17, 2014.
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.
International Preliminary Report on Patentability for PCT/US2009/044200, dated Nov. 17, 2010.
International Preliminary Report on Patentability for PCT/US2012/061747, dated Apr. 29, 2014.
International Search Report and Written Opinion for PCT/US12/61747, dated Mar. 1, 2013.
International Search Report and Written Opinion on PCT/US09/44200, dated Jul. 1, 2009.
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/284,855, dated Dec. 19, 2013.
Notice of Allowance on U.S. Appl. No. 13/284,855, dated Jul. 14, 2014.
Final Office Action on U.S. Appl. No. 13/527,498, dated Nov. 17, 2014.
Non-Final Office Action on U.S. Appl. No. 13/662,759, dated Nov. 6, 2014.
Elghany et al., “High Throughput High Performance NoC Switch,” NORCHIP 2008, Nov. 2008, pp. 237-240.
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 Communications, Computers and Signal Processing, Aug. 2005, pp. 613-616.
Non-Final Office Action on U.S. Appl. No. 14/334,931, dated Jan. 5, 2015.
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.
Final Office Action on U.S. Appl. No. 14/052,723, dated Dec. 3, 2015.
Notice of Allowance on U.S. Appl. No. 13/692,741 dated Dec. 4, 2015.
Non-Final Office Action on U.S. Appl. No. 14/334,931 dated Dec. 11, 2015.
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).
Non-Final Office Action on U.S. Appl. No. 14/106,697, dated Aug. 17, 2015.
Office Action on Taiwan Application 101139729, dated May 25, 2015 (English translation not available).
Final Office Action on U.S. Appl. No. 13/662,759, dated Feb. 22, 2016.
Final Office Action on U.S. Appl. No. 14/106,697 dated Feb. 2, 2016.
Non-Final Office Action on U.S. Appl. No. 12/889,721, dated Feb. 24, 2016.
Das et al., “Unifying Packet and Circuit Switched Networks,” IEEE Globecom Workshops 2009, Nov. 30, 2009, pp. 1-6.
Final Office Action on U.S. Appl. No. 13/624,725 dated Mar. 10, 2016.
Non-Final Office Action on U.S. Appl. No. 14/725,543 dated Apr. 7, 2016.
Notice of Allowance on U.S. Appl. No. 13/624,725, dated Mar. 30, 2016.
Non-Final Office Action on U.S. Appl. No. 14/334,178 dated Dec. 18, 2015.
Final Office Action on U.S. Appl. No. 12/889,721 dated Aug. 2, 2016.
Final Office Action on U.S. Appl. No. 13/728,428 dated May 6, 2016.
Notice of Allowance on U.S. Appl. No. 14/334,931 dated May 20, 2016.
Notice of Allowance on U.S. Appl. No. 13/662,759 dated May 10, 2016.
Notice of Allowance on U.S. Appl. No. 14/334,178 dated Jun. 8, 2016.
Notice of Allowance on U.S. Appl. No. 13/728,428 dated Jul. 18, 2016.
Notice of Allowance on U.S. Appl. No. 14/725,543 dated Jul. 21, 2016.
HP ProLiant SL6500 Scalable System, Family data sheet, HP Technical sheet, Sep. 2010 4 pages.
Non-Final Office Action on U.S. Appl. No. 15/281,462 dated Feb. 10, 2017.
Notice of Allowance issued on U.S. Appl. No. 14/052,723, dated Feb. 8, 2017.
Non-Final Office Action on U.S. Appl. No. 14/753,948 dated Nov. 4, 2016.
Notice of Allowance on U.S. Appl. No. 14/106,697 dated Oct. 24, 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/270,418 dated Apr. 21, 2017.
Notice of Allowance on U.S. Appl. No. 15/360,668, dated May 5, 2017.
Final Office Action on U.S. Appl. No. 15/281,462 dated Jun. 13, 2017.
Non-Final Office Action on U.S. Appl. No. 15/254,111 dated Jun. 20, 2017.
Notice of Allowance on U.S. Appl. No. 14/753,948 dated Jun. 14, 2017.
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.
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/728,428, dated Jun. 12, 2015.
Final Office Action on U.S. Appl. No. 14/809,723 dated Aug. 25, 2017.
Non-Final Office Action on U.S. Appl. No. 15/078,115 dated Sep. 5, 2017.
Notice of Allowance on U.S. Appl. No. 15/254,111 dated Sep. 1, 2017.
Non-Final Office Action on U.S. Appl. No. 15/357,332 dated Nov. 9, 2017.
Notice of Allowance on U.S. Appl. No. 15/270,418 dated Nov. 2, 2017.
Related Publications (2)
Number Date Country
20120096211 A1 Apr 2012 US
20150381528 A9 Dec 2015 US
Provisional Applications (2)
Number Date Country
61383585 Sep 2010 US
61256723 Oct 2009 US
Continuation in Parts (1)
Number Date Country
Parent 12794996 Jun 2010 US
Child 13234054 US