Abstract: A method and apparatus of copying data from a first memory location to a second memory location includes performing a copy operation selected out of one or more copy operations. The copy operations include performing interleaved data copying, performing a full wavefront copy operation, copying all data to a local data store (LDS) prior to copying to the second memory location, or pipelining the data for copying. The copy operation is applied to copy the data from the first location to the second memory location.

Abstract: Improvements in the graphics processing pipeline that allow multiple pipelines to cooperate to render a single frame are disclosed. Two approaches are provided. In a first approach, world-space pipelines for the different graphics processing pipelines process all work for draw calls received from a central processing unit (CPU). In a second approach, the world-space pipelines divide up the work. Work that is divided is synchronized and redistributed at various points in the world-space pipeline. In either approach, the triangles output by the world-space pipelines are distributed to the screen-space pipelines based on the portions of the render surface overlapped by the triangles. Triangles are rendered by screen-space pipelines associated with the render surface portions overlapped by those triangles.

Abstract: Techniques for removing reset indices from, and identifying primitives in, an index stream that defines a set of primitives to be rendered, are disclosed. The index stream may be specified by an application program executing on the central processing unit. The technique involves classifying the primitive topology for the index stream as either requiring an offset-based technique or requiring a non-offset-based technique. This classification is done by determining whether, according to the primitive topology, each subsequent index can form a primitive with prior indices (e.g., line strip, triangle strip). If each subsequent index can form a primitive with prior indices, then the technique used is the non-offset-based technique. If each subsequent index does not form a primitive with prior indices, but instead at least two indices are required to form a new primitive (e.g., line list, triangle list), then the technique used is the offset-based technique.

Abstract: Techniques are described which apply a method for including a routing stack to provide a timely way to dynamically learn about route changes for an end to end system in the context of an adaptive private network (APN). By allowing learned routes to be assigned different services based on filtering rules, the APN can efficiently manage traffic through the WAN. Techniques for learning routes and to advertise the learned routes in different networks are also described. Upon an APN route change being detected in the APN, a route table is updated with the APN route change, wherein the route table contains routes in a local area network (LAN) and routes in a wide area network (WAN). The APN route change is selected from the route table and configured to a protocol for the LAN. The selected APN route change is advertised in the protocol to local routers in the LAN.

Abstract: An athlete tracking system and method for tracking an athlete during training sessions, such as swim training. The system includes a mobile tracking device wearable around the athlete's chest, and a training log server for maintaining an athlete profile that includes a training record updatable by the athlete and a training plan supplied by a coach.

Abstract: System and techniques are described which provide a method for time correlated monitoring of nodes in a network. A statistics request message is sent from a centralized control point to a node in a network having a plurality of nodes, wherein the statistics request message contains a centralized control point time stamp tn of when the message was sent. The statistics request message is received at the node which records a node timestamp ta when the message was received in the node. Node statistics are converted to system time at the centralized control point according to a first delta between tn and ta to generate adjusted node statistics. A second delta is determined at the centralized control point which is applied to the adjusted node statistics to provide consistent system time information for feedback or presentation through a network attached user interface.

Abstract: A compute unit accesses a chunk of bits that represent indices of vertices of a graphics primitive. The compute unit sets values of a first bit to indicate whether the chunk is monotonic or ordinary, second bits to define an offset that is determined based on values of indices in the chunk, and sets of third bits that determine values of the indices in the chunk based on the offset defined by the second bits. The compute unit writes a compressed chunk represented by the first bit, the second bits, and the sets of third bits to a memory. The compressed chunk is decompressed and the decompressed indices are written to an index buffer. In some embodiments, the indices are decompressed based on metadata that includes offsets that are determined based on values of the indices and bitfields that indicate characteristics of the indices.

Abstract: Processing of non-real-time and real-time workloads is performed using discrete pipelines. A first pipeline includes a first shader and one or more fixed function hardware blocks. A second pipeline includes a second shader that is configured to emulate the at least one fixed function hardware block. First and second memory elements store first state information for the first pipeline and second state information for the second pipeline, respectively. A non-real-time workload executing in the first pipeline is preempted at a primitive boundary in response to a real-time workload being dispatched for execution in the second pipeline. The first memory element retains the first state information in response to preemption of the non-real-time workload. The first pipeline is configured to resume processing the subsequent primitive on the basis of the first state information stored in the first memory element.

Abstract: Techniques for removing reset indices from, and identifying primitives in, an index stream that defines a set of primitives to be rendered, are disclosed. The index stream may be specified by an application program executing on the central processing unit. The technique involves classifying the primitive topology for the index stream as either requiring an offset-based technique or requiring a non-offset-based technique. This classification is done by determining whether, according to the primitive topology, each subsequent index can form a primitive with prior indices (e.g., line strip, triangle strip). If each subsequent index can form a primitive with prior indices, then the technique used is the non-offset-based technique. If each subsequent index does not form a primitive with prior indices, but instead at least two indices are required to form a new primitive (e.g., line list, triangle list), then the technique used is the offset-based technique.

