Abstract: A method for computing includes defining a processing pipeline, including at least a first stage in which producer processors compute and output data to respective locations in a buffer and a second processing stage in which one or more consumer processors read the data from the buffer and apply a computational task to the data read from the buffer. The computational task is broken into multiple, independent work units, for application by the consumer processors to respective ranges of the data in the buffer, and respective indexes are assigned to the work units in a predefined index space. A mapping is generated between the index space and the addresses in the buffer, and execution of the work units is scheduled such that at least one of the work units can begin execution before all the producer processors have completed the first processing stage.

Abstract: A method for computing includes providing software source code defining a processing pipeline including multiple, sequential stages of parallel computations, in which a plurality of processors apply a computational task to data read from a buffer. A static code analysis is applied to the software source code so as to break the computational task into multiple, independent work units, and to define an index space in which the work units are identified by respective indexes. Based on the static code analysis, mapping parameters that define a mapping between the index space and addresses in the buffer are computed, indicating by the mapping the respective ranges of the data to which the work units are to be applied. The source code is compiled so that the processors execute the work units identified by the respective indexes while accessing the data in the buffer in accordance with the mapping.

Abstract: A processor includes an internal memory and processing circuitry. The internal memory is configured to store a definition of a multi-dimensional array stored in an external memory, and indices that specify elements of the multi-dimensional array in terms of multi-dimensional coordinates of the elements within the array. The processing circuitry is configured to execute instructions in accordance with an Instruction Set Architecture (ISA) defined for the processor. At least some of the instructions in the ISA access the multi-dimensional array by operating on the multi-dimensional coordinates specified in the indices.

Abstract: Methods, apparatus, systems and articles of manufacture to prepare a set of equations for a successive over relaxation processor are disclosed. An example apparatus includes an identifier to identify a set of equations that corresponds to pixels of an input image. Example apparatus also include a partitioner to divide the set of equations into partitions that contain mutually independent subsets of the equations and a collector to collect the subsets of the set of equations into groups, based on the partitions, to be solved in parallel by the successive over relaxation processor.

Abstract: Computational apparatus includes a memory, which contains first and second input matrices of input data values, having at least three dimensions including respective heights and widths in a predefined sampling space and a common depth in a feature dimension, orthogonal to the sampling space. An array of processing elements each perform a multiplication of respective first and second input operands and to accumulate products of the multiplication to generate a respective output value. Data access logic extracts first and second pluralities of vectors of the input data values extending in the feature dimension from the first and second input matrices, respectively, and distributes the input data values from the extracted vectors in sequence to the processing elements so as to cause the processing elements to compute a convolution of first and second two-dimensional matrices composed respectively of the first and second pluralities of vectors.

Abstract: Methods, apparatus, systems and articles of manufacture to prepare a set of equations for a successive over relaxation processor are disclosed. An example apparatus includes an identifier to identify a set of equations that corresponds to pixels of an input image. Example apparatus also include a partitioner to divide the set of equations into partitions that contain mutually independent subsets of the equations and a collector to collect the subsets of the set of equations into groups, based on the partitions, to be solved in parallel by the successive over relaxation processor.

Abstract: Methods and apparatus relating to improved SIMD (Single Instruction, Multiple Data) K-nearest-neighbors implementations are described. An embodiment provides a technique for improving SIMD implementations of the multidimensional K-Nearest-Neighbors (KNN) techniques. One embodiment replaces the non-SIMD friendly part of the KNN algorithm with a sequence of SIMD operations. For example, in order to avoid branches in the algorithm hotspot (e.g., the inner loop), SIMD operations may be used to update the list of nearest distances (and neighbors) after each iteration. Other embodiments are also disclosed and claimed.

Abstract: Systems and methods may provide for obtaining data associated with an image and using a plurality of threads in a graphics processor to conduct a single instruction multiple data (SIMD) scan of the data. Additionally, systems and methods may provide for generating a plurality of connection tables corresponding to the plurality of threads based on the SIMD scan. In one example, a plurality of threads in the graphics processor are used to conduct a single phase merge of the plurality of connection tables onto a global connected components labeling (CCL) table for the image.

Abstract: Techniques related to blob detection in noisy images are discussed. Such techniques may include traversing a contour associated with a candidate blob contour pixel to an inline pixel along a predetermined orientation, detecting a direction of the inline pixel with respect to the candidate blob contour pixel, and continuing to traverse the contour as a contour of the blob or detecting a second candidate blob contour pixel based on the detected direction.

Abstract: Techniques related to blob detection in noisy images are discussed. Such techniques may include traversing a contour associated with a candidate blob contour pixel to an inline pixel along a predetermined orientation, detecting a direction of the inline pixel with respect to the candidate blob contour pixel, and continuing to traverse the contour as a contour of the blob or detecting a second candidate blob contour pixel based on the detected direction.

Abstract: Methods and apparatus relating to improved SIMD (Single Instruction, Multiple Data) K-nearest-neighbors implementations are described. An embodiment provides a technique for improving SIMD implementations of the multidimensional K-Nearest-Neighbors (KNN) techniques. One embodiment replaces the non-SIMD friendly part of the KNN algorithm with a sequence of SIMD operations. For example, in order to avoid branches in the algorithm hotspot (e.g., the inner loop), SIMD operations may be used to update the list of nearest distances (and neighbors) after each iteration. Other embodiments are also disclosed and claimed.

Abstract: Systems and methods may provide for obtaining data associated with an image and using a plurality of threads in a graphics processor to conduct a single instruction multiple data (SIMD) scan of the data. Additionally, systems and methods may provide for generating a plurality of connection tables corresponding to the plurality of threads based on the SIMD scan. In one example, a plurality of threads in the graphics processor are used to conduct a single phase merge of the plurality of connection tables onto a global connected components labeling (CCL) table for the image.