Intel Corporation

Joshua B Fryman

Jason M Howard

Robert Pawlowski

Ankit More

Vincent Cave

Sriram Aananthakrishnan

Shaden Smith

Fabrizio Petrini

Ibrahim Hur

Allan Douglas Knies

Samkit Jain

Bharadwaj Krishnamurthy

Wim Heirman

Stijn Eyerman

Sowmya Pitchaimoorthy

Byoungchan Oh

Sergey Yuryevich Shumarayev

Edward Thomas Grochowski

Andrew Thomas Forsyth

David Pardo Keppel

Mohan Rajagopalan

Anwar Ghuloum

Tina C Zhong

Khaled Ahmed

Kristof Du Bois

Shruti Sharma

Michael Abbott

Sai Dheeraj Polagani

Scott Cline

Ivan Ganev

Naveen Neelakantam

James E Jaussi

David Stewart Dunning

Pooya Tadayon

Ravi Rajwar

Sebastian Schoenberg

Eric A Sprangle

Robert Conrad Knauerhase

Jianping Xu

Asit K Mishra

Brent Ralph Boswell

Ethan Schuchman

Roger Espasa

Ramacharan Sundararaman

Polychronis Xekalakis

Nicholas P Carter

Patrick P Lai

Jaroslaw Topp

John H Kelm

Denis M Khartikov

Demos Pavlou

Daniel S Klowden

John Cruz Mejia

Toni Juan

Gregor Stellpflug

Srikanth Dakshinamoorthy

Dong Hyuk Woo

Jing Fang

Sang Phill Park

Yigit Demir

Nick Pepperling

Scott Hagan Schmittel

Mirem Hyuseinova Seidahmedova

Banu Meenakshi Nagasundaram

Aditya Agrawal

William Paul Griffin

Vincent Cavé

Paul Griffin

Embodiments of apparatuses and methods for copying and operating on matrix elements are described. In embodiments, an apparatus includes a hardware instruction decoder to decode a single instruction and execution circuitry, coupled to hardware instruction decoder, to perform one or more operations corresponding to the single instruction. The single instruction has a first operand to reference a base address of a first representation of a source matrix and a second operand to reference a base address of second representation of a destination matrix. The one or more operations include copying elements of the source matrix to corresponding locations in the destination matrix and filling empty elements of the destination matrix with a single value.

Large-scale matrix restructuring and matrix-scalar operations

Memory requests are protected by encoding memory requests to include error correction codes. A subset of bits in a memory request are compared to a pre-defined pattern to determine whether the subset of bits matches a pre-defined pattern, where a match indicates that a compression can be applied to the memory request. The error correction code is generated for the memory request and the memory request is encoded to remove the subset of bits, add the error correction code, and add at least one metadata bit to the memory request to generate a protected version of the memory request, where the at least one metadata bit identifies whether the compression was applied to the memory request.

Low overhead error correction code

An apparatus comprising a chip comprising a plurality of micro-emitters, the micro-emitters to couple to a plurality of data lines and to an optical fiber, wherein the micro-emitters are to generate optical signals for parallel transmission through the optical fiber, the optical signals corresponding to data communicated on the data lines.

Pseudo-monolithic data communication system

Technologies for chip-to-chip optical data transfer are disclosed. In the illustrative embodiment, microLEDs on a first chip are used to send data to microphotodiodes on a second chip. The beams from the microLEDs may be sent to the microphotodiodes using an optical bridge, microprisms, a channel through a substrate, a channel defined in a substrate, etc. The microLEDs may be used for high-speed data transfer with low power usage. A chip may include a relatively large number of microLEDs and/or microphotodiodes, allowing for a large bandwidth connection. MicroLEDs and microphotodiodes may be used to connect different parts of the same chip, different chips on the same package, different packages on the same device, or different chips on different devices.

Technologies for chip-to-chip optical data transfer background

Examples described herein relate to a first group of core nodes to couple with a group of switch nodes and a second group of core nodes to couple with the group of switch nodes, wherein: a core node of the first or second group of core nodes includes circuitry to execute one or more message passing instructions that indicate a configuration of a network to transmit data toward two or more endpoint core nodes and a switch node of the group of switch nodes includes circuitry to execute one or more message passing instructions that indicate the configuration to transmit data toward the two or more endpoint core nodes.

In-network multicast operations

Techniques for operating on an indirect memory access instruction, where the instruction accesses a memory location via at least one indirect address. A pipeline processes the instruction and a memory operation engine generates a first access to the at least one indirect address and a second access to a target address determined by the at least one indirect address. A cache memory used with the pipeline and the memory operation engine caches pointers. In response to a cache hit when executing the indirect memory access instruction, operations dereference a pointer to obtain the at least one indirect address, not set a cache bit, and return data for the instruction without storing the data in the cache memory; and in response to a cache miss, operations set the cache bit, obtain, and store a cache line for a missed pointer, and return data without storing the data in the cache memory.

Cache support for indirect loads and indirect stores in graph applications

