In a system that utilizes multiple processors to cooperatively execute a workload, the multiple processors are typically physically located on the same compute device. In such systems, the processors communicate with one another through a shared memory and/or a local bus to cooperatively execute the workload. However, a given workload may utilize only a portion of the available processors on the compute device. As a result, the other processors may be underutilized, leading to wastage of resources. Conversely, the workload may benefit from being executed on a greater number of processors than the set of processors available on a single compute device, such as when multiple tasks within the workload are amenable to concurrent execution. In a data center, such as a cloud data center in which customers agree to pay a predefined amount of money in return for a set of target quality of service metrics (e.g., a target latency, a target throughput, etc.), incorrectly matching the available resources of compute devices to the workloads may result in lost money and/or time, either in the form of purchasing and allocating too many resources (e.g., processors) to a workload or providing too few resources (e.g., processors) to a workload that could be executed more efficiently (e.g., at a higher quality of service) with more processors on the same compute device.
The concepts described herein are illustrated by way of example and not by way of limitation in the accompanying figures. For simplicity and clarity of illustration, elements illustrated in the figures are not necessarily drawn to scale. Where considered appropriate, reference labels have been repeated among the figures to indicate corresponding or analogous elements.
While the concepts of the present disclosure are susceptible to various modifications and alternative forms, specific embodiments thereof have been shown by way of example in the drawings and will be described herein in detail. It should be understood, however, that there is no intent to limit the concepts of the present disclosure to the particular forms disclosed, but on the contrary, the intention is to cover all modifications, equivalents, and alternatives consistent with the present disclosure and the appended claims.
References in the specification to “one embodiment,” “an embodiment,” “an illustrative embodiment,” etc., indicate that the embodiment described may include a particular feature, structure, or characteristic, but every embodiment may or may not necessarily include that particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to effect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described. Additionally, it should be appreciated that items included in a list in the form of “at least one A, B, and C” can mean (A); (B); (C); (A and B); (A and C); (B and C); or (A, B, and C). Similarly, items listed in the form of “at least one of A, B, or C” can mean (A); (B); (C); (A and B); (A and C); (B and C); or (A, B, and C).
The disclosed embodiments may be implemented, in some cases, in hardware, firmware, software, or any combination thereof. The disclosed embodiments may also be implemented as instructions carried by or stored on a transitory or non-transitory machine-readable (e.g., computer-readable) storage medium, which may be read and executed by one or more processors. A machine-readable storage medium may be embodied as any storage device, mechanism, or other physical structure for storing or transmitting information in a form readable by a machine (e.g., a volatile or non-volatile memory, a media disc, or other media device).
In the drawings, some structural or method features may be shown in specific arrangements and/or orderings. However, it should be appreciated that such specific arrangements and/or orderings may not be required. Rather, in some embodiments, such features may be arranged in a different manner and/or order than shown in the illustrative figures. Additionally, the inclusion of a structural or method feature in a particular figure is not meant to imply that such feature is required in all embodiments and, in some embodiments, may not be included or may be combined with other features.
The illustrative data center 100 differs from typical data centers in many ways. For example, in the illustrative embodiment, the circuit boards (“sleds”) on which components such as CPUs, memory, and other components are placed are designed for increased thermal performance. In particular, in the illustrative embodiment, the sleds are shallower than typical boards. In other words, the sleds are shorter from the front to the back, where cooling fans are located. This decreases the length of the path that air must to travel across the components on the board. Further, the components on the sled are spaced further apart than in typical circuit boards, and the components are arranged to reduce or eliminate shadowing (i.e., one component in the air flow path of another component). In the illustrative embodiment, processing components such as the processors are located on a top side of a sled while near memory, such as DIMMs, are located on a bottom side of the sled. As a result of the enhanced airflow provided by this design, the components may operate at higher frequencies and power levels than in typical systems, thereby increasing performance. Furthermore, the sleds are configured to blindly mate with power and data communication cables in each rack 102A, 102B, 102C, 102D, enhancing their ability to be quickly removed, upgraded, reinstalled, and/or replaced. Similarly, individual components located on the sleds, such as processors, accelerators, memory, and data storage drives, are configured to be easily upgraded due to their increased spacing from each other. In the illustrative embodiment, the components additionally include hardware attestation features to prove their authenticity.
Furthermore, in the illustrative embodiment, the data center 100 utilizes a single network architecture (“fabric”) that supports multiple other network architectures including Ethernet and Omni-Path. The sleds, in the illustrative embodiment, are coupled to switches via optical fibers, which provide higher bandwidth and lower latency than typical twisted pair cabling (e.g., Category 5, Category 5e, Category 6, etc.). Due to the high bandwidth, low latency interconnections and network architecture, the data center 100 may, in use, pool resources, such as memory, accelerators (e.g., graphics accelerators, FPGAs, ASICs, etc.), and data storage drives that are physically disaggregated, and provide them to compute resources (e.g., processors) on an as needed basis, enabling the compute resources to access the pooled resources as if they were local. The illustrative data center 100 additionally receives utilization information for the various resources, predicts resource utilization for different types of workloads based on past resource utilization, and dynamically reallocates the resources based on this information.
The racks 102A, 102B, 102C, 102D of the data center 100 may include physical design features that facilitate the automation of a variety of types of maintenance tasks. For example, data center 100 may be implemented using racks that are designed to be robotically-accessed, and to accept and house robotically-manipulatable resource sleds. Furthermore, in the illustrative embodiment, the racks 102A, 102B, 102C, 102D include integrated power sources that receive a greater voltage than is typical for power sources. The increased voltage enables the power sources to provide additional power to the components on each sled, enabling the components to operate at higher than typical frequencies.
In various embodiments, dual-mode optical switches may be capable of receiving both Ethernet protocol communications carrying Internet Protocol (IP packets) and communications according to a second, high-performance computing (HPC) link-layer protocol (e.g., Intel's Omni-Path Architecture's, Infiniband) via optical signaling media of an optical fabric. As reflected in
MPCMs 916-1 to 916-7 may be configured to provide inserted sleds with access to power sourced by respective power modules 920-1 to 920-7, each of which may draw power from an external power source 921. In various embodiments, external power source 921 may deliver alternating current (AC) power to rack 902, and power modules 920-1 to 920-7 may be configured to convert such AC power to direct current (DC) power to be sourced to inserted sleds. In some embodiments, for example, power modules 920-1 to 920-7 may be configured to convert 277-volt AC power into 12-volt DC power for provision to inserted sleds via respective MPCMs 916-1 to 916-7. The embodiments are not limited to this example.
MPCMs 916-1 to 916-7 may also be arranged to provide inserted sleds with optical signaling connectivity to a dual-mode optical switching infrastructure 914, which may be the same as—or similar to—dual-mode optical switching infrastructure 514 of
Sled 1004 may also include dual-mode optical network interface circuitry 1026. Dual-mode optical network interface circuitry 1026 may generally comprise circuitry that is capable of communicating over optical signaling media according to each of multiple link-layer protocols supported by dual-mode optical switching infrastructure 914 of
Coupling MPCM 1016 with a counterpart MPCM of a sled space in a given rack may cause optical connector 1016A to couple with an optical connector comprised in the counterpart MPCM. This may generally establish optical connectivity between optical cabling of the sled and dual-mode optical network interface circuitry 1026, via each of a set of optical channels 1025. Dual-mode optical network interface circuitry 1026 may communicate with the physical resources 1005 of sled 1004 via electrical signaling media 1028. In addition to the dimensions of the sleds and arrangement of components on the sleds to provide improved cooling and enable operation at a relatively higher thermal envelope (e.g., 250 W), as described above with reference to
As shown in
In another example, in various embodiments, one or more pooled storage sleds 1132 may be included among the physical infrastructure 1100A of data center 1100, each of which may comprise a pool of storage resources that is globally accessible to other sleds via optical fabric 1112 and dual-mode optical switching infrastructure 1114. In some embodiments, such pooled storage sleds 1132 may comprise pools of solid-state storage devices such as solid-state drives (SSDs). In various embodiments, one or more high-performance processing sleds 1134 may be included among the physical infrastructure 1100A of data center 1100. In some embodiments, high-performance processing sleds 1134 may comprise pools of high-performance processors, as well as cooling features that enhance air cooling to yield a higher thermal envelope of up to 250 W or more. In various embodiments, any given high-performance processing sled 1134 may feature an expansion connector 1117 that can accept a far memory expansion sled, such that the far memory that is locally available to that high-performance processing sled 1134 is disaggregated from the processors and near memory comprised on that sled. In some embodiments, such a high-performance processing sled 1134 may be configured with far memory using an expansion sled that comprises low-latency SSD storage. The optical infrastructure allows for compute resources on one sled to utilize remote accelerator/FPGA, memory, and/or SSD resources that are disaggregated on a sled located on the same rack or any other rack in the data center. The remote resources can be located one switch jump away or two-switch jumps away in the spine-leaf network architecture described above with reference to
In various embodiments, one or more layers of abstraction may be applied to the physical resources of physical infrastructure 1100A in order to define a virtual infrastructure, such as a software-defined infrastructure 1100B. In some embodiments, virtual computing resources 1136 of software-defined infrastructure 1100B may be allocated to support the provision of cloud services 1140. In various embodiments, particular sets of virtual computing resources 1136 may be grouped for provision to cloud services 1140 in the form of SDI services 1138. Examples of cloud services 1140 may include—without limitation—software as a service (SaaS) services 1142, platform as a service (PaaS) services 1144, and infrastructure as a service (IaaS) services 1146.
In some embodiments, management of software-defined infrastructure 1100B may be conducted using a virtual infrastructure management framework 1150B. In various embodiments, virtual infrastructure management framework 1150B may be designed to implement workload fingerprinting techniques and/or machine-learning techniques in conjunction with managing allocation of virtual computing resources 1136 and/or SDI services 1138 to cloud services 1140. In some embodiments, virtual infrastructure management framework 1150B may use/consult telemetry data in conjunction with performing such resource allocation. In various embodiments, an application/service management framework 1150C may be implemented in order to provide QoS management capabilities for cloud services 1140. The embodiments are not limited in this context.
Referring now to
While two compute sleds 1202 are shown in
As shown in
In the illustrative embodiment, each compute sled 1202 includes two processors 1220, the accelerator 1222, and a network interface controller (NIC) 1226 that is configured to communicate with the network switch 1204. It should be appreciated that, in other embodiments, each compute sled 1202 may include a different number of processors 1220 and accelerator 1222. In the illustrative embodiment, the accelerator 1222 of the compute sled 1202 includes a coherence kernel (e.g., a set of circuitry and/or executable code usable to implement a set of functions) 1224 that is configured to enable the accelerator 1222 to perform node coherence functions to communicate coherence data with other accelerator(s) of other compute sled(s) 1202 via the network switch 1204.
The network switch 1204 is configured to communicatively connect the processors 1220 and/or the accelerator 1222 of the compute sleds 1202 included in the managed node to share coherence data. For example, the processors 1220 on different compute sleds 1202 of the managed node may cooperatively execute tasks that share a data set of the workload and may later access the same data set in order to read from and/or write to different parts of the data set. To ensure that the processors 1220 of the managed node are executing the workload using the most recently updated data associated with the workload, the network switch 1204 may receive coherence data (i.e., data indicative of updates to the data set by the processor(s) 1220 of one compute sled 1202a) from the coherence kernel 1224 of the accelerator 1222 of the corresponding compute sled 1202a via the network interface controller 1226 of the corresponding compute sled 1202. The network switch 1204 may subsequently transmit the coherence data to other processor(s) 1220 of the other compute sled 1202b that is included in the managed node to update the local working data used by the compute sled 1202b.
Referring now to
The compute engine 1310 may be embodied as any type of device or collection of devices capable of performing the various compute functions as described below. In some embodiments, the compute engine 1310 may be embodied as a single device such as an integrated circuit, an embedded system, a field-programmable-array (FPGA), a system-on-a-chip (SOC), an application specific integrated circuit (ASIC), reconfigurable hardware or hardware circuitry, or other specialized hardware to facilitate performance of the functions described herein. Additionally, in some embodiments, the compute engine 1310 may include, or may be embodied as, a CPU 1312 and memory 1314. The CPU 1312 may be embodied as any type of processor capable of performing the functions described herein. For example, the CPU 1312 may be embodied as a single or multi-core processor(s), digital signal processor, microcontroller, or other processor or processing/controlling circuit.
The memory 1314 may be embodied as any type of volatile (e.g., dynamic random access memory (DRAM), etc.) or non-volatile memory or data storage capable of performing the functions described herein. It should be appreciated that the memory 1314 may include multiple physical memory devices. Volatile memory may be a storage medium that requires power to maintain the state of data stored by the medium. Non-limiting examples of volatile memory may include various types of random access memory (RAM), such as dynamic random access memory (DRAM) or static random access memory (SRAM). One particular type of DRAM that may be used in a memory module is synchronous dynamic random access memory (SDRAM). In particular embodiments, DRAM of a memory component may comply with a standard promulgated by JEDEC, such as JESD79F for DDR SDRAM, JESD79-2F for DDR2 SDRAM, JESD79-3F for DDR3 SDRAM, JESD79-4A for DDR4 SDRAM, JESD209 for Low Power DDR (LPDDR), JESD209-2 for LPDDR2, JESD209-3 for LPDDR3, and JESD209-4 for LPDDR4 (these standards are available at www.jedec.org). Such standards (and similar standards) may be referred to as DDR-based standards and communication interfaces of the storage devices that implement such standards may be referred to as DDR-based interfaces.
In one embodiment, the memory device is a block addressable memory device, such as those based on NAND or NOR technologies. A memory device may also include future generation nonvolatile devices, such as a three dimensional crosspoint memory device (e.g., Intel 3D XPoint™ memory), or other byte addressable write-in-place nonvolatile memory devices. In one embodiment, the memory device may be or may include memory devices that use chalcogenide glass, multi-threshold level NAND flash memory, NOR flash memory, single or multi-level Phase Change Memory (PCM), a resistive memory, nanowire memory, ferroelectric transistor random access memory (FeTRAM), anti-ferroelectric memory, magnetoresistive random access memory (MRAM) memory that incorporates memristor technology, resistive memory including the metal oxide base, the oxygen vacancy base and the conductive bridge Random Access Memory (CB-RAM), or spin transfer torque (STT)-MRAM, a spintronic magnetic junction memory based device, a magnetic tunneling junction (MTJ) based device, a DW (Domain Wall) and SOT (Spin Orbit Transfer) based device, a thyristor based memory device, or a combination of any of the above, or other memory. The memory device may refer to the die itself and/or to a packaged memory product.
In some embodiments, 3D crosspoint memory (e.g., Intel 3D XPoint™ memory) may comprise a transistor-less stackable cross point architecture in which memory cells sit at the intersection of word lines and bit lines and are individually addressable and in which bit storage is based on a change in bulk resistance. In some embodiments, all or a portion of the memory 1314 may be integrated into the CPU 1312. In operation, the memory 1314 may store various data and software used during operation of the compute sled 1202 such as operating systems, applications, programs, libraries, and drivers.
The compute engine 1310 is communicatively coupled to other components of the compute sled 1202 via the I/O subsystem 1320, which may be embodied as circuitry and/or components to facilitate input/output operations with the CPU 1312, the memory 1314, and other components of the compute sled 1202. For example, the I/O subsystem 1320 may be embodied as, or otherwise include, memory controller hubs, input/output control hubs, integrated sensor hubs, firmware devices, communication links (e.g., point-to-point links, bus links, wires, cables, light guides, printed circuit board traces, etc.), and/or other components and subsystems to facilitate the input/output operations. In some embodiments, the I/O subsystem 1320 may form a portion of a system-on-a-chip (SoC) and be incorporated, along with one or more of the CPU 1312, the memory 1314, and other components of the compute sled 1202, on a single integrated circuit chip.
The communication circuitry 1330 may be embodied as any communication circuit, device, or collection thereof, capable of enabling communications between the compute sled 1202 and another compute device (e.g., the orchestrator server 1206, the network switch 1204, and/or the client device 1208 over the network 1212). The communication circuitry 1330 may be configured to use any one or more communication technology (e.g., wired or wireless communications) and associated protocols (e.g., Ethernet, Bluetooth®, Wi-Fi®, WiMAX, etc.) to effect such communication.
The illustrative communication circuitry 1330 may include a network interface controller (NIC) 1226, which may also be referred to as a host fabric interface (HFI). The NIC 1226 may be embodied as one or more add-in-boards, daughtercards, network interface cards, controller chips, chipsets, or other devices that may be used by the compute sled 1202 to connect with another compute device (e.g., the orchestrator server 1206, another compute sled 1202, the network switch 1204, and/or the client device 1208) via the network switch 1204. In some embodiments, the NIC 1226 may be embodied as part of a system-on-a-chip (SoC) that includes one or more processors, or included on a multichip package that also contains one or more processors. In some embodiments, the NIC 1226 may include a local processor (not shown) and/or a local memory (not shown) that are both local to the NIC 1226. In such embodiments, the local processor of the NIC 1226 may be capable of performing one or more of the functions of the CPU 1312 described herein. Additionally or alternatively, in such embodiments, the local memory of the NIC 1226 may be integrated into one or more components of the compute sled 1202 at the board level, socket level, chip level, and/or other levels. Additionally or alternatively, the compute sled 1202 may include one or more peripheral devices 1350. Such peripheral devices 1350 may include any type of peripheral device commonly found in a compute device such as a display, speakers, a mouse, a keyboard, and/or other input/output devices, interface devices, and/or other peripheral devices.
The accelerator 1222 may be embodied as a single device such as an integrated circuit, an embedded system, a field-programmable-array (FPGA), a system-on-a-chip (SOC), an application specific integrated circuit (ASIC), reconfigurable hardware or hardware circuitry, or other specialized hardware capable of communicating with other accelerator(s) 1222 on other compute sled(s) 1202 of the managed node to cooperatively execute the workload. To do so, the accelerator 1222 further includes the coherence logic unit 1340, which may be embodied as circuitry, components, a kernel (e.g., a set of configured gates in an FPGA), or any type of devices capable of coordinating inter-processor communications to enable the processors 1220 of the managed node to share coherence data across multiple sleds 1202. For example, the coherence logic unit 1340 may configure the accelerator 1222 to perform node coherence functions to coordinate inter-processor communications between the selected processors 1220 of multiple compute sleds 1202 included in the managed node by enabling the selected processors 1220 across the multiple compute sleds 1202 to cooperatively execute a workload (e.g., an application). In the illustrative embodiment, the coherence logic unit 1340 of the corresponding compute sled 1202 may receive a node configuration request from the orchestrator server 1206. The node configuration request illustratively includes information about a managed node to be composed. For example, the node configuration request may include a number of processors 1220 of the corresponding compute sled 1202 required to compose the managed node and/or identifier(s) (IDs) of other compute sled(s) of the managed node that the processor(s) 1220 of the corresponding compute sled 1202 is configured to cooperatively execute workload with. The request may also include an indication of the type of workload (e.g., a code or description indicative of a general class of algorithms to be performed, such as cryptographic operations, transcoding operations, compression/decompression operations, convolutional neural network operations, etc.) to be executed by the managed node.
Upon receiving a node configuration request from the orchestrator server 1206, the accelerator 1222 may be configured to enable one or more processors 1220 of the corresponding compute sled 1202 to perform the node coherence functions to coordinate inter-processor communications between the compute sleds 1202 to enable processors 1220 across multiple compute sleds 1202 to operate cooperatively as if they were local to the same compute sled 1202. For example, the node coherence functions include determining whether the accelerator device 1222 is capable of communicating with another accelerator 1222 of another compute sled 1202, and if so, determining an amount of bandwidth required for accelerator 1222 to communicate coherence data to another accelerator 1222 of another compute sled 1202. The node coherence functions may further include determining coherence data to be communicated to the processor(s) 1220 of other compute sled(s) 1202 of the managed node. As discussed above, the coherence data includes any modifications or updates to the workload resulted from the execution of operations on the local working data on the corresponding compute sled 1202. The accelerator 1222 may determine the coherence data that has been modified by the processor(s) 1220 of the corresponding compute sled 1202. For example, the accelerator 1222 may track the timing (e.g., timestamps), locations (e.g., byte positions), and content of writes to the working data set and communicate information indicative of the writes as the coherence data to the other processor(s) 1220 of other compute sled(s) 1202 of the managed node via the network switch 1204 to update the local working data on the other compute sled(s) 1202 (e.g., to ensure that all processors 1220 of the managed node are working on the most recently updated data to maintain the integrity of working data).
Referring now to
In the illustrative environment 1400, the network communicator 1402, which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof as discussed above, is configured to facilitate inbound and outbound network communications (e.g., network traffic, network packets, network flows, etc.) to and from the compute sled 1202, respectively. To do so, the network communicator 1402 is configured to receive and process data from one system or computing device (e.g., the orchestrator server 1206, the network switch 1204, other compute sled(s) 1202, etc.) and to prepare and send data to a system or computing device (e.g., the orchestrator server 1206, the network switch 1204, other compute sled(s) 1202, etc.). Accordingly, in some embodiments, at least a portion of the functionality of the network communicator 1402 may be performed by the communication circuitry 1330, and, in the illustrative embodiment, by the NIC 1226.
The managed node configuration determiner 1404, which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof as discussed above, is configured to determine requested configurations of a managed node to be composed and configure the accelerator 1222 of the corresponding compute sled 1202 in accordance of the requested configuration of the managed node. In the illustrative embodiment, the managed node configuration determiner 1404 may be configured to receive a node configuration request from the orchestrator server 1206 that includes managed node configuration data of a managed node to be composed. For example, the managed node configuration data may include a number of processors 1220 of the corresponding compute sled 1202 to be allocated to compose the managed node and/or identifier(s) (IDs) of other compute sled(s) of the managed node that the processor(s) 1220 of the corresponding compute sled 1202 is configured to cooperatively execute workload with. The request may additionally include an indication of the type of workload that is to be executed.
In the illustrative embodiment, the managed node configuration determiner 1404 further includes the accelerator manager 1406, which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof as discussed above, is configured to determine a configuration of the accelerator 1222 of the compute sled 1202 and configure the accelerator 1222 to cooperatively execute a workload with other accelerator(s) 1222 of other compute sled(s) 1202 via the inter-processor communication. To do so, the accelerator manager 1406 is configured to determine the features of hardware components of each accelerator device 1222. For example, the accelerator manager 1406 may determine whether the accelerator 1222 is capable of communicating with another accelerator 1222 of another compute sled 1202. For example, the accelerator manager 1406 may determine whether the accelerator 1222 of the corresponding compute sled 1202 is communicatively coupled to the network switch 1204 to coordinate the inter-processor communication across multiple compute sleds 1202 to cooperatively execute a workload. If the accelerator 1222 of the corresponding compute sled 1202 is capable of the inter-processor communication, the accelerator manager 1406 may configure the accelerator 1222 in accordance with the managed node configuration.
The coherence manager 1408, which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof as discussed above, is configured to coordinate inter-processor communications between the compute sleds 1202 to cooperatively execute the workload. To do so, the coherence manager 1408 may perform node coherence functions to determine coherence data to be communicated to the processor(s) 1220 of other compute sled(s) 1202 of the managed node. As discussed above, the coherence data includes any modifications or updates to the working data resulted from the execution of the local working data by the processor(s) 1220 of the corresponding compute sled 1202. The accelerator 1222 may determine data that has been modified by the processor(s) 1220 of the corresponding compute sled 1202 (i.e., the coherence data) and communicates the coherence data to the other processor(s) 1220 of the managed node on other compute sled(s) 1202 via the network switch 1204 to update the local working data on the other compute sled(s) 1202 with the coherence data. It should be appreciated that, by updating the local working data on other compute sled(s) 1202 of the managed node, the coherence manager 1408 ensures that all processors 1220 of the managed node are working on the most recently updated data and to maintain the integrity of local working data on each compute sled 1202 of the managed node.
In the illustrative embodiment, the coherence manager 1408 further includes a bandwidth allocator 1410, which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof as discussed above, is configured to determine an amount of bandwidth required for the accelerator 1222 of the corresponding compute sled 1202 to communicate the coherence data to another accelerator 1222 of another compute sled 1202 and allocate the determined bandwidth to the corresponding compute sled 1202 to ensure that the coherence data is communicated to the other compute sled(s) 1202 of the managed node.
Referring now to
In some embodiments, in block 1506, the compute sled 1202 may determine identifier(s) of other compute sled(s) to cooperatively execute the workload with based on the node configuration request. In some embodiments, as indicated in block 1508, the compute sled 1202 may receive the identifiers from the orchestrator server 1206. Further, as indicated in block 1510, the request from the orchestrator server 1206 may identify one or more memory addresses of memory on the present compute sled 1202 and one or more memory addresses of memory on other compute sled(s) 1202 with which to maintain data coherence. In some embodiments, the memory addresses are included in the identifiers of the compute sleds (e.g., the identifiers received in block 1508).
In some embodiments, in block 1512, the compute sled 1202 may further determine, in response to receiving the node configuration request, availability of the processors 1220 on the present compute sled 1202. To do so, the compute sled 1202 may determine the present load (e.g., amount of total compute capacity that is presently being used) on each processor 1220 in block 1514 and compare the present load to a predefined threshold in block 1516 to determine whether the present load satisfies (e.g., is equal to or exceeds) a predefined threshold. If the present load satisfies the predefined threshold, the compute sled 1202 determines that the requested processor 1220 on the present compute sled is not available to be included in the managed node to cooperatively execute the workload. If, however, the present load does not satisfy the predefined threshold, the compute sled 1202 determines that the requested processor 1220 on the present compute sled 1202 is available to be included in the managed node to cooperatively execute the workload and may send a response indicative of the number of processors 1220 available to cooperatively execute the workflow in block 1518.
In block 1520, the compute sled 1202 determines whether a node configuration request has been received from the orchestrator server 1206. If the compute sled 1202 determines that a node configuration request has not been received, the method 1500 loops back to block 1502 to continue monitoring for a receipt of a node configuration request from the orchestrator server 1206. If, however, the compute sled 1202 determines that the node configuration request has been received, the method 1500 advances to block 1522 shown in
In block 1522, the compute sled 1202 determines an amount of bandwidth to be used by the accelerator 1222 to communicate (e.g., send and/or receive) coherence data between the processor(s) on the present compute sled 1202 and other processor(s) 1220 on other compute sled(s) 1202 of the managed node. For example, in some embodiments, the amount of bandwidth may be determined as a function of a total number of processors 1220 that are to be included in the managed node, since more processors 1220 may indicate that there is more coherence data to be communicated between the processors 1220 within the managed node. Additionally or alternatively, the amount of bandwidth may be determined as a function of a total number of compute sleds 1202 that are to be included in the managed node, since more compute sleds 1202 may indicate that there is more coherence data to be communicated between the compute sleds 1202 within the managed node.
Additionally or alternatively, in some embodiments, the amount of bandwidth may be determined as a function of the total amount of working data to be operated on (e.g., an initial set of data provided to the compute sled 1202 when it was requested to execute the workload). For example, the compute sled 1202 may determine a direct relationship between the amount of coherence data and the initial set of data to be operated on, since more data to be operated on may indicate that more bandwidth is required for communicating coherence data. Additionally or alternatively, in other embodiments, the amount of bandwidth may be determined as a function of the type of the workload, such as whether the workload is of a type in which the working data is to be transformed from one format to another. For example, in a transcoding process, a video file may be transcoded from one compression scheme to another. In a cryptographic process, unencrypted data may be encrypted or encrypted data may be decrypted. In a compression/decompression process, uncompressed data may be compressed or compressed data may be decompressed. These types of workload may utilize a greater bandwidth for coherence data as compared to a workload in which the working set of data is not transformed.
Additionally or alternatively, in yet other embodiments, the amount of bandwidth may be determined as a function of an amount of interdependence between portions of the working data, which may impact the frequency at which the coherence data may be communicated between the compute sleds 1202. For example, if a portion of the working data that is operated on by the processors 1220 of one compute sled 1202a is not affected by changes to another portion of the working set of data that is operated on by another compute sled 1202b, the frequency of communication of the coherence data may be relatively small as compared to workloads in which the portions of the working data are dependent on each other. In other words, the modifications to be made to the set of the working data operated on by a remote compute sled 1202b may be different based on modifications made by the present compute sled 1202a to a portion of the working data. In such case, the present compute sled 1202a may determine that only a relatively small amount of bandwidth is to be used to communicate with that particular remote compute sled 1202b.
As discussed above, the coherence data includes any modifications or updates to the workload resulted from the execution of the local working data on the corresponding compute sled 1202. The coherence data is to be communicated to the other compute sled(s) of the managed node to update the local working data on the other compute sled(s) 1202 to ensure that all processors 1220 of the managed node are working on an up-to-date version of the working data set for the workload.
In block 1524, the compute sled 1202 sends a message to the orchestrator server 1206 to request the determined bandwidth to be allocated to the compute sled 1202 for use by the accelerator 1222 of the compute sled 1202 to communicate the coherence data to other compute sled(s) 1202. Such bandwidth allocation ensures that the coherence data of the compute sled 1202 may be communicated to the other compute sled(s) 1202 of the managed node without delays due to congestion in the network switch 1204.
In block 1526, the compute sled 1202 cooperatively executes the requested workload. To do so, in block 1528, the compute sled 1202 executes operations on a portion of local working data of the workload on the present compute sled 1202 using the processor(s) 1220 on the compute sled 1202. In block 1530, the accelerator 1222 of the present compute sled 1202 communicates with the coherence logic of the accelerator 1222 of the present compute sled 1202 to determine any modifications or updates to the working data (i.e., the coherence data) resulting from the execution of the local working data by the processor(s) 1220. For example, in some embodiments, the accelerator 1222 of the present compute sled 1202 may determine the coherence data by tracking the timing (e.g., timestamps) of writes to the working data made by the processors 1220 on the present compute sled 1202, identifying the locations (e.g., byte addresses of the writes), and identifying the content of the writes (e.g., the actual data written).
In block 1532, the accelerator 1222 of the present compute sled 1202 further communicates the coherence data to the processor(s) 1220 of other compute sled(s) 1202 of the managed node. For example, the accelerator 1222 of the present compute sled 1202 may communicate the coherence data by sending any updates that occurred after the last set of updates (e.g., any writes that occurred after the latest timestamp in the previous set of coherence data sent out by the present compute sled 1202). In some embodiments, the compute sled 1202 communicates coherence data associated with the received memory addresses (e.g., from block 1510), as indicated in block 1534. In the illustrative embodiment, the compute sled 1202 sends the modified working data (i.e., the coherence data) via the network switch 1204 to other compute node(s) 1202 as indicated in block 1536.
In some embodiments, the present compute sled 1202 may receive coherence data with the coherence logic unit 1340 of the present accelerator 1222 from another compute sled 1202 in block 1538 and update the local working data, as indicated in block 1540. For example, the compute sled 1202 may update the local working data by replacing data values at positions (e.g., byte addresses) in the local copy of the working data with the content of the writes operations indicated in the received coherence data, in the order of the timestamps indicated in the received coherence data.
Illustrative examples of the technologies disclosed herein are provided below. An embodiment of the technologies may include any one or more, and any combination of, the examples described below.
Example 1 includes a compute sled comprising a memory; one or more processors connected to the memory; and an accelerator comprising a coherence logic unit, wherein the coherence logic unit is to (i) receive a node configuration request to execute a workload, wherein the node configuration request identifies the compute sled and a second compute sled to be included in a managed node, (ii) modify, with the one or more processors of the compute sled, a portion of local working data associated with the workload on the compute sled in the memory, (iii) determine coherence data indicative of the modification made by the one or more processors of the compute sled to the local working data in the memory, and (iv) send the coherence data to the second compute sled of the managed node.
Example 2 includes the subject matter of Example 1, and wherein to receive the node configuration request comprises to receive memory addresses of memory on the compute sled and the second compute sled to share the coherence data.
Example 3 includes the subject matter of any of Examples 1 and 2, and wherein the coherence logic unit is further to determine, in response to a receipt of the node configuration request, an availability of the one or more processors of the compute sled.
Example 4 includes the subject matter of any of Examples 1-3, and wherein to determine the availability of the one or more processors of the compute sled comprises to determine whether a present load on each processor exceeds a threshold; and send a response indicative of the number of processors having a present load that does not exceed the threshold as being available to cooperatively execute the workload.
Example 5 includes the subject matter of any of Examples 1-4, and wherein the coherence logic unit is further to receive coherence data from the second compute sled; and update the local working data with the coherence data received from the second compute sled.
Example 6 includes the subject matter of any of Examples 1-5, and wherein the coherence logic unit is further to determine an amount of bandwidth to communicate with another coherence logic unit of the second compute sled.
Example 7 includes the subject matter of any of Examples 1-6, and wherein to determine the amount of bandwidth comprises to determine an amount of bandwidth as a function of a total number of processors that are to be included in the managed node.
Example 8 includes the subject matter of any of Examples 1-7, and wherein to determine the amount of bandwidth comprises to determine an amount of bandwidth as a function of a total number of compute sleds that are to be included in the managed node.
Example 9 includes the subject matter of any of Examples 1-8, and wherein to determine the amount of bandwidth comprises to determine an amount of bandwidth as a function of a size of the local working data to be operated on.
Example 10 includes the subject matter of any of Examples 1-9, and wherein to determine the amount of bandwidth comprises to determine an amount of bandwidth as a function of a type of the workload.
Example 11 includes the subject matter of any of Examples 1-10, and wherein the coherence logic unit is further to send a request to a network switch for the determined amount of bandwidth.
Example 12 includes the subject matter of any of Examples 1-11, and wherein to send the coherence data to the second compute sled of the managed node comprises to send the coherence data associated with a memory address identified in the node configuration request.
Example 13 includes the subject matter of any of Examples 1-12, and wherein the coherence logic unit is a kernel of a field programmable gate array.
Example 14 includes the subject matter of any of Examples 1-13, and wherein the node configuration request identifies a number of processors of the compute sled to be included in the managed node.
Example 15 includes a method comprising receiving, by a compute sled, a node configuration request to execute a workload, wherein the node configuration request identifies the compute sled and a second compute sled to be included in a managed node; modifying, by one or more processors of the compute sled, a portion of local working data associated with the workload in a memory of the compute sled; determining, by the compute sled, coherence data indicative of the modification made by the one or more processors of the compute sled to the local working data in the memory; and sending, by the compute sled, the coherence data to the second compute sled of the managed node.
Example 16 includes the subject matter of Example 15, and wherein receiving the node configuration request comprises receiving, by the compute sled, memory addresses of memory on the compute sled and the second compute sled to share the coherence data.
Example 17 includes the subject matter of any of Examples 15 and 16, and further including determining, by the compute sled and in response to a receipt of the node configuration request, an availability of the one or more processors of the compute sled.
Example 18 includes the subject matter of any of Examples 15-17, and wherein determining the availability of the one or more processors of the compute sled comprises determining whether a present load on each processor exceeds a threshold; and sending a response indicative of the number of processors having a present load that does not exceed the threshold as being available to cooperatively execute the workload.
Example 19 includes the subject matter of any of Examples 15-18, and further including receiving, by the compute sled, coherence data from the second compute sled; and updating, by the compute sled, the local working data with the coherence data received from the second compute sled.
Example 20 includes the subject matter of any of Examples 15-19, and further including determining, by the compute sled, an amount of bandwidth to communicate with a coherence logic unit of the second compute sled.
Example 21 includes the subject matter of any of Examples 15-20, and wherein determining the amount of bandwidth comprises determining an amount of bandwidth as a function of a total number of processors that are to be included in the managed node.
Example 22 includes the subject matter of any of Examples 15-21, and wherein determining the amount of bandwidth comprises determining an amount of bandwidth as a function of a total number of compute sleds that are to be included in the managed node.
Example 23 includes the subject matter of any of Examples 15-22, and wherein determining the amount of bandwidth comprises determining an amount of bandwidth as a function of a size of the local working data to be operated on.
Example 24 includes the subject matter of any of Examples 15-23, and wherein determining the amount of bandwidth comprises determining an amount of bandwidth as a function of a type of the workload.
Example 25 includes the subject matter of any of Examples 15-24, and further including sending, by the compute sled, a request to a network switch for the determined amount of bandwidth.
Example 26 includes the subject matter of any of Examples 15-25, and wherein sending the coherence data to the second compute sled of the managed node comprises sending, by the compute sled, the coherence data associated with a memory address identified in the node configuration request.
Example 27 includes the subject matter of any of Examples 15-26, and wherein determining the coherence data comprises determining the coherence data with a field programmable gate array of the compute sled.
Example 28 includes the subject matter of any of Examples 15-27, and further including receiving, by the compute sled, coherence data from the second compute sled; and updating, by a field programmable gate array of the compute sled, the local working data with the coherence data received from the second compute sled.
Example 29 includes one or more machine-readable storage media comprising a plurality of instructions stored thereon that, in response to being executed, cause a compute sled to perform the method of any of Examples 15-28.
Example 30 includes a compute sled comprising means for performing the method of any of Examples 15-28.
Example 31 includes a compute sled comprising a memory; one or more processors connected to the memory; and an accelerator comprising a coherence logic unit circuitry, wherein the coherence logic unit circuitry is to (i) receive a node configuration request to execute a workload, wherein the node configuration request identifies the compute sled and a second compute sled to be included in a managed node, (ii) modify, with the one or more processors of the compute sled, a portion of local working data associated with the workload on the compute sled in the memory, (iii) determine coherence data indicative of the modification made by the one or more processors of the compute sled to the local working data in the memory, and (iv) send the coherence data to the second compute sled of the managed node.
Example 32 includes the subject matter of Example 31, and wherein to receive the node configuration request comprises to receive memory addresses of memory on the compute sled and the second compute sled to share the coherence data.
Example 33 includes the subject matter of any of Examples 31 and 32, and wherein the coherence logic unit circuitry is further to determine, in response to a receipt of the node configuration request, an availability of the one or more processors of the compute sled.
Example 34 includes the subject matter of any of Examples 31-33, and wherein to determine the availability of the one or more processors of the compute sled comprises to determine whether a present load on each processor exceeds a threshold; and send a response indicative of the number of processors having a present load that does not exceed the threshold as being available to cooperatively execute the workload.
Example 35 includes the subject matter of any of Examples 31-34, and wherein the coherence logic unit circuitry is further to receive coherence data from the second compute sled; and update the local working data with the coherence data received from the second compute sled.
Example 36 includes the subject matter of any of Examples 31-35, and wherein the coherence logic unit circuitry is further to determine an amount of bandwidth to communicate with another coherence logic unit circuitry of the second compute sled.
Example 37 includes the subject matter of any of Examples 31-36, and wherein to determine the amount of bandwidth comprises to determine an amount of bandwidth as a function of a total number of processors that are to be included in the managed node.
Example 38 includes the subject matter of any of Examples 31-37, and wherein to determine the amount of bandwidth comprises to determine an amount of bandwidth as a function of a total number of compute sleds that are to be included in the managed node.
Example 39 includes the subject matter of any of Examples 31-38, and wherein to determine the amount of bandwidth comprises to determine an amount of bandwidth as a function of a size of the local working data to be operated on.
Example 40 includes the subject matter of any of Examples 31-39, and wherein to determine the amount of bandwidth comprises to determine an amount of bandwidth as a function of a type of the workload.
Example 41 includes the subject matter of any of Examples 31-40, and wherein the coherence logic unit circuitry is further to send a request to a network switch for the determined amount of bandwidth.
Example 42 includes the subject matter of any of Examples 31-41, and wherein to send the coherence data to the second compute sled of the managed node comprises to send the coherence data associated with a memory address identified in the node configuration request.
Example 43 includes the subject matter of any of Examples 31-42, and wherein the coherence logic unit circuitry is a kernel of a field programmable gate array.
Example 44 includes the subject matter of any of Examples 31-43, and wherein the node configuration request identifies a number of processors of the compute sled to be included in the managed node.
Example 45 includes a compute sled comprising circuitry for receiving a node configuration request to execute a workload, wherein the node configuration request identifies the compute sled and a second compute sled to be included in a managed node; means for modifying, by one or more processors of the compute sled, a portion of local working data associated with the workload in a memory of the compute sled; means for determining coherence data indicative of the modification made by the one or more processors of the compute sled to the local working data in the memory; and means for sending the coherence data to the second compute sled of the managed node.
Example 46 includes the subject matter of Example 45, and wherein the means for receiving the node configuration request comprises means for receiving memory addresses of memory on the compute sled and the second compute sled to share the coherence data.
Example 47 includes the subject matter of any of Examples 45 and 46, and further including means for determining, in response to a receipt of the node configuration request, an availability of the one or more processors of the compute sled.
Example 48 includes the subject matter of any of Examples 45-47, and wherein the means for determining the availability of the one or more processors of the compute sled comprises means for determining whether a present load on each processor exceeds a threshold; and means for sending a response indicative of the number of processors having a present load that does not exceed the threshold as being available to cooperatively execute the workload.
Example 49 includes the subject matter of any of Examples 45-48, and further including means for receiving coherence data from the second compute sled; and means for updating the local working data with the coherence data received from the second compute sled.
Example 50 includes the subject matter of any of Examples 45-49, and further including means for determining an amount of bandwidth to communicate with a coherence logic unit of the second compute sled.
Example 51 includes the subject matter of any of Examples 45-50, and wherein the means for determining the amount of bandwidth comprises means for determining an amount of bandwidth as a function of a total number of processors that are to be included in the managed node.
Example 52 includes the subject matter of any of Examples 45-51, and wherein the means for determining the amount of bandwidth comprises means for determining an amount of bandwidth as a function of a total number of compute sleds that are to be included in the managed node.
Example 53 includes the subject matter of any of Examples 45-52, and wherein the means for determining the amount of bandwidth comprises means for determining an amount of bandwidth as a function of a size of the local working data to be operated on.
Example 54 includes the subject matter of any of Examples 45-53, and wherein the means for determining the amount of bandwidth comprises means for determining an amount of bandwidth as a function of a type of the workload.
Example 55 includes the subject matter of any of Examples 45-54, and further including circuitry for sending, by the compute sled, a request to a network switch for the determined amount of bandwidth.
Example 56 includes the subject matter of any of Examples 45-55, and wherein the means for sending the coherence data to the second compute sled of the managed node comprises means for sending the coherence data associated with a memory address identified in the node configuration request.
Example 57 includes the subject matter of any of Examples 45-56, and wherein the means for determining the coherence data comprises means for determining the coherence data with a field programmable gate array of the compute sled.
Example 58 includes the subject matter of any of Examples 45-57, and further including means for receiving coherence data from the second compute sled; and means for updating, with a field programmable gate array of the compute sled, the local working data with the coherence data received from the second compute sled.
Number | Date | Country | Kind |
---|---|---|---|
201741030632 | Aug 2017 | IN | national |
This patent application is a continuation of U.S. patent application Ser. No. 17/246,388, filed Apr. 30, 2021, which is a continuation of U.S. patent application Ser. No. 16/344,582, filed Apr. 24, 2019, now U.S. Pat. No. 11,016,832, issued on May 25, 2021, which is a national stage entry under 35 USC § 371(b) of International Application No. PCT/US2017/063756, filed Nov. 29, 2017 and claims the benefit of U.S. Provisional Patent Application No. 62/427,268, filed Nov. 29, 2016, Indian Provisional Patent Application No. 201741030632, filed Aug. 30, 2017, and U.S. Provisional Patent Application No. 62/584,401, filed Nov. 10, 2017.
Number | Name | Date | Kind |
---|---|---|---|
6085295 | Ekanadham et al. | Jul 2000 | A |
6104696 | Kadambi et al. | Aug 2000 | A |
6115372 | Dinha | Sep 2000 | A |
6353885 | Herzi et al. | Mar 2002 | B1 |
6367018 | Jain | Apr 2002 | B1 |
6650620 | Neogi | Nov 2003 | B1 |
7415022 | Kadambi et al. | Aug 2008 | B2 |
7739677 | Kekre et al. | Jun 2010 | B1 |
7835388 | Hu | Nov 2010 | B2 |
7962736 | Polyudov | Jun 2011 | B1 |
8248928 | Wang et al. | Aug 2012 | B1 |
8788663 | Adogla et al. | Jul 2014 | B1 |
8812765 | Dai et al. | Aug 2014 | B2 |
9026765 | Marshak et al. | May 2015 | B1 |
9042402 | Loganathan et al. | May 2015 | B1 |
9143406 | Waggener et al. | Sep 2015 | B2 |
9253055 | Nelke et al. | Feb 2016 | B2 |
9612767 | Huang et al. | Apr 2017 | B2 |
9733980 | Khan et al. | Aug 2017 | B1 |
9859918 | Gopal | Jan 2018 | B1 |
9893988 | Agarwal et al. | Feb 2018 | B2 |
9929747 | Gopal | Mar 2018 | B2 |
9936613 | Adiletta | Apr 2018 | B2 |
9954552 | Gopal | Apr 2018 | B2 |
9973207 | Gopal | May 2018 | B2 |
10033404 | Cutter | Jul 2018 | B2 |
10034407 | Miller | Jul 2018 | B2 |
10045098 | Adiletta | Aug 2018 | B2 |
10070207 | Adiletta et al. | Sep 2018 | B2 |
10085358 | Adiletta | Sep 2018 | B2 |
10091904 | Miller | Oct 2018 | B2 |
10116327 | Cutter | Oct 2018 | B2 |
10191684 | Gopal et al. | Jan 2019 | B2 |
10234833 | Ahuja | Mar 2019 | B2 |
10263637 | Gopal | Apr 2019 | B2 |
10268412 | Guilford | Apr 2019 | B2 |
10313769 | Miller | Jun 2019 | B2 |
10334334 | Miller | Jun 2019 | B2 |
10348327 | Adiletta | Jul 2019 | B2 |
10349152 | Adiletta | Jul 2019 | B2 |
10356495 | Adiletta | Jul 2019 | B2 |
10368148 | Kumar | Jul 2019 | B2 |
10390114 | Schmisseur | Aug 2019 | B2 |
10397670 | Gorius | Aug 2019 | B2 |
10411729 | Miller | Sep 2019 | B2 |
10448126 | Gilsdorf | Oct 2019 | B2 |
10461774 | Balle | Oct 2019 | B2 |
10469252 | Schmisseur | Nov 2019 | B2 |
10474460 | Adiletta | Nov 2019 | B2 |
10476670 | Schmisseur | Nov 2019 | B2 |
10489156 | Munoz | Nov 2019 | B2 |
10542333 | Miller | Jan 2020 | B2 |
10963176 | Balle et al. | Mar 2021 | B2 |
10990309 | Guim Bernat et al. | Apr 2021 | B2 |
11029870 | Balle et al. | Jun 2021 | B2 |
11128553 | Adiletta et al. | Sep 2021 | B2 |
11507430 | Subramanian | Nov 2022 | B2 |
11630702 | Kumar | Apr 2023 | B2 |
20030026525 | Alvarez | Feb 2003 | A1 |
20030028594 | Laschkewitsch et al. | Feb 2003 | A1 |
20040205304 | McKenney et al. | Oct 2004 | A1 |
20050135231 | Bellovin | Jun 2005 | A1 |
20060036719 | Bodin et al. | Feb 2006 | A1 |
20060059492 | Fellenstein | Mar 2006 | A1 |
20060168337 | Stahl et al. | Jul 2006 | A1 |
20060184670 | Beeson et al. | Aug 2006 | A1 |
20060239270 | Yao et al. | Oct 2006 | A1 |
20070147400 | Hu | Jun 2007 | A1 |
20080075071 | Beshai | Mar 2008 | A1 |
20080229318 | Franke | Sep 2008 | A1 |
20090198792 | Wittenschlaeger | Aug 2009 | A1 |
20100191823 | Archer et al. | Jul 2010 | A1 |
20110185125 | Jain et al. | Jul 2011 | A1 |
20110228767 | Singla et al. | Sep 2011 | A1 |
20110296231 | Dake | Dec 2011 | A1 |
20120054770 | Krishnamurthy et al. | Mar 2012 | A1 |
20120099863 | Xu et al. | Apr 2012 | A1 |
20120207139 | Husted et al. | Aug 2012 | A1 |
20120230343 | Schrum, Jr. | Sep 2012 | A1 |
20120303885 | Jeddeloh | Nov 2012 | A1 |
20130159638 | Koinuma et al. | Jun 2013 | A1 |
20130179485 | Chapman et al. | Jul 2013 | A1 |
20130232495 | Rossbach et al. | Sep 2013 | A1 |
20130297769 | Chang et al. | Nov 2013 | A1 |
20130325998 | Hormuth et al. | Dec 2013 | A1 |
20140012961 | Pope | Jan 2014 | A1 |
20140047272 | Breternitz et al. | Feb 2014 | A1 |
20140047341 | Breternitz et al. | Feb 2014 | A1 |
20140359044 | Davis et al. | Dec 2014 | A1 |
20150007182 | Rossbach et al. | Jan 2015 | A1 |
20150106804 | Chandrashekhar et al. | Apr 2015 | A1 |
20150229529 | Engebretsen | Aug 2015 | A1 |
20150281065 | Liljenstolpe | Oct 2015 | A1 |
20150333824 | Swinkels et al. | Nov 2015 | A1 |
20150334867 | Faw et al. | Nov 2015 | A1 |
20150381426 | Roese et al. | Dec 2015 | A1 |
20160050194 | Rachmiel | Feb 2016 | A1 |
20160087847 | Krithivas et al. | Mar 2016 | A1 |
20160118121 | Kelly et al. | Apr 2016 | A1 |
20160127191 | Nair | May 2016 | A1 |
20160147592 | Guddeti | May 2016 | A1 |
20160162281 | Hokiyama | Jun 2016 | A1 |
20160164739 | Skalecki | Jun 2016 | A1 |
20160231939 | Cannata et al. | Aug 2016 | A1 |
20160234580 | Clarke et al. | Aug 2016 | A1 |
20160306677 | Hira et al. | Oct 2016 | A1 |
20170046179 | Teh et al. | Feb 2017 | A1 |
20170070431 | Nidumolu et al. | Mar 2017 | A1 |
20170076195 | Yang | Mar 2017 | A1 |
20170093756 | Bernat et al. | Mar 2017 | A1 |
20170116004 | Devegowda et al. | Apr 2017 | A1 |
20170150621 | Breakstone et al. | May 2017 | A1 |
20170185786 | Ylinen et al. | Jun 2017 | A1 |
20170199746 | Nguyen et al. | Jul 2017 | A1 |
20170223436 | Moynihan et al. | Aug 2017 | A1 |
20170251077 | Eerpini et al. | Aug 2017 | A1 |
20170257970 | Alleman et al. | Sep 2017 | A1 |
20170279705 | Lin et al. | Sep 2017 | A1 |
20170315798 | Shivanna et al. | Nov 2017 | A1 |
20170317945 | Guo et al. | Nov 2017 | A1 |
20170329860 | Jones | Nov 2017 | A1 |
20180004835 | Piechowicz | Jan 2018 | A1 |
20180014306 | Adiletta | Jan 2018 | A1 |
20180014757 | Kumar | Jan 2018 | A1 |
20180017700 | Adiletta | Jan 2018 | A1 |
20180020054 | Woodacre | Jan 2018 | A1 |
20180024578 | Ahuja | Jan 2018 | A1 |
20180024739 | Schmisseur | Jan 2018 | A1 |
20180024740 | Miller | Jan 2018 | A1 |
20180024752 | Miller | Jan 2018 | A1 |
20180024756 | Miller | Jan 2018 | A1 |
20180024764 | Miller | Jan 2018 | A1 |
20180024771 | Miller | Jan 2018 | A1 |
20180024775 | Miller | Jan 2018 | A1 |
20180024776 | Miller | Jan 2018 | A1 |
20180024838 | Nachimuthu | Jan 2018 | A1 |
20180024860 | Balle | Jan 2018 | A1 |
20180024861 | Balle | Jan 2018 | A1 |
20180024864 | Wilde | Jan 2018 | A1 |
20180024867 | Gilsdorf | Jan 2018 | A1 |
20180024932 | Nachimuthu et al. | Jan 2018 | A1 |
20180024947 | Miller | Jan 2018 | A1 |
20180024957 | Nachimuthu | Jan 2018 | A1 |
20180024958 | Nachimuthu | Jan 2018 | A1 |
20180024960 | Wagh | Jan 2018 | A1 |
20180025299 | Kumar | Jan 2018 | A1 |
20180026652 | Cutter | Jan 2018 | A1 |
20180026653 | Cutter | Jan 2018 | A1 |
20180026654 | Gopal | Jan 2018 | A1 |
20180026655 | Gopal | Jan 2018 | A1 |
20180026656 | Gopal | Jan 2018 | A1 |
20180026800 | Munoz | Jan 2018 | A1 |
20180026835 | Nachimuthu | Jan 2018 | A1 |
20180026849 | Guim | Jan 2018 | A1 |
20180026851 | Adiletta | Jan 2018 | A1 |
20180026868 | Guim | Jan 2018 | A1 |
20180026882 | Gorius | Jan 2018 | A1 |
20180026904 | Van De Groenendaal | Jan 2018 | A1 |
20180026905 | Balle et al. | Jan 2018 | A1 |
20180026906 | Balle | Jan 2018 | A1 |
20180026907 | Miller | Jan 2018 | A1 |
20180026908 | Nachimuthu | Jan 2018 | A1 |
20180026910 | Balle et al. | Jan 2018 | A1 |
20180026912 | Guim | Jan 2018 | A1 |
20180026913 | Balle | Jan 2018 | A1 |
20180026918 | Kumar | Jan 2018 | A1 |
20180027055 | Balle et al. | Jan 2018 | A1 |
20180027057 | Balle | Jan 2018 | A1 |
20180027058 | Balle et al. | Jan 2018 | A1 |
20180027059 | Miller | Jan 2018 | A1 |
20180027060 | Metsch et al. | Jan 2018 | A1 |
20180027062 | Bernat | Jan 2018 | A1 |
20180027063 | Nachimuthu | Jan 2018 | A1 |
20180027066 | Van De Groenendaal et al. | Jan 2018 | A1 |
20180027067 | Guim | Jan 2018 | A1 |
20180027093 | Guim | Jan 2018 | A1 |
20180027312 | Adiletta | Jan 2018 | A1 |
20180027313 | Adiletta | Jan 2018 | A1 |
20180027376 | Kumar | Jan 2018 | A1 |
20180027679 | Schmisseur | Jan 2018 | A1 |
20180027680 | Kumar | Jan 2018 | A1 |
20180027682 | Adiletta | Jan 2018 | A1 |
20180027684 | Miller | Jan 2018 | A1 |
20180027685 | Miller | Jan 2018 | A1 |
20180027686 | Adiletta | Jan 2018 | A1 |
20180027687 | Adiletta | Jan 2018 | A1 |
20180027688 | Adiletta | Jan 2018 | A1 |
20180027703 | Adiletta | Jan 2018 | A1 |
20180266510 | Gopal | Jan 2018 | A1 |
20180067857 | Wang et al. | Mar 2018 | A1 |
20180077235 | Nachimuthu et al. | Mar 2018 | A1 |
20180150240 | Guim Bernat et al. | May 2018 | A1 |
20180150256 | Kumar | May 2018 | A1 |
20180150293 | Nachimuthu | May 2018 | A1 |
20180150298 | Balle | May 2018 | A1 |
20180150299 | Balle | May 2018 | A1 |
20180150330 | Bernat | May 2018 | A1 |
20180150334 | Bernat et al. | May 2018 | A1 |
20180150343 | Bernat | May 2018 | A1 |
20180150372 | Nachimuthu | May 2018 | A1 |
20180150391 | Mitchel | May 2018 | A1 |
20180150419 | Steinmacher-Burow | May 2018 | A1 |
20180150471 | Gopal | May 2018 | A1 |
20180150644 | Khanna | May 2018 | A1 |
20180151975 | Aoki | May 2018 | A1 |
20180152200 | Guilford | May 2018 | A1 |
20180152201 | Gopal | May 2018 | A1 |
20180152202 | Gopal | May 2018 | A1 |
20180152317 | Chang | May 2018 | A1 |
20180152366 | Cornett | May 2018 | A1 |
20180152383 | Burres | May 2018 | A1 |
20180152540 | Niell | May 2018 | A1 |
20180165199 | Brandt | Jun 2018 | A1 |
20180205392 | Gopal | Jul 2018 | A1 |
20180293493 | Kalamkar | Oct 2018 | A1 |
20190014396 | Adiletta | Jan 2019 | A1 |
20190021182 | Adiletta | Jan 2019 | A1 |
20190034102 | Miller | Jan 2019 | A1 |
20190034383 | Schmisseur | Jan 2019 | A1 |
20190034490 | Yap | Jan 2019 | A1 |
20190035483 | Schmisseur | Jan 2019 | A1 |
20190042090 | Raghunath | Feb 2019 | A1 |
20190042091 | Raghunath | Feb 2019 | A1 |
20190042122 | Schmisseur | Feb 2019 | A1 |
20190042126 | Sen | Feb 2019 | A1 |
20190042136 | Nachimuthu | Feb 2019 | A1 |
20190042234 | Bernat | Feb 2019 | A1 |
20190042277 | Nachimuthu | Feb 2019 | A1 |
20190042408 | Schmisseur | Feb 2019 | A1 |
20190042611 | Yap | Feb 2019 | A1 |
20190044809 | Willis | Feb 2019 | A1 |
20190044849 | Ganguli | Feb 2019 | A1 |
20190044859 | Sundar | Feb 2019 | A1 |
20190052457 | Connor | Feb 2019 | A1 |
20190062053 | Jensen | Feb 2019 | A1 |
20190065083 | Sen | Feb 2019 | A1 |
20190065112 | Schmisseur | Feb 2019 | A1 |
20190065172 | Nachimuthu | Feb 2019 | A1 |
20190065212 | Kumar | Feb 2019 | A1 |
20190065231 | Schmisseur | Feb 2019 | A1 |
20190065253 | Bernat | Feb 2019 | A1 |
20190065260 | Balle | Feb 2019 | A1 |
20190065261 | Narayan | Feb 2019 | A1 |
20190065281 | Bernat et al. | Feb 2019 | A1 |
20190065290 | Custodio | Feb 2019 | A1 |
20190065401 | Dormitzer | Feb 2019 | A1 |
20190065415 | Nachimuthu | Feb 2019 | A1 |
20190067848 | Aoki | Feb 2019 | A1 |
20190068444 | Grecco | Feb 2019 | A1 |
20190068464 | Bernat | Feb 2019 | A1 |
20190068466 | Chagam | Feb 2019 | A1 |
20190068509 | Hyatt | Feb 2019 | A1 |
20190068521 | Kumar | Feb 2019 | A1 |
20190068523 | Chagam | Feb 2019 | A1 |
20190068693 | Bernat | Feb 2019 | A1 |
20190068696 | Sen | Feb 2019 | A1 |
20190068698 | Kumar | Feb 2019 | A1 |
20190069433 | Balle | Feb 2019 | A1 |
20190069434 | Aoki | Feb 2019 | A1 |
20190129874 | Huang et al. | May 2019 | A1 |
20190196824 | Liu | Jun 2019 | A1 |
20190205745 | Sridharan | Jul 2019 | A1 |
20190307014 | Adiletta | Oct 2019 | A1 |
20190342642 | Adiletta | Nov 2019 | A1 |
20190342643 | Adiletta | Nov 2019 | A1 |
20190387291 | Adiletta | Dec 2019 | A1 |
20200007511 | Van de Groenendaal et al. | Jan 2020 | A1 |
20200226027 | Krasner et al. | Jul 2020 | A1 |
20200241926 | Guim Bernat | Jul 2020 | A1 |
20200341810 | Ranganathan et al. | Oct 2020 | A1 |
20210103544 | Guim Bernat | Apr 2021 | A1 |
20210209035 | Galbi et al. | Jul 2021 | A1 |
20210377140 | Adiletta | Dec 2021 | A1 |
Number | Date | Country |
---|---|---|
1468007 | Jan 2004 | CN |
1816003 | Aug 2006 | CN |
103634330 | Mar 2014 | CN |
105183561 | Dec 2015 | CN |
105721358 | Jun 2016 | CN |
105979007 | Sep 2016 | CN |
2002158733 | May 2002 | JP |
2018102414 | Jun 2018 | WO |
2018111228 | Jun 2018 | WO |
2020190801 | Sep 2020 | WO |
Entry |
---|
International Preliminary Report on Patentability for PCT Application No. PCT/US2017/063765, dated Jun. 4, 2019. |
International Search Report and Written Opinion for PCT Application No. PCT/US2017/063756, dated Feb. 23, 2018. |
International Search Report and Written Opinion for PCT Application No. PCT/US2021/051801, dated Jan. 3, 2022. |
Notice of Allowance for U.S. Appl. No. 16/344,582, dated Jan. 12, 2021. |
Notice of Allowance for U.S. Appl. No. 17/246,388, dated Dec. 13, 2022. |
Office Action for U.S. Appl. No. 16/344,582, dated Jul. 22, 2020. |
Office Action for U.S. Appl. No. 17/246,388, dated Jul. 21, 2022. |
“Directory-Based Cache Coherence”, Parallel Computer Architecture and Programming, CMU 15-418/15-618, Spring 2019. |
Denneman, Frank, “Numa Deep Dive Part 3: Cache Coherency”, https://frankdenneman.nl/2016/07/11/numa-deep-dive-part-3-cache-coherency/, Jul. 11, 2016. |
Gorman, Mel, et al., “Optimizing Linux for AMD EPYC 7002 Series Processors with SUSE Linux Enterprise 15 SP1” , SUSE Best Practices, Nov. 2019. |
Ronciak, John A., et al., “Page-Flip Technology for use within the Linux Networking Stack”, Proceedings of the Linux Symposium, vol. Two, Jul. 2004. |
Office Action for U.S. Appl. No. 17/221,541, dated Mar. 15, 2023. |
Office Action from European Patent Application No. 20217841.4 dated May 25, 2023, 9 pgs. |
Communication pursuant to Article 94(3) for European Patent Application No. 18191345.0, dated Apr. 16, 2021. |
Corrected Notice of Allowability for U.S. Appl. No. 17/015,479, dated Jun. 3, 2021. |
Extended European Search Report for European Patent Application No. 181934.0, dated Feb. 11, 2019. |
Extended European Search Report for European Patent Application No. 20217841.4, dated Apr. 16, 2021. |
Final Office Action for U.S. Appl. No. 15/719,770, dated Jun. 24, 2020. |
International Preliminary Report on Patentability for PCT Application No. PCT/US2017/038552, dated Jan. 22, 2019. |
International Search Report and Written Opinion for PCT Application No. PCT/US2017/038552, dated Oct. 11, 2017, 3 pages. |
Notice of Allowance for Chinese Patent Application No. 20170038785.3, dated Jul. 13, 2022. |
Notice of Allowance for U.S. Appl. No. 15/395,203, dated Apr. 10, 2018. |
Notice of Allowance for U.S. Appl. No. 15/719,770, dated Jun. 17, 2021. |
Notice of Allowance for U.S. Appl. No. 15/719,770, dated Mar. 1, 2021. |
Notice of Allowance for U.S. Appl. No. 15/721,829, dated Jan. 22, 2021. |
Notice of Allowance for U.S. Appl. No. 15/721,829, dated Sep. 11, 2020. |
Notice of Allowance for U.S. Appl. No. 16/055,602, dated Feb. 13, 2020. |
Notice of Allowance for U.S. Appl. No. 16/055,602, dated Oct. 28, 2019. |
Notice of Allowance for U.S. Appl. No. 16/513,345, dated Jun. 5, 2020. |
Notice of Allowance for U.S. Appl. No. 16/513,345, dated May 19, 2020. |
Notice of Allowance for U.S. Appl. No. 16/513,371, dated Jan. 31, 2020. |
Notice of Allowance for U.S. Appl. No. 16/513,371, dated Jun. 5, 2020. |
Notice of Allowance for U.S. Appl. No. 16/513,371, dated May 20, 2020. |
Notice of Allowance for U.S. Appl. No. 17/015,479, dated May 26, 2021. |
Notice of Allowance for U.S. Appl. No. 17/404,749, dated Nov. 9, 2022. |
Office Action for U.S. Appl. No. 15/396,014 dated Nov. 4, 2019. |
Office Action for U.S. Appl. No. 15/395,203, dated Dec. 1, 2017. |
Office Action for U.S. Appl. No. 15/396,014, dated May 10, 2022. |
Office Action for U.S. Appl. No. 15/396,014, dated May 14, 2020. |
Office Action for U.S. Appl. No. 15/396,014, dated Nov. 3, 2022. |
Office Action for U.S. Appl. No. 15/719,770, dated Dec. 27, 2019. |
Office Action for U.S. Appl. No. 15/721,829 dated Dec. 23, 2019. |
Office Action for U.S. Appl. No. 15/721,829, dated May 13, 2020. |
Office Action for U.S. Appl. No. 16/055,602 dated Mar. 27, 2019. |
Office Action for U.S. Appl. No. 16/055,602, dated Aug. 15, 2019. |
Office Action for U.S. Appl. No. 16/513,345, dated Jan. 31, 2020. |
Office Action for U.S. Appl. No. 17/015,479, dated Feb. 12, 2021. |
Office Action for U.S. Appl. No. 17/221,541, dated Oct. 25, 2022. |
Office Action for U.S. Appl. No. 17/404,749, dated Jul. 27, 2022. |
Summons to attend oral proceedings pursuant to Rule 115(1) for European Patent Application No. 18191345.0, dated Aug. 23, 2022. |
Translation of Office Action and Search Report for Chinese Patent Application No. 201780038785.3, dated Feb. 18, 2022. |
“Secure In-Field Firmware Updates for MSP MCUs”, Texas Instruments, Application Report, Nov. 2015. |
Artail, et al., “Speedy Cloud: Cloud Computing with Support for Hardware Acceleration Services”, 2017 IEEE, pp. 850-865. |
Asiatici, et al., “Virtualized Execution Runtime for FPGA Accelerators in the Cloud”, 2017 IEEE, pp. 1900-1910. |
Burdeniuk, et al., “An Event-Assisted Sequencer to Accelerate Matrix Algorithms”, 2010 IEEE, pp. 158-163. |
Caulfield, et al., “A Cloud-scale acceleration Architecture”, Microsoft Corp., Oct. 2016, 13 pages. |
Diamantopoulos, et al., “High-level Synthesizable Dataflow MapReduce Accelerator for FPGA-coupled Data Centers”, 2015 IEEE, pp. 26-33. |
Ding, et al., “A Unified OpenCL-flavor Programming Model with Scalable Hybrid Hardware Platform on FPGAs” , 2014 IEEE, 7 pages. |
Fahmy Suhaib, et al., “Virtualized FPGA Accelerators for Efficient Cloud Computing”, 2015 IEEE 7th International Conference on Cloud Computing Technology and Science (Cloudcom), IEEE, Nov. 30, 2015, pp. 430-435. |
Shade, L.K., “Implementing Secure Remote Firmware Updates”, Embedded Systems Conference Silicon Valley, 2011, May 2011. |
Non-Final Office Action from U.S. Appl. No. 17/221,541 dated Aug. 1, 2023, 15 pgs. |
Non-Final Office Action from U.S. Appl. No. 17/681,025 dated Jun. 23, 2023, 8 pgs. |
Non-Final Office Action from U.S. Appl. No. 18/116,957 dated Jun. 30, 2023, 27 pgs. |
Office Action from Chinese Patent Application No. 202110060921.7 dated Sep. 11, 2023, 5 pgs. |
Final Office Action from U.S. Appl. No. 17/125,420 dated Oct. 13, 2023, 19 pgs. |
Non-Final Office Action from U.S. Appl. No. 18/076,104 dated Dec. 12, 2023, 11 pgs. |
Notice of Allowance from U.S. Appl. No. 17/125,420 dated Jan. 10, 2024, 14 pgs. |
Notice of Allowance from U.S. Appl. No. 17/681,025 dated Oct. 17, 2023, 14 pgs. |
Office Action from Chinese Patent Application No. 201811004538.4 dated Dec. 25, 2023, 11 pgs. |
Office Action from Chinese Patent Application No. 201811006541.X dated Dec. 6, 2023, 10 pgs. |
Number | Date | Country | |
---|---|---|---|
20230176919 A1 | Jun 2023 | US |
Number | Date | Country | |
---|---|---|---|
62584401 | Nov 2017 | US | |
62427268 | Nov 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 17246388 | Apr 2021 | US |
Child | 18103739 | US | |
Parent | 16344582 | US | |
Child | 17246388 | US |