Abstract: Processing of non-real-time and real-time workloads is performed using discrete pipelines. A first pipeline includes a first shader and one or more fixed function hardware blocks. A second pipeline includes a second shader that is configured to emulate the at least one fixed function hardware block. First and second memory elements store first state information for the first pipeline and second state information for the second pipeline, respectively. A non-real-time workload executing in the first pipeline is preempted at a primitive boundary in response to a real-time workload being dispatched for execution in the second pipeline. The first memory element retains the first state information in response to preemption of the non-real-time workload. The first pipeline is configured to resume processing the subsequent primitive on the basis of the first state information stored in the first memory element.

Abstract: System and techniques are described for applying selectable applications to process data packets an adaptive private network (APN). Methods to select application specific processing within a WAN ingress processing pipeline begin with receiving a packet from a local area network (LAN) in an adaptive private network (APN) WAN ingress processing stages. The received packet is identified to be separately processed by a selected application that is different than standard ingress processing. Packet processing flow is redirected to the selected application for application specific processing of the received packet in response to the packet being identified to be separately processed. The separately processed packet is returned to the standard ingress processing after completing the separate processing.

Abstract: Systems and techniques are described for a path maximum transmission unit (MTU) discovery method that allows the sender of IP packets to discover the MTU of packets that it is sending over a conduit to a given destination. The MTU is the largest packet that can be sent through the network along a path without requiring fragmentation. The path MTU discovery method actively probes each sending path of each conduit with fragmentation enabled to determine a current MTU and accordingly increase or decrease the conduit MTU. The path MTU discovery process is resilient to errors and supports retransmission if packets are lost in the discovery process. The path MTU discovery process is dynamically adjusted at a periodic rate to adjust to varying network conditions.

Abstract: Described are methods of fabricating lithium sputter targets, lithium sputter targets, associated handling apparatus, and sputter methods including lithium targets. Various embodiments address adhesion of the lithium metal target to a support structure, avoiding and/or removing passivating coatings formed on the lithium target, uniformity of the lithium target as well as efficient cooling of lithium during sputtering. Target configurations used to compensate for non-uniformities in sputter plasma are described. Modular format lithium tiles and methods of fabrication are described. Rotary lithium sputter targets are also described.

Abstract: Thin-film devices, for example electrochromic devices for windows, and methods of manufacturing are described. Particular focus is given to methods of patterning optical devices. Various edge deletion and isolation scribes are performed, for example, to ensure the optical device has appropriate isolation from any edge defects. Methods described herein apply to any thin-film device having one or more material layers sandwiched between two thin film electrical conductor layers. The described methods create novel optical device configurations.

Abstract: Techniques for removing duplicate indices from an index stream are disclosed. The techniques involve dividing the indices into chunks. For any particular chunk, the techniques involve examining each index in the chunk to determine whether a “match” exists for that index within a reuse depth sliding window. The reuse depth sliding window includes a fixed number of indices immediately prior to the index being examined for a match. If a match exists, then the index is marked as non-unique and is assigned a position value equal to the position value of the matching index. If a match does not exist, then the index is marked as unique and assigned the next available position value for the chunk. After assigning position values to indices in a chunk, the indices in the chunk are transmitted to a vertex shader stage for processing in the order indicated by the position values.

Abstract: Systems and techniques are described for a path maximum transmission unit (MTU) discovery method that allows the sender of IP packets to discover the MTU of packets that it is sending over a conduit to a given destination. The MTU is the largest packet that can be sent through the network along a path without requiring fragmentation. The path MTU discovery method actively probes each sending path of each conduit with fragmentation enabled to determine a current MTU and accordingly increase or decrease the conduit MTU. The path MTU discovery process is resilient to errors and supports retransmission if packets are lost in the discovery process. The path MTU discovery process is dynamically adjusted at a periodic rate to adjust to varying network conditions.

Abstract: Methods, systems, and apparatus to constrain a search are described. A selection of one or more items of a search result set by a user may be obtained. One or more attributes of the one or more selected items may be evaluated. One or more filters are identified based on the evaluated attributes.

Abstract: Improvements in the graphics processing pipeline that allow multiple pipelines to cooperate to render a single frame are disclosed. Two approaches are provided. In a first approach, world-space pipelines for the different graphics processing pipelines process all work for draw calls received from a central processing unit (CPU). In a second approach, the world-space pipelines divide up the work. Work that is divided is synchronized and redistributed at various points in the world-space pipeline. In either approach, the triangles output by the world-space pipelines are distributed to the screen-space pipelines based on the portions of the render surface overlapped by the triangles. Triangles are rendered by screen-space pipelines associated with the render surface portions overlapped by those triangles.

Abstract: A method and apparatus of copying data from a first memory location to a second memory location includes performing a copy operation selected out of one or more copy operations. The copy operations include performing interleaved data copying, performing a full wavefront copy operation, copying all data to a local data store (LDS) prior to copying to the second memory location, or pipelining the data for copying. The copy operation is applied to copy the data from the first location to the second memory location.

Abstract: An athlete tracking system and method for tracking an athlete during training sessions, such as swim training. The system includes a mobile tracking device wearable around the athlete's chest, and a training log server for maintaining an athlete profile that includes a training record updatable by the athlete and a training plan supplied by a coach.