Systems, methods, and apparatuses for direct memory access instruction set architecture support for flexible dense compute using a reconfigurable spatial array are described. In one embodiment, a processor includes a first type of hardware processor core that includes a two-dimensional grid of compute circuits, a memory, and a direct memory access circuit coupled to the memory and the two-dimensional grid of compute circuits; and a second different type of hardware processor core that includes a decoder circuit to decode a single instruction into a decoded single instruction, the single instruction including a first field to identify a base address of two-dimensional data in the memory, a second field to identify a number of elements in each one-dimensional array of the two-dimensional data, a third field to identify a number of one-dimensional arrays of the two-dimensional data, a fourth field to identify an operation to be performed by the two-dimensional grid of compute circuits, and a fifth field to indicate the direct memory access circuit is to move the two-dimensional data indicated by the first field, the second field, and the third field into the two-dimensional grid of compute circuits and the two-dimensional grid of compute circuits is to perform the operation on the two-dimensional data according to the fourth field, and an execution circuit to execute the decoded single instruction according to the fields.

Circuitry and methods for direct memory access instruction set architecture support for flexible dense compute using a reconfigurable spatial array

In an embodiment, a processor comprises: an execution circuit to execute instructions; at least one cache memory coupled to the execution circuit; and a table storage element coupled to the at least one cache memory, the table storage element to store a plurality of entries each to store object metadata of an object used in a code sequence. The processor is to use the object metadata to provide user space multi-object transactional atomic operation of the code sequence. Other embodiments are described and claimed.

System, apparatus and method for user space object coherency in a processor

Disclosed embodiments relate to an improved memory system architecture for multi-threaded processors. In one example, a system includes a system comprising a multi-threaded processor core (MTPC), the MTPC comprising: P pipelines, each to concurrently process T threads; a crossbar to communicatively couple the P pipelines; a memory for use by the P pipelines, a scheduler to optimize reduction operations by assigning multiple threads to generate results of commutative arithmetic operations, and then accumulate the generated results, and a memory controller (MC) to connect with external storage and other MTPCs, the MC further comprising at least one optimization selected from: an instruction set architecture including a dual-memory operation; a direct memory access (DMA) engine; a buffer to store multiple pending instruction cache requests; multiple channels across which to stripe memory requests; and a shadow-tag coherency management unit.

Memory system architecture for multi-threaded processors

Methods, apparatus, systems and articles of manufacture to build a storage architecture for graph data are disclosed herein. Disclosed example apparatus include a neighbor identifier to identify respective sets of neighboring vertices of a graph. The neighboring vertices included in the respective sets are adjacent to respective ones of a plurality of vertices of the graph and respective sets of neighboring vertices are represented as respective lists of neighboring vertex identifiers. The apparatus also includes an element creator to create, in a cache memory, an array of elements that are unpopulated. The array elements have lengths equal to a length of a cache line. In addition, the apparatus includes an element populater to populate the elements with neighboring vertex identifiers. Each of the elements store neighboring vertex identifiers of respective ones of the list of neighboring vertex identifiers.

Storage architectures for graph analysis applications

Embodiments of apparatuses, methods, and systems for scheduling tasks to hardware threads are described. In an embodiment, a processor includes a multiple hardware threads and a task manager. The task manager is to issue a task to a hardware thread. The task manager includes a hardware task queue to store a descriptor for the task. The descriptor is to include a field to store a value to indicate whether the task is a single task, a collection of iterative tasks, and a linked list of tasks.

Multithreaded processor core with hardware-assisted task scheduling

An apparatus is described. The apparatus includes a rank of memory chips to couple to a memory channel. The memory channel is characterized as having eight transfers of eight bits of raw data per burst access. The rank of memory chips has first, second and third X4 memory chips. The X4 memory chips conform to a JEDEC dual data rate (DDR) memory interface specification. The first and second X4 memory chips are to couple to an eight bit raw data portion of the memory channel's data bus. The third X4 memory chip to couple to an error correction coding (ECC) information portion of the memory channel's data bus.

Memory rank design for a memory channel that is optimized for graph applications

In one embodiment, a first processor core includes: a plurality of execution pipelines each to execute instructions of one or more threads; a plurality of pipeline barrier circuits coupled to the plurality of execution pipelines, each of the plurality of pipeline barrier circuits associated with one of the plurality of execution pipelines to maintain status information for a plurality of barrier groups, each of the plurality of barrier groups formed of at least two threads; and a core barrier circuit to control operation of the plurality of pipeline barrier circuits and to inform the plurality of pipeline barrier circuits when a first barrier has been reached by a first barrier group of the plurality of barrier groups. Other embodiments are described and claimed.

System, apparatus and method for barrier synchronization in a multi-threaded processor

The present disclosure is directed to systems and methods of performing one or more broadcast or reduction operations using direct memory access (DMA) control circuitry. The DMA control circuitry executes a modified instruction set architecture (ISA) that facilitates the broadcast distribution of data to a plurality of destination addresses in system memory circuitry. The broadcast instruction may include broadcast of a single data value to each destination address. The broadcast instruction may include broadcast of a data array to each destination address. The DMA control circuitry may also execute a reduction instruction that facilitates the retrieval of data from a plurality of source addresses in system memory and performing one or more operations using the retrieved data. Since the DMA control circuitry, rather than the processor circuitry performs the broadcast and reduction operations, system speed and efficiency is beneficially enhanced.

Array broadcast and reduction systems and methods

Growing community of inventors

Sunnyvale, CA, United States of America

Joshua B Fryman