Patent Grant
11062200
Advancements in accelerated deep learning are needed to provide improvements in one or more of accuracy, performance, and energy efficiency.
Unless expressly identified as being publicly or well known, mention herein of techniques and concepts, including for context, definitions, or comparison purposes, should not be construed as an admission that such techniques and concepts are previously publicly known or otherwise part of the prior art. All references cited herein (if any), including patents, patent applications, and publications, are hereby incorporated by reference in their entireties, whether specifically incorporated or not, for all purposes.
The invention may be implemented in numerous ways, e.g., as a process, an article of manufacture, an apparatus, a system, a composition of matter, and a computer readable medium such as a computer readable storage medium (e.g., media in an optical and/or magnetic mass storage device such as a disk, an integrated circuit having non-volatile storage such as flash storage), or a computer network wherein program instructions are sent over optical or electronic communication links. The Detailed Description provides an exposition of one or more embodiments of the invention that enable improvements in cost, profitability, performance, efficiency, and utility of use in the field identified above. The Detailed Description includes an Introduction to facilitate understanding of the remainder of the Detailed Description. The Introduction includes Example Embodiments of one or more of systems, methods, articles of manufacture, and computer readable media in accordance with concepts described herein. As is discussed in more detail in the Conclusions, the invention encompasses all possible modifications and variations within the scope of the issued claims.
A detailed description of one or more embodiments of the invention is provided below along with accompanying figures illustrating selected details of the invention. The invention is described in connection with the embodiments. The embodiments herein are understood to be merely exemplary, the invention is expressly not limited to or by any or all of the embodiments herein, and the invention encompasses numerous alternatives, modifications, and equivalents. To avoid monotony in the exposition, a variety of word labels (such as: first, last, certain, various, further, other, particular, select, some, and notable) may be applied to separate sets of embodiments; as used herein such labels are expressly not meant to convey quality, or any form of preference or prejudice, but merely to conveniently distinguish among the separate sets. The order of some operations of disclosed processes is alterable within the scope of the invention. Wherever multiple embodiments serve to describe variations in process, system, and/or program instruction features, other embodiments are contemplated that in accordance with a predetermined or a dynamically determined criterion perform static and/or dynamic selection of one of a plurality of modes of operation corresponding respectively to a plurality of the multiple embodiments. Numerous specific details are set forth in the following description to provide a thorough understanding of the invention. The details are provided for the purpose of example and the invention may be practiced according to the claims without some or all of the details. For the purpose of clarity, technical material that is known in the technical fields related to the invention has not been described in detail so that the invention is not unnecessarily obscured.
This introduction is included only to facilitate the more rapid understanding of the Detailed Description; the invention is not limited to the concepts presented in the introduction (including explicit examples, if any), as the paragraphs of any introduction are necessarily an abridged view of the entire subject and are not meant to be an exhaustive or restrictive description. For example, the introduction that follows provides overview information limited by space and organization to only certain embodiments. There are many other embodiments, including those to which claims will ultimately be drawn, discussed throughout the balance of the specification.
In an aspect conceptually related to task synchronization for accelerated deep learning, techniques in advanced deep learning provide improvements in one or more of accuracy, performance, and energy efficiency. An array of processing elements performs flow-based computations on wavelets of data. Each processing element has a respective compute element and a respective routing element. Each compute element has memory. Each router enables communication via wavelets with at least nearest neighbors in a 2D mesh. Routing is controlled by respective virtual channel specifiers in each wavelet and routing configuration information in each router. A particular one of the compute elements conditionally selects for task initiation a previously received wavelet specifying a particular one of the virtual channels. The conditional selecting excludes the previously received wavelet for selection until at least block/unblock state maintained for the particular virtual channel is in an unblock state. The compute elements execute block/unblock instructions to modify the block/unblock state.
A first example of accelerated deep learning is using a deep learning accelerator to train a neural network. A second example of accelerated deep learning is using a deep learning accelerator to operate a trained neural network to perform inferences. A third example of accelerated deep learning is using a deep learning accelerator to train a neural network and subsequently perform inference with any one or more of the trained neural network, information from same, and a variant of same.
Examples of neural networks include Fully Connected Neural Networks (FCNNs), Recurrent Neural Networks (RNNs), Convolutional Neural Networks (CNNs), Long Short-Term Memory (LSTM) networks, autoencoders, deep belief networks, and generative adversarial networks.
An example of training a neural network is determining one or more weights associated with the neural network, such as by hardware acceleration via a deep learning accelerator. An example of making an inference is using a trained neural network to compute results by processing input data based on weights associated with the trained neural network. As used herein, the term ‘weight’ is an example of a ‘parameter’ as used in various forms of neural network processing. For example, some neural network learning is directed to determining parameters that are then usable for performing neural network inferences using the parameters.
A neural network processes data according to a dataflow graph comprising layers of neurons. Stimuli (e.g., input data) is received by an input layer of neurons and the computed results of the dataflow graph (e.g., output data) are provided by an output layer of neurons. Example layers of neurons include input layers, output layers, rectified linear unit layers, fully connected layers, recurrent layers, long short-term memory layers, convolutional layers, kernel layers, dropout layers, and pooling layers. A neural network is conditionally and/or selectively trained, subject to hardware acceleration. After being trained, a neural network is conditionally and/or selectively used for inference, subject to hardware acceleration.
An example of a deep learning accelerator is one or more relatively specialized hardware elements operating in conjunction with one or more software elements to train a neural network and/or perform inference with a neural network relatively more efficiently than using relatively less specialized hardware elements. Some implementations of the relatively specialized hardware elements include one or more hardware logic circuitry elements such as transistors, resistors, inductors, capacitors, wire interconnects, combinatorial logic (e.g., NAND, NOR) gates, latches, register files, memory arrays, tags for memory arrays, content-addressable memories, flash, ROM, DRAM, SRAM, Serializer/Deserializer (SerDes), I/O drivers, and the like, such as implemented via custom logic, synthesized logic, ASICs, and/or FPGAs. Some of the relatively less specialized hardware elements include conventional CPUs and conventional GPUs.
An example implementation of a deep learning accelerator is enabled to process dataflow in accordance with computations performed for training of a neural network and/or inference with a neural network. Some deep learning accelerators comprise processing elements coupled via a fabric and enabled to communicate with each other via the fabric. Sometimes the processing elements and the fabric are collectively referred to as a fabric of processing elements.
An example implementation of a processing element is enabled to communicate and process wavelets. In various circumstances, the wavelets correspond to dataflow and/or instruction flow in accordance with communication and/or processing enabling computations performed for training of and/or inference using a neural network.
An example processing element comprises a router to communicate wavelets via the fabric and a compute element to process the wavelets. An example router is coupled to a plurality of elements: a fabric, an off ramp to the compute element, and an on ramp from the compute element. An example coupling between the router and the fabric enables communication between the router and, e.g., four logically and/or physically adjacent processing elements. The router variously receives wavelets from the fabric and the on ramp. The router variously transmits wavelets to the fabric and the off ramp.
An example implementation of a compute element is enabled to process wavelets by initiating tasks and executing instructions associated with the wavelets, and accessing data associated with the wavelets and/or the instructions. The instructions are in accordance with an instruction set architecture comprising arithmetic instructions, control flow instructions, datatype conversion instructions, configuration instructions, fabric management instructions, and load/store instructions. The instructions operate on operands comprising various datatypes, e.g., integer datatypes and floating-point datatypes of various widths. The operands variously comprise scalar operands and vector operands. In various embodiments and/or usage scenarios, a vector variously represents, e.g., weights of a neural network, inputs or stimuli of a neural network, activations of a neural network, and/or partial sums of a neural network. In some scenarios, a vector is a sparse vector (e.g., a vector of neuron activations) and comprises sparse data elements (e.g., only non-zero elements). In some other scenarios, a vector is a dense vector (e.g., pixel values) and comprises dense data elements (e.g., all elements of the vector, including zero elements).
An example compute element comprises hardware elements that collectively execute the instructions associated with a wavelet by performing operations specified by the instructions (e.g., arithmetic operations, control flow operations, and load/store operations). Examples of the hardware elements include picker queues, a picker, a task definition table, an instruction sequencer, an instruction decoder, a data sequencer, a register file, a memory, a pseudo-random number generator, and an ALU. Some implementations of the hardware elements are in accordance with hardware logic circuitry elements as described elsewhere herein. Sometimes a compute element is referred to as a compute engine. Sometimes the compute scheduler is referred to as a picker and the compute scheduler queues are referred to as picker queues.
An example fabric is a collection of logical and/or physical couplings between processing elements and/or within a single processing element. The fabric is usable to implement logical and/or physical communication topologies such as a mesh, a 2D mesh, a 3D mesh, a hypercube, a torus, a ring, a tree, or any combination thereof. An example of a physical coupling between processing elements is a set of physical interconnects (comprising optional and/or selective buffering) between physically-coupled processing elements. A first example of physically-coupled processing elements is immediately physically adjacent processing elements, such as a first processing element located directly beside (such as ‘north’, ‘south’, ‘east’, or ‘west’) of a second processing element. A second example of physically-coupled processing elements is relatively physically nearby processing elements, such as a first processing element located within a relatively small number of intervening processing elements, e.g., one or two ‘rows’ and/or ‘columns’ away from a second processing element. A third example of physically-coupled processing elements is relatively physically far away processing elements, such as a first processing element located physical relatively far away from a second processing element, such as a distance limited by signal propagation (with or without optional and/or selective buffering) within a clock cycle and/or clock sub-cycle associated with the processing elements. An example of physical coupling within a single processing element (having, e.g., a compute element and a router) is an on ramp coupling output information from the compute element to the router, and an off ramp coupling input information from the router to the compute element. In some situations, the router routes information from the on ramp to the off ramp.
An example of a logical coupling between processing elements is a virtual channel as implemented by routers within processing elements. A route between a first processing element and a second processing element is implemented, e.g., by routers within processing elements along the route forwarding in accordance with the virtual channel and routing configuration information. An example of a logical coupling within a single particular processing element (having, e.g., a router) is a virtual channel as implemented by the router, enabling the particular processing element to send information via the virtual channel to the particular processing element. The router forwards “internally” with respect to the particular processing element in accordance with the virtual channel and routing configuration information.
An example wavelet is a bundle of information communicated between processing elements via the fabric. An example wavelet comprises a wavelet payload and a color. A wavelet payload comprises data and is associated with instructions. A first response to a wavelet received by a compute element of a processing element comprises the compute element initiating a task, such as corresponding to processing of instructions associated with the wavelet. A second response to a wavelet received by a compute element of a processing element comprises the compute element processing data of the wavelet. Example types of wavelets include dense wavelets and sparse wavelets, as well as data wavelets and control wavelets.
Wavelets are used, for example, for communicating between processing elements. In a first scenario, a first processing element transmits wavelets to a second processing element. In a second scenario, an external device (e.g., an FPGA) transmits wavelets to a processing element. In a third scenario, a processing element transmits wavelets to an external device (e.g., an FPGA).
An example virtual channel is one or more communication pathways specified by a color and enabled, e.g., by a fabric and one or more routers. A wavelet comprising a particular color is sometimes referred to as being associated with a particular virtual channel associated with the particular color. A first example of a color is a fabric color specifying a virtual channel between two different processing elements. In some embodiments, a fabric color is a 5-bit integer. A second example of a color is a local color specifying a virtual channel from a processing element to the processing element. In some embodiments, a color is a 6-bit integer and specifies one of a fabric color and a local color.
An example task comprises a collection of instructions executed in response to a wavelet. An example instruction comprises an operation and optionally one or more operands specifying locations of data elements to be processed in accordance with the operation. A first example of an operand specifies data elements in memory. A second example of an operand specifies data elements communicated (e.g., received or transmitted) via the fabric. An example of a data sequencer determines the locations of data elements. An example of an instruction sequencer determines an address in memory of instructions associated with a wavelet.
An example picker queue is enabled to hold wavelets received via an off ramp of the fabric for processing in the compute element. An example of a picker selects a wavelet from the picker queue for processing, and/or selects an active unblocked color for processing to initiate a corresponding task.
An example of storage is one or more elements enabled to retain state information, e.g., any one or more of: a flip-flop, a latch or an array of latches, a register or an array of registers, a register file, a memory, a memory array, a magnetic storage device, an optical storage device, SRAM, DRAM, flash, and ROM. In various embodiments storage is volatile (e.g., SRAM or DRAM) and/or non-volatile (e.g., flash or ROM).
An example of an Integrated Circuit (IC) is a collection of circuitry implemented on a single portion of semiconductor material. An example of an Application-Specific Integrated Circuit (ASIC) is an IC designed for a particular use. An example of wafer-scale integration is implementing a system using all or a significant portion of a wafer as an element of the system, e.g., by leaving the wafer whole or substantially whole.
In some embodiments and/or usage scenarios, wafer-scale integration enables connecting multiple elements in a system via wafer interconnect formed using silicon fabrication processes instead of via inter-chip interconnect, and thus improves any one or more of improved performance, cost, reliability, and energy efficiency. As a specific example, a system implemented using wafer-scale integration technology enables implementation of three million PEs on a single wafer, each of the PEs having bandwidth to nearest physical neighbors that is greater than a comparable system using other-than wafer-scale integration technology. The greater bandwidth enables the system implemented using wafer-scale integration technology to relatively efficiently train and/or perform inferences for larger neural networks than the system implemented using other-than wafer-scale integration technology.
At least some of the various shorthand abbreviations (e.g., acronyms) defined here refer to certain elements used herein.
In concluding the introduction to the detailed description, what follows is a collection of example embodiments, including at least some explicitly enumerated as “ECs” (Example Combinations), providing additional description of a variety of embodiment types in accordance with the concepts described herein; these examples are not meant to be mutually exclusive, exhaustive, or restrictive; and the invention is not limited to these example embodiments but rather encompasses all possible modifications and variations within the scope of the issued claims and their equivalents.
EC1. A method comprising:
EC2) The method of EC1, further comprising excluding the first fabric packet from being picked until at least the block/unblock state maintained for the specified virtual channel is in the unblock state
EC3) The method of EC1, further comprising:
EC4) The method of EC3, further comprising:
EC5) The method of EC1, further comprising:
EC6) The method of EC1, further comprising, in the receiving processing element, setting the respective block/unblock state maintained for the particular virtual channel to a blocked state in response to a block instruction specifying a particular one of the virtual channels.
EC7) The method of EC1, further comprising, in the receiving processing element, setting the respective block/unblock state maintained for the particular virtual channel to an unblocked state in response to an unblock instruction specifying a particular one of the virtual channels.
EC8) The method of EC1, wherein the one or more fabric routers comprise fabric routers of the sending processing element, the receiving processing element, and at least one more of the processing elements.
EC9) The method of EC1, wherein the sending processing element, the one or more fabric routers, and the receiving processing element are fabricated via wafer-scale integration.
EC10) The method of EC1, wherein the sending processing element and the receiving processing element are fabricated via wafer-scale integration on separate die of a single wafer.
EC11) The method of EC1, wherein at least some of the exchanged fabric packets are fabric vectors.
EC12) The method of EC1, further comprising:
EC13) The method of EC12, wherein except for defects, the fabric is homogeneous, the plurality of processing elements numbers in the hundreds of thousands, each processing element comprises in the tens of kB of private local storage for instructions and data, and the parameters and task software comprises in the tens of GB of instruction and data storage for one or more of inference and training.
EC14) The method of EC12, wherein the concurrently executing does not require any access to storage external to the fabric for any intermediate state or additional parameters of the dataflow graph.
EC15) The method of EC12, wherein the dataflow graph is a neural network, the nodes correspond to neurons, and at least some of parameters of the dataflow graph correspond to a plurality of weights of the neural network.
EC16) The method of EC1, wherein the sending processing element implements at least a portion of a first neuron of a neural network and the receiving processing element implements at least a portion of a second neuron of a neural network.
EC17) The method of EC1, wherein the sending processing element implements at least a portion of a first layer of a neural network and the receiving processing element implements at least a portion of a second layer of a neural network.
EC18) The method of EC1, wherein the sending processing element and the receiving processing element implement respective portions of at least a partitioned neuron of a neural network.
EC19) The method of EC1, further comprising, with respect to the receiving processing element, managing fabric packet input queues to have generally equal average rates of production and consumption by stalling/resuming task activities via manipulation of the block/unblock state.
EC20) The method of EC1, further comprising, with respect to the receiving processing element, managing one or more priorities within and between tasks by stalling/resuming task activities via manipulation of the block/unblock state.
EC21) The method of EC1, further comprising, with respect to the receiving processing element, managing one or more dependencies within and between tasks by stalling/resuming task activities via manipulation of the block/unblock state.
EC22) The method of EC1, further comprising, with respect to the receiving processing element, synchronizing one or more of computations and communications of one or more tasks, via manipulation of the block/unblock state.
EC23) The method of EC1, further comprising, with respect to the receiving processing element, implementing task software interlocks via manipulation of the block/unblock state.
EC24) The method of EC1, further comprising synchronizing data sourced via unequal delay paths by manipulation of the block/unblock state of one or more of the processing elements along the delay paths.
EC25) The method of EC1, further comprising shaping at least some dataflow in at least part of the fabric by manipulation of the block/unblock state of one or more of the processing elements.
EC26. An apparatus comprising:
EC27) The apparatus of EC26, further comprising means for excluding the first fabric packet from being picked until at least the block/unblock state maintained for the specified virtual channel is in the unblock state.
EC28) The apparatus of EC26, further comprising:
EC29) The apparatus of EC28, further comprising:
EC30) The apparatus of EC26, further comprising:
EC31) The apparatus of EC26, further comprising, in the receiving processing element, means for setting the respective block/unblock state maintained for the particular virtual channel to a blocked state in response to a block instruction specifying a particular one of the virtual channels.
EC32) The apparatus of EC26, further comprising, in the receiving processing element, means for setting the respective block/unblock state maintained for the particular virtual channel to an unblocked state in response to an unblock instruction specifying a particular one of the virtual channels.
EC33) The apparatus of EC26, wherein the one or more fabric routers comprise fabric routers of the sending processing element, the receiving processing element, and at least one more of the processing elements.
EC34) The apparatus of EC26, wherein the sending processing element, the one or more fabric routers, and the receiving processing element are fabricated via wafer-scale integration.
EC35) The apparatus of EC26, wherein the sending processing element and the receiving processing element are fabricated via wafer-scale integration on separate die of a single wafer.
EC36) The apparatus of EC26, wherein at least some of the exchanged fabric packets are fabric vectors.
EC37) The apparatus of EC26, further comprising:
EC38) The apparatus of EC37, wherein except for defects, the fabric is homogeneous, the plurality of processing elements numbers in the hundreds of thousands, each processing element comprises in the tens of kB of private local storage for instructions and data, and the parameters and task software comprises in the tens of GB of instruction and data storage for one or more of inference and training.
EC39) The apparatus of EC37, wherein the means for concurrently executing does not require any access to storage external to the fabric for any intermediate state or additional parameters of the dataflow graph.
EC40) The apparatus of EC37, wherein the dataflow graph is a neural network, the nodes correspond to neurons, and at least some of parameters of the dataflow graph correspond to a plurality of weights of the neural network.
EC41) The apparatus of EC26, wherein the sending processing element implements at least a portion of a first neuron of a neural network and the receiving processing element implements at least a portion of a second neuron of a neural network.
EC42) The apparatus of EC26, wherein the sending processing element implements at least a portion of a first layer of a neural network and the receiving processing element implements at least a portion of a second layer of a neural network.
EC43) The apparatus of EC26, wherein the sending processing element and the receiving processing element implement respective portions of at least a partitioned neuron of a neural network.
EC44) The apparatus of EC26, further comprising, with respect to the receiving processing element, means for managing fabric packet input queues to have generally equal average rates of production and consumption by stalling/resuming task activities via manipulation of the block/unblock state.
EC45) The apparatus of EC26, further comprising, with respect to the receiving processing element, means for managing one or more priorities within and between tasks by stalling/resuming task activities via manipulation of the block/unblock state.
EC46) The apparatus of EC26, further comprising, with respect to the receiving processing element, means for managing one or more dependencies within and between tasks by stalling/resuming task activities via manipulation of the block/unblock state.
EC47) The apparatus of EC26, further comprising, with respect to the receiving processing element, means for synchronizing one or more of computations and communications of one or more tasks, via manipulation of the block/unblock state.
EC48) The apparatus of EC26, further comprising, with respect to the receiving processing element, means for implementing task software interlocks via manipulation of the block/unblock state.
EC49) The apparatus of EC26, further comprising means for synchronizing data sourced via unequal delay paths by manipulation of the block/unblock state of one or more of the processing elements along the delay paths.
EC50) The apparatus of EC26, further comprising means for shaping at least some dataflow in at least part of the fabric by manipulation of the block/unblock state of one or more of the processing elements.
EC51) A method comprising:
EC52) The method of EC51, wherein the instruction is in accordance with a block instruction.
EC53) The method of EC51, wherein the processing element is a first processing element, and additionally comprising transmitting a fabric packet associated with one of the specified one or more virtual channels from a second processing element comprising a coupling to the fabric to the first processing element, wherein the first processing element and second processing element are fabricated via wafer-scale integration.
EC54) The method of EC51, wherein the plurality of virtual channels comprise one or more local virtual channels and one or more fabric virtual channels.
EC55) The method of EC51, wherein the scheduler comprises a respective block indicator associated with each of the plurality of virtual channels and the dynamically disabling comprises setting the block indicators associated with the specified one or more virtual channels to a blocked state.
EC56) The method of EC55, wherein each block indicator comprises a respective block bit.
EC57) The method of EC55, wherein the fabric packet is a first fabric packet, the scheduler subsequently selects a second fabric packet for processing from a particular one of the one or more input queues, the particular one of the one or more input queues is associated with a particular one of the plurality of virtual channels, and the block indicator associated with the particular virtual channel is set to something other than the blocked state.
EC58) The method of EC51, wherein a source operand of the instruction specifies the specified one or more virtual channels.
EC59) The method of EC58, wherein the source operand is an immediate source operand and the value of the immediate source operand specifies a particular one of the plurality of virtual channels.
EC60) The method of EC51, wherein the instruction is associated with a previously stored fabric packet received via the fabric.
EC61) The method of EC60, wherein the previously stored fabric packet was previously selected by the scheduler for processing.
EC62) The method of EC59, wherein the immediate source operand is a particular length of eight bits.
EC63) The method of EC51, wherein the selecting comprises selecting the one of the one or more input queues and then selecting the oldest fabric packet in the selected input queue.
EC64) The method of EC51, wherein the one or more virtual channels comprise at least a portion of a neural network.
EC65) The method of EC51, wherein at least one of the one or more virtual channels comprises at least a portion of a connection between a plurality of neurons of a neural network.
EC66) The method of EC51, wherein at least one of the one or more virtual channels comprises at least a portion of a connection between a plurality of layers of a neural network.
EC67) The method of EC51, wherein at least one of the one or more virtual channels comprises at least a portion of a connection between a plurality of neurons of a layer of a neural network.
EC68) The method of EC51, wherein the one or more virtual channels are used for communicating at least one of data and control associated with one or more of: computing an activation of a neural network, computing a partial sum of activations of a neural network, computing an error of a neural network, computing a gradient estimate of a neural network, and updating a weight of a neural network.
EC69) The method of EC51, wherein the one or more virtual channels is one virtual channel.
EC70) A method comprising:
EC71) The method of EC70, further comprising, in the receiving processing element, in response to a block instruction specifying a particular one of the virtual channels, setting the respective block/unblock state maintained for the particular virtual channel to a blocked state.
EC72) The method of EC70, further comprising, in the receiving processing element, in response to an unblock instruction specifying a particular one of the virtual channels, setting the respective block/unblock state maintained for the particular virtual channel to an unblocked state.
EC73) The method of EC70, wherein the sending processing element, the one or more routing elements, and the receiving processing element are fabricated via wafer-scale integration.
EC74) The method of EC70, wherein the one of the plurality of virtual channels is used for communicating at least one of control and data associated with one or more of: computing an activation of a neural network, computing a partial sum of activations of a neural network, computing an error of a neural network, computing a gradient estimate of a neural network, and updating a weight of a neural network.
EC75) The method of EC70, wherein the sending processing element implements at least a portion of a first neuron of a neural network and the receiving processing element implements at least a portion of a second neuron of a neural network.
EC76) The method of EC70, wherein the sending processing element implements at least a portion of a first layer of a neural network and the receiving processing element implements at least a portion of a second layer of a neural network.
EC77) The method of EC70, wherein the sending processing element and the receiving processing element implement portions of at least a neuron of a neural network.
EC78) The method of EC70, wherein the fabric packet comprises at least one of control and data associated with one or more of: computing an activation of a neural network, computing a partial sum of activations of a neural network, computing an error of a neural network, computing a gradient estimate of a neural network, and updating a weight of a neural network.
EC79) A method comprising:
EC80) The method of EC79, wherein the instruction is in accordance with an unblock instruction.
EC81) The method of EC79, wherein the processing element is a first processing element, and additionally comprising transmitting a fabric packet associated with one of the specified one or more virtual channels from a second processing element comprising a coupling to the fabric to the first processing element, wherein the first processing element and second processing element are fabricated via wafer-scale integration.
EC82) The method of EC79, wherein the plurality of virtual channels comprise one or more local virtual channels and one or more fabric virtual channels.
EC83) The method of EC79, wherein the scheduler comprises a respective block indicator associated with each of the plurality of virtual channels and the dynamically enabling comprises setting the block indicators associated with the specified one or more virtual channels to an unblocked state.
EC84) The method of EC83, wherein each block indicator comprises a respective block bit.
EC85) The method of EC83, wherein the fabric packet is a first fabric packet, the scheduler subsequently selects a second fabric packet for processing from a particular one of the one or more input queues, the particular one of the one or more input queues is associated with a particular one of the plurality of virtual channels, and the block indicator associated with the particular virtual channel is set to the unblocked state.
EC86) The method of EC79, wherein a source operand of the instruction specifies the specified one or more virtual channels.
EC87) The method of EC86, wherein the source operand is an immediate source operand and the value of the immediate source operand specifies a particular one of the plurality of virtual channels.
EC88) The method of EC79, wherein the instruction is associated with a previously stored fabric packet received via the fabric.
EC89) The method of EC88, wherein the fabric packet was previously selected by the scheduler for processing.
EC90) The method of EC87, wherein the immediate source operand is a particular length of eight bits.
EC91) The method of EC79, wherein the selecting comprises selecting the one of the one or more input queues and then selecting the oldest fabric packet in the selected input queue.
EC92) The method of EC79, wherein the one or more virtual channels comprise at least a portion of a neural network.
EC93) The method of EC79, wherein at least one of the one or more virtual channels comprises at least a portion of a connection between a plurality of neurons of a neural network.
EC94) The method of EC79, wherein at least one of the one or more virtual channels comprises at least a portion of a connection between a plurality of layers of a neural network.
EC95) The method of EC79, wherein at least one of the one or more virtual channels comprises at least a portion of a connection between a plurality of neurons of a layer of a neural network.
EC96) The method of EC79, wherein the one or more virtual channels are used for communicating at least one of control and data associated with one or more of: computing an activation of a neural network, computing a partial sum of activations of a neural network, computing an error of a neural network, computing a gradient estimate of a neural network, and updating a weight of a neural network.
EC97) The method of EC79, wherein the one or more virtual channels is one virtual channel.
Embodiments relating to neural network training and inference, comprising deep learning accelerator hardware elements and software elements are described herein (see, e.g.,
Deep Learning Accelerator Overview
Referring to the figure, Deep Learning Accelerator 120 comprises FPGAs 121 and PEs 122, enabled to communicate with each other, as illustrated by Coupling 123. Placement Server(s) 150, (comprising CPUs 151 and CRM 152) is coupled to Connection Server(s) 160 (comprising CPUs 161, CRM 162, and NICs 164) via LAN 111. Connection Server(s) 160 is enabled to communicate with FPGAs 121 via NICs 164 and 100 Gb 112. Autonomous Vehicle 130 comprises CPUs 131, CRM 132, IEs 133, and Camera 135. Cell Phone 140 comprises CPUs 141, CRM 142, IEs 143, and Camera 145.
Internet 180 provides for coupling (not explicitly illustrated) between any combination of Placement Server(s) 150, Connection Server(s) 160, Autonomous Vehicle 130, and/or Cell Phone 140, according to various embodiments and/or usage scenarios.
Dashed-arrow Placements 113 conceptually indicates placement information communicated from Placement Server(s) 150 to PEs 122 (e.g., via LAN 111, Connection Server(s) 160/NICs 164, 100 Gb 112, FPGAs 121, and Coupling 123). In some embodiments and/or usage scenarios, Placements 113 is implicit, reflected in initialization information provided to router elements of PEs 122 and compute elements of PEs 122. In some embodiments and/or usage scenarios, a portion of initialization information of Placements 113 is provided to FPGAs 121 to configure elements of FPGAs 121 for operation with PEs 122.
Dashed-arrow Weights 114 and dashed-arrow Weights 115 conceptually indicate weight information communicated from PEs 122 respectively to Autonomous Vehicle 130 and Cell Phone 140 (e.g., via Coupling 123, FPGAs 121, 100 Gb 112, Connection Server(s) 160/NICs 164 and Internet 180). In some embodiments and/or usage scenarios, the weight information is any one or more of all or any portions of weight information as directly produced as a result of training, a sub-sampling thereof, a quantization thereof, and/or other transformations thereof.
Deep Learning Accelerator 120 is enabled to perform training of neural networks, such as by computing weights in response to placement information and training information received via 100 Gb 112. Deep Learning Accelerator 120 is further enabled to, upon training completion, provide the weights as results via 100 Gb 112. The weights are then usable for inference, such as in Autonomous Vehicle 130 and/or in Cell Phone 140. PEs 122 comprises a relatively large number of PEs (e.g., 10,000 or more) each enabled to independently perform routing and computations relating to training. In some embodiments and/or usage scenarios, PEs 122 is implemented via wafer-scale integration, such as respective pluralities of PEs implemented on respective dice of a single wafer. FPGAs 121 is enabled to interface PEs 122 to information provided via 100 Gb 112. The interfacing includes conversion to/from modified Ethernet frames from/to Wavelets, as communicated on Coupling 123.
Placement Server(s) 150 is enabled to programmatically determine placements of neurons (e.g., as indicated by Placements 113) via one or more placement programs. The placement programs are stored in CRM 152 and executed by CPUs 151. The placement information is communicated to Connection Server(s) 160 via LAN 111. An example of a placement is a mapping of logical neurons of a neural network onto physical memory and execution hardware resources (e.g., PEs 122).
Connection Server(s) 160 is enabled to communicate with FPGAs 121 and indirectly with PEs 122 via FPGAs 121/Coupling 123, via NICs 164 and programmed control thereof via driver programs. In various embodiments and/or usage scenarios, the communication comprises placement information (e.g., from Placement Server(s) 150), training information (e.g., from sources not illustrated but accessible via Internet 180) and/or results of training (e.g., weights from PEs 122). The driver programs are stored in CRM 162 and executed by CPUs 161.
Autonomous Vehicle 130 is enabled to use Weights 114 to perform inferences using IEs 133 as programmatically controlled and/or assisted by CPUs 131 executing programs stored in CRM 132. The inferences are optionally and/or selectively performed using information obtained from Camera 135. For example, a car is operable as an autonomous vehicle. The car comprises cameras enabled to provide video to an inference engine. The inference engine is enabled to recognize objects related to navigating the car, such as traffic lanes, obstructions, and other objects. The car is enabled to navigate using results of the object recognition. Any combination of the providing, the recognizing, and the navigating are controlled and/or performed at least in part via one or more CPUs executing programs stored in a CRM.
Cell Phone 140 is enabled to use Weights 115 to perform inferences using IEs 143 as programmatically controlled and/or assisted by CPUs 141 executing programs stored in CRM 142. The inferences are optionally and/or selectively performed using information obtained from Camera 145. For example, the cell phone is operable to post tagged photos on a social networking web site. The cell phone comprises a camera enabled to provide image data to an inference engine. The inference engine is enabled to tag objects (e.g., by type such as ‘cat’, ‘dog’, and so forth, or by name such as ‘Bob’, ‘Mary’, and so forth) in the image. The cell phone is enabled to post the image and results of the tagging to the social networking web site. Any combination of the providing, the tagging, and the posting are controlled and/or performed at least in part via one or more CPUs executing programs stored in a CRM.
In various embodiments and/or usage scenarios, all or any portions of weight information determined via a deep learning accelerator is post-processed outside of the accelerator before inference usage. For example, all or any portions of information represented by Weights 114 and/or Weights 115, is processed in whole or in part by Placement Server(s) 150 before inference usage by Autonomous Vehicle 130 and/or Cell Phone 140. In various embodiments and/or usage scenarios, an example of post-processing comprises quantizing Weights 114 and/or Weights 115 (e.g., converting from a floating-point number format to a fixed-point number format). In various embodiments and/or usage models, Camera 135 and Camera 145 are respective examples of sensors that provide input to IEs 133 and IEs 143. Other examples of sensors are location sensors, orientation sensors, magnetic sensors, light sensors, and pressure sensors.
CPUs 151 comprises one or more CPUs that are compatible with respective instruction set architectures. CPUs 151 is enabled to fetch and execute instructions from CRM 152 in accordance with the instruction set architectures. CPUs 161 comprises one or more CPUs that are compatible with respective instruction set architectures. CPUs 161 is enabled to fetch and execute instructions from CRM 162 in accordance with the instruction set architectures. In some embodiments, at least one of the instruction set architectures of CPUs 151 is compatible with at least one of the instruction set architectures of CPUs 161.
CPUs 131 comprises one or more CPUs that are compatible with respective instruction set architectures. CPUs 131 is enabled to fetch and execute instructions from CRM 132 in accordance with the instruction set architectures. CPUs 141 comprises one or more CPUs that are compatible with respective instruction set architectures. CPUs 141 is enabled to fetch and execute instructions from CRM 142 in accordance with the instruction set architectures. In some embodiments, at least one of the instruction set architectures of CPUs 131 is compatible with at least one of the instruction set architectures of CPUs 141. In some embodiments, any one or more of CPUs 151, CPUs 161, CPUs 131, and CPUs 141 have instruction set architectures that are compatible with each other.
In some embodiments and/or usage scenarios, at least a respective portion of each of CRM 152 and CRM 162 CRM 132, and CRM 142, is non-volatile and comprised of any one or more of flash memory, magnetic memory, optical memory, phase-change memory, and other non-volatile memory technology elements.
In various embodiments and/or usage scenarios, IEs 133 and/or IEs 143 comprise one or more inference engines enabled to use weight information as determined by Deep Learning Accelerator 120 (and indicated conceptually by Weights 114 and/or Weights 115). In various embodiments and/or usage scenarios, IEs 133 operates in conjunction with and/or under control of programs executed by CPUs 131 and stored in CRM 132. In various embodiments and/or usage scenarios, IEs 143 operates in conjunction with and/or under control of programs executed by CPUs 141 and stored in CRM 142. In various embodiments and/or usage scenarios, all or any portions of IEs 133 and/or IEs 143 are implemented via various combinations of HW and/or SW techniques. In some embodiments, all or any portions of functionality provided by IEs 133 and/or IEs 143 is implemented using techniques such as implemented by and/or associated with Deep Learning Accelerator 120. In various embodiments and/or usage scenarios, all or any portions of IEs 133 and/or IEs 143 are variously implemented via techniques comprising various combinations of conventional CPUs, conventional GPUs, conventional DSPs, conventional FPGAs, and specialized hardware.
In various embodiments, 100 Gb 112, is variously a 100 Gb Ethernet coupling for sending standard Ethernet frames, a 100 Gb Ethernet coupling for sending modified Ethernet frames, a 100 GB modified Ethernet coupling for sending modified Ethernet frames, a 100 Gb serial coupling of other-than Ethernet technology, or some other relatively high-speed serial coupling.
In some embodiments and/or usage scenarios, Coupling 123 communicates information as wavelets.
In various embodiments, LAN 111 is implemented using techniques such as Ethernet, Fibre Channel, and/or other suitable interconnection technologies.
In some embodiments and/or usage scenarios, Placement Server(s) 150 and Connection Server(s) 160 are implemented and/or operated as a combined element (e.g., sharing CPU, CRM, and/or NIC resources), as illustrated conceptually by Combined Server(s) 110. In some embodiments and/or usage scenarios, Placement Server(s) 150 and Connection Server(s) 160 are coupled via Internet 180 rather than (or in addition to) LAN 111.
Connection Server(s) SW 220 comprises 100 Gb NIC Driver 224, Training Info Provider SW 225, and Weight Receiver SW 226, as well as other elements not illustrated, according to embodiment. In various embodiments and/or usage scenarios, all or any portions of Connection Server(s) SW 220 is stored in CRM 162 and executable by CPUs 161 of
In various embodiments and/or usage scenarios, Misc SW on FPGAs 250 conceptually represents SW executed by one or more CPUs comprised in FPGAs 121 of (
In various embodiments and/or usage scenarios, Task SW on PEs 260 conceptually represents distributed SW executed as tasks on various PEs of PEs 122. In various embodiments and/or usage scenarios, all or any portions of Task SW on PEs 260 and/or a representation thereof is stored in non-volatile memory comprised in PEs 122 and/or accessible to Connection Server(s) 160. In various embodiments and/or usage scenarios, Task SW on PEs 260 enables performing processing of training data such as to determine weights of a neural network (e.g., via forward, delta, and chain passes).
Autonomous Vehicle SW 230 comprises Video Camera SW 232, Inference Engine(s) SW 233, and Navigating SW 234, as well as other elements not illustrated, according to embodiment. In various embodiments and/or usage scenarios, all or any portions of Autonomous Vehicle SW 230 is stored in CRM 132 and executable by CPUs 131 of
Cell Phone SW 240 comprises Still Camera SW 242, Inference Engine(s) SW 243, Posting SW 244, as well as other elements not illustrated, according to embodiment. In various embodiments and/or usage scenarios, all or any portions of Cell Phone SW 240 is stored in CRM 142 and executable by CPUs 141 of
In various embodiments and/or usage scenarios, any one or more of SW collections Placement Server(s) SW 210, Connection Server(s) SW 220, Autonomous Vehicle SW 230, and/or Cell Phone SW 240 optionally and/or selectively comprise one or more operating system elements, e.g., one or more real-time operating systems, one or more non-real-time operating systems, and/or one or more other control programs to coordinate elements of each respective SW collection.
After the FPGA resources and PE resources are initialized in preparation for the training, training data is applied to the PEs in action 340. The PE resources process the training data in action 350. Then a check is made to determine if training is complete, e.g., because application of the training data is complete and/or one or more completion criteria are met (such as an inference error below a predetermine bound) in action 360. If not, then flow passes back to action 340 for application of further training data. In some scenarios, the training does not complete and in some embodiments, control instead passes to another action (not illustrated) to enable changing, for example, hyperparameters of the neural network (e.g., any one or more of: adding layers of neurons, removing layers of neurons, changing connectivity between neurons, changing the batch size, and changing the learning rule). The changed neural network is then trained in accordance with actions 310, 320, 330, 340, 350, and 360.
If training is complete, then flow continues to provide weights that are results of the training for use in inferences in 370. In some embodiments and/or usage scenarios, the weights are quantized, e.g., transformed to an integer data format. In some embodiments and/or usage scenarios, the integer data format is a reduced precision number format (e.g., 8-bit or 16-bit). The weights are then provided to one or more inference engines, and used to make inferences in action 380.
In various embodiments and/or usage scenarios, the inference engines correspond to one or more inference applications, e.g., text translation, optical character recognition, image classification, facial recognition, scene recognition for a self-driving car, speech recognition, data analysis for high energy physics, and drug discovery.
In various embodiments and/or usage scenarios, the PE resources correspond, e.g., to PEs 122 of
In various embodiments and/or usage scenarios, any one or more of all or any portions of actions of Neural Network Training/Inference 300 are performed by and/or related to all or any portions of any one or more elements of Neural Network System 100 of
In various embodiments and/or usage scenarios, any one or more of all or any portions of actions of Neural Network Training/Inference 300 are performed in conjunction with communicating information between various elements of Neural Network System 100 of
In some embodiments and/or usage scenarios, an array of identical instances of a same ASIC is formed on a wafer, and each of the same ASICs comprises a plurality of identical instances of a same PE (e.g., PE 499), forming a wafer (e.g., Wafer 412) usable in wafer-scale integration techniques. Unless indicated to the contrary, references herein to a “wafer” (including to Wafer 412) are applicable to embodiments of a whole or substantially whole wafer as well as to embodiments of a significant portion of a wafer. In some embodiments and/or usage scenarios, a peripheral portion of the PEs are coupled to I/O FPGAs 420. Example ASICs are illustrated as ASIC 410, comprising a column-organized section of PEs (replicated, e.g., in a one-dimensional fashion to form a wafer), and ASIC 411, comprising a square-organized section or a rectangular-organized section of PEs (replicated, e.g., in a two-dimensional fashion to form a wafer). Other organizations of ASICs on a wafer are contemplated.
In some embodiments and/or usage scenarios, neurons associated with layers in a neural network are generally placed on PE 499 elements in a left to right fashion, with earlier layers (e.g., the input layer) on the left and subsequent layers (e.g., the output layer) on the right. Accordingly, data flow during training is illustrated conceptually as dashed-arrows Forward 401, Delta 402, and Chain 403. During Forward 401, stimuli is applied to the input layer and activations from the input layer flow to subsequent layers, eventually reaching the output layer and producing a forward result. During Delta 402, deltas (e.g., differences between the forward result and the training output data) are propagated in the backward direction. During Chain 403, gradients are calculated based on the deltas (e.g., with respect to the weights in the neurons) as they are generated during Delta 402. In some embodiments and/or usage scenarios, processing for Delta 402 is substantially overlapped with processing for 403.
In some embodiments and/or usage scenarios, Deep Learning Accelerator 400 is an implementation of Deep Learning Accelerator 120 of
In some embodiments and/or usage scenarios, the placement of neurons (e.g., associated with layers in a neural network) onto PE 499 elements is performed in whole or in part by all or any portions of Placement Server(s) SW 210 of
Fabric Overview
As illustrated in
The fabric operates as a communication interconnect between all the PEs in the deep learning accelerator. The fabric transfers wavelets, e.g., via 30-bit physical couplings to enable transfer of an entire wavelet per cycle (e.g., core clock cycle). Conceptually the fabric is a local interconnect distributed throughput the PEs such that each PE is enabled to communicate directly with its (physical) neighbors. Communication to other-than (physical) neighbors is via hops through intermediate nodes, e.g., others of the PEs. In some embodiments and/or usage scenarios, a distributed local fabric topology efficiently maps to a neural network workload, e.g., each layer sends data to a neighboring layer) and/or is implementable with relatively lower cost in hardware.
An example fabric comprises 16 logically independent networks referred to as colors. Each color is a virtual network, e.g., virtual channel, overlaid on a single physical network. Each color has dedicated physical buffering resources but shares the same physical routing resources. The dedicated physical buffers enable non-blocking operation of the colors. The shared physical routing reduces physical resources. In various embodiments and/or usage scenarios, a fabric comprises various numbers of colors (e.g., 8, 24, or 32).
There is a routing pattern associated with each color and implemented by the routers. The routing pattern of each pattern is programmable and in some embodiments is statically configured, e.g., based at least in part on determinations made by Placement Server(s) SW 210 and/or Neuron to PE Mapping SW 212 of
As illustrated in
Performing each hop in the X or Y dimension in a single clock, in some embodiments and/or usage scenarios, enables simplifying implementation of arbitrary programmable routing topologies and related timing constraints. In some circumstances, the single cycle per hop latency is compatible with an associated pipelined data flow pattern. In some circumstances (e.g., when communicating from one layer to a next layer), the single cycle per hop latency adds additional latency and reduces performance. The additional latency is worst when the layer is deep and uses many PEs, since more hops are used to escape the layer and to reach all the PEs of the next layer. The additional latency results in overall workload pipeline length increasing and therefore storage (e.g. for forward pass activations) increasing.
The skip connections are used to reduce the additional latency. Consider an example. Each skip connection skips 50 PEs in a single core clock cycle. The latency to enter the first skip connection is 49 hops maximum. The latency to reach a final PE after exiting a final skip connection is 49 hops maximum. Therefore, there is a 98 core clock cycle maximum latency overhead and a 49 core clock cycle average latency overhead. The latency to process a layer is 2000 core clock cycles. Thus, in the example, there is a 5% maximum overall overhead and a 2.5% average overall overhead.
In some embodiments and/or usage scenarios, each row has skip connections and each column has loop connections. In some embodiments and/or usage scenarios, each skip connection skips 50 PEs, and each column has 200 PEs that a loop connection encompasses. In some embodiments, a single loop connection (e.g., in a context of a column of PEs, between the PE at the bottom of the column and the PE at the top of the column) approximately physically spans the column, and in other embodiments, loop connections of the column are physically implemented by folding so that the average and worst case loop hops approximately physically span two PEs.
In some embodiments and/or usage scenarios, the fabric interconnects 200×100 PEs per ASIC, with 200 PEs in the vertical dimension and 100 PEs in the horizontal dimension. The fabric is general purpose and usable by software executing on the PEs (e.g. Task SW on PEs 260 of
Conceptually, on the fabric, backpressure information flows along the same topology and at the same rate as data the backpressure information corresponds to, but in the opposite direction of the corresponding data. E.g., a router sends backpressure information along the reverse path of the fixed routing pattern. There is an independent backpressure channel (e.g., signal) for each color, enabling communicating backpressure information for multiple colors simultaneously. The independent back pressure channels simplify, in some embodiments and/or usage scenarios, the backpressure communication when there are multiple queues draining on the same cycle (e.g., to different outputs).
When a color is back pressured, data queued at each hop within the fabric is stalled. Conceptually, the queued data is an extension to a queue at the destination since it is drained into the destination once the backpressure is released. For example, the backpressure signal from a particular PE and corresponding to a particular color is only asserted when a data queue of the router of the particular PE and corresponding to the particular color is at a predetermined threshold (e.g., full or nearly full). Therefore, with respect to the particular color, data flows until reaching a stalled PE, such that the data queue effectively operates as a portion of a distributed in-fabric queue.
The fixed routing pattern provides for multicast replication within each router. Multicast enables high fan-out communication patterns, such as within some neural network workloads. To perform multicast, each router node is statically configured with multiple outputs per multicast color. The router replicates an incoming wavelet corresponding to the multicast color to all outputs specified by the static configuration before processing the next wavelet of the multicast color. In some circumstances there are a plurality of multicast colors, each statically configured with a respective set of multiple outputs.
The router provides for multiple input sources per color and processes a single active input source at a time. Coordination of the input sources is performed, for example, by software at a higher-level (e.g. flow control dependency, explicit messaging between PEs, or other suitable mechanisms) so that only a single input source is active at a time. Implementing a single active input source enables, in some embodiments and/or usage scenarios, relatively lower-cost hardware since the router has a single buffer per color instead of a buffer per input source.
Since there is only a single active input source at a time, there is not any congestion within a color. However, in some circumstances, congestion occurs between colors since the colors share a single physical channel. The router responds to the congestion by scheduling between ready colors onto a single shared output channel.
Deadlock on the fabric is possible since the fabric is blocking (e.g., the fabric and the routers have no hardware deadlock avoidance mechanisms). Deadlock is avoided by software configuring the fixed routing patterns to be free of dependent loops, thus avoiding circular dependencies and deadlock.
Software also ensures there are no circular dependencies through PE data path resources. Such dependencies would otherwise be possible since the training workload shares the same physical PE data path for all three mega-phases (forward pass, delta pass, and chain pass) and processing of the delta pass and the chain pass is on the same PEs as processing of the forward pass. To break any circular dependencies, software ensures that all tasks in the (forward pass, delta pass, and chain pass) loop do not block indefinitely. To do so, at least one task in the loop is guaranteed to complete once scheduled. The task scheduling is enabled by the wavelet picker in the compute element. The picker is programmed to schedule a wavelet only when the downstream color for the wavelet is available. It is also independently desirable for software to program tasks with the foregoing property for performance, in some embodiments and/or usages scenarios.
In the event of incorrect configuration leading to deadlock, there is a watchdog mechanism that detects lack of progress and signals a fault to management software. PROCESSING ELEMENT: COMPUTE ELEMENT AND ROUTER
Compute Element 520 performs computations on data embodied in the wavelets according to instruction address information derivable from the wavelets. The instruction address information is used to identify starting addresses of tasks embodied as instructions stored in storage (e.g., any one or more of memory, cache, and register file(s)) of the compute element. Results of the computations are selectively and/or conditionally stored in the storage and/or provided as data embodied in wavelets communicated to the router for, e.g., transmission to the other PEs and or PE 500.
In addition to data, Router 510 selectively and/or conditionally communicates (e.g. transmits and receives) backpressure information between the other PEs and PE 500 via couplings 511-516. Router 510 selectively and/or conditionally transmits backpressure information to PE 500 via On Ramp 522. Router 510 receives backpressure information from PE 500 via Off Ramp 521. The backpressure information provided to the other PEs, as well as the backpressure information provided to PE 500, is used by the other PEs and PE 500 to stall transmitting data (e.g. wavelets) that would otherwise be lost due to insufficient queue space to store the data in Router 510. The backpressure information received from the other PEs and PE 500 is used respectively by Router 510 to prevent transmitting data (e.g. wavelets) that would otherwise be lost due respectively to insufficient queue space in the routers of the other PEs and insufficient space in input queues of Compute Element 520.
In various embodiments, any one or more of 511-516 are omitted.
In some embodiments and/or usage scenarios, PE 500 is an embodiment of PE 499 of
Router 600 comprises four groups of interfaces, Data In 610, Data Out 620, Stall Out 630, and Stall In 640. Data In 610, Data Out 620, Stall Out 630, and Stall In 640 respectively comprise interface elements 611-617, 621-627, 631-637, and 641-647. Router 600 further comprises Write Dec 651, Out 652, Gen Stall 656, and Stall 657, respectively coupled to Data In 610, Data Out 620, Stall Out 630, and Stall In 640. Router 600 further comprises Sources 653 comprising Src 670 coupled to Gen Stall 656. Router 600 further comprises Data Queues 650, Control Info 660, and Router Sched 654. Control Info 660 comprises Dest 661 and Sent 662.
Conceptually, skipX+ 611, skipX+ 621, skipX+ 631, and skipX+ 641 comprise one of seven ‘directions’, e.g., the ‘skipX+’ direction. In some embodiments, the skipX+ direction corresponds to Skip East 514 of
Data In 610 is for receiving up to one wavelet from each direction each core clock cycle. Stall Out 630 is for transmitting stall information in each direction for each color each core clock cycle. Data Out 620 is for transmitting up to one wavelet to each direction in each core clock cycle. Stall In 640 is for receiving stall information from each direction for each color each core clock cycle.
Data Queues 650 is coupled to Write Dec 651 to receive incoming wavelet information and coupled to Out 652 to provide outgoing wavelet information. Data Queues 650 is further coupled to Gen Stall 656 to provide data queue validity information (e.g., corresponding to fullness) used for, e.g., generating stall information. Router Sched 654 is coupled to Control Info 660 to receive control information relevant to scheduling queued wavelets. Router Sched 654 is further coupled to Stall 657 to receive stall information relevant to scheduling queued wavelets. Router Sched 654 is further coupled to Out 652 to direct presentation of queued wavelets on one or more of 621-627. Router Sched 654 is further coupled to Gen Stall 656 to partially direct generation of stall information.
In some embodiments, Data Queues 650 comprises two entries per color (c0 . . . c15). Each entry is enabled to store at least payload information of a wavelet. In various embodiments, color information of the wavelet is not stored. A first of the entries is used to decouple the input of the queue from the output of the queue. A second of the entries is used to capture inflight data when a stall is sent in parallel (e.g., on a same core clock cycle) with the inflight data. In various embodiments, Data Queues 650 comprises a number of bits of storage equal to a number of colors multiplied by a number of bits of stored information per wavelet multiplied by a number of queue entries per color, e.g., 864 bits=16 colors*27 bits of wavelet data*2 entries per color. Alternatively, 33 bits of wavelet data are stored, and Data Queues 650 comprises 1056 bits=16 colors*33 bits of wavelet data*2 entries per color. In various embodiments, Data Queues 650 is implemented via one or more registers and/or a register file. Write Dec 651 stores, for each of the directions, information of the respective incoming wavelet into an entry of Data Queues 650 corresponding to the color of the incoming wavelet.
In some embodiments, Router Sched 654 comprises a scheduler for each of the directions (e.g., per 621-627). For each direction, the respective scheduler assigns available data in Data Queues 650 to the respective direction. Destination information per color is (statically) provided by Dest 661. In various embodiments, Dest 661 comprises a number of bits of storage equal to a number of colors multiplied by a number of directions, e.g., 112 bits=16 colors*7 directions. In various embodiments, Dest 661 is implemented via one or more registers and/or a register file. In some embodiments, Dest 661 comprises a data structure accessed by color that provides one or more directions as a result. E.g., a register file/array addressed by color encoded as a binary value and providing one bit per direction as a bit vector, each asserted bit of the bit vector indicating the color is to be sent to the associated direction(s).
Each of the schedulers operates independently of one another. Thus, for multicast outputs, a single wavelet is selectively and/or conditionally scheduled onto different directions in different core clock cycles, or alternatively in a same core clock cycle. Sent 662 is used to track which direction(s) a wavelet has been sent to. Each scheduler picks a color if the color has not been previously sent and the direction is not stalled for the color. In various embodiments, Sent 662 comprises a number of bits of storage equal to a number of colors multiplied by a number of directions, e.g., 112 bits=16 colors*7 directions. In various embodiments, Sent 662 is implemented via one or more registers and/or a register file.
In various embodiments, each scheduler implements one or more scheduling policies, e.g., round-robin and priority. The round-robin scheduling policy comprises the scheduler choosing between all available colors one at a time, conceptually cycling through all the colors before picking a same color again. The priority scheduling policy comprises the scheduler choosing from among a first set of predetermined colors (e.g., colors 0-7) with higher priority than from among a second set of predetermined colors (e.g., colors 8-15).
In some embodiments, Stall 657 is enabled to capture stall information and comprises a number of bits of storage equal to a number of colors multiplied by a number of directions, e.g., 112 bits=16 colors*7 directions. In various embodiments, Stall 657 is implemented via one or more registers and/or a register file.
In some embodiments, stall information is generated by Gen Stall 656 for all the colors of all the directions, based on occupancy of Data Queues 650. E.g., there is a stall generator for each color of each of 631-637. Src 670 stores and provides to Gen Stall 656 information to map a corresponding color of Data Queues 650 to one or more corresponding directions. In response to insufficient queue space in Data Queues 650 corresponding to a particular color, the directions acting as sources for the particular color are directed to stall providing further input, until queue space becomes available in Data Queues 650 for the further input. In various embodiments, Src 670 comprises a number of bits of storage equal to a number of colors multiplied by a number of directions, e.g., 112 bits=16 colors*7 directions. In various embodiments, Src 670 is implemented via one or more registers and/or a register file. In some embodiments, Src 670 comprises a data structure accessed by color that provides one or more directions as a result. E.g., a register file/array addressed by color encoded as a binary value and providing one bit per direction as a bit vector, each asserted bit of the bit vector indicating the color is source from the associated direction(s).
In various embodiments and/or usage scenarios, all or any portions of information retained in any one or more of Src 670 and Dest 661 corresponds to all or any portions of routing configuration information. In various embodiments and/or usage scenarios, all or any portions of the routing configuration information is determined, e.g., based at least in part on Placement Server(s) SW 210 and/or Neuron to PE Mapping SW 212 of
In various embodiments, each of interface elements 611-616, 621-626, 631-636, and 641-646 is variously implemented via passive interconnect (e.g., wire(s) without buffering), active interconnect (e.g., wire(s) with selective and/or optional buffering), and coupling with logic to accommodate additional functionality between one instance of Router 600 and another instance of Router 600. In various embodiments, each of interface elements 617, 627, 637, and 647 is variously implemented via passive interconnect (e.g., wire(s) without buffering), active interconnect (e.g., wire(s) with selective and/or optional buffering), and coupling with logic to accommodate additional functionality between the instant router and the CE of the PE the instant router is comprised in.
In some embodiments and/or usage scenarios, Router 600 is an implementation of Router 510 of
Wavelet Ingress 710 comprises actions 711-713 corresponding to wavelet ingress from (logically and/or physically) adjacent PEs and/or an instant PE, for each respective router direction (e.g., any of 611-617 of
In some embodiments, flow for generating and transmitting backpressure information begins (Start 743) by determining which input queues of the CE are storing more wavelets than a per-queue threshold (Determine Input Q(s) Over Threshold 744). In some embodiments, the per-queue threshold is predetermined. In various embodiments, the threshold for an input queue is two less than the maximum capacity of the input queue (e.g., an input queue enabled to store six wavelets has a threshold of four). In some other embodiments, the threshold for an input queue is one less than the maximum capacity. The determining occurs every period, e.g., every core clock cycle, and considers wavelets received and stored in the input queues and wavelets consumed and removed from the input queues in the period. Colors associated with each input queue and are determined by the CE (Determine Colors Associated with Input Q(s) 745). In some embodiments, an input queue is associated with multiple colors, and in other embodiments an input queue is associated with a single color. Based on whether the associated input queue is over/under the threshold, a stall/ready state is determined by the CE for each of the colors and provided as signals by the CE to the router (Provide Stall/Ready to Router 746).
In various embodiments, a ready state for a color indicates that the associated input queue has sufficient capacity to receive a number of wavelets (e.g., one or two) and the stall state indicates that the associated input queue does not have sufficient capacity to receive the number of wavelets. Based upon the provided stall/ready states, Router of PE 742 conditionally provides a wavelet to the CE (Provide Wavelet to CE in Accordance with Stall/Ready 747) and flow concludes (End 748). In some embodiments and/or usage scenarios, the router provides a wavelet for a color in the ready state and does not provide a wavelet for a color in the stall state.
In various embodiments and/or usage scenarios, actions of flow 740 are conceptually related to a CE, e.g., CE 800 of
In some embodiments, flow for generating and providing backpressure information begins (Start 755) by the router of the PE determining which data queues of the router are storing more wavelets than a threshold (Determine Data Queue(s) Over Threshold 756). In some embodiments, the threshold is predetermined. In various embodiments, the threshold for a data queue is one less than the maximum capacity of the queue (e.g., a queue enabled to store two wavelets has a threshold of one). The determining occurs every period, e.g., every core clock cycle, and considers wavelets received and stored in the data queues and wavelets that are transmitted and removed from the data queues in the period. The router determines sources of wavelets for each color (Check Color Sources 757). Based on whether the data queues are over/under the threshold and the sources of wavelets, for each router output (e.g., the local CE and neighbor PEs), the router determines which colors are in a stall/ready state (Determine Stall/Ready Colors for CE, Neighbors 758).
In various embodiments, a ready state for a color indicates that the associated data queue for the color has sufficient capacity to receive a number of wavelets (e.g., one or two) and the stall state indicates that the associated data queue does not have sufficient capacity to receive the number of wavelets. For each output, the stall/ready state for the colors are provided as a group by asserting stall/ready signals to CE of PE 752 and to Router(s) of Neighbor(s) 753 (Provide Stall/Ready to CE, Neighbors 759). In some embodiments and/or usage scenarios, backpressure information provided to CE of PE 752 and each router of Router(s) of Neighbor(s) 753 is identical. Based upon the provided stall/ready states, CE of PE 752 conditionally provides a wavelet to Router of PE 751 (Provide Wavelet to Router in Accordance with Stall/Ready 760), Router(s) of Neighbor(s) 753 conditionally provide wavelet(s) to Router of PE 751 (Provide Wavelet to Router in Accordance with Stall/Ready 761), and flow concludes (End 762). In some embodiments and/or usage scenarios, the CE and neighbor routers provide a wavelet for a color in the ready state and do not provide a wavelet for a color in the stall state.
In various embodiments and/or usage scenarios, actions of flow 750 are conceptually related to a CE, e.g., CE 800 of
In some embodiments, flow for stalling processing begins (Start 782) by the CE determining whether any output queues are storing a per-queue maximum capacity of wavelets (Determine Full Output Q(s) 783). In some embodiments, the per-queue maximum capacity is predetermined. The determining occurs every period, e.g., every core clock cycle, and considers wavelets that are created and stored in the output queues and wavelets that are transmitted to the router and removed from the output queues in the period. In response to determining an output queue is storing the maximum capacity of wavelets, the CE determines the colors associated with the output queue (Determine Colors Associated with Full Output Q(s) 784) and stalls processing for those colors (Stall Processing for Colors Associated with Full Output Q(s) 785), concluding flow (End 786).
In various embodiments and/or usage scenarios, actions of flow 780 are conceptually related to a CE, e.g., CE 800 of
In various embodiments, CE 800 is coupled to Router 600 of
In various embodiments, Input Qs 897 comprises a virtual queue for each fabric color and each local color. The virtual queues for each fabric color are usable, e.g., to hold wavelets created by other processing elements and associated with the respective color. The virtual queues for each local color are usable, e.g., to hold wavelets created by CE 800 and associated with the respective color. In various embodiments, the virtual queues are implemented by one or more physical input queues. In some other embodiments, Input Qs 897 comprises a physical queue for each fabric color and each local color. Each one of Input Qs 897 (e.g., Input QO 897.0) is associated with a respective one of Active Bit 898 (e.g., Active Bit 0898.0) and Block Bits 899 (e.g., Block Bit 0899.0). Each one of Active Bits 898 and each one of Block Bits 899 contain information about the respective one of Input Qs 897, e.g., Block Bit N 899.N indicates whether Input QN 897.N is blocked.
In various embodiments, there is variously a physical Q for each color, one or more physical Qs for a predetermined subset of colors, and one or more physical Qs for a dynamically determined subset of colors. In various embodiments, there is variously one or more physical Qs of a same size (e.g., each enabled to hold a same number of wavelets) and one or more physical Qs of differing sizes (e.g., each enabled to hold a different number of wavelets). In various embodiments, there are one or more physical Qs that are variously mapped to virtual Qs, each of the virtual Qs being associated with one or more colors. For example, there are N logical Qs and less than N physical Qs. For another example, some of Input Qs 897 are enabled to hold eight wavelets and others of Input Qs 897 are enabled to hold three wavelets. In some embodiments, traffic for one or more colors associated with a particular one of Input Qs 897 is estimated and/or measured, and the particular one of Input Qs 897 is enabled to hold a particular number of wavelets based on the traffic. In some embodiments, one or more of the physical Qs are implemented by one or more of: registers and SRAM.
Hash 822 is coupled to Qdistr 824 and selects a physical queue to store a wavelet, based at least in part on the color of the wavelet (e.g., by applying a hash function to the color). In some embodiments, the color associated with a wavelet payload is stored explicitly with the wavelet payload in a queue, such that an entry in the queue holds an entire wavelet (payload with color). In some embodiments, the color associated with a wavelet payload is not stored explicitly with the wavelet payload in a queue, such that an entry in the queue stores a wavelet payload without storing an associated color. The color of the wavelet payload is inferred, such as from the specific queue the wavelet payload is stored in.
In some embodiments, one or more of Active Bits 898 and Block Bits 899 are implemented as respective bit vectors with N entries, one entry for each color. In various embodiments, one or more of Active Bits 898 and Block Bits 899 are implemented as respective bit fields in a table comprising one entry for each color.
Picker 830 is coupled to Scheduling Info 896, RF 842, Dec 840, Base 890, PC 834, I-Seq 836, and D-Seq 844. RF, Dec, Base, PC, I-Seq, and D-Seq are respectively shorthand for Register File, Decoder, Base Register, Program Counter, Instruction Sequencer, and Data Sequencer. Picker 830 is enabled to select a wavelet for processing from one of Input Qs 897. In some embodiments, Picker 830 selects a wavelet by selecting one of Input Qs 897, and selecting the oldest wavelet in the selected queue. In some scenarios, Picker 830 selects a new wavelet for processing when Dec 840 signals that a terminate instruction has been decoded. In some other scenarios (e.g., an instruction accessing fabric input), Picker 830 selects a new wavelet for processing from one of Input Qs 897 in response to a queue identifier received from D-Seq 844.
Picker 830 receives the selected wavelet from one of Input Qs 897 and is enabled to selectively and/or optionally send one or more of data and index from the selected wavelet to RF 842. In some embodiments, Input Qs 897 is coupled to Data Path 852, and the Data Path is enabled to receive data directly from one of the Qs. Picker 830 is enabled to read a base address from Base 890 and calculate an instruction address to send to PC 834 and I-Seq 836. Base 890 stores a base address and is also coupled to D-Seq 844. PC 834 stores the address of the next instruction to fetch. In various embodiments, Base 890 and PC 834 are implemented as registers. In some embodiments, D-Seq 844 is enabled to read a base address from Base 890 and request data at one or more addresses from Memory 854 and D-Store 848, based at least in part upon the value read from Base 890.
Picker 830 is further enabled to select an activated color (as indicated by assertion of a corresponding one of Active Bits 898) for processing instead of selecting a wavelet for processing. A task corresponding to the selected color is initiated. In some embodiments and/or usage scenarios, unlike selection of a wavelet for processing, no information is provided to RF 842, and thus data communicated to the initiated task is via, e.g., global registers and/or memory.
I-Seq 836 is coupled to PC 834 and is enabled to read and modify PC 834 (e.g., increment for a sequential instruction or non-sequentially for a branch instruction). I-Seq 836 is also coupled to Memory 854 and is enabled to provide an instruction fetch address to Memory 854 (e.g., based upon PC 834).
Memory 854 is further coupled to Dec 840, Data Path 852, and D-Seq 844. In response to an instruction fetch address from I-Seq 836, Memory 854 is enabled to provide instructions located at the instruction fetch address to Dec 840 (an instruction decoder). In various embodiments, Memory 854 is enabled to provide up to three instructions in response to each instruction fetch address. In some embodiments, an instruction is formatted in accordance with one or more of
In various embodiments and/or usage scenarios, instructions are distributed to PEs, e.g., under control of software (such as Connection Server(s) SW 220, Misc SW on FPGAs 250, and/or Task SW on PEs 260 of
Dec 840 is coupled to Picker 830 via Terminate 812 and is enabled to signal that one of the decoded instructions is a terminate instruction that ends a task (e.g., the terminate instruction is the last instruction of the instructions executed in response to a task initiated in response to the selected wavelet).
In some scenarios, Dec 840 is enabled to decode a branch instruction. Examples of branch instructions include: conditional branch instructions that conditionally modify PC 834 and jump instructions that unconditionally modify PC 834. A branch instruction is executed by I-Seq 836 and optionally and/or conditionally modifies PC 834. In some scenarios, a branch instruction implements software control flow (e.g., a loop) by conditionally modifying PC 834.
In response to decoding an instruction (e.g., a multiply-accumulate instruction), Dec 840 is enabled to transmit an opcode to Data Path 852. Dec 840 is coupled to DSRs 846 and enabled to transmit one or more operand identifiers to DSRs 846. Dec 840 is also coupled to D-Seq 844 and enabled to transmit one or more operand type identifiers to D-Seq 844.
DSRs 846 comprise registers that hold Data Structure Descriptors (DSDs) and is coupled to and enabled to send one or more DSDs to D-Seq 844. In some embodiments, DSRs comprise source DSRs, destination DSRs, extended DSRs, and stride registers. In response to receiving an operand identifier from Dec 840, DSRs 846 is enabled to read the DSD specified by the operand identifier, and to transmit the DSD to D-Seq 844. In various embodiments, DSRs 846 is enabled to receive up to two source operand identifiers and one destination operand identifier, read two source DSRs and one destination DSR, and transmit two source DSDs and one destination DSD to D-Seq 844. In some embodiments, the CE is enabled to explicitly write a DSD to DSRs from memory in response to load DSR instructions and the CE is enabled to explicitly write a DSD to memory from DSRs in response to store DSR instructions. In some embodiments, DSRs 846 is coupled to and enabled to receive data from and transmit data to Memory 854.
In some embodiments, DSRs 846 comprise three sets of DSRs: 12 DSRs for source0 operands (sometimes referred to as S0DSRs), 12 DSRs for source 1 operands (sometimes referred to as S1DSRs), and 12 DSRs for destination operands (sometimes referred to as DDSRs). In addition, DSRs 846 also comprises six extended DSRs (sometimes referred to as XDSRs) and six stride registers. In some embodiments, DSRs comprise 48 bits, XDSRs comprise 51 bits, and stride registers comprise 15 bits. In various embodiments, respective instructions load 48 bits of data from memory (e.g., D-Store 848 or Memory 854) into respective DSRs (e.g., LDSOWDS, LDS1WDS, and LDDWDS instructions respectively load source0, source1, and destination DSRs). In various embodiments, respective instructions store 48 bits of data from respective DSRs to memory (e.g., STS0WDS, STS1WDS, and STDWDS instructions respectively store source0, source1, and destination DSRs to memory). In some embodiments, instructions (e.g., LDXDS) load data from memory into XDSRs and other instructions (e.g., STXDS) store data from XDSRs to memory. Instructions that move data between memory and XDSRs (e.g., LDXDS and STXDS) access 64 bits of memory, and only use the lower 51 bits. In some embodiments, instructions (e.g., LDSR) load data from memory into stride registers, and other instructions (e.g., STSR) store data from stride registers to memory. In some embodiments, instructions that move data between memory and stride registers access 16 bits of memory, and only use the lower 15 bits.
D-Seq 844 is also coupled to D-Store 848, RF 842, and Picker 830, and is enabled to initiate accessing vector data at various sources in response to DSDs received from DSRs 846. In some scenarios (e.g., in response to receiving a DSD describing one of a 1D memory vector, 4D memory vector, and circular memory buffer), D-Seq 844 is enabled to calculate a sequence of memory addresses to access (e.g., in Memory 854 and/or D-Store 848). In some other scenarios, (e.g., in response to receiving a DSD describing a fabric input), D-Seq 844 is enabled to initiate reading fabric data from one of Input Qs 897 via Picker 830. In yet other scenarios, (e.g., in response to receiving a DSD describing a fabric output), D-Seq 844 is enabled to initiate transforming data into wavelet(s) and transmitting wavelet(s) to a fabric coupling via Output Queues 859 and On Ramp 860. In some embodiments, D-Seq 844 is enabled to simultaneously access vector data at three sources (e.g., read vector data from memory, read vector data from a fabric input, and write vector data to a fabric output).
In some embodiments, D-Seq 844 is enabled to access data in one or more registers in RF 842 (e.g., an instruction with one or more input operands and/or one output operand). In some scenarios, D-Seq 844 is enabled to request operands from registers in RF 842. In yet other scenarios, D-Seq 844 is enabled to request data from a register (e.g., an index) in RF 842 as an input for calculating a sequence of memory addresses to access in accordance with a DSD.
In various embodiments, all or any portions of state of PE 800 is mapped in an address space, comprising software visible state (e.g., any combination of D-Store 848, Memory 854, RF 842, DSRs 846, Output Queues 859, and Input Qs 897, Block Bits 899) and state that is not software accessible (e.g., UT State 845). In various embodiments, the address space and/or portions of the address space are implemented by one or more of registers and SRAM. In some embodiments, the address spaces of multiple PEs implemented on a single ASIC are mapped to a single address space. In some embodiments, each respective PE (e.g., of multiple PEs implemented on a single ASIC or portion thereof) has a respective private address space. In some embodiments having private address spaces, one PE is unable to directly access elements in the address spaces of other PEs.
Data Path 852 is coupled to RF 842 and D-Store 848. In various embodiments, any one or more of Memory 854, RF 842, Input Qs 897, and D-Store 848 are enabled to provide data to Data Path 852 (e.g., in response to a request from D-Seq 844) and to receive data from Data Path 852 (e.g., results of operations). Data Path 852 comprises execution resources (e.g., ALUs) enabled to perform operations (e.g., specified by an opcode decoded and/or provided by Dec 840, according to embodiment). In some embodiments, RF 842 comprises sixteen general-purpose registers sometimes referred to as GPR0-GPR15. Each of the GPRs is 16 bits wide and is enabled to store integer or floating-point data.
Data Path 852 is also coupled via Output Queues 859 and On Ramp 860 to the router and enabled to send data via Output Queues 859 and On Ramp 860 to the router. In various embodiments, Output Queues 859 comprises a virtual queue for each fabric color (e.g., to hold information for wavelets created by Data Path 852 and associated with the respective color), e.g., Q 859.0, . . . , and Q 859.N. In various embodiments, a first portion of Output Queues 859 are statically or dynamically enabled to hold six wavelets, a second portion of Output Queues 859 are statically or dynamically enabled to hold two wavelets, and a third portion of Output Queues 859 are statically or dynamically enabled to hold zero wavelets.
In some embodiments, Data Path 852 is enabled to write one or more wavelets into one of Output Queues 859 based upon the fabric color associated with the one or more wavelets and the mapping of fabric colors to Output Queues 859. Output Queues 859 is enabled to transmit wavelets via On Ramp 860 to the router (e.g., Router 600 of
UT State 845 is coupled to Picker 830, Dec 840, D-Seq 844, DSRs 846, Scheduling Info 896, and Output Queues 859 (the foregoing couplings are omitted from the figure for clarity). In various embodiments and or usage scenarios, UT State 845 is used to store and provide information about one or more microthreaded instructions. An example of a microthreaded instruction is an instruction enabling microthreading, e.g., via at least one fabric vector operand with a corresponding UE field indicating microthreading is enabled. In some embodiments, UT State 845 comprises a data structure of one or more (e.g., eight) entries (e.g., implemented by storage such as SRAM) and enabled to store and provide information about respective one or more microthreaded instructions (such as any combination of: the microthreaded instruction itself, an opcode of the microthreaded instruction, one or more operands of the microthreaded instruction, and one or more DSDs associated with operands of the microthreaded instruction). In various embodiments, each respective entry of UT State 845 is associated with one or more of a respective one of Input Qs 897 and Output Queues 859 (e.g., entry 0is associated with Q 897.0 and Q 859.0). In some embodiments, the mapping from entries of UT State 845 to ones of Input Qs 897 and Output Queues 859 is static and predetermined. UT State 845 is enabled to communicate microthreaded instruction information (such as the microthreaded instruction itself) with Dec 840 and communicate portions of a DSD with one or more of D-Seq 844 and DSRs 846. In some embodiments, information about a microthreaded instruction is stored in the entry of UT State 845 determined by a microthread identifier from the associated DSD (e.g., UTID 2102 or UTID 2122). In various embodiments, information about a microthreaded instruction with a fabric destination operand is stored in an entry determined by UTID 2122. Information about a microthreaded instruction without a fabric destination is stored in an entry determined by UTID 2102 of the src0 operand and an entry determined by UTID 2102 of the src1 operand when there is no src0 operand from the fabric.
In various embodiments and usage scenarios, UT State 845 is enabled to receive and/or monitor stall information with any one or more of D-Seq 844, DSRs 846, Scheduling Info 896, and Output Queues 859. In some embodiments, UT State 845 is enabled to communicate to Picker 830 that one or more microthreaded instructions are ready for execution, and Picker 830 is enabled to schedule a microthreaded instruction for execution. In various embodiments and/or usage scenarios, when a microthreaded instruction from UT State 845 executes, UT State 845 is enabled to communicate instruction information (e.g., the operation and/or one or more operands) to one or more of: Dec 840, D-Seq 844, and Data Path 852.
In some embodiments, D-Store 848 is a type of memory that is smaller and more efficient (e.g., lower joules per bit of data read) than Memory 854. In some embodiments, D-Store 848 is a type of memory of relatively lower capacity (e.g., retaining less information) and relatively lower access latency and/or relatively higher throughput than Memory 854. In some scenarios, more frequently used data is stored in D-Store 848, while less frequently used data is stored in Memory 854. In some embodiments, D-Store 848 comprises a first address range and Memory 854 comprises a second, non-overlapping address range. In some embodiments and/or usage scenarios, Memory 854 is considered a first memory enabled to store instructions and any combination of D-Store 848 and RF 842 is considered a second memory enabled to store data.
In some embodiments and/or usage scenarios, there is a one to one correspondence between virtual queues (e.g., Input Qs 897 and Output Queues 859) and physical queues (e.g., storage implemented via SRAM), e.g., there is a physical queue for each virtual queue. In some of the one to one embodiments, respective sizes of one or more of the virtual queues are dynamically managed to vary over time, such as being zero at one time and being a maximum size in accordance with the physical queues at another point in time. In various embodiments and/or usage scenarios, there is a many to one correspondence between virtual queues and physical queues, e.g., a single physical queue implements a plurality of virtual queues. In various embodiments, there is variously a physical Q for each color, one or more physical Qs for a predetermined subset of colors, and one or more physical Qs for a dynamically determined subset of colors. In various embodiments, there is variously one or more physical Qs of a same size (e.g., each enabled to hold a same number of wavelets) and one or more physical Qs of differing sizes (e.g., each enabled to hold a different number of wavelets). In various embodiments, there are one or more physical Qs that are variously mapped to virtual Qs, each of the virtual Qs being associated with one or more colors. For example, there are more virtual Qs than physical Qs. For another example, a first portion of the virtual queues are statically or dynamically enabled to hold six wavelets, a second portion of the virtual queues are statically or dynamically enabled to hold two wavelets, and a third portion of the virtual queues are statically or dynamically enabled to hold zero wavelets. In some embodiments, one or more of the physical Qs are implemented by one or more of: registers and SRAM.
In various embodiments, CE 800 is enabled to process instructions in accordance with a five-stage pipeline. In some embodiments, in a first stage the CE is enabled to perform instruction sequencing, e.g., one or more of: receiving a wavelet (e.g., in Input Qs 897), selecting a wavelet for execution (e.g., by Picker 830), and accessing (e.g., by I-Seq 836) an instruction corresponding to the wavelet. In a second stage, the CE is enabled to decode (e.g., by Dec 840) the instruction, read any DSR(s) (e.g., from DSRs 846), and compute addresses of operands (e.g., by D-Seq 844 in accordance with a DSD). In a third stage, the CE is enabled to read data from any one or more memories (e.g., Memory 854, RF 842, D-Store 848, Input Qs 897). In a fourth stage, the CE is enabled to perform an operation specified by the instruction (e.g., in Data Path 852) and write results to a register file (e.g., RF 842). In a fifth stage, the CE is enabled to write results to any one or more memories, e.g., Memory 854, DSRs 846, D-Store 848. In various embodiments, in one of the stages the CE is enabled to optionally and/or conditionally provide results to Output Queues 859, and asynchronously provide wavelets to a router.
In some embodiments and/or usage scenarios, elements of the figure correspond to an implementation of Compute Element 520 of
The partitioning and coupling illustrated in
Task Initiation
In some embodiments, processing a wavelet for task initiation begins (Start 901) by selecting a ready wavelet from among, e.g., one or more queues for processing (Select Ready Wavelet for Task Initiation 902). In some embodiments, the wavelet is selected based upon one or more of: block/unblock state associated with each queue, active/inactive state associated with each queue, color(s) of previously selected wavelets, and a scheduling algorithm.
After selecting the ready wavelet, the wavelet is checked to determine if the wavelet is a control wavelet or a data wavelet (Control/Data? 903). If the wavelet is a control wavelet (aka closeout wavelet), then a starting address of a task associated with the control wavelet is calculated by adding the lower six bits of the index of the wavelet to a base register (Add Lower Index Bits to Base Register to Form Instruction Address 910). If the wavelet is not a control wavelet, then the wavelet is a data wavelet. The starting address of a task associated with the data wavelet is calculated by adding the base register to the color of the wavelet multiplied by four (Add (Color*4) to Base Register to Form Instruction Address 904). The starting address of the task, either as calculated for a control wavelet or as calculated for a data wavelet, corresponds to a starting address of instructions for the task.
Once the starting address of the instructions has been calculated, the instructions are fetched from the starting instruction address (Fetch Instructions From Memory at Instruction Address 905). One or more of the fetched instructions are decoded and executed (Execute Fetched Instruction(s) 906). Fetching and executing (as illustrated by actions 905 and 906) continue (Not Terminate 908) until a Terminate instruction is executed (Terminate 909), and then processing associated with the initiated task is complete (End 919). In some embodiments, a terminate instruction is the last instruction associated with processing a wavelet. After the initiated task is complete, flow optionally and/or selectively proceeds to process another wavelet for task initiating, beginning with Start 901.
According to various usage scenarios, the executing (Execute Fetched Instruction(s) 906) comprises executing sequential and/or control-flow instructions, and the instruction address used for fetching varies accordingly (Fetch Instructions From Memory at Instruction Address 905).
The ready wavelet selected for task initiation is comprised of a particular color. In some embodiments and/or usage scenarios, once a ready wavelet has been selected for task initiation (Select Ready Wavelet for Task Initiation 902), further wavelets, if any, received of the particular color are consumed as operands for execution of instructions (Execute Fetched Instruction(s) 906). The consuming of the wavelets comprising the particular color as operands continues until fetching and executing of a terminate instruction (Terminate 909).
In various embodiments and/or usages scenarios, actions of flow 900 are conceptually related to a CE, e.g., CE 800 of
As another example, action 903 is performed by elements of CE 800. If the control bit of the wavelet payload (e.g., Control Bit 1320 of
As another example, action 905 is performed by elements of CE 800, e.g., PC 834, I-Seq 836, and Memory 854. Action 906 is performed by elements of CE 800, e.g., Dec 840, D-Seq 844, Memory 854, RF 842, and Data Path 852, among others. Execution comprises execution of a terminate instruction. An example of a terminate instruction is an instruction with a terminate bit asserted. In the context of the example, when Dec 840 decodes a terminate instruction, Dec 840 signals Picker 830 via Terminate 812 that the wavelet is finished, and Picker 830 selects another wavelet for processing, corresponding, e.g., to action 902.
In various embodiments and/or usage scenarios, all or any portions of elements of Processing a Wavelet for Task Initiation 900 conceptually correspond to all or any portions of executions of instructions of Task SW on PEs 260 of
In various embodiments and/or usage scenarios, all or any portions of the actions comprising flow 900 conceptually variously correspond to all or any portions of flow 1500 of
In some embodiments, flow for task activating begins (Start 921) by performing an activate operation for one or more colors (Activate Operation for Color(s) 923). The activate operation is responsive to, e.g., an instruction or one of a set of events. In response to the activate operation, corresponding colors are activated, making them selectable for execution (Activate Color(s) 924). Then a color that is selectable for execution is chosen by the picker (Picker Selects Color 925). The task corresponding to the chosen color is initiated and the chosen color is deactivated (Initiate Task, Deactivate Color 926). Task initiation comprises determining a starting address for the task and fetching and executing instruction beginning at the starting address. Flow is then complete (End 929).
The instruction the activate operation is responsive to comprises an activate instruction. The activate instruction specifies the one or more colors to activate. The colors to activate are variously specified by one or more of an immediate value (e.g. a 6-bit field specifying a single color to activate) in the activate instruction, a register specified by the activate instruction, or other information. In some embodiments and/or usage scenarios, if an activate instruction source is not an immediate, then new task selection is stalled until the activate instruction completes.
In some embodiments and/or usage scenarios, the set of events the activate operation is responsive to comprises completing processing for a fabric vector that enables microthreading. For example, a fabric vector is processed in accordance with a fabric input Data Structure Descriptor (DSD). The fabric input DSD specifies that microthreading is enabled and the fabric input DSD further specifies a color to activate responsive to completing processing of the fabric vector. The color is activated in response to the completing processing of the fabric vector. For another example, a fabric vector is processed in accordance with a fabric output DSD. The fabric output DSD specifies that microthreading is enabled and the fabric output DSD further specifies a color to activate responsive to completing processing of the fabric vector. The color is activated in response to the completing processing of the fabric vector.
In some embodiments and/or usage scenarios, the set of events the activate operation is responsive to further comprises pushing and/or popping an element from a circular buffer in accordance with a circular memory buffer DSD having an associated circular memory buffer eXtended DSD (XDSD). The circular memory buffer XDSD has respective fields to specify colors to activate responsive to pushing an element onto the circular buffer and popping an element off of the circular buffer. The respective color is activated in response to the pushing and/or the popping.
In some embodiments and/or usage scenarios, activating a color comprises setting an indicator corresponding to the color to an activated stated, and making a color inactive comprises setting the indicator to an inactivated state. In some embodiments and/or usage scenarios, the indicator comprises a bit, assertion of the bit indicates the activated state, and deassertion of the bit indicates the inactivated state, and there is a corresponding bit for each color.
In various embodiments and/or usage scenarios, actions illustrated in
In various embodiments and/or usage scenarios, actions of flow 920 are conceptually related to a CE, e.g., CE 800 of
Fabric Input Data Structure Descriptor 2100 (
Task Block and Unblock
In various embodiments and/or usage scenarios, the instruction set of CE 800 comprises block and unblock instructions, and instructions enabled to perform an activate operation (e.g., an activate instruction), useful for, inter alia, task synchronization. Task SW on PEs 260 of
Referring to the figure, executing an instruction begins (Start 941) by fetching the instruction from memory and decoding the instruction (Fetch, Decode Instruction 942). If the instruction decodes to a block instruction (Block Instruction? 943), then a block operation is performed (Block Color(s) 944). The source operand of the block instruction specifies one or more colors to block with respect to instruction processing associated with blocked/unblocked colors. In various embodiments and/or usage scenarios, the block operation is performed by setting one or more block indicators to a blocked state for the one or more colors specified by the source operand, and execution is complete (End 949). In various scenarios, the source operand variously specifies blocking a single color, blocking all colors, and blocking an arbitrary plurality of colors. In subsequent operation, wavelets comprised of colors that are blocked are not selected for processing.
If the instruction decodes to an unblock instruction (Unblock Instruction? 945), then an unblock operation is performed (Unblock Color(s) 946). The source operand of the unblock instruction specifies one or more colors to unblock with respect to instruction processing associated with blocked/unblocked colors. In various embodiments and/or usage scenarios, the unblock operation is performed by setting a block indicator to an unblocked state for the one or more colors specified by the source operand, and execution is complete (End 949). In various scenarios, the source operand variously specifies unblocking a single color, unblocking all colors, and unblocking an arbitrary plurality of colors. In subsequent operation, wavelets comprised of colors that are unblocked are selectable for processing.
If the instruction decodes to an instruction that is not a block instruction and that is not an unblock instruction, then the instruction is otherwise executed (Execute Instruction 947) and execution is complete (End 949).
In some embodiments, if the source operand of a block instruction is an immediate (e.g., an 8-bit immediate), then the value of the immediate specifies the color to be blocked. In various embodiments, a block instruction with particular operands blocks multiple colors. If the source operand is not an immediate, then all colors are blocked until the block instruction completes.
In some embodiments, the source operand of an unblock instruction is an immediate (e.g., an 8-bit immediate) and the value of the immediate specifies the color to be unblocked. In various embodiments, an unblock instruction with particular operands unblocks multiple colors.
In various embodiments and/or usage scenarios, all or any portions of any one or more of elements of Block and Unblock Instruction Processing Flow 940 correspond conceptually to and/or are related conceptually to operations performed by and/or elements of a compute element, such as all or any portions of a CE of a PE, e.g., Compute Element 520 of
As an example, Block Bits 899 comprise a bit for each color (e.g., as entries in a table, or as a bit-mask). The block operation (Block Color(s) 944) is performed by setting Block Bits 899 to a specific blocked state (e.g., ‘1’) for the one or more colors specified by the source operand. In some embodiments, Picker 830 selects a wavelet for processing from a color where Block Bits 899 match an unblocked state (e.g., ‘0’). As another example, the unblock operation (Unblock Color(s) 946) is performed by setting Block Bits 899 to a specific unblocked state (e.g., ‘0’) for the one or more colors specified by the source operand. In some embodiments, Picker 830 selects a wavelet comprising a color where Block Bits 899 match an unblocked state (e.g., ‘0’).
In some embodiments, portions of Block and Unblock Instruction Processing Flow 940 correspond to portions of Processing a Wavelet for Task Initiation 900 of
In various embodiments and/or usage scenarios, all or any portions of elements of Block and Unblock Instruction Processing Flow 940 conceptually correspond to all or any portions of executions of instructions of Task SW on PEs 260 of
High-Level Dataflow
Non-zero activation aA 1061 from Neuron A 1041 triggers lookups of stored weights wAD 1080, wAE 1081, and wAF 1082. PE01070, PE11071, and PE21072 perform respective local multiply and accumulates of the respective local neuron weights with the incoming activation aA 1061 from Neuron A 1041 to produce respective local partial sums. Non-zero activation aB 1062 from Neuron B 1042 triggers lookups of stored weights wBD 1083, wBE 1084, and wBF 1085. PE31073, PE41074, and PE51075 perform respective local multiply and accumulates of the respective local neuron weights with the incoming activation aB 1062 from Neuron B 1042 to produce respective local partial sums. Non-zero activation aC 1063 from Neuron C 1043 triggers lookups of stored weights wCD 1086, wCE 1087, and wCF 1088. PE61076, PE71077, and PE81078 perform respective local multiply and accumulates of the respective local neuron weights with the incoming activation aC 1063 from Neuron C 1043 to produce respective local partial sums. The local partial sums of PE01070, PE31073, and PE61076 are accumulated to produce a final sum, an activation function is performed, and if non-zero, activation aD 1064 is broadcast to the next layer. The local partial sums of PE11071, PE41074, and PE71077 are accumulated to produce a final sum, an activation function is performed, and if non-zero, activation aE 1065 is broadcast to the next layer. The local partial sums of PE21072, PE51075, and PE81078 are accumulated to produce a final sum, an activation function is performed, and if non-zero, activation aF 1066 is broadcast to the next layer.
In
Example Workload Mapping and Exemplary Tasks
Conceptually, Deep Learning Accelerator 400 (
The workload is deep neural network training, implemented via SGD. The deep neural network comprises a plurality of layers of neurons. The workload has three mega-phases: a forward pass, a delta pass, and a chain pass. The forward pass propagates activations in a forward direction. The delta pass propagates deltas in a backward direction. The chain pass calculates gradients based on the deltas as the deltas are generated in the delta pass. The three mega-phases have approximately a same amount of compute.
In some embodiments and/or usage scenarios, within a set of the PEs mapped to a single one of the layers, the weights of the single layer are distributed across the PEs such that a single neuron is mapped to multiple PEs. Splitting a single neuron across multiple PEs, in some circumstances, provides a load balancing benefit and provides a communication partitioning benefit (see, e.g.,
Conceptually, processing proceeds as follows (see Forward 401 of
The delta pass (see Delta 402 of
An incoming activation closeout on the activation broadcast wire (Closeouts from Prior Layer 1112) triggers f_rxact:close 1102. The closeout signals the end of all activations for the current wavefront. The instant PE executes instructions of the task, starting the partial sum accumulation ring with the partial sums in a start list of the instant PE (Start Psums 1116). Example data structures the task references are fpsum_acc_mem, and fpsum_acc_fab.
An incoming partial sum (Prop Psums 1130) triggers f psum:prop 1103. The instant PE executes instructions of the task, adding the incoming partial sum to the local partial sum of the instant PE, and then forwarding the result to the next hop on the ring (Prop Psums 1131). If the instant PE is the end of the ring, then the final sum is generated. In some embodiments and/or usage scenarios, additional processing is performed to prevent deadlock. Example data structures the task references are fpsum_acc_mem, fpsum_acc_fab, and f_txact_wake.
When there are queued activations to transmit, f_txact:tx 1104 is self-triggered (Wake 1114), e.g., via the instant PE sending a wavelet to itself. The instant PE executes instructions of the task, de-queuing an activation and transmitting the activation on the broadcast wire to the next layer (Activations to Next Layer 1121). When more items remain in the queue, the instant PE reschedules the task (Reschedule 1115), e.g., via the instant PE sending a wavelet to itself. When the queue is empty, the instant PE sends a closeout wavelet to close the wavefront (Closeouts to Next Layer 1122).
The activations (incoming and outgoing) and the partial sums (incoming and outgoing), as well as the closeout wavelets are communicated as wavelets (see, e.g.,
Data structures for the various state machines are referenced via a plurality of DSDs stored in respective DSRs (see, e.g.,
The foregoing example workload mapping is with respect to SGD. However, the techniques are readily applicable to MBGD and CPGD, with and without RCP.
In some embodiments and/or usage scenarios, all or any portions of the actions of
Flow begins (Start 1201). Activations are received (Receive Activation 1202) and accumulated (Accumulate Activations 1203), e.g., as processed by f_rxact:acc 1101 of
In some embodiments and/or usage scenarios, closeouts conclude other portions of a neural network, e.g., transmitting deltas.
In some embodiments and/or usage scenarios, all or any portions of the actions of Activation Accumulation/Closeout and Partial Sum Computation/Closeout 1200 correspond or are related conceptually to operations performed by and/or elements of PEs 122 of
Wavelets
In some embodiments, Sparse Data 1322 comprises a field for a 16-bit floating-point number or a 16-bit integer number. In various scenarios, Sparse Data 1322 variously represents a weight of a neural network, an input or stimulus of a neural network, an activation of a neural network, or a partial sum of a neural network.
In some embodiments, Index 1321 comprises a 16-bit field. In some scenarios, Index 1321 is an integer number and is an index that explicitly indicates a specific neuron of a neural network. In some embodiments, Lower Index Bits 1321.1 is six bits, and Upper Index Bits 1321.2 is 10 bits.
In some embodiments, Control Bit 1320 is 1-bit field. In some scenarios, Control Bit 1320 indicates whether Sparse Wavelet Payload 1302 triggers control activity or data activity. In some scenarios, control activity comprises computing the last activation of a neuron and data activity comprises computing activations of a neuron that are not the last activation. In some embodiments and/or usage scenarios, the control activity comprises a closeout activity, such as associated with any one or more of Closeouts from Prior Layer 1112 and/or Closeouts to Next Layer 1122 of
In some embodiments, Color 1324 comprises a 5-bit field. In some embodiments, a color corresponds to a virtual channel over a shared physical channel, such as via routing in accordance with the color. In some scenarios, a color is used for a specific purpose such as sending configuration information to processing elements or sending input of a neural network to a neuron that is mapped to a processing element.
In some embodiments, Control Bit 1340 is a 1-bit field and is functionally identical to Control Bit 1320.
In some embodiments, Color 1344 comprises a 5-bit field and is functionally identical to Color 1324.
In some scenarios, Dense Data 1343.1 and Dense Data 1343.2 comprise fields for respective 16-bit floating-point numbers or respective 16-bit integer numbers. In various scenarios, Dense Data 1343.1 and Dense Data 1343.2 variously represent weights of a neural network, inputs or stimuli of a neural network, activations of a neural network, or partial sums of a neural network. In some scenarios, Dense Data 1343.1 and Dense Data 1343.2 collectively comprise a 32-bit floating-point number (e.g., Dense Data 1343.1 comprises a first portion of the 32-bit floating-point number and Dense Data 1343.2 comprises a second portion of the 32-bit floating-point number).
In various embodiments and/or usage scenarios, usage of sparse wavelets vs. dense wavelets is variously predetermined, dynamically determined, and/or both. In various embodiments and/or usage scenarios, usage of sparse wavelets vs. dense wavelets is determined by software.
Creating and transmitting a wavelet begins (Start 1401) by initializing at least one transmitting PE and one or more receiving PEs, as well as any PEs comprising routers implementing a fabric coupling the transmitting PEs and the receiving PEs (Initialize PEs 1402). Each of the PEs comprises a respective router (e.g., Router 510 of
In various embodiments, a DSR holds a DSD comprising information about an operand such as location of data elements (e.g., memory, fabric input, and/or fabric output), number of the data elements (e.g., length), an address or addresses of the data elements (e.g., start address and stride in memory). For fabric output operands (e.g., wavelets sent via the fabric), the DSR comprises a color for the wavelet(s) on the fabric, a control bit, and optionally a value or location of an index.
In some embodiments, the CE of the transmitting PE configures a source (Set Source 1403). In some scenarios, the source is a source DSD describing a source operand. In various embodiments, the source DSD describes one or more data elements stored in one of: cache and memory. In other embodiments, the source DSD describes one or more data elements received via the fabric (e.g., the data elements are payloads of wavelets arriving via the fabric). In some other scenarios, the source comprises a source register (e.g., one of RF 842). In yet other scenarios, the source comprises an immediate specified in an instruction.
The CE also configures a destination DSD in a destination DSR describing the location of a destination operand. In various embodiments, the location of the destination operand is the fabric (Set Destination (Fabric) DSR 1404). In some embodiments, the destination DSD describes one or more data elements transmitted via the fabric. In various embodiments, the source and the destination DSDs are configured via one or more instructions.
Subsequently, the CE fetches and decodes an instruction (e.g., FMACH, MOV, LT16) comprising one or more source operands, an operation, and a destination operand specified by the DSD in the destination DSR (Fetch/Decode Instruction with Destination DSR 1405). In some embodiments, the operand type fields of the instruction specify whether an operand is specified by a DSD.
The CE reads the destination DSD from the destination DSR and any source DSDs in source DSRs (Read DSR(s) 1406). Based on the DSDs, the CE determines the type of data structure, the source of the data element(s), whether multiple data elements are read together (e.g., for a SIMD operation), and a total number of data elements for each operand. In some scenarios, DSRs are read for one or more of: a source0 operand, a source1 operand, and a destination operand. In some embodiments and/or usage scenarios, the DSRs are read entirely or partially in parallel, and in other embodiments and/or usage scenarios, the DSRs are read entirely or partially sequentially.
The CE of the transmitting PE reads (e.g., from register or memory) the first data element(s) specified by the source (Read (Next) Data Elements(s) from Queue/Memory 1407) and performs the operation specified by the instruction (e.g., multiplication) on the first data element(s). In response to the destination operand being specified as a fabric type by the destination DSD, the CE creates one or more wavelets. One or more results of the operation (e.g., in a form of data elements) are used to form a wavelet payload, based on the destination DSD. The control bit of the wavelet payload and the color of the wavelet are specified by the destination DSD. The wavelet payload and the color are provided to the router of the transmitting CE (Provide Data Element(s) as Wavelet to Output Queue 1408). In some embodiments and/or usage scenarios, a single data element is used to create the payload of a sparse wavelet. In other embodiments and/or usage scenarios, two data elements are used to create the payload of a dense wavelet. In various embodiments, four data elements are used to create the payload of two wavelets. In some embodiments, the number of data elements used is specified by the destination DSD.
The CE of the transmitting PE determines if additional data element(s) are specified by the destination DSD (More Data Elements? 1409). If additional data element(s) are specified by the destination DSD, then the CE creates additional wavelet(s) via actions Read (Next) Source Data Element(s) from Queue/Memory 1407, Provide Data Element(s) as Wavelet to Output Queue 1408, and More Data Elements? 1409 until no additional data element(s) are specified by the destination DSD. If no additional data element(s) are specified by the destination DSD, then flow concludes (End 1410). In some embodiments, the wavelets created via action 1408 are of the same color as specified by the destination DSR.
The router of the transmitting PE transmits the wavelet(s) in accordance with the color of the wavelet(s) (Transmit Wavelet(s) to Fabric 1411), in accordance with respective colors of the wavelets. In some embodiments and/or usage scenarios, the transmitting is directly to the router of the receiving PE. In some embodiments and/or usage scenarios, the transmitting is indirectly to the router of the receiving PE, e.g., via one or more intervening PEs acting to forward the wavelet(s) in accordance with the colors. The router of the receiving PE receives the wavelet(s) in accordance with the color (Receive Wavelet(s) from Fabric 1412).
In various embodiments, action 1411 is performed asynchronously with respect to any one or more of actions 1407, 1408, and 1409. For example, a plurality of wavelets is produced by action 1408 before any of the produced wavelets are transmitted as illustrated by action 1411.
In various embodiments, Receive Wavelet(s) from Fabric 1412 corresponds in various respects to Receive Wavelet at Router 1503 of
In various embodiments and/or usage scenarios, all or any portions of any one or more of elements of Wavelet Creation Flow 1400 correspond conceptually to and/or are related conceptually to operations performed by and/or elements of a PE, e.g., PE 499 of
In various embodiments and/or usage scenarios, all or any portions of any one or more of elements of Wavelet Creation Flow 1400 (e.g., any one or more of actions 1403-1409) correspond conceptually to and/or are related conceptually to operations performed by and/or elements of a compute element, such as all or any portions of a CE of a PE, e.g., Compute Element 520 of
As another example, CE 800 as the CE of the transmitting PE performs action 1403 in response to a load DSR instruction copying information from Memory 854 into the source DSR (e.g., one of DSRs 846). In various embodiments, the source DSR specifies the location of the data elements as one of Memory 854, D-Store 848, and RF 842. In some scenarios, the source DSR specifies an address of a first data element in Memory 854 (e.g., address 0x0008), a number of data elements (e.g., nine data elements), and a stride between subsequent data elements (e.g., 12 bytes). As another example, CE 800 performs action 1403 by writing data into a register of RF 842.
As another example, CE 800 as the CE of the transmitting PE performs action 1404 in response to a load DSR instruction copying information from Memory 854 into the destination DSR (e.g., one of DSRs 846). In various embodiments, the destination DSR specifies transformation of one or more data elements into one or more wavelets and transmitted by Router 510 via a fabric-coupled egress port (e.g., North 513). The destination DSR specifies a color for the wavelet(s), a control bit for the wavelet(s), a number of data elements (e.g., length), and information about an index of the wavelet(s). In some scenarios, the destination DSR specifies the value of the index and in other scenarios the destination DSR specifies a location of the value of the index (e.g., in a register of RF 842).
As another example, CE 800 as the CE of the transmitting PE performs actions 1406, 1407, 1408, and 1409 in response to fetching and decoding an instruction specifying a destination DSR as a destination operand (action 1405). In some embodiments and/or usage scenarios, D-Seq 844 reads the source DSR(s) and accesses one, two, or four data elements specified by each source DSR, e.g., from Memory 854 or D-Store 848, thereby performing action 1407. In various embodiments, Memory 854 and/or D-Store 848 provide the data elements to Data Path 852. The Data Path 852 performs the operation on the data elements (e.g., adding source0 data elements to source1 data elements). In accordance with the destination DSD, Data Path 852 transforms the result data of the operation into a wavelet and writes the wavelet to one of Output Queues 859 as specified by a color of the destination DSD, thereby performing action 1408. In some embodiments, CE 800 of the transmitting PE performs action 1409 by comparing a number of data elements specified in the destination DSD (e.g., a length) against the number of data elements sent via action 1408 (e.g., tracked by a counter).
As another example, CE 800 as the CE of the transmitting PE performs action 1408. The CE transforms the one or two data element(s) into a wavelet payload, according to the destination DSD. In some embodiments and/or usage scenarios, the CE transforms a single data element into a wavelet payload formatted in accordance with Sparse Wavelet 1301 of
As another example, CE 800 as the CE of the transmitting PE transforms two data elements into a wavelet payload formatted in accordance with Dense Wavelet 1331 of
In some embodiments, the CE provides the wavelet(s) to the router asynchronously (e.g., in accordance with action 760 of
In various embodiments and/or usage scenarios, all or any portions of any one or more of elements of Wavelet Creation Flow 1400 (e.g., any one or more of actions 1411 and 1412) correspond conceptually to and/or are related conceptually to operations performed by and/or elements of a router, such as all or any portions of a router of a PE, e.g., Router 510 of
As an example, Transmit Wavelet(s) to Fabric 1411 is performed by Router 600 as Router of Transmitting PE 1430 in accordance with action 760 of
In some embodiments and/or usage scenarios, all or any portions of elements of Wavelet Creation Flow 1400 conceptually correspond to all or any portions of executions of instructions of Task SW on PEs 260 of
Receiving a wavelet begins (Start 1501) by initializing at least one transmitting PE and one or more receiving PEs as well any PEs comprising routers implementing fabric coupling the transmitting PEs and the receiving PEs (Initialize PEs 1502). Each of the PEs comprises a respective router (e.g., Router 510 of
The following description assumes there is a single receiving PE. In usage scenarios where there is plurality of receiving PEs, the respective routers and CEs of each of the receiving PEs perform processing in accordance with
The router of the receiving PE receives a wavelet ‘on a color’ (e.g., the wavelet comprises the color) of the fabric (Receive Wavelet at Router 1503), as transmitted by the transmitting PE. The router checks the destination(s) of the wavelet based on the color, e.g., by reading a configuration register. If the destination(s) of the wavelet includes other PEs (To Other PE(s)? 1504), then the router transmits the wavelet to the destination PE(s). The router sends the wavelet to output(s) of the router (Transmit Wavelet to Output(s) 1505), and the wavelet is transmitted from the output across the fabric to the destination PE(s). If the destination(s) of the wavelet does not include other PEs, then the transmitting is omitted.
If the destination(s) of the wavelet do not include the local CE (For Local CE? 1506), then no further action is taken (End 1510). If one of the destination(s) of the wavelet is the local CE, then the router provides the wavelet to the local CE via the Off Ramp and the wavelet is written into a picker queue associated with the color that the wavelet was received on (Write Wavelet to Picker Queue 1507), thereby receiving the wavelet (End 1510).
In various embodiments and/or usage scenarios, all or any portions of any one or more of elements of Wavelet Receive Flow 1500 (e.g., any one or more of actions 1503-1506) correspond conceptually to and/or are related conceptually to operations performed by and/or elements of a router, such as all or any portions of a router of a PE, e.g., Router 510 of
As an example, Receive Wavelet at Router 1503 is performed by Router 600 as Router of Receiving PE 1520 when a wavelet is received on one of Data In 610. Subsequently, To Other PE(s)? 1504 and For Local CE? 1506 are performed by Router 600, using the color of the wavelet to determine the destination(s) of the wavelet, e.g., by reading Dest 661. For each input color, Dest 661 indicates the output destination(s), e.g., one or more of Data Out 620. If Dest 661 indicates that the output includes other PEs (e.g., via one of SkipX+ 621, SkipX− 622, X+ 623, X− 624, Y+ 625, and Y− 626), then the wavelet is sent to other PEs by Router Sched 654. If Dest 661 indicates that the output includes the CE of the PE (e.g., Offramp 627), then the wavelet is sent to the CE by Router Sched 654. The wavelet remains in one of Data Queues 650 until action 1505 is performed by scheduling the wavelet (e.g., by Router Sched 654) to be sent to one or more of Data Out 620.
In various embodiments and/or usage scenarios, all or any portions of any one or more of elements of Wavelet Receive Flow 1500 (e.g., action 1507) correspond conceptually to and/or are related conceptually to operations performed by and/or elements of a compute element, such as all or any portions of a CE of a PE, e.g., Compute Element 520 of
In some embodiments and/or usage scenarios, wavelets are received by the router, queued, and routed to router output ports without any specific determination that a wavelet is for a local CE. Instead, wavelets destined for the local CE are routed to the off ramp and are then written into the picker queue. Wavelets not destined for the local CE are routed to other-than the off ramp router outputs.
Consuming a wavelet begins (Start 1601) by the picker selecting the wavelet from a queue for processing (Picker Selects Wavelet for Processing 1602), and then the CE processes the wavelet. The CE fetches and executes instructions associated with the wavelet (Fetch, Execute Instructions 1603), thereby consuming the wavelet (End 1604). In some embodiments and/or usage scenarios, fetching and executing instructions associated with the wavelet ends with fetching and executing a terminate instruction.
In some embodiments, Picker Selects Wavelet for Processing 1602 is performed by Picker 830 of
In some other scenarios, the wavelet is accessed as an operand by an instruction (e.g., FMACH) executing on the CE and the wavelet is consumed by the CE during the execution of the instruction, e.g., as illustrated in
Neuron Smearing
Selected neurons (N211721, N221722, N231723, and N241724 as well as N311731 and N321732) and communications (1791, 1792, and 1793) between the selected neurons are highlighted in the figure. The selected neurons and pathways are discussed in more detail following.
Each of neurons N211721, N221722, N231723, and N241724 represents approximately an equal amount of computational resources, e.g., M operations, K storage capacity, and J bandwidth to and from the storage. Each of neurons N311731 and N321732 represents approximately an equal amount of computational resources, e.g., M/2 operations, K/2 storage, and J/2 bandwidth. Thus, each of N311731 and N321732 represents approximately one half the computational resources of each of N211721, N221722, N231723, and N241724. In various embodiments, examples of computational resources comprise compute operations, storage capacity, read bandwidth from storage, write bandwidth to storage, input connections from other neurons, and output connections to other neurons.
In the illustrated embodiment, neuron processing is allocated such that each of the foregoing neurons is allocated to an entire PE. More specifically, N211721 is allocated to PE01820, N221722 is allocated to PE11821, N231723 is allocated to PE21822, N241724 is allocated to PE31823, N311731 is allocated to PE41824, and N321732 is allocated to PE51825. Therefore, four of the six processing elements are fully subscribed (PE01820, PE11821, PE21822, and PE31823), while two of the six processing elements are only one-half subscribed (PE41824 and PE51825).
In the illustrated embodiment, neuron processing is allocated such that processing for respective neurons is “smeared” across processing elements. Conceptually, neurons are “split” into portions suitable for processing elements to be allocated to. As illustrated in the figure, neurons are split and processing elements allocated so that four of the six processing elements are equally (and fully) subscribed (PE01820, PE11821, PE21822, and PE31823), while two of the six processing elements are completely unsubscribed and therefore available for other uses (PE41824, and PE51825). In some embodiments and/or usage scenarios, unsubscribed processing elements remain unused and consume little or no active and/or static power (e.g., via one or more of clock gating and power gating). More specifically, N211721 is allocated in two halves (½ N211721.1 and ½ N211721.2) to two respective processing elements (PE01820 and PE21822). Similarly, N221722 is allocated in two halves (½ N221722.1 and ½ N221722.2) to two respective processing elements (PE01820 and PE21822). N231723 is allocated in two halves (½ N231723.1 and ½ N23 1723.2) to two respective processing elements (PE11821 and PE31823) and N241724 is allocated in two halves (½ N241724.1 and ½ N241724.2) to two respective processing elements (PE11821 and PE31823). N311731 is allocated in four fourths (¼ N311731.1, ¼ N311731.2, ¼ N311731.3, and ¼ N311731.4) to four respective processing elements (PE01820, PE11821, PE21822, and PE31823). Similarly, N321732 is allocated in four fourths (¼ N321732.1, ¼ N321732.2, ¼ N321732.3, and ¼ N321732.4) to four respective processing elements (PE01820, PE11821, PE21822, and PE31823). In various embodiments, neurons are split and processing elements allocated based on one or more computational resources associated with the neurons. In some embodiments, neurons are split and processing elements allocated based on the hardware resources available in the processing elements (e.g., some neurons require specific hardware resources such as PRNGs).
Conceptually, N211721 is considered to comprise local compute and local storage, as well as inputs and outputs. Respective elements of N211721 are partitioned respectively. The local compute of N21 is partitioned into ½ Local Compute 1930.1 and ½ Local Compute 1930.2. The local storage of N21 is partitioned into ½ Local Storage 1940.1 and ½ Local Storage 1940.2. The inputs of N21 are partitioned into a first half in01910, in11911 and in21912 as well as a second half in31913, in41914, and in51915. The outputs of N21 are partitioned into a first half out01920, out11921, out21922 as well as a second half out31923, out41924, and out51925.
½ Local Compute 1930.1, ½ Local Storage 1940.1, in01910, in11911, in21912, out01920, out11921, and out21922 are implemented by PE01820. ½ Local Compute 1930.2, ½ Local Storage 1940.2, in31913, in41914, and in51915, out31923, out41924, and out51925 are implemented by PE21822.
In some embodiments and/or usage scenarios, smearing a neuron across more than one processing element comprises combining partial results from the portions of the smeared neuron into results corresponding to results of the entire (original non-smeared) neuron. The combining is implemented, e.g., at least in part by additional computation, additional storage, and/or additional communication that would not otherwise be performed/used by the entire neuron. Additional Compute 1950.1 and Additional Storage 1960.1 are representative of additional compute and additional storage for ½ N211721.1, and are implemented by PE01820. Additional Compute 1950.2 and Additional Storage 1960.2 are representative of additional compute and additional storage for ½ N211721.2, and are implemented by PE21822.
Additional Communication 1970 is representative of additional communication between ½ N211721.1 and ½ N211721.2, and is implemented by fabric connectivity between PE01820 and PE21822. In some embodiments and/or usage scenarios, all or any portions of Additional Communication 1970 is representative of communications that would occur internally to a single processing element if the single processing element entirely implemented N211721.
Wafer Portion 2000 comprises PE01820, PE11821, PE21822, and PE31823. Couplings between PEs of Wafer Portion 2000 are illustrated as (coupling between adjacent PEs) 2040 coupling PE01820 and PE11821, 2041 coupling PE11821 and PE31823, 2043 coupling PE31823 and PE21822, and 2044 coupling PE21822 and PE01820. Couplings to PEs adjacent to Wafer Portion 2000 are illustrated as (portion of coupling between adjacent PEs) 2050, 2051, 2052, 2053, 2054, 2055, 2056, and 2057. The couplings to adjacent PEs are ‘portions’ since in some embodiments and/or usage scenarios, all or any portions of the couplings are comprised in wafer portions adjacent to Wafer Portion 2000, rather than entirely in Wafer Portion 2000. In various embodiments and/or usage scenarios, and as at least in part further described elsewhere herein, communication between processing elements over the couplings is via virtual channel, a type of logical coupling implemented by the routers within the processing elements, in accordance with a specified color of a wavelet, e.g., as determined by Neuron to PE Mapping SW 212 of
As a first example, communication portion 1791.1 conceptually represents a portion of communication 1791 between N111711 and N211721 (of
As a second example, communication portion 1792.1 conceptually represents a portion of communication 1792 between N211721 and N311731 (of
As a third example, communication portion 1793.1 conceptually represents a portion of communication 1793 between N231723 and N311731 (of
As a fourth example, communication 2060 conceptually represents all or any portions of Additional Communication 1970 (of
In some embodiments and/or usage scenarios, all or any portion of Wafer Portion 2000 comprises PEs 122 of
Concepts relating to neuron smearing (e.g., as described with respect to and illustrated by
In various embodiments and/or usage scenarios, neurons are split into same-sized portions, e.g., halves, fourths, eights, and so forth. In various embodiments and/or usage scenarios, neurons are split into different-sized portions, e.g., a first portion that is a half, and second and third portions that are respectively each fourths. In various embodiments and/or usage scenarios, neurons are split into arbitrarily-sized portions.
In various embodiments and/or usage scenarios, a multiplicity of PEs are allocated to a single neuron. In various embodiments and/or usage scenarios, a single PE is allocated to the respective entireties of a multiplicity of neurons.
In various embodiments and/or usage scenarios, allocation of PEs to neurons is entirely or partially responsive to static and/or dynamic measurements of computational and/or storage requirements. In various embodiments and/or usage scenarios, allocation of PEs to neurons is entirely or partially responsive to dimensionality of data to be processed.
In various embodiments and/or usage scenarios, dataflow as represented by directions of arrows is unidirectional (as illustrated by drawn arrowhead), bidirectional, and/or reverse-direction (against drawn arrowhead). As a specific example, in various embodiments and/or usage scenarios, communication 1792 (of
In various embodiments and/or usage scenarios, each neuron has: associated storage for a weight per incoming activation, a partial sum accumulation computation, and an output activation function computation. For those scenarios in which single neurons are split across multiple PEs, the weights are respectively locally stored in the multiple PEs, multiply and accumulate operations are respectively locally performed in the multiple PEs, and locally generated partial sums are communicated via virtual channels to a particular PE for production of a final sum. The activation function following the final sum can be performed in the same particular PE or in another PE, all as determined by Neuron to PE Mapping SW 212 of
In various embodiments and/or usage scenarios, the partial sums, the accumulations, and the activation functions, are implemented using all digital techniques, including digital logic and/or digital processing. In various embodiments and/or usage scenarios, exclusive of defects, the fabric comprises a homogenous collection of PEs enabled to perform digital arithmetic via one or more of: a task performing floating-point arithmetic, floating-point multiplier logic, fused multiply and accumulate digital logic, and floating-point addition using stochastic rounding. In various embodiments and/or usage scenarios, the PEs of the homogenous collection are further enabled to perform each activation functions as a nonlinear activation function selected from the group consisting of Rectified Linear Unit (ReLU), sigmoid, and tanh.
It is understood that the representation in
Vectors and Data Structure Descriptors
In various embodiments and/or usages scenarios, processing of one or more vectors, each vector comprising respective one or more of data elements, is performed. A vector is variously read from memory (e.g., of a CE of a PE, such as Memory 854 or D-Store 848 of
Each element identifier in the description of
Fabric Input Data Structure Descriptor 2100 comprises Length 2101, UTID (Microthread Identifier) 2102, UE (Microthread Enable) 2103, SW (SIMD Width) 2104, AC (Activate Color) 2105, Term (Terminate Microthread on Control Wavelet) 2106, CX (Control Wavelet Transform Enable) 2107, US (Microthread Sparse Mode) 2108, Type 2109, SS (Single Step) 2110, SA (Save Address/Conditional Single Step Mode) 2111, SC (Color Specified/Normal Mode) 2112, SQ (Queue Specified/Normal Mode) 2113, and CH (Color High) 2114.
In some embodiments, Length 2101 comprises a 15-bit integer specifying the length of the vector, e.g., the number of data elements in the vector.
In some embodiments, UE (Microthread Enable) 2103 comprises a 1-bit field indicating whether, under at least some conditions, microthreading is enabled during processing of the fabric vector, sometimes referred to as the fabric vector ‘enabling microthreading’. If at least one operand (source or destination) of an instruction is a fabric vector enabling microthreading, then the instruction is referred to as a ‘microthreaded instruction’, and on either an input or output stall during processing an iteration of the instruction, processing is enabled to proceed (provided sufficient microthreading resource are available) to another instruction (e.g., of the same task, or of another task). When the stall is cleared, then processing (eventually) returns to the previously stalled instruction at the iteration that was stalled. An example input stall is when at least one element of an input fabric vector or a FIFO operand is not available as an input (e.g., a source data element). An example output stall is when there is insufficient space to buffer results associated with an element of an output fabric vector or a FIFO for an output (e.g., a destination data element). In some scenarios, a fabric vector that does not enable microthreading is processed synchronously and stalls processing on either an input or output stall. In some scenarios, a fabric vector that enables microthreading is processed asynchronously and reduces or avoids stalling the processing element on either an input or output stall. If a fabric vector enables microthreading, then the processing element is enabled to conditionally switch to processing a different instruction (instead of stalling) and subsequently resume processing the fabric vector at a later point in time (e.g., when data is available).
In some embodiments, UTID (Microthread Identifier) 2102 comprises a 3-bit field identifying one of a plurality of microthreads and/or resources associated with one of a plurality of microthreads. The microthreads and/or the resources are associated, e.g., with a fabric vector that enables microthreading. In some embodiments, the hardware provides resources for eight microthreads. In some embodiments and/or usage scenarios, UTID 2102 identifies or partially identifies one of Input Qs 897.
In some embodiments, SW (SIMD Width) 2104 comprises a 2-bit field specifying the number of operations (e.g., one, two, or four) that are, in some implementations, executed in parallel. For example, an FMACH, FADDH, FMULH or MOV16 instruction performs multiple (up to four) operations in parallel on respective operands. In some implementation, the SW field is used to determine how to parse wavelets into data versus index information. For example, when the SW field is four, then two wavelets, each having two data values (and no index values) provide four operands, e.g., in parallel. Continuing with the example, when the SW field is two, then a single wavelet having two data values (and no index value) provides two operands, e.g., in parallel. Continuing with the example, when the SW field is one, then a single wavelet having a single data value and a single index value provides a single operand.
In some embodiments, AC (Activate Color) 2105 comprises a 6-bit field specifying a color to activate (e.g., via an activate operation). In some scenarios, when processing is complete for a fabric vector that enables microthreading, the color specified by the AC field is activated and a task initiated based on the activated color. The completion of processing occurs, e.g., when all elements of the fabric vector have been processed, or when Term 2106 indicates to terminate upon encountering a control wavelet and a control wavelet is encountered while processing the fabric vector. In some embodiments, AC 2105 is enabled to specify one of: a local color and a fabric color.
In some embodiments, Term (Terminate Microthread on Control Wavelet) 2106 comprises a 1-bit field specifying whether to terminate upon receiving a control wavelet. If the wavelet at the head of the queue specified by Fabric Input Data Structure Descriptor 2100 (e.g., one of Input Qs 897 as variously specified by various functions of any combination of UTID 2102, SC 2112, and/or SQ 2113, as described elsewhere herein) is a control wavelet (e.g., Control Bit 1320 of
In some embodiments, CX (Control Wavelet Transform Enable) 2107 comprises a 1-bit field specifying whether to transform control wavelets. If CX 2107 is asserted, then in response to receiving a control wavelet in the fabric vector, bits 15:6 of the index register are all ‘1’s. In some embodiments and/or usage scenarios, if bits 15:6 of the index register are all ‘1’s, then the control bits of any output wavelets associated with an output fabric vector referencing the index register are asserted.
In some embodiments, US (Microthread Sparse Mode) 2108 comprises a 1-bit field specifying whether a fabric vector that enables microthreading (e.g., via the UE field) is processed in a sparse mode. If US 2108 is asserted, then the fabric vector comprises a vector of sparse data elements and respective wavelet indices of the operand described by Fabric Input Data Structure Descriptor 2100. The indices are optionally and/or selectively used for address calculation of memory operands, dependent on WLI 2152 (of
In some embodiments, Type 2109 comprises a 3-bit field specifying a data structure type and/or how to interpret other fields of Fabric Input Data Structure Descriptor 2100. Type 2109 is “0” for all instances of Fabric Input Data Structure Descriptor 2100.
In some embodiments, SS (Single Step) 2110 comprises a 1-bit field specifying whether single step mode operation is enabled, under at least some conditions, for operations using the DSD as an operand. In some scenarios, an instruction with one or more operands that enable single step mode operates in single step mode.
In some embodiments, SA (Save Address/Conditional Single Step Mode) 2111 comprises a 1-bit field specifying whether save address mode operation is enabled, under at least some conditions, for operations using the DSD as an operand.
In some embodiments and/or usage scenarios, a color is activated and in response a task is initiated at an address based at least in part on the color. Once initiated, the task executes. In some scenarios, an input fabric vector is provided from the queue associated with the color of the currently executing task. In some embodiments, SC (Color Specified, Normal Mode) 2112 comprises a 1-bit field that if asserted, specifies that the input fabric vector is provided from a specific queue (e.g., one of Input Qs 897) associated with a specific fabric color. The specific fabric color is specified (e.g., as a 5-bit color) as a concatenation of lower bits UTID 2102 (comprising a 3-bit field) and upper bits CH 2114 (comprising a 2-bit field). In some embodiments, SQ (Queue Specified, Normal Mode) 2113 comprises a 1-bit field that if asserted, specifies that the input fabric vector is provided from a specific queue (e.g., one of Input Qs 897). If SQ 2113 is asserted, then the input fabric vector is provided from the one of Input Qs 897 specified by UTID 2102.
Fabric Output Data Structure Descriptor 2120 comprises Length 2121, UTID (Microthread Identifier) 2122, UE (Microthread Enable) 2123, SW (SIMD Width) 2124, Color 2126, C (Output Control Bit) 2127, Index Low 2128.1, Type 2129, SS (Single Step) 2130, SA (Save Address/Conditional Single Step Mode) 2131, WLI (Wavelet Index Select) 2132, Index High 2128.2, and AC (Activate Color) 2125.
In some embodiments, the elements of Fabric Output Data Structure Descriptor 2120 (Length 2121, UTID 2122, UE 2123, SW 2124, SS 2130, SA 2131, and AC 2125) are respectively similar in function and/or operation with respect to the elements of Fabric input Data Structure Descriptor 2100 (Length 2101, UTID 2102, UE 2103, SW 2104, SS 2110, SA 2111, and AC 2105).
In some embodiments, Color 2126 comprises a 5-bit field specifying the fabric color used to transmit wavelets associated with the fabric vector.
In some embodiments, C (Output Control Bit) 2127 comprises a 1-bit field specifying whether a wavelet is a control wavelet. If C 2127 is asserted, then any wavelets created based on the DSD are control wavelets (e.g., Control Bit 1320 of
In some embodiments, Index Low 2128.1 comprises a 3-bit field and Index High 2128.2 comprises a 3-bit field. The concatenation of Index Low 2128.1 and Index High 2128.2 is collectively referred to as Index 2128. In some scenarios, Index 2128 is used to form an index for a wavelet (e.g., Index 1321 of
In some embodiments, Type 2129 comprises a 3-bit field specifying a data structure type and/or how to interpret other fields of Fabric Output Data Structure Descriptor 2120. Type 2129 is “0” for all instances of Fabric Output Data Structure Descriptor 2120.
In some embodiments, WLI (Wavelet Index Select) 2132 comprises a 1-bit field specifying in part the index of the fabric vector. In some scenarios, if WLI 2132 is “1”, then the index is the value from a register (e.g., GPR4 of RF 842). In some scenarios, if WLI 2132 is “0”, then the index is a zero-extension to 16 bits of Index 2128.
1D Memory Vector Data Structure Descriptor 2140 comprises Length 2141, Base Address 2142, Type 2149, SS (Single Step) 2150, SA (Save Address/Conditional Single Step Mode) 2151, WLI (Wavelet Index Select) 2152, and Stride 2153.
In some embodiments, some of the elements of 1D Memory Vector Data Structure Descriptor 2140 (Length 2141, SS 2150, and SA 2151) are respectively similar in function and/or operation with respect to some of the elements of Fabric Input Data Structure Descriptor 2100 (Length 2101, SS 2110, and SA 2111). In some scenarios, if the length of the memory vector is more than 15 bits, then 4D Memory Vector Data Structure Descriptor 2140 is used.
In some embodiments, Base Address 2142 comprises a 15-bit integer specifying the base address of the memory vector.
In some embodiments, Type 2149 comprises a 3-bit field specifying a data structure type and/or how to interpret other fields of 1D Memory Vector Data Structure Descriptor 2140. Type 2149 is “1” for all instances of 1D Memory Vector Data Structure Descriptor 2140.
In some embodiments, WLI (Wavelet Index Select) 2152 comprises a 1-bit field specifying in part the index of the vector. If WLI 2152 is “0”, then the index is 0. In some scenarios, if WLI 2152 is “1”, then the index is the value from a register (e.g., GPR4 of RF 842) or the index of a sparse wavelet (e.g., Index 1321 of
In some embodiments, Stride 2153 comprises a 9-bit signed integer specifying the stride of the vector. In some scenarios, Base Address 2142, an index specified by WLI 2153, and Stride 2153 enable calculating addresses of data elements in a 1D memory vector. The address of the first data element in the 1D memory vector is Base Address 2142 plus the index specified by WLI 2153. The address of the next data element in the 1D vector is the address of the first data element plus Stride 2153. For example, Base Address 2142 is 136, WLI 2153 is 1, GPR4 holds the value 6, Stride 2153 is −2, and Length 2141 is 10, then the memory vector comprises data located at addresses {142, 140, 138, . . . , 124}. In some scenarios, if the stride of the memory vector is more than nine bits, then 4D Memory Vector Data Structure Descriptor 2140 is used.
4D Memory Vector Data Structure Descriptor 2160 comprises Length Lower Bits 2161.1, Base Address 2162, Type 2169, SS (Single Step) 2170, SA (Save Address/Conditional Single Step Mode) 2171, WLI (Wavelet Index Select) 2172, and Length Upper Bits 2161.2.
In some embodiments, some of the elements of 4D Memory Vector Data Structure Descriptor 2160 (Base Address 2162, SS 2170, SA 2171, and WLI 2172) are respectively similar in function and/or operation with respect to 1D Memory Vector Data Structure Descriptor 2140 (Base Address 2142, SS 2150, SA 2151, and WLI 2152).
In some embodiments, Lower Bits 2161.1 comprises a 15-bit field and Length Upper Bits 2161.2 comprises a 9-bit field. The concatenation of Lower Bits 2161.1 and Length Upper Bits 2161.2 is collectively referred to (and illustrated as) Length 2161 (a 24-bit field) interpreted in conjunction with 4D Memory Vector Extended Data Structure Descriptor 2240.
In some embodiments, Type 2169 comprises a 3-bit field specifying an extended DSR (XDSR), storing, e.g., an extended DSD (XDSD). The XDSD specifies and describes one of: a circular memory buffer (e.g., Circular Memory Buffer Extended Data Structure Descriptor 2210 of
Circular Memory Buffer Data Structure Descriptor 2180 comprises Length 2181, Base Address 2182, FW (FIFO Wrap Bit) 2188, Type 2189, SS (Single Step) 2190, SA (Save Address/Conditional Single Step Mode) 2191, WLI (Wavelet Index Select) 2192, and SW (SIMD Width) 2184. In some embodiments, a circular memory buffer access always has an index of zero and a stride of one.
In some embodiments, some of the elements of Circular Memory Buffer Data Structure Descriptor 2180 (Length 2181, Base Address 2182, SS 2190, and SA 2191) are respectively similar in function and/or operation with respect to some of the elements of 1D Memory Vector Data Structure Descriptor 2140 (Length 2141, Base Address 2142, SS 2150, and SA 2151). In some embodiments, Type 2189 is similar in function and/or operation to Type 2169 of 4D Memory Vector Data Structure Descriptor 2160. In some embodiments, SW 2184 of Circular Memory Buffer Data Structure Descriptor 2180 is similar in function and/or operation to SW 2104 of Fabric Input Data Structure Descriptor 2100.
In some embodiments, FW (FIFO Wrap Bit) 2188 comprises a 1-bit field enabling distinguishing between a full FIFO and an empty FIFO. FW (FIFO Wrap Bit) 2188 is toggled when an access wraps around the address range of the FIFO.
In some embodiments, WLI 2192 has no impact on the index of a circular buffer.
In some embodiments, Type 2211 comprises a 1-bit field specifying the type of data structure. Type 2211 is “1” for all instances of Circular Memory Buffer Extended Data Structure Descriptor 2210.
In some embodiments, Start Address 2212 comprises a 15-bit field specifying the start address of the circular buffer in the memory. In some embodiments, End Address 2213 comprises a 15-bit integer specifying the end address of the circular buffer in the memory. When an address is incremented (e.g., by the stride to initiate the next access) and equals End Address 2213, the address is reset to Base Address 2212, thereby providing circular access behavior.
In some embodiments, FIFO 2214 comprises a 1-bit field specifying whether the circular buffer is a FIFO. If FIFO 2214 is “0”, then the circular buffer is not a FIFO. If FIFO 2214 is “1”, then the circular buffer is a FIFO.
In some embodiments, Push (Activate) Color 2215 and Pop (Activate) Color 2216 comprise 6-bit fields specifying colors to activate (e.g., via an activate operation). In some embodiments, Push (Activate) Color 2215 and Pop (Activate) Color 2216 are enabled to specify ones of: a local color and a fabric color.
In various embodiments, two circular memory buffer DSRs are enabled to describe a FIFO of data elements stored in a same region of the memory. A destination DSR (e.g., DDSR8) describes a write pointer of the FIFO, and a source1 DSR (e.g., S1DSR8) describes a read pointer of the FIFO. In some embodiments, destination and source1 DSRs have a same identifier. In various embodiments, only some of DSRs 846 are enabled to describe FIFOs, (e.g., DDSR8-DDSR11 and S1DSR8-S1DSR11).
FW (FIFO Wrap Bit) 2188 of the two DSRs enables detecting if a FIFO is full or empty. When a FIFO is used as a destination, Base Address 2182 and FW 2188 of the associated S1DSR is read and compared to values from the DDSR. If Base Address 2182 of the two DSRs are the same, but FW 2188 are different, then the FIFO is full. When a FIFO is used as a source, Base Address 2182 and FW 2188 of the associated DDSR are read and compared to values from the S1DSR. If Base Address 2182 of the two DSRs are the same and FW 2188 are the same, then the FIFO is empty. In some scenarios (e.g., microthreading), in response to a read accessing an empty FIFO or a write accessing a full FIFO, processing is switched to an instruction in another task until the FIFO is respectively not empty or not full.
In some embodiments and/or usage scenarios, software (e.g. Task SW on PEs 260 of
In some embodiments, Type 2241 comprises a 1-bit field specifying the type of data structure. Type 2241 is “0” for all instances of 4D Memory Vector Extended Data Structure Descriptor 2240.
In some embodiments, Dimensions 2242 comprises a 20-bit field used to initialize the length of the next dimension of the vector.
In some embodiments, DF (Dimension Format) 2243 comprises a 5-bit field that, in conjunction with Length 2161 of
In some embodiments, Select Stride 12244.1 comprises a 1-bit field specifying a stride for the first dimension of the vector. If Select Stride 12244.1 is “0”, then the stride is 1. If Select Stride 12244.1 is “1”, then the stride is specified by Stride 2245.
In some embodiments, Select Stride 22244.2 comprises a 3-bit field and encodes a stride for the second dimension of the vector. If Select Stride 22244.2 is “0”, then the stride is 1. If Select Stride 22244.2 is “1”, then the stride is specified by Stride 2245. If Stride Select 22244.2 is 2-7, then the stride is specified by a corresponding (DSR) stride register (e.g., of the six stride registers of DSRs 846.
In some embodiments, Select Stride 32244.3 and Select Stride 42244.4 comprise respective 3-bit fields. In some embodiments, Select Stride 32244.3 and Select Stride 42244.4 are respectively similar in function and/or operation with respect to the third and fourth dimension as Select Stride 22244.2 is with respect to the second dimension.
In some embodiments, Stride 2245 comprises a 15-bit field specifying a stride of the vector in the memory. In some scenarios, Stride 2245 enables using a longer stride for a one-dimensional vector than Stride 2153 (of
Accessing a source operand via a data structure descriptor begins (Start 2301) by initializing one or more DSRs of a CE of a PE with respective DSDs (Set DSR(s) 2302) and optionally initializing respective XDSDs and/or stride values of the CE ((optional) Set XDSR(s) 2305). In some embodiments, the initialized DSRs (as well as the optionally initialized XDSRs and stride registers holding the stride values) are initialized by instructions that move data from memory to the DSRs. Subsequently, the CE fetches and decodes an instruction (e.g., FMACH, MOV, or LT16) comprising one or more operands specified by the initialized DSRs and optionally one or more XDSRs and/or stride registers (Fetch/Decode Instruction with DSR(s) 2303). In some embodiments, the operand type fields of the instruction specify whether an operand is specified by a DSR.
The CE reads one or more DSDs from the DSRs (Read DSR(s) 2304) and determines one or more of: the type of data structure, the source of the data element(s), whether multiple data elements are read together (e.g., for a SIMD operation), and the total number of data elements for each operand. Depending on the determination, for each DSD read, an XDSR and one or more stride registers are also optionally read ((optional) Read XDSR(s) 2306), as described with respect to
Based upon the DSDs obtained in action 2304 (and optional XDSRs and stride values obtained in action 2306), the CE reads one or more source data element(s) from the fabric and/or memory (Read (Next) Source Data Element(s) from Queue/Memory 2310). For each source specified by the instruction obtained in action 2303 (e.g., each of source0 and source1), the CE reads sufficient elements for an iteration of the operation specified in the instruction, and in accordance with SIMD width information in the DSDs. In some embodiments and/or usage scenarios, sufficient elements for an iteration is at least one element and no more than the number indicated by the SIMD width information. In various embodiments, sufficient elements is no more than the number of elements comprised by one or two entries in a queue of Input Queues 897 and no more than the number of elements comprised by one or two entries in a queue of Output Queues 859. Data element(s) from the fabric (e.g., a source data structure is a fabric vector) are accessed via one or more queues of the CE. In some embodiments and/or usage scenarios, the CE also reads data element(s) from registers.
After reading the source data element(s), the CE performs the operation using the data element(s) as inputs (Perform (Next) Operation(s) on Data Element(s) 2311). The operation is specified by the instruction obtained in action 2303 (e.g., a multiply-accumulate operation for an FMACH instruction, a move operation for a MOV instruction, or a less than integer comparison for LT16).
In some scenarios, the operation (e.g., a multiply-accumulate operation or a move operation) produces one or more output data element(s). The CE writes the output data element(s) to the fabric or the memory (Write (Next) Destination Data Element(s) to Queue/Memory 2312), based upon the DSDs obtained in action 2304 (and optional XDSRs and stride values obtained in action 2306). Data element(s) sent to the fabric (e.g., the destination data structure is a fabric vector) are formed into wavelets and transmitted to the fabric via the router of the PE. In some other scenarios, there are no output data elements (e.g., some comparison operations).
After writing any results from the operation, the CE determines if there are additional data element(s) to process (More Data Element(s)? 2313). In some embodiments, the DSD specifies the total number of data elements to access (e.g., the length of the vector) and the CE compares the number of data element(s) that have been accessed (e.g., tracked via a counter) to the total number of data element(s) specified by the length. If there are additional data element(s) to process, the CE repeats actions 2310-2313 until all data element(s) have been processed and flow concludes (End 2316).
In various embodiments and/or usage scenarios, all or any portions of any one or more of elements of Data Structure Descriptor Flow 2300 (e.g., any one or more actions of 2302-2312) correspond conceptually to and/or are related conceptually to operations performed by and/or elements of a CE, e.g., CE 800.
As an example, the source DSRs holding source DSDs (associated with Set DSR(s) 2302 and Read DSR(s) 2304) are one or more of DSRs 846 (e.g., S0DSRs, S1DSRs, DDSRs, XDSRs, and stride registers). In some embodiments, CE 800 performs Set DSR(s) 2302 responsive to instruction(s) that write DSDs into DSRs, e.g., LDSOWDS, LDS1WDS, LDXDS, and LDSR.
As another example, CE 800 performs Fetch/Decode Instruction with DSR(s) 2303. In various embodiments, PC 834 and I-Seq 836 fetch instructions from Memory 854 and Dec 840 decodes fetched instructions. In some embodiments, instructions are formatted in accordance with one of: Multiple Operand Instruction 2510 of
As another example, CE 800 performs Read DSR(s) 2304 in response to an instruction with one or more operands specified by a DSR. In various embodiments, D-Seq 844 reads the DSR(s) specified by the instruction obtained in action 2303 from DSRs 846. In some embodiments, DSDs read from the DSRs are formatted in accordance with one or more of: Fabric Input Data Structure Descriptor 2100 of
As another example, CE 800 performs Read (Next) Source Data Element(s) from Queue/Memory 2310 based upon the source DSD(s) read in action 2304 and optionally XDSD(s) read in action 2306. In some scenarios, a source DSD specifies (e.g., via Type 2149) that an operand originates from memory, and D-Seq 844 reads data element(s) from D-Store 848 or Memory 854 at address(es) specified by the DSD (e.g., based in part upon one or more of: Base Address 2142, WLI 2152, and Stride 2153). In some scenarios, a source DSD specifies (e.g., via Type 2109) that an operand originates from the fabric and CE 800 reads data element(s) from one of Input Qs 897. In some embodiments and/or usage scenarios, data elements are directly transmitted from one of Input Qs 897 to Data Path 852. In other embodiments and/or usage scenarios, data elements are transmitted from one of Input Qs 897 to RF 842 and from RF to Data Path 852. In some embodiments, the one of Input Qs 897 is implicitly specified by portions of the DSD (e.g., one or more of: UTID 2102, SC 2112, and SQ 2113). In some scenarios, the CE reads from the queue associated with the color of the current task (e.g., the task associated with the instruction obtained in action 2303). In some scenarios (e.g., SQ 2113 is “1”), the CE reads from a queue specified by UTID 2102. In some scenarios (e.g., SC 2112 is “1”), the CE reads from a queue associated with the color specified by UTID 2102 concatenated with CH 2114. In some scenarios, the CE reads one, two, or four data elements from the specified queue based upon SW 2104.
In some embodiments and/or usage scenarios, when CE 800 attempts to read more data element(s) than are available in the specified queue of Input Qs 897, or alternatively attempts to read from an empty FIFO (e.g., as implemented in accordance with a DSD in accordance with
As another example, CE 800 performs Perform (Next) Operation(s) on Data Element(s) 2311. In some embodiments, Data Path 852 uses the data element(s) read in action 2310 as inputs to the operation specified by the instruction obtained in action 2303. In some scenarios (e.g., a computational operation), action 2311 produces output data element(s), while in other scenarios (e.g., a comparison operation), action 2311 produces no output data element. In some embodiments, Data Path 852 is enabled to perform more than one operation simultaneously (e.g., in an iteration), e.g., performing two or four multiply-accumulate operations simultaneously using SIMD execution resources.
As another example, CE 800 performs Write (Next) Source Data Element(s) to Queue/Memory 2312 based upon the destination DSD read in action 2304 and optionally XDSD(s) read in action 2306. In some scenarios, the destination DSD specifies (e.g., via Type 2149) that an operand is destined for memory, and D-Seq 844 writes data element(s) to D-Store 848 or Memory 854 at address(es) specified by the destination DSD (e.g., based in part upon one or more of: Base Address 2142, WLI 2152, and Stride 2153).
In various embodiments and/or usage scenarios, portions of action 2312 (e.g., writing destination data elements to the fabric) correspond conceptually to and/or are related conceptually to Provide Data Element(s) as Wavelet to Output Queue 1408 of
In some embodiments and/or usage scenarios, when CE 800 attempts to transmit more wavelets than resources available in Router 600 (e.g., there are insufficient resources in Data Queues 650 of
As another example, CE 800 performs action 2313. In some embodiments, D-Seq 844 determines how many data element(s) have been processed (e.g., by incrementing a counter for each data element) and compares this against the length of the vector (e.g., Length 2101).
If the DSD does not correspond to a fabric vector, then the DSD corresponds to a memory vector. The CE then determines whether the DSD corresponds to a 1D memory vector (Type=XDSR? 2421), e.g., in accordance with
If the DSD does not correspond to a 1D memory vector, then the DSD corresponds to either a 4D memory vector (e.g., in accordance with
The CE then determines whether the XDSD specifies a 4D memory vector (e.g., in accordance with
If the XDSD does not correspond to a 4D memory vector, then the XDSD corresponds to a circular buffer (e.g., in accordance with
In various embodiments, D-Seq 844 performs Type=Fabric? 2411 and/or Type=XDSD? 2421 based upon a DSD read in action 2304 (of
As another example, D-Seq 844 performs Type=4D Vector? 2423 based upon the XDSD of action 2422. In some embodiments, the type field of the XDSD (e.g., Type 2211 of
As another example, D-Seq 844 generates memory access(es) in accordance with action 2427 by computing the memory address(es) based upon the DSD (e.g., of action 2304), using e.g., Base Address 2142, WLI 2152, Length 2141, and Stride 2153 of the DSD, as described elsewhere herein. Similarly, D-Seq 844 generates memory access(es) in accordance with action 2428 by computing the memory address(es) based upon the DSD (e.g., of action 2404) and XDSD of action 2422 using e.g., Base Address 2162, Length 2161, WLI 2172, Stride 2245, Stride Select 12244.1, and DF 2243 of the DSD and the XDSD, as described elsewhere herein. Similarly, D-Seq 844 generates memory access(es) in accordance with action 2429 by computing the memory address(es) based upon the DSD (e.g., of action 2404) and XDSD of action 2422 using e.g., Base Address 2182, Length 2181, WLI 2192, Start Address 2212, and End Address 2213 of the DSD and the XDSD, as described elsewhere herein.
In some embodiments, D-Seq 844 sends each computed address to one of D-Store 848 and Memory 854. In response to receiving a computed address, the D-Store and/or the Memory accesses two bytes of data at the computed address.
Instruction Formats
Each element identifier in the description of
Multiple Operand Instruction 2510 comprises various fields: Instruction Type 2511, Opcode 2512, Operand 0 Encoding 2513, Operand 1 Encoding 2514, and Terminate 2515. Operand 0 Encoding 2513 comprises Operand 0 Type 2513.1 and Operand 0 2513.2. Operand 1 Encoding 2514 comprises Operand 1 Type 2514.1 and Operand 1 2514.2. In some embodiments, Multiple Operand Instruction 2510 comprises 20 bits.
In some embodiments, the value of Instruction Type 2511 distinguishes between different types of instructions (e.g., two/three source, one destination and one source, and one destination instruction types) according to the table following. In various embodiments, the value of Opcode 2512 specifies a particular operation (e.g., multiply, add, or subtract). The length of Opcode 2512 varies between different types of instructions as described in the table following.
In some embodiments, Operand 0 Encoding 2513 describes a source and/or destination operand, according to the table following. In some embodiments, Operand 1 Encoding 2714 describes a source operand.
In some embodiments, Operand 0 2513.2 and Operand 1 2514.2 comprise respective 4-bit fields. In some embodiments, Operand 0 Type 2513.1 and Operand 1 Type 2514.1 comprise respective 2-bit fields and respectively determine how to interpret Operand 0 2513.2 and Operand 1 2514.2. For a two/three source operand, one destination operand instruction, Operand 0 Type 2513.1 is interpreted according to the table following.
For example, if the value of Operand 0 Type 2513.1 is “1” and the value of Operand 0 2513.2 is “4”, then Operand 0 Encoding 2513 specifies that the source0 operand is a vector described by S0DSR[4] and the destination operand is a vector described by DDSR[4].
For a two source operand, no destination operand instruction, Operand 0 Type 2513.1 is interpreted according to the table following.
For example, if the value of Operand 0 Type 2513.1 is “0” and the value of Operand 0 2513.2 is “4”, then Operand 0 Encoding 2513 specifies that the source0 operand is a vector described by S0DSR[4].
For a one source operand, one destination operand instruction, Operand 0 Type 2513.1 is interpreted according to the table following.
For example, if the value of Operand 0 Type 2513.1 is “0” and the value of Operand 0 2513.2 is “4”, then Operand 0 Encoding 2513 specifies that the destination operand is a vector described by DDSR[4].
For Multiple Operand Instruction 2510, Operand 1 Type 2514.1 is interpreted according to the table following.
For example, if the value of Operand 0 Type 2513.1 is “0” and the value of Operand 0 2513.2 is “4”, then Operand 0 Encoding 2513 specifies that the destination operand is a vector described by DDSR[4].
In various embodiments, a source1 operand that is an immediate specifies one of: several predetermined values (e.g., 0, 1, and −1) and a pseudo-random number generated by an LFSR. For example, if the value of Operand 1 Type 2514.1 is “3” and the value of Operand 1 2514.2 is “8”, then Operand 1 Encoding 2514 specifies a PRN generated by an LFSR.
In various embodiments, a source1 operand that is a floating-point immediate specifies one of: several predetermined values (e.g., 0, 1, −1, +infinity, −infinity, min normal, max normal, −min normal, −min normal) and a pseudo-random number generated by an LFSR. For example, if the value of Operand 1 Type 2514.1 is “3” and the value of Operand 1 2514.2 is “8”, then Operand 1 Encoding 2514 specifies a PRN generated by an LFSR.
In some embodiments, Terminate 2515 comprises a 1-bit field specifying that the instruction is the last instruction in a task. When the instruction finishes execution, the task is terminated, enabling selection and execution of a new task (e.g., via Terminate 812 and Picker 830).
In some embodiments, Instruction Type 2521 comprises four bits, “1111”, specifying that the instruction is a one source, no destination operand instruction, and Opcode 2522 comprises a 4-bit field specifying a particular operation (e.g., block, unblock, activate, set active PRNG, data filter, conditional branch, and jump).
In some embodiments, Immediate High 2524 comprises a 4-bit field. In some scenarios, Immediate High 2524 concatenated with Operand 1 2523.2 forms an 8-bit immediate.
In some embodiments, Operand 1 Type 2523.1 comprises a 2-bit field that determines how Operand 1 2523.2 is interpreted. If Operand 1 Type 2523.1 is “0”, then Operand 1 Encoding 2523 specifies a vector (e.g., a fabric vector of data elements from Input Qs 897, or a memory vector of data elements in one of Memory 854 and D-Store 854) and the value of Operand 1 2523.2 identifies which one of the 12 S1DSRs of DSRs 846 describe the vector. If Operand 1 Type 2523.1 is “1”, then Operand 1 Encoding 2523 describes a value in memory (e.g., one of Memory 854 and D-Store 848) at an 8-bit address formed by a concatenation of Immediate High 2524 with Operand 1 2523.2. If Operand 1 Type 2523.1 is “2”, then Operand 1 Encoding 2523 describes a value in a register (e.g., one of RF 842) identified by the value of Operand 1 2523.2. If Operand 1 Type 2523.1 is “3”, then Operand 1 Encoding 2523 describes an immediate. If Opcode 2522 specifies an operation (e.g., block, unblock, or activate) that operates on 16-bit integer operands, then the immediate comprises eight bits and is a concatenation of Immediate High 2524 and Operand 1 2523.2.
In some embodiments, Terminate 2525 comprises a 1-bit field specifying that the instruction is the last instruction in a task. When the instruction finishes execution, the task is terminated, enabling selection and execution of a new task (e.g., via Terminate 812 and Picker 830. If One Source, No Destination Instruction 2520 is a conditional branch, then the task is only terminated if the conditional branch is not taken.
In some embodiments, Instruction Type 2531 comprises a 1-bit field, “0”, specifying that the instruction is an immediate instruction, and Opcode 2532 comprises a 5-bit field specifying a particular operation (e.g., load source0 DSR, load source1 DSR, load destination DSR, store source0 DSR, store source1 DSR, and store destination DSR). In some scenarios, execution of an Immediate Instruction 2530 (e.g., a load DSR instruction, and a load XDSR instruction) loads data from one of Memory 854 and D-Store 848 to a DSR of DSRs 846. In other scenarios, execution of an Immediate Instruction 2530 (e.g., a store DSR instruction, and a store XDSR instruction) stores data from a DSR of DSRs 846 to one of Memory 854 and D-Store 848.
In some embodiments, Operand 0 2533.2 comprises a 4-bit field and Opcode 2532 determines how Operand 0 2533.2 is interpreted. In some scenarios (e.g., if Operand 0 2533.2 specifies an operation without a register operand such as a jump operation), Immediate Low 2534.1, Operand 0 2533.2, and Immediate High 2534.2 are concatenated to form a 14-bit immediate. In some other scenarios, Immediate 2534 is sign extended to form a 16-bit immediate. In yet other scenarios, Immediate 2534 is sign extended to form a 15-bit address. In yet other scenarios, Immediate 2534 is shifted one bit to the left and sign extended to form a 15-bit address (e.g., for 32-bit data). MICROTHREADING
Flow 2600 is descriptive of processing that occurs in the context of Data Structure Descriptor Flow 2300 of
When a stall condition exists, the CE determines if microthreading is enabled (Microthreading Enabled? 2606) for the instruction fetched in Fetch/Decode Instruction with DSR(s) 2303 of
The CE periodically, e.g., every core clock cycle, monitors the stall condition(s) (e.g., detected at action 2603) to detect if the stall condition(s) have abated and the operands are ready (Stall Resolved? 2609). When the stall has not resolved, the CE continues executing the next instructions (action 2608). When the stall has been resolved, the CE resumes executing the microthreaded instruction by reading source data elements (Read (Next) Source Data Element(s) from Queue/Memory 2610), thereby concluding flow. If microthreading is not enabled, then the CE stalls processing until the stall condition(s) have abated and the operands are ready (Stall Resolved? 2605). When the stall has been resolved, the CE resumes executing the instruction by reading source data elements (Read (Next) Source Data Element(s) from Queue/Memory 2610), thereby concluding flow.
In various embodiments and/or usage scenarios, actions of flow 2600 are conceptually related to a CE, e.g., CE 800 of
In some embodiments and/or usage scenarios, action 2607 saves information about the microthreaded instruction (e.g., from Dec 840) to UT State 845. In various embodiments, the information comprises one or more of: stall condition(s) to monitor in action 2609 (e.g., waiting for one or more of: a FIFO with insufficient space, a FIFO with insufficient data element(s), a fabric input, and a fabric output), portions of the DSD(s) (e.g., information identifying a queue from one or more of D-Seq 844 and DSRs 846), and/or all or any portions of the instruction itself. In various embodiments, the CE writes associated state to the respective DSD(s) that were read in action 2304. For example, a microthreaded instruction that specifies reading 32 data elements from fabric input and writing the 32 data elements to a 1D memory vector is stalled after reading and writing four data elements. Length 2101 of the source DSD and Length 2141 of the destination DSD are written indicating that the length is now 28 data elements. The CE also writes the next address to Base Address 2142 of the destination DSD (e.g., increment the address by the length of four data elements times Stride 2153). In some other embodiments, the CE writes the all or any portions of the instruction information to a shadow version(s) of the respective DSD(s) read in action 2304.
In some embodiments and/or usage scenarios, action 2610 is performed in accordance with the information stored about the microthreaded instruction in UT State 845 and the respective DSD(s) that were updated in action 2607. For example, when action 2609 flows to action 2610, a partial restore is optionally and/or selectively performed by reading information from UT State 845. In various other embodiments, action 2610 is performed in accordance with the information stored about the microthreaded instruction in UT State 845 and the respective shadow version(s) of the DSD(s) that were updated in action 2607. For example, when action 2609 flows to action 2610, a partial restore is optionally and/or selectively performed by reading information from any combination of UT State 845 and the respective shadow version(s) of the DSD(s) that were updated in action 2607.
Deep Learning Accelerator Example Uses
In various embodiments and/or usage scenarios, as described elsewhere herein, a deep learning accelerator, such as a fabric of PEs (e.g., as implemented via wafer-scale integration and as illustrated, for example, in
Past deep neural network training approaches (e.g., SGD and MBGD) have used so-called anchored-delta learning. That is, the delta derived weight updates have been ‘anchored’ or held fixed until processing of all activations for a training set batch or a mini-batch are completed. In some circumstances, the layer-sequential nature of anchored-delta learning resulted in high-latency sequential parameter updates (including for example, weight updates), which in turn led to slow convergence. In some circumstances, anchored-delta learning has limited layer-parallelism and thus limited concurrency.
In contrast, in some circumstances, use of a continuous propagation (aka immediate-delta) learning rule for deep neural network training, as taught herein, provides faster convergence, decreases the latency of parameter updates, and increases concurrency by enabling layer-parallelism. Deltas computed from the immediate network parameters use updated information corresponding to the current parameter slope. Continuous propagation enables layer parallelism by enabling each layer to learn concurrently with others without explicit synchronization. As a result, parallelization along the depth of a network enables more computing resources to be applied to training. Parallelism available in continuous propagation realizes up to a 10× wall clock time improvement, as compared to MBGD techniques, in some usage scenarios. The continuous propagation approach also enables avoiding using extra memory to store the model parameter values for multiple vectors of activations.
In some embodiments and/or usage scenarios, a neural network is trained using continuous propagation of stimuli to perform SGD. In some embodiments of training via CPGD, RCP enables reducing the number of activations held in memory (thus reducing the memory footprint) by recomputing selected activations. In some scenarios, recomputing activations also improves the accuracy of the training estimates for the weights. In training without RCP, every layer of neurons receives activations during one or more forward passes, and saves the activations to re-use for computations performed during the one or more backward passes associated with the forward passes (e.g., the one or more delta, chain, and weight update passes associated with the forward passes). In some scenarios (e.g., relatively deep neural networks), the time between saving the activations and the associated backward pass is relatively long and saving all activations uses relatively more memory than saving fewer than all the activations.
For example, only some of the layers of neurons (e.g., every even layer) save the respective activations and the other layers discard the respective activations (e.g., every odd layer). The layers with saved activations (e.g., every even layer) use the most recent weights to recompute and transmit the recomputed activations to the layers that discarded activations (e.g., every odd layer). In some scenarios, the recomputed activations differ from the discarded activations because the most recent weights are different from the weights that were available during the forward pass (e.g., one or more weight updates occurred between the forward pass and the associated backward pass). In various embodiments, the number and type of layers that save and discard activations is selected to optimize for the desired balance of reduced memory usage and increased computation. As one example, every fourth layer saves activations and all other layers discard activations. As another example, convolutional layers are selected to save activations and other layers are selected to discard activations.
In various embodiments and/or usage scenarios, any one or more of SGD, MBGD, and CPGD, with or without RCP, are implemented via one or more of: a fabric of processing elements (e.g., as illustrated in
SGD, e.g., with back-propagation, is usable (as described elsewhere herein) for training a neural network. However, learning via gradient descent is inherently sequential, because each weight update uses information from a gradient measurement made after completion of a full forward pass through the neural network. Further, weight updates are made during a corresponding backward pass through the neural network (following and corresponding to the forward pass), and thus the last weight update occurs after completion of the entire corresponding backward pass.
MBGD enables more parallelism than SGD by gradient averaging over a mini-batch, processing several (a ‘mini-batch’ of) activations in parallel. However, speed of sequential updates, compared to SGD, is unchanged, and weight updates, as in SGD, are completed after completion of all corresponding backward passes through the neural network. As mini-batch size increases by processing more activations in parallel, gradient noise is reduced. Beyond a point the reduction in gradient noise, in some scenarios, results in poor generalization.
CPGD enables parallel processing and updating of weights in all layers of a neural network, while activations propagate through the layers in a stream. Thus CPGD overcomes, in some embodiments and/or usage scenarios, sequential processing limitations of SGD and MBGD.
RCP enables reduced memory usage via (re)computing activations that would otherwise be stored, and is usable in combination with SGD, MBGD, and CPGD.
Pipeline flow diagrams are usable to compare and contrast various SGD, MBGD, CPGD, and CPGD with RCP techniques. Information flows and concurrency in training techniques are visible with the pipeline flow diagrams.
Unlike gradient-descent techniques (e.g., SGD and MBGD) that use a full forward pass and a full backward pass through a network to compute a gradient estimate, and thus result in a sequential dependency, CPGD uses a differential construction to replace the sequential dependency with a continuous model that has sustained gradient generation. In some embodiments and/or usage scenarios, CPGD enables layer parallelism by enabling each layer of a neural network to be trained (e.g., to ‘learn’) concurrently with others of the layers without explicit synchronization. Thus, parallelization along the depth of a neural network enables applying more computing resources to training. In various embodiments and/or usage scenarios, CPGD provides comparable accuracy and improved convergence rate expressed in epochs of training compared to other techniques.
As a specific example, Forward Pass 2765 begins, and later Forward Pass 2766 begins. At least a portion of Forward Pass 2765 operates in parallel with at least a portion of Forward Pass 2766. At least a portion of a corresponding backward pass for Forward Pass 2765 operates in parallel with at least a portion of Forward Pass 2766. Further, the corresponding backward pass completes at least some weight updates that are used by Forward Pass 2766, as shown by example Weight Update Use 2767.
As a specific example, CPGD with RCP processing is characterized by Forward Pass 2771 and a corresponding Backward Pass 2781. A first activation is computed during the Forward Pass and stored in a layer for use in the corresponding Backward Pass, as illustrated by Activation Storage 2785. Activation Storage 2785 is occupied during portions of Forward Pass and Backward Pass and unavailable for other uses. A specific example of memory reduction is illustrated by Recomputed Activation Storage 2786. A second activation is computed during the Forward Pass, but is discarded and does not require any storage. During the Backward Pass the second activation is recomputed and stored in a layer for use in the Backward Pass as illustrated by Recomputed Activation Storage 2786. Recomputed Activation Storage 2786 is unoccupied throughout the entire Forward Pass and available for other uses (e.g., other forward passes, other backward passes), thereby reducing the memory required.
Considering parallelization more generally, in some embodiments and/or usage scenarios, parallelizing a computation (e.g., neural network training) spreads the computation over separate computation units operating simultaneously. In a model-parallel regime, separate units simultaneously evaluate a same neural network using distinct model parameters. In a data-parallel regime, separate workers simultaneously evaluate distinct network inputs using the same formal model parameters. Some scaling techniques use fine-grained data parallelism across layers and among units in a cluster.
MBGD, in some embodiments and/or usage scenarios, improves accuracy of a gradient estimate as a function of a mini-batch size, n. However, computation to perform MBGD for mini-batch size n is approximately equal to computation to perform SGD for n steps. In some situations, SGD for n steps is more efficient than MBGD for a mini-batch size n by approximately the square root of n. Thus, higher parallelism (e.g., as in MBGD) and higher efficiency (e.g., as in SGD) are sometimes mutually exclusive.
In some embodiments and/or usage scenarios, a deep neural network is a high-dimensional parameterized function, sometimes expressed as a directed acyclic graph. Back propagation techniques are sometimes expressed by a cyclic graph. The cycle in the graph is a feedback iteration. Gradients produced by a first full network evaluation change weights used in a next iteration, because the iteration is a discrete approximation of a continuous differential system. The discrete approximation comprises an unbiased continuous-noise process with time-varying statistics. The noise process provides regularization to enable the continuous system to model phenomena observed in discrete-time learning systems. In the discrete case, regularization is provided by a sampling procedure (e.g., SGD), by learning rate, and/or by other explicit mechanisms. A time-dependent noise process enables using a learning-rate schedule that erases local high-frequency contours in parameter space. As a correct region is approached, regularization is reduced, leading, in some circumstances, to a better final solution.
CPGD, in a conceptual framework of an arbitrary feed-forward neural network, expresses all nodes as functions of time and applies functional composition to formulate representations in terms of internal state and stimuli the internal state is subjected to. A factorization results with individual layers as systems with independent local dynamics. Two dimensions are depth of the network and time evolution of parameters. In some embodiments and/or usage scenarios implementing acceleration by mapping network layers to computational units separated in space, there is latency communicating between the network layers. Thus there is a time delay communicating between the layers. Some implementations of CPGD are synchronous implementations that account for the time delays.
During CPGD processing, an activation vector and associated hidden representations are combined with model parameters at different time steps during the forward pass of the activation vector. The difference between model parameters at different time steps versus a same time step is not detectable by the activation vector going forward. Conceptually it is as if a fixed set of parameters from successive time steps were used to form an aggregate parameter state that is then used for learning.
There is a choice during the backward pass (e.g., delta propagation) to use either immediate parameters (e.g., weights) after updating or to retrieve historical parameters anchored to when the corresponding forward pass was performed. Deltas computed from the immediate parameters use updated information corresponding to a current parameter slope. Some embodiments and/or usage scenarios use immediate parameters. Some embodiments and/or usage scenarios use historical parameters.
Some implementations of CPGD use memory on an order similar to SGD. Reverse checkpoint (as described elsewhere herein) is usable with CPGD, such as to reduce memory usage. Some embodiments and/or usage scenarios of reverse checkpoint use immediate parameters (e.g., weights) to recompute activations. Some embodiments and/or usage scenarios of reverse checkpoint use historical parameters to recompute activations. In some embodiments and/or usage scenarios using immediate parameters to recompute activations, a time disparity between parameters used for computing forward propagating activations and backward-propagating deltas is reduced in the aligning wavefronts.
Continuous propagation techniques are usable in conjunction with mini-batch style processing (e.g., MBGD). In some embodiments and/or usage scenarios, a subsequent batch is started before an immediately preceding batch is completed, conceptually similar to asynchronous SGD. Parameter inconsistency within the pipeline is limited to no more than one batch boundary.
In some embodiments and/or usage scenarios, enabling data to stream through a neural network and to perform computations without a global synchronization boundary, enables extracting learning information not otherwise extracted. In some embodiments and/or usage scenarios, a lower learning rate dominates using larger batch sizes. In some embodiments and/or usage scenarios, hidden activity and/or delta arcs are conceptually interpreted as individual vectors or alternatively batch matrices. The batch matrices interpretation enables implementing techniques as described herein directly on GPUs, CPUs, DSPs, FPGAs, and/or ASICs.
Like-numbered elements in
Regarding
In forward pass operation for SGD or MBGD, activation A1,t 2881 is received by Previous Layer 2801 and stored in A 2816 (for later use during the backward pass). A1,t 2881 and a weight W1,t, previously stored in W 2817, are then processed in accordance with F 2811 to produce activation A2,t 2882. A2,t 2882 is then passed to Subsequent Layer 2802. Similarly to the Previous Layer, A2,t 2882 is received by Subsequent Layer 2802 and stored in A 2826 (for later use during the backward pass). A2,t 2882 and a weight W2,t previously stored in W 2827 are then processed in accordance with F 2821 to produce activation A3,t 2883. A3,t 2883 is then provided to a next subsequent layer (if present) for processing, and so forth, until the forward pass is complete and the backward pass commences. If Subsequent Layer 2802 is the output layer, then the forward pass is completed and the backward pass corresponding to the forward pass is initiated.
Regarding
In backward pass operation for SGD or MBGD, delta Δ3,t 2893 is received from the next subsequent layer (if present) during backward pass processing. If Subsequent Layer 2802 is the output layer, then Subsequent Layer 2802 computes delta Δ3,t according to the delta rule, e.g., as a function of the difference between the output of the Subsequent Layer (e.g., the estimated output) and the training output (e.g., desired output). Δ3,t 2893, the weight W2,t previously stored in W 2827, and the activation A2,t previously stored in A 2826, are then processed in accordance with B 2822 (e.g., in accordance with the delta rule) to produce delta Δ2,t 2892 and a new weight W2,t+1 that is then stored in W 2828 for use in a next forward pass. Δ2,t 2892 is then passed to Previous Layer 2801. Similarly to the Subsequent Layer, delta Δ2,t 2892, the weight W1,t previously stored in W 2817, and the activation Δ1,t previously stored in A 2816, are then processed in accordance with B 2812 to produce delta Δ1,t 2891 and a new weight W1,t+t that is then stored in W 2818 for use in the next forward pass. Δ1,t 2891 is then passed to a next previous layer (if present) for processing, and so forth, until the backward pass is complete and a next forward pass commences. If Previous Layer 2801 is the input layer, then the backward pass is complete, and the next forward pass commences.
In SGD and MBGD (and unlike CPGD), the next forward pass is delayed until the previous backward pass completes, e.g., W 2817 and W 2827 are respectively updated with W 2818 and W 2828 after W 2817 and W 2827 have been used for a same forward pass and a same corresponding backward pass. Therefore, the next forward pass is performed using weights that are from the same backward pass.
More specifically, in Previous Layer 2801, A1,t 2881 is received and stored in A 2816, identically to SGD and MBGD. A1,t 2881 and a weight W1,t-k-j previously stored in W 2817 are then processed in accordance with F 2811 to produce activation A2,t 2882. The weight W1,t-k-j was produced and stored by a backward pass corresponding to a forward pass preceding the instant forward pass by k-j forward passes. A2,t 2882 is then passed to Subsequent Layer 2802, and similarly to the Previous Layer, A2,t 2882 is received and stored in A 2826, identically to SGD and MBGD. A2,t 2882 and a weight W2,t-k previously stored in W 2827 are then processed in accordance with F 2821 to produce activation A3,t 2883. The weight W2,t-k was produced and stored by a backward pass corresponding to a forward pass preceding the instant forward pass by k forward passes. Note that the Previous Layer and the Subsequent Layer, for processing of a same forward pass, use weights from different backward passes. As in SGD and MBGD, A3,t 2883 is then provided to a next subsequent layer (if present) for processing, and so forth, until the forward pass is complete and the backward pass commences. If Subsequent Layer 2802 is the output layer, then the forward pass is completed and the backward pass corresponding to the forward pass is initiated. In some embodiments and/or usage scenarios, the value of j is 0 and (k-j) and (k) are equal. In various embodiments and/or usage scenarios, the Previous Layer and the Subsequent Layer simultaneously process one of: different forward passes, different backward passes, and a forward pass and a different backward pass.
In forward pass operation, with respect to Previous Layer 2803, activation A1,t 2881 is received and processed in accordance with forward pass processing in Compute 2830, and stored in Storage 2835 as described with respect to
In the first portion of the backward pass operation, activations not stored in the corresponding forward pass are recomputed. In SGD and MBGD scenarios, the recomputed activation is formulated in Previous Layer 2803 by processing the activation stored from the forward pass in A 2816 and weight stored in W 2817 in accordance with F 2811 to produce activation A′2,t 2884, that is then stored in A 2829 of Subsequent Layer 2804. Since SGD and MBGD delay weight updates and commencement of a next forward pass until the forward pass and corresponding backward pass are complete, A′2,t 2884 is identical to the value discarded during the forward pass, A2,t 2882.
In a CPGD scenario, the recomputed activation is formulated according to the same topology as the SGD and MBGD scenarios. However, CPGD performs updates without delays and enables commencement of a next forward pass without regard to completion of previous backward passes. Thus, a weight value stored at the time of the backward pass, e.g., in W 2817, according to embodiment and/or usage scenarios, selectively differs from the weight value stored during the corresponding forward pass. As a specific example, in accordance with
In the second portion of backward pass operation, computation proceeds using the recomputed activation. In SGD and MBGD scenarios, since the recomputed activation is identical to the discarded activation (e.g., conceptually the value stored in A 2829 is identical to the value stored in A 2826), the backward processing produces results that are identical to the results described with respect to
In some embodiments and/or usage scenarios, W 2817 is distinct from W 2818 (as illustrated), and in some embodiments and/or usage scenarios, W 2818 and W 2817 are a same portion of storage (not illustrated), such that saving a new value in W 2818 overwrites a previously saved value in W 2817. Similarly, W 2827 is variously distinct from or the same as W 2828. In various embodiments and/or usage scenarios, A 2829 is variously implemented to use fewer memory locations and/or use a same number of memory locations for a shorter time than A 2826.
In various embodiments and/or usages scenarios, activations and/or weights are implemented and/or represented by any one or more scalar, vector, matrix, and higher-dimensional data structures. E.g., any one or more of A 2816, A 2826, A 2829, W 2817, W 2827, W 2818, and W 2828 are enabled to store any one or more of one or more scalars, one or more vectors, one or more matrices, and one or more higher-dimensional arrays.
In various embodiments and/or usage scenarios, one or more elements of Previous Layer 2801 and Subsequent Layer 2802 are implemented by respective PEs, e.g., a portion of PE 499 or similar elements of
In various embodiments and/or usage scenarios, all or any portions of elements of F 2811, F 2821, B 2812, and B 2822 conceptually correspond to all or any portions of executions of instructions of Task SW on PEs 260 of
Floating-Point Operating Context and Stochastic Rounding Operation
In some scenarios, an FP computation results in a value that has more precision than is expressible by the number format. For example, without rounding, an FP multiply result is twice the precision of the inputs. Rounding is used to remove the additional precision, so, e.g., the result is the same precision as the number format. The IEEE 754 standard describes five different (deterministic) rounding modes. Two modes round to the nearest value, but with different rules for breaking a tie. The default mode for some computing is round to nearest, with ties rounding to the nearest value with a ‘0’ in the ULP. A second mode is round to nearest with ties rounded away from zero. Three modes round according to a specific rule. Round to zero is equivalent to truncation and simply removes all bits after the ULP. Round to infinity is equivalent to rounding up and rounding to negative infinity is equivalent to rounding down. IEEE 754 FP arithmetic is sometimes performed in accordance with one of the five rounding modes.
In some neural network embodiments and/or usage scenarios, a training process iterates through many FP computations that form long dependency chains. For example, a single iteration includes many vector and/or matrix FP operations that each have long dependency chains. For another example, many iterations are performed, each dependent on a preceding one of the iterations, resulting in long dependency chains. In some situations, because of the long dependency chains, tiny biases in rounding compound across many computations to systematically bias results, thus reducing accuracy, increasing training time, increasing inference latency, and/or reducing energy efficiency. In some scenarios and/or embodiments, use of stochastic rounding of FP results reduces the systematic bias, thereby improving accuracy, decreasing training time, decreasing inference latency, and/or increasing energy efficiency. In some scenarios and/or embodiments, rounding is performed on results of dependent FP operations (e.g. FP multiply-accumulate operations), and the rounded results are then fed back into a subsequent dependent FP operation, resulting in long dependency chains of rounded operations/results.
In some circumstances, performing stochastic rounding enables retaining some precision that would otherwise be lost if performing non-stochastic (e.g. deterministic) rounding. For example, consider a scenario with a neural network comprising a layer with thousands or millions of parameters, each parameter represented by a floating-point number with an N-bit mantissa. If the average magnitude of the parameter updates is small (e.g., 10% of updates are represented by an N+1-bit mantissa, and the remainder are even smaller), then without stochastic rounding the parameter updates would be rounded to zero and no learning would occur. With stochastic rounding, approximately 10% of the weights would be updated and learning would occur, essentially recovering some numerical precision lost by the N-bit mantissa, and thereby improving the latency of training the neural network and/or improving the accuracy of the trained neural network.
In some circumstances, neural network computations are conceptually statistical, and performing stochastic rounding instead of non-stochastic rounding enables effectively higher precision than would otherwise be possible in view of a particular FP precision. The improved precision of stochastic rounding enables smaller and more power-efficient compute logic (e.g., FPUs) and smaller and more power-efficient storage (e.g., latches, registers, and memories), thus enabling higher performance, lower latency, more accurate, and/or more power-efficient systems for training neural networks and performing inference with trained neural networks.
In various embodiments and/or usage scenarios, stochastic rounding is implemented at least in part via one or more PRNGs. An example of a PRNG is an RNG that deterministically generates a pseudo-random sequence of numbers, determined by an initial seed value. An LFSR is an example of a PRNG. Various PRNGs are implemented with LFSRs of varying length with respect to the number of bits of generated random numbers. For a first example, a 3-bit PRNG is implemented with a 3-bit LFSR. For a second example, a 32-bit LFSR is used to implement a 3-bit PRNG, such as by using the three LSBs of the LFSR as a 3-bit PRNG. Throughout the description herein, the term random number generator (RNG) will be understood to mean a pseudo-random number generator (PRNG), unless otherwise explicitly specified.
Various embodiments comprise a plurality of instances of Processor 2900 and/or variations thereof. In various embodiments, a two-dimensional (or more-dimensional) array comprises a plurality of the instances of Processor 2900. In various embodiments, the array dimensionality is implemented as any one or more of a physical arrangement, a logical arrangement, a virtual arrangement, and a communication arrangement. In various usage scenarios, all or any portions of the instances perform all or any portions of operations that are long dependency chains. In various usage scenarios, the instances communicate with each other in accordance with the long dependency chains, such as to communicate results of computation, partial computations, intermediate calculations, feedback values, and so forth. In various usage scenarios, the long dependency chains comprise long dependency chains of FP computations. In various usage scenarios, the long dependency chains are performed wholly or in part to train one or more neural networks and/or to perform inferences with respect to one or more trained neural networks. In various usage scenarios, rounding bias is reduced in at least some of the long dependency chains (or one or more portions thereof) by using stochastic rounding such as enabled by random number information provided by the respective instance of RNGs 2921 included in each instance of Processor 2900. In some embodiments, Processor 2900 is a portion of a neural network accelerator.
FPU 2901 comprises FP control and execution logic such as Instruction Decode Logic 2920, RNGs 2921, FP Control Register 2925, Multiplier 2911, Accumulator 2912, Normalizer 2913, and Exponent DP 2915, as well as rounding logic such as N-bit Adder 2922 and Incrementer 2914. Processor 2900 comprises Instruction Decode Logic 2920 that is enabled to receive Instruction 2950 and decode Instruction 2950 into operations executed by FPU 2901.
In various embodiments, RNGs 2921 are initialized with seed values by configuration instructions, are readable by configuration instructions, and/or are writable by configuration instructions. In some usage scenarios, RNGs 2921 are managed to enable time-sharing of a computational system implemented in part by Processor 2900. For example, RNGs 2921 are initialized as part of initializing a first neural network computation, and after a portion of the first computation is completed, RNGs 2921 are read and saved in a first portion of non-volatile memory (not illustrated). Then, RNGs 2921 are initialized as part of initializing a second neural network computation, and after a portion of the second computation is completed, RNGs 2921 are read and saved in a second portion of the memory. Then, RNGs 2921 are written using the saved values from the first portion of the memory, and the first computation is resumed. In some embodiments, PRNGs enable deterministic random number generation which is advantageous in some usage scenarios, e.g., enabling reproducible computations. In various embodiments, RNGs 2921 comprise an entropy source that is not pseudo-random (e.g., truly random or quasi-random). In some embodiments, RNGs 2921 comprises one random number generator (e.g., a single PRNG, a single PRNG comprising a LFSR).
Instruction Decode Logic 2920 is coupled to FPU 2901 and communicates an operation to be performed by FPU 2901, such as an FP multiply-accumulate operation with optional stochastic rounding, an FP multiply operation with optional stochastic rounding, an integer-to-FP data conversion with optional stochastic rounding, and so forth. The operation to be performed is specified by OpCode Bits 3023 of Instruction 2950 (See
Referring to
Instruction Decode Logic 2920 is enabled to select a random number resource of RNGs 2921. Instruction Decode Logic 2920 decodes Rounding Mode Bits 3021 to determine a rounding mode associated with processing of the operation (the operation being specified by OpCode Bits 3023). If Rounding Mode Bits 3021 specify stochastic rounding, then Instruction Decode Logic 2920 decodes RNG Bits 3022 to generate RNG Selector 2961. RNGs 2921, in response to RNG Selector 2961, provide N-bit Random Number 2962. In various embodiments, RNGs 2921, further in response to RNG Selector 2961, advance the selected random number resource to produce a next random number. For example, RNGs 2921 implements four random number resources specified, selected, and identified respectively as 0, 1, 2, and 3. Each random number resource comprises a separate LFSR. In response to RNG Bits 3022 having a value of ‘1’, Instruction Decode Logic 2920 provides a value of ‘1’ on RNG Selector 2961. In response to RNG Selector 2961 being ‘1’, RNGs 2921 provides the value of LFSR ‘1’ as N-bit Random Number 2962, and subsequently advances the state of LSFR ‘1’ to a next state. In various embodiments, one or more random number resources of RNGs 2921 are usable as source operands of instructions, such as any more of Src A 2951, Src B 2952, and Src C 2954, thereby providing random numbers as input data for the instructions.
In some embodiments, N-bit Adder 2922 is an integer adder that is enabled to receive and sum two inputs: N Most Significant Lower Bits 2957.1 and N-bit Random Number 2962. N-bit Adder 2922 provides a carry out of the sum as Carry Bit 2963. Incrementer 2914 receives Mantissa Bits Subject to Rounding 2958 and Carry Bit 2963. Incrementer 2914 provides an output that is a conditional increment of Mantissa Bits Subject to Rounding 2958 as Stochastically Rounded Mantissa 2964. If Carry Bit 2963 is asserted, then Incrementer 2914 provides an increment (starting at ULP 3002.1) of Mantissa Bits Subject to Rounding 2958 as Stochastically Rounded Mantissa 2964. If Carry Bit 2963 is de-asserted, then Incrementer 2914 provides Mantissa Bits Subject to Rounding 2958 without change as Stochastically Rounded Mantissa 2964. In various embodiments, the bit width of Incrementer 2914 varies to accommodate the bit width of Mantissa Bits Subject to Rounding 2958. For example, if the bit width of Mantissa Bits Subject to Rounding 2958 is 11 bits (half-precision), then Incrementer 2914 is also 11 bits. In various embodiments, N is 3, the N Most Significant Lower Bits 2957.1 comprises 3 bits, the N-bit Random Number 2962 comprises 3 random bits, and the N-bit Adder 2922 comprises a 3-bit adder. In various other embodiments, N is variously 4, 5, 7, or any integer number.
Exponent DP 2915 is an FP exponent data path that adjusts, in accordance with normalization information received from Normalizer 2913, an exponent received from Accumulator 2912. In some embodiments and/or usage scenarios, Exponent DP 2915 receives rounding information (such as stochastic rounding information) from Incrementer 2914 and further adjusts the exponent accordingly, producing Stochastically Rounded Exponent 2965. Stochastically Rounded Exponent 2965 and Stochastically Rounded Mantissa 2964 taken together form a complete FP result, suitable, for example, for storage for later use, or for feedback to any of Src A 2951, Src B 2952, and Src C 2954 as an input operand for subsequent operations.
In various embodiments, Processor 2900 comprises FP Control Register 2925. In some embodiments, FPU 2901 comprises FP Control Register 2925. In some embodiments, FP Control Register 2925 specifies that all or any portions of operations (such as all FP multiplies and all FP multiply-accumulates) are performed using a specified rounding mode (e.g., a stochastic rounding mode of a plurality of rounding modes). In various embodiments, rounding mode information from Instruction 2950 overrides the specified rounding mode from FP Control Register 2925 (such as on an instruction-by-instruction basis). In some embodiments, FP Control Register 2925 provides random number resource selection information specifying that all stochastically rounded operations are performed using a specified one or more random number resources of RNGs 2921. In various embodiments, random number resource selection information from Instruction 2950 overrides the random number resource selection information from FP Control Register 2925.
The partitioning in
As illustrated, FPU 2901 is enabled to perform FP multiply-accumulate operations with optional stochastic rounding. In some embodiments, additional hardware (not illustrated) enables FPU 2901 to perform additional FP operations with optional stochastic rounding, such as addition, subtraction, multiplication, division, reciprocal, comparison, absolute value, negation, maximum, minimum, elementary functions, square root, logarithm, exponentiation, sine, cosine, tangent, arctangent, conversion to a different format, and conversion from/to integer.
In various embodiments and/or usage scenarios, Processor 2900 has hardware logic to fetch a stream of instructions from an instruction storage element, providing the fetched instructions to Instruction Decode Logic 2920 as respective instances of Instruction 2950. In various embodiments, the instruction storage element implements non-transitory media, such as computer readable medium such as a computer readable storage medium (e.g., media in an optical and/or magnetic mass storage device such as a disk, or an integrated circuit having non-volatile storage such as flash storage).
Rounding Mode Bits 3021 optionally specifies one or more rounding modes to use when processing the operations, such as stochastic rounding, any IEEE 754 standard rounding, and any other rounding modes. RNG Bits 3022 optionally specifies one or more random number resources of RNGs 2921 to use when processing the operations, such as when performing stochastic rounding.
In some embodiments, FP Control Register 2925 comprises bit field FTZ 2925.3 that controls behavior of subnormal FP numbers. When FTZ 2925.3 is set to a first value (e.g., 1), FPU 2901 flushes subnormal results of an operation to zero. When FTZ 2925.3 is set to a second value (e.g., 0), FPU 2901 flushes subnormal results of an operation to the minimum normal value. In various embodiments, FP Control Register 2925 comprises bit fields Max Sat 2925.4 and/or Min Sat 2925.5. When Max Sat 2925.4 is set to a first value (e.g., 0), operations performed by FPU 2901 that overflow the FP representation return infinity, while otherwise retaining behavior of the rounding mode specified (e.g., by Rounding Mode Bits 3021). When Max Sat 2925.4 is set to a second value (e.g., 1), operations performed by FPU 2901 that overflow the FP representation return the maximum normal magnitude value, instead of returning infinity, while otherwise retaining behavior of the rounding mode specified (e.g., by Rounding Mode Bits 3021). When Min Sat 2925.5 is set to a first value (e.g., 0), operations performed by FPU 2901 that underflow the FP representation return zero, while otherwise retaining behavior of the rounding mode specified (e.g., by Rounding Mode Bits 3021). When Min Sat 2925.5 is set to a second value (e.g., 1), operations performed by FPU 2901 that underflow the FP representation return the minimum normal magnitude value (e.g., in flush-to-zero rounding mode) or the minimum subnormal value (e.g. in another rounding mode), instead of returning zero, while otherwise retaining behavior of the rounding mode specified (e.g., by Rounding Mode Bits 3021).
In various embodiments, the number of random number resources implemented by RNGs 2921 is respectively 1, 2, 4, and 7. In various usage scenarios, respective groups of instructions specify (via respective values in RNG Bits 3022 and/or Static RNG Bits 2925.2) to use respective ones of the random number resources of RNGs 2921. For example, the respective RNG Bits 3022 value in a first group of instructions is a same first value, specifying that all the instructions in the first group use a same first random number resource of RNGs 2921 for stochastic rounding. Continuing with the example, the respective RNG Bits 3022 value in a second group of instructions is a same second value, specifying that all the instructions in the second group use a same second random number resource of RNGs 2921 for stochastic rounding. For another example, preceding execution of a first group of instructions, Static RNG Bits 2925.2 is set by a first configuration instruction to specify a first random number resource of RNGs 2921 for stochastic rounding. Continuing with the example, the first group of instructions is executed, in accordance with the first random number resource. Then, preceding a second group of instructions, Static RNG Bits 2925.2 is set by a second configuration instruction to specify a second random number resource of RNGs 2921 for stochastic rounding. Continuing with the example, the second group of instructions is executed, in accordance with the second random number resource. In some embodiments, specification of which RNG to use for an instruction is predetermined and/or implicit. E.g., in embodiments with a single RNG, the single RNG is used without reference to RNG Bits 3022 or Static RNG Bits 2925.2.
There are no requirements on arrangement in storage or execution with respect to instructions of the groups. In various embodiments and usage scenarios, instructions in the first group are contiguous with respect to each other in program storage and/or execution order, are not contiguous with respect to each other in program storage and/or execution order, and are variously arranged with respect to each other and other instructions, such as intermixed with one or more instructions of any other groups of instructions, and similarly for the second group and any other groups of instructions. In some embodiments and/or usage scenarios, using a same random number resource of a group of instructions improves determinism and/or reproducibility of execution.
In some scenarios where random number resource selection varies relatively frequently, instructions specify that random number resource selection is via respective values in RNG Bits 3022, and the respective values optionally vary from one instruction to the next. In some scenarios where random number selection varies relatively infrequently, instructions specify that random number resource selection is via Static RNG Bits 2925.2, and the value therein is held constant for several instructions.
Processing of Instruction 2950 begins in action 3100. In action 3110, Processor 2900 decodes Instruction 2950 and various specifiers therein. The specifiers include an operation specifier (such as specifying an FP multiply-accumulate operation via a specific encoding in OpCode Bits 3023). In various embodiments, the FP multiply-accumulate instruction specifies one of half-, single-, and double-precision data and operations. In some embodiments, the data and operation precision are specified by OpCode Bits 3023, and in other embodiments the data and operation precision are specified by a separate bitfield in Instruction 2950 (not illustrated).
In action 3120, Multiplier 2911 performs an FP multiplication of Src A 2951 and Src B 2952, producing Intermediate Result 2953 as a result (having exponent and mantissa portions). Accumulator 2912 then performs an FP add of Intermediate Result 2953 and Src C 2954, producing Mantissa 2955 as a result (as well as an exponent provided to Exponent DP 2915). In action 3130, Normalizer 2913 normalizes Mantissa 2955, detecting Leading Zeros 2955.1 (if any) and shifting Other Bits 2955.2 to the left, removing Leading Zeros 2955.1 to produce Normalized Mantissa 2956.
In action 3140, Processor 2900 determines the rounding mode, e.g., by decoding Rounding Mode Bits 3021. If Rounding Mode Bits 3021 specifies a stochastic rounding mode 3142, then flow proceeds to action 3160. If Rounding Mode Bits 3021 specifies other-than a stochastic rounding mode (e.g. round to nearest even) 3141, then flow proceeds to action 3150. In action 3150, FPU 2901 deterministically rounds (e.g. without stochastic rounding) according to the specified rounding mode, and flow proceeds to action 3198.
In action 3160, Processor 2900 selects a random number resource of RNGs 2921 (e.g., based on decoding RNG Bits 3022). In some embodiments, a random number resource of RNGs 2921 is selected based on Static RNG Bits 2925.2. The selected random number resource is provided as N-bit Random Number 2962. In action 3170, N-bit Random Number 2962 and N Most Significant Lower Bits 2957.1 are added together (integer addition) by N-bit Adder 2922.
In action 3180, subsequent flow is conditionally dependent on whether the addition performed by N-bit Adder 2922 produces a carry (Carry Bit 2963 is asserted). If so 3182, then flow proceeds to action 3190. If not 3181, then Mantissa Bits Subject to Rounding 2958 is provided without change (such as by a pass-through function of Incrementer 2914) as Stochastically Rounded Mantissa 2964, and flow proceeds to action 3198. In action 3190, Incrementer 2914 provides an increment (starting at ULP 3002.1) of Mantissa Bits Subject to Rounding 2958 as Stochastically Rounded Mantissa 2964. Flow then proceeds to action 3198, where Stochastically Rounded Exponent 2965 and Stochastically Rounded Mantissa 2964 are collectively provided to a destination in accordance with the destination operand specifier (Dest Bits 3025). Processing of the instruction is then complete at action 3199.
In some embodiments and/or usage scenarios, action 3170 is conceptually a mechanism to compare N-bit Random Number 2962 and N Most Significant Lower Bits 2957.1 to determine whether to round up (3182) or round down (3181). By using N-bit Random Number 2962 as a comparison source, probability of the round up/down decision is equal to the fraction represented by N Most Significant Lower Bits 2957.1 (e.g., the probability of rounding away from zero is the fraction represented by N Most Significant Lower Bits 2957.1), which enables unbiased rounding. In some embodiments, Least Significant Lower Bits 3003.2 is ignored when performing stochastic rounding. In some embodiments, the LSB of N Most Significant Lower Bits 2957.1 is replaced with a logical OR of what N Most Significant Lower Bits 2957.1 would otherwise be and one or more bits of Least Significant Lower Bits 3003.2.
In some embodiments and/or usage scenarios, Processor 2900 is enabled to optionally and/or selectively perform stochastic rounding for floating-point operations that produce integer results or fixed-point results. For example, Processor 2900 is enabled to perform stochastic rounding for a floating-point to integer conversion operation, with the stochastic rounding affecting the resultant integer value. For another example, Processor 2900 is enabled to perform stochastic rounding for a floating-point to fixed-point conversion operation, with the stochastic rounding affecting the resultant fixed-point value.
In various embodiments and/or usage scenarios, the training process with FP computations that form long dependency chains corresponds conceptually and/or is related conceptually to concepts disclosed in section “Deep Learning Accelerator Example Uses” (see, e.g.,
In various embodiments and/or usage scenarios, all or any portions of Processor 2900 of
In various embodiments and/or usage scenarios, one or more instances of Instruction 2950 correspond to all or any portions of Task SW on PEs 260 of
In various embodiments and/or usage scenarios, all or any portions of Instruction 2950 correspond and/or are related conceptually to instructions, e.g., Multiple Operand Instruction 2510 of
Scalability for Large Deep Neural Networks
A consideration in evaluating hardware architectures for implementing Deep Neural Networks (DNN) is storage capacity of the hardware in comparison to storage requirements for weights associated with the DNN. The weights are an example of a parameter of a neural network. Additional storage required for forward partial sums, activations (including but not limited to layer outputs), and other implementation overhead (e.g. for convolutions), however, is in some situations, modest compared to the storage requirements for the weights. In the context of academic and industrial benchmarks, popular DNNs include LeNet-5, AlexNet, VGG-16, GoogLeNet(v1), and ResNet-50. The popular DNNs range from 4 to 50 layers, require between 341k and 15.5G MAC (Multiply and Accumulate) operations, and require between 60k and 138M weights, in total across all layers. Assuming each weight requires 16-bit precision, the popular DNNs have storage requirements of between 120 kB and 276 MB, just for weights, after training. For 32-bit precision, the requirements are double. Additional storage is required during training, e.g., for gradient accumulations, delta partial sums, layer errors, and duplicated weights. For some training methods (e.g., minibatch), the weights are duplicated multiple times, increasing the weight storage requirements accordingly.
Various factors affect usage of memory of a hardware accelerator for deep neural networks, e.g., Memory 854 of
Using either 16-bit or 32-bit precision weights, any of the aforementioned embodiments, in which Memory 854 holds 48 kB, is enabled to minimally implement the most demanding (VGG-16) of the above mentioned popular DNNs in a single ASIC, with all layers concurrently resident, for one or both of inference and training (e.g., for one or both of forward propagation and backward propagation), and without using external check-pointing or other external (off chip, or off wafer) storage of any of the intermediate (not yet final) state of the DNN. Any of the aforementioned embodiments, in which Memory 854 holds 8 kB or more, is enabled to minimally implement any of the above mentioned popular DNNs across a small plurality of ASICs of the wafer, with all layers concurrently resident, for one or both of inference and training, and without using external check-pointing or other external (off chip, or off wafer) storage of any of the intermediate state of the DNN. The required minimum number of ASICs depends on the embodiment (e.g., 8 kB vs. 48 kB for Memory 854, and e.g., whether weights of 16-bit or 32-bit precision are used). Stated differently, all (e.g., 100%) of the neurons and synapses of large DNNs are implementable in hardware (more particularly, in wafer 412, of Deep Learning Accelerator 400, of
In various embodiments and/or usage scenarios, Data Path 852 of
As described above, the aforementioned embodiments, in which Memory 854 holds between 8 kB and 48 kB, are enabled to minimally implement any of the above-mentioned popular DNNs via a small plurality of ASICs of the wafer. However, in view of the large number of MAC operations required for large DNNs (e.g., 15.5G MAC operations for VGG-16), performance (often viewed in terms of “wall-clock time”) for minimal implementations of such large DNNs is constrained by the number of data path resources, particularly multipliers, which for various embodiments and/or usage scenarios are necessarily being reused. Yet, according to embodiment, the entire system will have 500k to 3M instances of Data Path 852, or 25× to 150× the number as a single ASIC. By smearing (as discussed in detail elsewhere herein) and/or spreading out the neurons of the DNN (across more PEs and more ASICS of the wafer, but mindful of transfer latencies between the spread neurons) will offer potential speedup (and corresponding reduced wall-clock time) via enabling increased concurrent use, particularly of multipliers. Stated differently, in various embodiments and/or usage scenarios, in executing the training and/or operation of a dataflow graph (e.g. a DNN), the system is enabled to scale the performance (e.g., reduce wall-clock time) by one to two orders of magnitude (potentially, e.g., 25× to 150×, according to embodiment) by altering the placement (the mapping of the DNN onto PEs) to change utilization (e.g., increase parallel operation of greater numbers of multipliers) of the large number of instances of Data Path 852 in Deep Learning Accelerator 400 (e.g., via selective spreading and/or smearing of the nodes of the dataflow graph, or the neurons of the DNN).
Embodiments and usage scenarios described with respect to
In some embodiments, various combinations of all or any portions of operations performed for and/or structure associated with any of accelerated deep learning; stochastic rounding for accelerated deep learning, microthreading for accelerated deep learning; task activating for accelerated deep learning; backpressure for accelerated deep learning; data structure descriptors and fabric vectors for accelerated deep learning; neuron smearing for accelerated deep learning; task synchronization for accelerated deep learning; dataflow triggered tasks for accelerated deep learning; a control wavelet for accelerated deep learning; and/or a wavelet representation for accelerated deep learning; as well as portions of a processor, microprocessor, system-on-a-chip, application-specific-integrated-circuit, hardware accelerator, or other circuitry providing all or portions of the aforementioned operations, are specified by a specification compatible with processing by a computer system. The specification is in accordance with various descriptions, such as hardware description languages, circuit descriptions, netlist descriptions, mask descriptions, or layout descriptions. Example descriptions include: Verilog, VHDL, SPICE, SPICE variants such as PSpice, IBIS, LEF, DEF, GDS-II, OASIS, or other descriptions. In various embodiments, the processing includes any combination of interpretation, compilation, simulation, and synthesis to produce, to verify, or to specify logic and/or circuitry suitable for inclusion on one or more integrated circuits. Each integrated circuit, according to various embodiments, is compatible with design and/or manufacture according to a variety of techniques. The techniques include a programmable technique (such as a field or mask programmable gate array integrated circuit), a semi-custom technique (such as a wholly or partially cell-based integrated circuit), and a full-custom technique (such as an integrated circuit that is substantially specialized), any combination thereof, or any other technique compatible with design and/or manufacture of integrated circuits.
In some embodiments, various combinations of all or portions of operations as described by a computer readable medium having a set of instructions stored therein, are performed by execution and/or interpretation of one or more program instructions, by interpretation and/or compiling of one or more source and/or script language statements, or by execution of binary instructions produced by compiling, translating, and/or interpreting information expressed in programming and/or scripting language statements. The statements are compatible with any standard programming or scripting language (such as C, C++, Fortran, Pascal, Ada, Java, VBscript, and Shell). One or more of the program instructions, the language statements, or the binary instructions, are optionally stored on one or more computer readable storage medium elements. In various embodiments, some, all, or various portions of the program instructions are realized as one or more functions, routines, sub-routines, in-line routines, procedures, macros, or portions thereof.
Certain choices have been made in the description merely for convenience in preparing the text and drawings, and unless there is an indication to the contrary, the choices should not be construed per se as conveying additional information regarding structure or operation of the embodiments described. Examples of the choices include: the particular organization or assignment of the designations used for the figure numbering and the particular organization or assignment of the element identifiers (the callouts or numerical designators, e.g.) used to identify and reference the features and elements of the embodiments.
Various forms of the words “include” and “comprise” are specifically intended to be construed as abstractions describing logical sets of open-ended scope and are not meant to convey physical containment unless described explicitly (such as followed by the word “within”).
Although the foregoing embodiments have been described in some detail for purposes of clarity of description and understanding, the invention is not limited to the details provided. There are many embodiments of the invention. The disclosed embodiments are exemplary and not restrictive.
It will be understood that many variations in construction, arrangement, and use are possible consistent with the description, and are within the scope of the claims of the issued patent. For example, interconnect and function-unit bit-widths, clock speeds, and the type of technology used are variable according to various embodiments in each component block. The names given to interconnect and logic are merely exemplary, and should not be construed as limiting the concepts described. The order and arrangement of flowchart and flow diagram process, action, and function elements are variable according to various embodiments. Also, unless specifically stated to the contrary, value ranges specified, maximum and minimum values used, or other particular specifications (such as file types; and the number of entries or stages in registers and buffers), are merely those of the described embodiments, are expected to track improvements and changes in implementation technology, and should not be construed as limitations.
Functionally equivalent techniques known in the art are employable instead of those described to implement various components, sub-systems, operations, functions, routines, sub-routines, in-line routines, procedures, macros, or portions thereof. It is also understood that many functional aspects of embodiments are realizable selectively in either hardware (e.g., generally dedicated circuitry) or software (e.g., via some manner of programmed controller or processor), as a function of embodiment dependent design constraints and technology trends of faster processing (facilitating migration of functions previously in hardware into software) and higher integration density (facilitating migration of functions previously in software into hardware). Specific variations in various embodiments include, but are not limited to: differences in partitioning; different form factors and configurations; use of different operating systems and other system software; use of different interface standards, network protocols, or communication links; and other variations to be expected when implementing the concepts described herein in accordance with the unique engineering and business constraints of a particular application.
The embodiments have been described with detail and environmental context well beyond that required for a minimal implementation of many aspects of the embodiments described. Those of ordinary skill in the art will recognize that some embodiments omit disclosed components or features without altering the basic cooperation among the remaining elements. It is thus understood that much of the details disclosed are not required to implement various aspects of the embodiments described. To the extent that the remaining elements are distinguishable from the prior art, components and features that are omitted are not limiting on the concepts described herein.
All such variations in design are insubstantial changes over the teachings conveyed by the described embodiments. It is also understood that the embodiments described herein have broad applicability to other computing and networking applications, and are not limited to the particular application or industry of the described embodiments. The invention is thus to be construed as including all possible modifications and variations encompassed within the scope of the claims of the issued patent.
To the extent permitted by the type of the instant application, this application incorporates by reference for all purposes the following applications, all commonly owned with the instant application not later than the effective filing date of the instant application: PCT Application Serial No. PCT/IB2018/052610, filed 2018 Apr. 15, first named inventor Sean LIE, and entitled WAVELET REPRESENTATION FOR ACCELERATED DEEP LEARNING;PCT Application Serial No. PCT/IB2018/052607, filed 2018 Apr. 15, first named inventor Sean LIE, and entitled NEURON SMEARING FOR ACCELERATED DEEP LEARNING;PCT Application Serial No. PCT/IB2018/052606, filed 2018 Apr. 15, first named inventor Sean LIE, and entitled DATAFLOW TRIGGERED TASKS FOR ACCELERATED DEEP LEARNING;PCT Application Serial No. PCT/IB2018/052602, filed 2018 Apr. 13, first named inventor Sean LIE, and entitled FLOATING-POINT UNIT STOCHASTIC ROUNDING FOR ACCELERATED DEEP LEARNING;U.S. Provisional Application Ser. No. 62/655,826, filed 2018 Apr. 11, first named inventor Sean LIE, and entitled MICROTHREADING FOR ACCELERATED DEEP LEARNING;U.S. Provisional Application Ser. No. 62/655,210, filed 2018 Apr. 9, first named inventor Sean LIE, and entitled BACKPRESSURE FOR ACCELERATED DEEP LEARNING;U.S. Provisional Application Ser. No. 62/652,933, filed 2018 Apr. 5, first named inventor Sean LIE, and entitled TASK ACTIVATING FOR ACCELERATED DEEP LEARNING;U.S. Non-Provisional application Ser. No. 15/903,340, filed 2018 Feb. 23, first named inventor Sean LIE, and entitled ACCELERATED DEEP LEARNING;PCT Application Serial No. PCT/IB2018/051128, filed 2018 Feb. 23, first named inventor Sean LIE, and entitled ACCELERATED DEEP LEARNING;U.S. Provisional Application Ser. No. 62/628,784, filed 2018 Feb. 9, first named inventor Sean LIE, and entitled FABRIC VECTORS FOR DEEP LEARNING ACCELERATION;U.S. Provisional Application Ser. No. 62/628,773, filed 2018 Feb. 9, first named inventor Sean LIE, and entitled DATA STRUCTURE DESCRIPTORS FOR DEEP LEARNING ACCELERATION;U.S. Provisional Application Ser. No. 62/580,207, filed 2017 Nov. 1, first named inventor Sean LIE, and entitled NEURON SMEARING FOR ACCELERATED DEEP LEARNING;U.S. Provisional Application Ser. No. 62/542,645, filed 2017 Aug. 8, first named inventor Sean LIE, and entitled DATAFLOW TRIGGERED TASKS FOR ACCELERATED DEEP LEARNING;U.S. Provisional Application Ser. No. 62/542,657, filed 2017 Aug. 8, first named inventor Sean LIE, and entitled TASK SYNCHRONIZATION FOR ACCELERATED DEEP LEARNING;U.S. Provisional Application Ser. No. 62/522,065, filed 2017 Jun. 19, first named inventor Sean LIE, and entitled WAVELET REPRESENTATION FOR ACCELERATED DEEP LEARNING;U.S. Provisional Application Ser. No. 62/522,081, filed 2017 Jun. 19, first named inventor Sean LIE, and entitled CONTROL WAVELET FOR ACCELERATED DEEP LEARNING;U.S. Provisional Application Ser. No. 62/520,433, filed 2017 Jun. 15, first named inventor Michael Edwin JAMES, and entitled INCREASED CONCURRENCY AND EFFICIENCY OF DEEP NETWORK TRAINING VIA CONTINUOUS PROPAGATION;U.S. Provisional Application Ser. No. 62/517,949, filed 2017 Jun. 11, first named inventor Sean LIE, and entitled ACCELERATED DEEP LEARNING;U.S. Provisional Application Ser. No. 62/486,372, filed 2017 Apr. 17, first named inventor Sean LIE, and entitled ACCELERATED DEEP LEARNING;U.S. Provisional Application Ser. No. 62/485,638, filed 2017 Apr. 14, first named inventor Sean LIE, and entitled FLOATING-POINT UNIT STOCHASTIC ROUNDING FOR MACHINE LEARNING; andU.S. Provisional Application Ser. No. 62/462,640, filed 2017 Feb. 23, first named inventor Michael Edwin JAMES, and entitled INCREASED CONCURRENCY AND EFFICIENCY OF DEEP NETWORK TRAINING VIA CONTINUOUS PROPAGATION.
| Filing Document | Filing Date | Country | Kind |
|---|---|---|---|
| PCT/IB2018/052638 | 4/16/2018 | WO | 00 |
| Publishing Document | Publishing Date | Country | Kind |
|---|---|---|---|
| WO2018/193360 | 10/25/2018 | WO | A |
| Number | Name | Date | Kind |
|---|---|---|---|
| 5329611 | Pechanek | Jul 1994 | A |
| 5361334 | Cawley | Nov 1994 | A |
| 5481688 | Takagi | Jan 1996 | A |
| 5710549 | Horst et al. | Jan 1998 | A |
| 5835024 | Olnowich et al. | Nov 1998 | A |
| 5870396 | Abu-Amara et al. | Feb 1999 | A |
| 6788698 | Bandai et al. | Sep 2004 | B1 |
| 7401333 | Vandeweerd | Jul 2008 | B2 |
| 7453810 | Zoranovic et al. | Nov 2008 | B2 |
| 7565657 | Leung et al. | Jul 2009 | B1 |
| 7701957 | Bicknell | Apr 2010 | B1 |
| 7814303 | Muff et al. | Oct 2010 | B2 |
| 8151088 | Bao et al. | Apr 2012 | B1 |
| 8194690 | Steele et al. | Jun 2012 | B1 |
| 8311057 | Attig et al. | Nov 2012 | B1 |
| 8583896 | Cadambi et al. | Nov 2013 | B2 |
| 8738860 | Griffin et al. | May 2014 | B1 |
| 8745626 | Sandstrom | Jun 2014 | B1 |
| 9009660 | Griffin et al. | Apr 2015 | B1 |
| 9038072 | Nollet et al. | May 2015 | B2 |
| 9117550 | Tran | Aug 2015 | B2 |
| 9152427 | Vorbach et al. | Oct 2015 | B2 |
| 9170812 | Vorbach et al. | Oct 2015 | B2 |
| 9348557 | Langhammer et al. | May 2016 | B1 |
| 9373073 | Arthur et al. | Jun 2016 | B2 |
| 9390461 | Jane et al. | Jul 2016 | B1 |
| 9423999 | Linzer | Aug 2016 | B1 |
| 9946548 | Burger et al. | Apr 2018 | B2 |
| 10067796 | Metcalf | Sep 2018 | B1 |
| 10127043 | Sebexen et al. | Nov 2018 | B2 |
| 10268679 | Li et al. | Apr 2019 | B2 |
| 10355975 | Sebexen et al. | Jul 2019 | B2 |
| 10515303 | Lie et al. | Dec 2019 | B2 |
| 10614357 | Lie | Apr 2020 | B2 |
| 10657438 | Lie et al. | May 2020 | B2 |
| 10699189 | Lie | Jun 2020 | B2 |
| 10700968 | Sebexen et al. | Jun 2020 | B2 |
| 10726329 | Lie | Jul 2020 | B2 |
| 20020027813 | King et al. | Mar 2002 | A1 |
| 20020141427 | McAipine | Oct 2002 | A1 |
| 20020161986 | Kamigata et al. | Oct 2002 | A1 |
| 20040030712 | Sano | Feb 2004 | A1 |
| 20040037313 | Gulati | Feb 2004 | A1 |
| 20040153623 | Buchty et al. | Aug 2004 | A1 |
| 20040160970 | Dally et al. | Aug 2004 | A1 |
| 20050257027 | Leijten | Nov 2005 | A1 |
| 20060069854 | Jain et al. | Mar 2006 | A1 |
| 20060179284 | Jensen et al. | Aug 2006 | A1 |
| 20060259713 | De Santis et al. | Nov 2006 | A1 |
| 20070058557 | Cuffaro et al. | Mar 2007 | A1 |
| 20070140240 | Dally et al. | Jun 2007 | A1 |
| 20080077926 | Jeter et al. | Mar 2008 | A1 |
| 20080107105 | Reilly et al. | May 2008 | A1 |
| 20080107106 | Leonard | May 2008 | A1 |
| 20080133889 | Glew | Jun 2008 | A1 |
| 20080186852 | Sami et al. | Aug 2008 | A1 |
| 20080222646 | Sigal et al. | Sep 2008 | A1 |
| 20090003827 | Kai et al. | Jan 2009 | A1 |
| 20090094436 | Deng et al. | Apr 2009 | A1 |
| 20090119489 | Pechanek et al. | May 2009 | A1 |
| 20090248941 | Morein et al. | Oct 2009 | A1 |
| 20090259713 | Blumrich et al. | Oct 2009 | A1 |
| 20090306804 | Chao et al. | Dec 2009 | A1 |
| 20090313195 | McDaid | Dec 2009 | A1 |
| 20100061390 | Godbole et al. | Mar 2010 | A1 |
| 20100095098 | Gschwind | Apr 2010 | A1 |
| 20100106940 | Muff et al. | Apr 2010 | A1 |
| 20100208317 | Bogoni et al. | Aug 2010 | A1 |
| 20110022821 | Fei et al. | Jan 2011 | A1 |
| 20110028293 | Atkin et al. | Feb 2011 | A1 |
| 20110161626 | Mangione-Smith | Jun 2011 | A1 |
| 20110213950 | Mathieson et al. | Sep 2011 | A1 |
| 20110235531 | Vangal et al. | Sep 2011 | A1 |
| 20110310739 | Aybay | Dec 2011 | A1 |
| 20110313961 | Toscano et al. | Dec 2011 | A1 |
| 20110314255 | Krishna | Dec 2011 | A1 |
| 20120131288 | Box et al. | May 2012 | A1 |
| 20120137119 | Doerr et al. | May 2012 | A1 |
| 20120210324 | Truschin et al. | Aug 2012 | A1 |
| 20130031040 | Modha | Jan 2013 | A1 |
| 20130070588 | Steele et al. | Mar 2013 | A1 |
| 20130073497 | Akopyan et al. | Mar 2013 | A1 |
| 20130073498 | Izhikevich et al. | Mar 2013 | A1 |
| 20130086367 | Gschwind et al. | Apr 2013 | A1 |
| 20130198488 | Pechanek | Aug 2013 | A1 |
| 20130322459 | Xu | Dec 2013 | A1 |
| 20140046882 | Wood | Feb 2014 | A1 |
| 20140115208 | Willey et al. | Apr 2014 | A1 |
| 20140143470 | Dobbs et al. | May 2014 | A1 |
| 20140181501 | Hicok et al. | Jun 2014 | A1 |
| 20140211630 | Cavanna et al. | Jul 2014 | A1 |
| 20140281385 | Tu | Sep 2014 | A1 |
| 20140282560 | Hutton et al. | Sep 2014 | A1 |
| 20140282580 | Zeng et al. | Sep 2014 | A1 |
| 20140313972 | Kim | Oct 2014 | A1 |
| 20140324934 | Hrdy et al. | Oct 2014 | A1 |
| 20150074162 | Carter et al. | Mar 2015 | A1 |
| 20150089095 | Stark | Mar 2015 | A1 |
| 20150124828 | Janraj et al. | May 2015 | A1 |
| 20150127925 | Follett et al. | May 2015 | A1 |
| 20150188847 | Chopra et al. | Jul 2015 | A1 |
| 20150195182 | Mathur et al. | Jul 2015 | A1 |
| 20150242463 | Lin et al. | Aug 2015 | A1 |
| 20150242741 | Campos et al. | Aug 2015 | A1 |
| 20150302295 | Rivera et al. | Oct 2015 | A1 |
| 20150324690 | Chilimbi et al. | Nov 2015 | A1 |
| 20150378734 | Hansen et al. | Dec 2015 | A1 |
| 20150379670 | Koker et al. | Dec 2015 | A1 |
| 20160014229 | Seedorf et al. | Jan 2016 | A1 |
| 20160098296 | Ash | Apr 2016 | A1 |
| 20160182398 | Davis et al. | Jun 2016 | A1 |
| 20160182405 | Chen et al. | Jun 2016 | A1 |
| 20160203401 | Duranton et al. | Jul 2016 | A1 |
| 20160210381 | Singleton et al. | Jul 2016 | A1 |
| 20160224889 | Alvarez Icaza Rivera et al. | Aug 2016 | A1 |
| 20160246337 | Colgan | Aug 2016 | A1 |
| 20160301618 | Labonte et al. | Oct 2016 | A1 |
| 20160328239 | Iyer et al. | Nov 2016 | A1 |
| 20160328647 | Lin et al. | Nov 2016 | A1 |
| 20160330112 | Raindel et al. | Nov 2016 | A1 |
| 20160379115 | Burger et al. | Dec 2016 | A1 |
| 20160379137 | Burger et al. | Dec 2016 | A1 |
| 20170061041 | Kumar et al. | Mar 2017 | A1 |
| 20170083315 | Burger et al. | Mar 2017 | A1 |
| 20170083335 | Burger et al. | Mar 2017 | A1 |
| 20170094527 | Shattil et al. | Mar 2017 | A1 |
| 20170102920 | Henry et al. | Apr 2017 | A1 |
| 20170102939 | Lutz et al. | Apr 2017 | A1 |
| 20170110968 | Shepard et al. | Apr 2017 | A1 |
| 20170118139 | Bandic et al. | Apr 2017 | A1 |
| 20170220342 | Bradbury et al. | Aug 2017 | A1 |
| 20170295111 | Sadowski | Oct 2017 | A1 |
| 20170300333 | Wang et al. | Oct 2017 | A1 |
| 20180013657 | Cantwell et al. | Jan 2018 | A1 |
| 20180077228 | Blagodurov | Mar 2018 | A1 |
| 20180088940 | Rubanovich et al. | Mar 2018 | A1 |
| 20180095751 | Aminot et al. | Apr 2018 | A1 |
| 20180157465 | Bittner et al. | Jun 2018 | A1 |
| 20180174041 | Imam et al. | Jun 2018 | A1 |
| 20180189056 | Turakhia et al. | Jul 2018 | A1 |
| 20180189063 | Fleming et al. | Jul 2018 | A1 |
| 20180189633 | Henry et al. | Jul 2018 | A1 |
| 20180189642 | Boesch et al. | Jul 2018 | A1 |
| 20180189652 | Korthikanti et al. | Jul 2018 | A1 |
| 20180218257 | Xu et al. | Aug 2018 | A1 |
| 20180218518 | Yan et al. | Aug 2018 | A1 |
| 20180302306 | Carroll et al. | Oct 2018 | A1 |
| 20180314941 | Lie et al. | Nov 2018 | A1 |
| 20190258919 | Lie et al. | Aug 2019 | A1 |
| 20190258920 | Lie et al. | Aug 2019 | A1 |
| 20190258921 | Lie et al. | Aug 2019 | A1 |
| 20190259713 | Li et al. | Aug 2019 | A1 |
| 20190286987 | Lie et al. | Sep 2019 | A1 |
| 20190303143 | Beard | Oct 2019 | A1 |
| 20190303743 | Venkataramani et al. | Oct 2019 | A1 |
| 20190325309 | Flamant | Oct 2019 | A1 |
| 20190332926 | Lie et al. | Oct 2019 | A1 |
| 20200005142 | Lie et al. | Jan 2020 | A1 |
| 20200125934 | Lie et al. | Apr 2020 | A1 |
| 20200336421 | Sebexen et al. | Oct 2020 | A1 |
| 20200364546 | Lie et al. | Nov 2020 | A1 |
| 20200380341 | Lie et al. | Dec 2020 | A1 |
| 20200380344 | Lie et al. | Dec 2020 | A1 |
| 20200380370 | Lie et al. | Dec 2020 | A1 |
| 20210004674 | Lie et al. | Jan 2021 | A1 |
| 20210056400 | Lie et al. | Feb 2021 | A1 |
| 20210097376 | Lie et al. | Apr 2021 | A1 |
| Number | Date | Country |
|---|---|---|
| 101778049 | Jul 2010 | CN |
| 2051459 | Apr 2009 | EP |
| 3153996 | Apr 2017 | EP |
| H025173 | Jan 1990 | JP |
| 0668056 | Mar 1994 | JP |
| 06110864 | Apr 1994 | JP |
| 2009-129447 | Jun 2009 | JP |
| 1020170099848 | Sep 2017 | KR |
| 9716792 | May 1997 | WO |
| 2014081457 | May 2014 | WO |
| 2014081461 | May 2014 | WO |
| 2016186813 | Nov 2016 | WO |
| 2016210014 | Dec 2016 | WO |
| 2017003887 | Jan 2017 | WO |
| 2017048655 | Mar 2017 | WO |
| 2017129325 | Aug 2017 | WO |
| 2017214728 | Dec 2017 | WO |
| 2018154494 | Aug 2018 | WO |
| 2018189728 | Oct 2018 | WO |
| 2018193352 | Oct 2018 | WO |
| 2018193353 | Oct 2018 | WO |
| 2018193354 | Oct 2018 | WO |
| 2018193360 | Oct 2018 | WO |
| 2018193361 | Oct 2018 | WO |
| 2018193363 | Oct 2018 | WO |
| 2018193370 | Oct 2018 | WO |
| 2018193377 | Oct 2018 | WO |
| 2018193379 | Oct 2018 | WO |
| 2018193380 | Oct 2018 | WO |
| 2020021395 | Jan 2020 | WO |
| 2020044152 | Mar 2020 | WO |
| 2020044208 | Mar 2020 | WO |
| 2020044238 | Mar 2020 | WO |
| 2021084485 | May 2021 | WO |
| 2021084505 | May 2021 | WO |
| 2021084506 | May 2021 | WO |
| Entry |
|---|
| International Search Report in the related case PCT/IB2018/052610, dated Jul. 30, 2018, 3 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2018/052610, dated Jul. 30, 2018, 5 pages. |
| International Search Report in the related case PCT/IB2018/052606, dated Jul. 26, 2018, 3 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2018/052606, dated Jul. 26, 2018, 9 pages. |
| Ka-Ming Keung, ‘A study of on-chip FPGA system with 2D mesh network’, Iowa State University Digital Repository [online], Graduate Theses and Dissertations, 2010, pp. 1-131, [retrieved on Aug. 14, 2018]. Retrieved from the Internet <URL: https://lib.dr.iastate.edu/etd/11251>. (147 sheets). |
| International Search Report in the related case PCT/IB2018/051128, dated Jun. 14, 2018, 3 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2018/051128, dated Jun. 14, 2018, 8 pages. |
| International Search Report in the related case PCT/IB2018/052667, dated Aug. 9, 2018, 7 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2018/052667, dated Aug. 9, 2018, 9 pages. |
| International Search Report in the related case PCT/IB2018/052607, dated Jul. 27, 2018, 8 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2018/052607, dated Jul. 27, 2018, 9 pages. |
| International Search Report in the related case PCT/IB2018/052640, dated Aug. 7, 2018, 5 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2018/052640, dated Aug. 7, 2018, 10 pages. |
| International Search Report in the related case PCT/IB2018/052602, dated Jul. 31, 2018, 3 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2018/052602, dated Jul. 31, 2018, 11 pages. |
| International Search Report in the related case PCT/IB2018/052643, dated Aug. 7, 2018, 4 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2018/052643, dated Aug. 7, 2018, 9 pages. |
| Xiao-Wei Shen et al., ‘An Efficient Network-on-Chip Router for Dataflow Architecture’, In: Journal of Computer Science and Technology [online & print], vol. 32, Jan. 2017, pp. 11-25, DOI 10.1007/s11390-017-1703-5 (International DOI Foundation compliant document identifier), [retrieved on Aug. 30, 2018]. Retrieved from the Internet <URL: https://link.springer.com/content/pdf/10.1007%2Fs11390-017-1703-5.pdf>. (15 sheets). |
| International Search Report in the related case PCT/IB2018/052666, dated Aug. 10, 2018, 4 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2018/052666, dated Aug. 10, 2018, 4 pages. |
| International Search Report in the related case PCT/IB2018/052651, dated Jul. 31, 2018, 3 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2018/052651 dated Jul. 31, 2018, 8 pages. |
| International Search Report in the related case PCT/IB2018/052664, dated Aug. 13, 2018, 7 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2018/052664, dated Aug. 13, 2018, 6 pages. |
| Salwa Said et al, ‘Deep Wavelet Network for Image Classification’, 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2016), Budapest, Oct. 9-12, 2016, pp. 000922-000927, 6 pages. |
| International Search Report in the related case PCT/IB2019/056118, dated Dec. 20, 2019, 3 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2019/056118, dated Dec. 20, 2019, 13 pages. |
| International Search Report in the related case PCT/IB2019/057172, dated Jan. 23, 2020, 3 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2019/057172, dated Jan. 23, 2020, 6 pages. |
| Vivienne Sze et al. “Efficient Processing of Deep Neural Networks: A Tutorial and Survey”, Proceedings of the IEEE, vol. 105, No. 12, Dec. 2017, See pp. 2297-2298, 35 pages. |
| International Search Report in the related case PCT/IB2019/057216, dated Jan. 23, 2020, 4 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2019/057216, dated Jan. 23, 2020, 10 pages. |
| International Search Report in the related case PCT/IB2019/056825, dated Jan. 28, 2020, 3 pages. |
| Written Opinion of the International Searching Authority in the related case PCT/IB2019/056825, dated Jan. 28, 2020, 7 pages. |
| European search report European Application No. 18756971.0, dated Jan. 7, 2020, 8 pages. |
| Narayanamurthy N et al: “Evolving bio plausible design with heterogeneous Noc”, The 15th International Conference on Advanced Communications Technology—ICACT2013, Jan. 27, 2013, (pp. 451-456), 6 pages. |
| Dong Y et al: “High dependable implementation of Neural Networks with networks on chip architecture and a backtracking routing algorithm”, Jan. 19, 2009, (pp. 404-407), 4 pages. |
| Japan Patent Office, Japanese Patent Application No. 2019-556705, Notice of reason for refusal, Transmittal Date Jun. 30, 2020, 4 pages. |
| Ardavan Pedram, William Lynch, Gary Lauterbach, “Accelerating Training in the Cloud”, a tutorial presented at Hot Chips: A Symposium on High Performance Chips, HC30 (2018), Cupertino, California, USA, Aug. 19-21, 2018, IEEE Technical Committee on Microprocessors and Microcomputers, [retrieved on Mar. 21, 2019] , Retrieved from the Internet <URL: http://www.hotchips.org/hc30/4allslides/hc30_all_slides_v20180821_4.zip >, 65 pages. |
| Ardavan Pedram, William Lynch, Gary Lauterbach, “Accelerating Training in the Cloud”, a tutorial presented at Hot Chips: A Symposium on High Performance Chips, HC30 (2018), Cupertino, California, USA, Aug. 19-21, 2018, IEEE Technical Committee on Microprocessors and Microcomputers, pre-presentation version believed to be only available to attendees and as downloaded Aug. 19, 2018 via on-site private network at the conference, 65 pages. |
| A. H. Benyamina, B.Beldjilali S. Eltar, K. Dellal, “Mapping Real Time Applications on NoC Architecture with Hybrid Multi-objective PSO Algorithm,” Actes du Septième Colloque sur I'Optimisation et les Systèmes d'Information—COSI'2010 (informally AKA Proceedings of the Seventh Symposium on Optimization and Information Systems—COSI'2010), Apr. 18-20, 2010, Ouargla, Algeria, KASDI Merbah University, pp. 505-511, 7 pages. |
| F. A. Samman, “Microarchitecture and Implementation of Networks-on-Chip with a Flexible Concept for Communication Media Sharing”, Dissertation (Doctoral Thesis), Technische Universität Darmstadt: Fachbereich Elektrotechnik and Informationstechnik (informally AKA Department of Electrical Engineering and Information Technology of the TU Darmstadt), Darmstadt, Germany, 2010, 286 pages. |
| Paris Mesidis, “Mapping of Real-time Applications on Network-on-Chip based MPSOCS.” Dissertation (Masters Thesis), The University of York, Department of Computer Science, Heslington, York, UK, Dec. 2011, 105 pages. |
| A. Agarwal, et al., “Survey of Network on Chip (NoC) Architectures & Contributions”, Journal of Engineering, Computing and Architecture, vol. 3, Issue 1, Scientific Journals International, a division of Global Commerce & Communication, Inc., Saint Cloud, Minnesota, 2009, [retrieved on Mar. 25, 2019], Retrieved from the Internet <URL: https://www.ee.ryerson.ca/˜courses/ee8205/Data-Sheets/noc/Survey-NoC-Arch09.pdf >, 15 pages. |
| S Han, X Liu, H Mao, J Pu, A Pedram, M Horowitz, B Daily, “Deep Compression and EIE: Efficient Inference Engine on Compressed Deep Neural Network”, Hot Chips: A Symposium on High Performance Chips, HC28 (2016), Cupertino, California, Aug. 21-23, 2016, IEEE Technical Committee on Microprocessors and Microcomputers, [retrieved on Mar. 25, 2019] , Retrieved from the Internet <URL: http://www.hotchips.org/wp-content/uploads/hc_archives/hc28/hc28_archive.zip >, 6 pages. |
| D. Moloney, “Embedded Deep Neural Networks: The Cost of Everything and the Value of Nothing”, Hot Chips: A Symposium on High Performance Chips, HC28 (2016), Cupertino, California, USA, Aug. 21-23, 2016, IEEE Technical Committee on Microprocessors and Microcomputers, [retrieved on Mar. 25, 2019] , Retrieved from the Internet <URL: http://www.hotchips.org/wp-content/uploads/hc_archives/hc28/hc28_archive.zip >, 20 pages. |
| G. Efland, S. Parkh, H. Sanghavi, and A. Farooqui. “High Performance DSP for Vision, Imaging and Neural Networks”, Hot Chips: A Symposium on High Performance Chips, HC28 (2016), Cupertino, California, USA, Aug. 21-23, 2016, IEEE Technical Committee on Microprocessors and Microcomputers, [retrieved on Mar. 25, 2019] , Retrieved from the Internet <URL: http://www.hotchips.org/wp-content/uploads/hc_archives/hc28/hc28_archive.zip >, 30 pages. |
| K. Guo et al., “From Model to FPGA: Software-Hardware Co-Design for Efficient Neural Network Acceleration”, Hot Chips: A Symposium on High Performance Chips, HC28 (2016), Cupertino, California, USA, Aug. 21-23, 2016, IEEE Technical Committee on Microprocessors and Microcomputers, [retrieved on Mar. 25, 2019] , Retrieved from the Internet <URL: http://www.hotchips.org/wp-content/uploads/hc_archives/hc28/hc28_archive.zip >, 27 pages. |
| S. Schmitt et al., “Neuromorphic Hardware in the Loop: Training a Deep Spiking Network on the BrainScaleS Wafer-Scale System”, in arXiv.org (A Cornell University Library e-print service & repository) [online], Mar. 6, 2017, arXiv:1703.01909v1 [cs.NE] (arXiv identifier and primary classification), [retrieved on Apr. 7, 2018] , Retrieved from the Internet <URL: https://arxiv.org/pdf/1703.01909.pdf >, 8 pages. |
| Jouppi, N. P. et al. “In-Datacenter Performance Analysis of a Tensor Processing Unit”, in arXiv.org (A Cornell University Library e-print service & repository) [online], Apr. 16, 2017, arXiv:1704.04760 [cs.AR] (arXiv identifier and primary classification), [retrieved on Apr. 7, 2018], Retrieved from the Internet <URL: https://arxiv.org/pdf/1704.04760.pdf >, 17 pages. |
| K. Ovtcharov, O. Ruwase, J.Y. Kim, J. Fowers, K. Strauss, E.S. Chung, “Accelerating Deep Convolutional Neural Networks Using Specialized Hardware”, Microsoft Research Whitepaper [online], Feb. 22, 2015, Microsoft Corporation, Redmond, Washington, USA, [retrieved on Mar. 25, 2019], Retrieved from the Internet <URL: https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/CNN20Whitepaper.pdf >, 4 pages. |
| V. Sze, Y.-H. Chen, T.-J. Yang, and J. Emer, “Efficient Processing of Deep Neural Networks: A Tutorial and Survey”, in arXiv.org (A Cornell University Library e-print service & repository) [online], Aug. 13, 2017, arXiv:1703.09039v2 [cs.CV] (arXiv identifier and primary classification), [retrieved on Mar. 25, 2019], Retrieved from the Internet <URL: https://arxiv.org/pdf/1703.09039.pdf>, 32 pages. |
| C. Farabet, B. Martini, P. Akselrod, S. Talay, Y. LeCun, E. Culurciello, “Hardware Accelerated Convolutional Neural getworks for Synthetic Vision Systems”, Proc. of 2010 IEEE Int'l Symp. on Circuits and Systems, Paris, France, May 2-Jun. 2, 2010, IEEE, May 2010, 4 pages. |
| V. Gokhale, J. Jin, A. Dundar, B. Martini, E. Culurciello, “A 240 G-ops/s Mobile Coprocessor for Deep Neural Networks”, 2014 IEEE Conf. on Comput. Vis. and Pattern Recognit. Workshops (CVPRW), Columbus, OH, USA, Jun. 23-28, 2014, IEEE, Jun. 2014, pp. 682-687, 6 pages. |
| Dominik Scherer , Hannes Schulz , Sven Behnke, “Accelerating Large-Scale Convolutional Neural Networks with Parallel Graphics Multiprocessors”, 20th International Conference on Artificial Neural Networks (ICANN 2010), Proceedings, Part III, Sep. 15-18, 2010, Thessaloniki, Greece, European Neural Network Society (ENNS), 2010, 10 pages. |
| Joel Emer, Vivienne Sze, Yu-Hsin Chen, Tien-Ju Yang, “Hardware Architectures for Deep Neural Networks”, a tutorial presented at the (44th) International Symposium on Computer Architecture (ISCA 2017), Jun. 24-28, 2017, Toronto, ON, Canada, ACM/IEEE, Jun. 24, 2017, 290 pages. |
| Joel Emer, Vivienne Sze, Yu-Hsin Chen,“Hardware Architectures for Deep Neural Networks”, at tutorial presented at the (49th Annual) IEEE/ACM International Symposium on Microarchitecture (MICRO-49), Oct. 15-19, 2016, Taipei, Taiwan, IEEE/ACM, Oct. 16, 2016, 300 pages. |
| J. Jin, V. Gokhale, A. Dundar, B. Krishnamurthy, B. Martini, and E. Culurciello. “An Efficient Implementation of Deep Convolutional Neural Networks on a Mobile Coprocessor”, 2014 IEEE 57th International Midwest Symposium on Circuits and Systems (MWSCAS 2014), Aug. 3-6, 2014, College Station, TX, USA, IEEE, Aug. 2014, 4 pages. |
| Pande, S., “Design Exploration of EMBRACE Hardware Spiking Neural Network Architecture and Applications”. Dissertation (Doctoral Thesis), Feb. 5, 2014, National University of Ireland, Galway, Ireland, [retrieved on Mar. 30, 2018], Retrieved from the Internet <URL: https://aran.library.nuigalway.ie/handle/10379/4172 >, 176 pages. |
| International Search Report in PCT/182018/052638 (the international stage of the instant case), dated Aug. 7, 2018, 3 pages. |
| Written Opinion of the International Searching Authority in PCT/182018/052638 (the international stage of the instant case), dated Aug. 7, 2018, 8 pages. |
| International Preliminary Report on Patentability (Chapter II) in PCT/182018/052638 (the international stage of the instant case), dated Aug. 7, 2019, 4 pages. |
| Murtagh, P., et al, Bit-serial systolic array implementation of a multilayer perceptron, in IEE Proceedings-E (Computers and Digital Techniques), Sep. 1993, pp. 277-288, vol. 140, Issue 5, IEE. (12 sheets). |
| Girones, R. G., et al, Systolic Implementation of a Pipelined On-Line Backpropagation, in Proceedings of the Seventh International Conference on Microelectronics for Neural, Fuzzy and Bio-Inspired Systems, Apr. 7-9, 1999, pp. 387-394, IEEE, Granada, Spain. (8 sheets). |
| Girones, R. G., et al, Forward-Backward Parallelism in On-Line Backpropagation, in Engineering Applications of Bio-Inspired Artificial Neural Networks, Proceedings of the International Work-Conference on Artificial and Natural Neural Networks vol. 2, Jun. 1999, pp. 157-165, Lecture Notes in Computer Science vol. 1607, Springer, Berlin, Germany. (9 sheets). |
| Gadea, R., et al, Artificial Neural Network Implementation on a single FPGA of a Pipelined On-Line Backpropagation, in Proceedings of the 13th International Symposium on System Synthesis, Sep. 2000, pp. 225-230, IEEE, Madrid, Spain. (6 sheets). |
| Gaunt, A. L., et al, AMPNet: Asynchronous Model-Parallel Training for Dynamic Neural Networks, in arXiv.org (A Cornell University Library e-print service & repository) [online], Jun. 22, 2017, arXiv:1705.09786v3 [cs.LG] (arXiv identifier & primary classification), [retrieved on Jul. 20, 2018]. Retrieved from the Internet <URL: https://arxiv.org/pdf/1705.09786v3.pdf>, pp. 1-18. (18 sheets). |
| May 28, 2020 List of References Used in Art Rejections in Cases Related to, May 28, 2020, 2 pages. |
| Canadian Intellectual Property Office, Canadian Patent Application No. 3,060,356, Office Action, dated Feb. 28, 2020, 7 pages. |
| Canadian Intellectual Property Office, Canadian Patent Application No. 3,051,990, Office Action, dated Mar. 9, 2020, 5 pages. |
| Japan Patent Office, Japanese Patent Application No. 2019-546879, Notice of reason for refusal, dated Mar. 10, 2020, 4 pages. |
| European search report, European Application No. 18788154.5 , dated Mar. 20, 2020, 9 pages. |
| European search report European Application No. 18788046.3, dated Mar. 27, 2020, 10 pages. |
| European search report European Application No. 18788255.0, dated Apr. 1, 2020, 11 pages. |
| Xiao-Wei Shen et al: “An Efficient Network-on-Chip Router for Dataflow Architecture”, Journal of Computer Science and Technology., vol. 32, No. 1, Jan. 1, 2017 (Jan. 1, 2017), pp. 11-25, XP055678469, 15 pages. |
| European search report European Application No. 18788260.0, dated Apr. 3, 2020, 10 pages. |
| Yiping Dong et al: “Network on Chip architecture for BP neural network”, Communications, Circuits and Systems, 2008. ICCCAS 2008. International Conference on, IEEE, Piscataway, NJ, USA, May 25, 2008 (May 25, 2008), pp. 964-968, XP031353080, 5 pages. |
| Japan Patent Office, Japanese Patent Application No. 2019-556713, Notice of reason for refusal, dated Apr. 7, 2020, 16 pages. |
| Sam Fuller “RapidIO: The Next Generation Communication Fabric for Embedded Application”, RapidIO—The Embedded System Interconnect, Release Date, Jan. 2005, John Wiley & Sons, Inc., 3 pages. |
| Kurt Shuler, “The Soc Interconnect Fabric: A Brief History”, Arteris IP, Aug. 6, 2013, 9 pages. |
| Seth Copen Goldstein et al, “PipeRench: A Coprocessor for Streaming Multimedia Acceleration”, Appeared in Proceedings of 26th International Symposium on Computer Architecture, ISCA 1999. 12 pages. |
| Jul. 21, 2020 List of References Used in Art Rejections in Cases Related to, Jul. 21, 2020, 3 pages. |
| International Preliminary Report on Patentability (Ch II) in PCT/IB2018/052606, dated Apr. 1, 2019, 4 pages. |
| International Preliminary Report on Patentability (Ch II) in PCT/IB2018/051128, dated Jun. 7, 2019, 4 pages. |
| International Preliminary Report on Patentability (Ch II) in the related PCT/IB2018/052667, dated Aug. 7, 2019, 4 pages. |
| International Preliminary Report on Patentability (Ch II) in the related PCT/IB2018/052602, dated Aug. 7, 2019, 4 pages. |
| International Preliminary Report on Patentability (Ch II) in the related PCT/IB2018/052640, dated Aug. 7, 2019, 4 pages. |
| International Preliminary Report on Patentability (Ch II) in the related PCT/IB2018/052651, dated Aug. 7, 2019, 4 pages. |
| International Preliminary Report on Patentability (Ch II) in the related PCT/IB2018/052607, dated Aug. 7, 2019, 4 pages. |
| Alex Kriznevsky et al, ImageNet Classification with Deep Convolutional Neural Networks, in Advances in Neural Information Processing Systems (NIPS), vol. 25, pp. 1106-1114, 2012, 9 pages. |
| Yann Lecun et al, Deep learning, in Nature, May 28, 2015, pp. 436-444, vol. 521, Macmillan Publishers Limited, 9 pages. |
| Chrisitian Szegedy et al, Going deeper with convolutions, in arXiv.org (A Cornell University Library e-print service & repository) [online], Sep. 17, 2014, arXiv:1409.4842v1 [cs.CV] (arXiv identifier & primary classification), [retrieved on Oct. 18, 2018]. Retrieved from the Internet <URL: https://arxiv.org/pdf/1409.4842.pdf>, 12 pages. |
| Karen Simonyan et al, Very Deep Convolutional Networks for Large-Scale Image Recognition, in arXiv.org (A Cornell University Library e-print service & repository) [online], Apr. 10, 2015, arXiv: arXiv:1409.1556v6 [cs.CV] (arXiv identifier & primary classification), [retrieved on Oct. 18, 2018]. Retrieved from the Internet <URL: https://arxiv.org/pdf/1409.1556.pdf>,14 pages. |
| Jan. 29, 2021 List of References Used in Art Rejections in Cases Related to, Jan. 29, 2021, 2 page. |
| National Intellectual Property Administration, PRC, PRC Patent Application No. 2018800135043, Notification of the First Office Action, dated Jul. 13, 2020, 10 pages. |
| European search report, European Application No. 18786968.0 , dated Sep. 20, 2020, 10 pages. |
| M.M. Khan, D.R. Lester, L.A. Plana, A. Rast, X. Jin, E. Painkras and S.B. Furber, “SpiNN aker: Mapping Neural Networks onto a Massively-Parallel Chip Multiprocessor”, 2008 International Joint Conference on Neural Networks (IJCNN 2008), pp. 2850-2857, 8 sheets. |
| Johannes Schemmel, Johannes Fieres and Karlheinz Meier. “Wafer-Scale Integration of Analog Neural Networks”, 2008 International Joint Conference on Neural Networks (IJCNN 2008), pp. 431-438, 8 sheets. |
| Soheil Shams and K. Wojtek Przytula, “Mapping of Neural Networks onto Programmable Parallel Machines”, Hughes Research Laboratories Malibu, California 90265, 1990 IEEE, pp. 2613-2617, 5 sheets. |
| European search report, European Application No. 18788154.5 , dated Dec. 12, 2020, 6 pages. |
| May 13, 2021 List of References Used in Art Rejections in Cases Related to Docket No. CS-17-06US, May 13, 2021, 1 page. |
| European search report, European Application No. 18787945.7, dated Feb. 03, 2021, 13 pages. |
| Japanese Notice of Reasons for Refusal Application No. 2019-556709, dated Mar. 2, 2021, 9 pages. |
| European search report, European Application No. 18788046.3, dated Feb. 22, 2021, 9 pages. |
| Canadian Intellectual Property Office, Canadian Patent Application No. 3,060,350, Office Action, dated Apr. 14, 2021, 4 pages. |
| Daniel U. Becker, dissertation entitled “Efficient Microarchitecture for Network-On-Chip Routers”, Submitted to the Department of Electrical Engineering, Thesis (Ph.D.)—Stanford University, Aug. 2012, 193 pages. |
| William J. Daily and Charles L. Seitz, “The Torus Routing Chip”, Computer Science Department, California Institute of Technology 5208:Tr:86, Jan. 24, 1985, 19 pages. |
| Alireza Monemi et al, “Low latency network-on-chip router microarchitecture using request masking technique”, International Journal of Recontigurable Computing, Jan. 1 , 2015, Hindawi Publising Corportation, vol. 2015, 13 pages. |
| “Cosmic Cubism”, Engineering & Science, Mar. 1984, pp. 17-20, 4 sheets. |
| Heidi Pan et al, “Heads and Tails: A Variable-Length Instruction Format Supporting Parallel Fetch and Decode” Cases '01, Nov. 16-17, 2001, Atlanta, Georgia, USA. Copyright 2001 ACM 1-58113-399-05/01/0011, 8 sheets. |
| Charles L. Seitz, “The Cosmic Cube”, Communications of the ACM, ]anuary 1985, vol. 28 No. 2, 12 pages. |
| William J. Daily et al, “Route packets, not wires: On-chip interconnection networks”, IEEE Xplore. Downloaded on Jan. 26, 2009 at 16:19 from IEEE Xplore, DAC 2001, Jun. 18-22, 2001, Las Vegas, Nevada, USA. pages 684-689, 6 sheets. |
| Vinothkumar, M. et al, “Design and Implementation of Router Arbitration in Network on Chip” , Jan. 2014, SSRN Electronic Journal, 6 sheets. |
| Van Der Laan, D “The Structure and Performance of Optimal Routing Sequences” Thomas Shelties Institute for Mathematics, Sep. 8, 1976 (Sep. 8, 1976), 208 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20200133741 A1 | Apr 2020 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62486372 | Apr 2017 | US | |
| 62517949 | Jun 2017 | US | |
| 62520433 | Jun 2017 | US | |
| 62522065 | Jun 2017 | US | |
| 62522081 | Jun 2017 | US | |
| 62542645 | Aug 2017 | US | |
| 62542657 | Aug 2017 | US | |
| 62580207 | Nov 2017 | US | |
| 62628773 | Feb 2018 | US | |
| 62628784 | Feb 2018 | US | |
| 62652933 | Apr 2018 | US | |
| 62655210 | Apr 2018 | US |
