Kalray

Stmicroelectronics S.a.

Benoît Dupont De Dinechin

Michel Harrand

Patrice Couvert

Nicolas Brunie

Vincent Ray

Yves Durand

Alexandre Blampey

Thomas Champseix

Marta Rybczynska

Pierre Guironnet De Massas

Julien Le Maire

Renaud Ayrignac

Florent Dupont De Dinechin

Duco Van Amstel

Arnaud Odinot

An inter-processor synchronization method using point-to-point links, comprises the steps of defining a point-to-point synchronization channel between a source processor and a target processor; executing in the source processor a wait command expecting a notification associated with the synchronization channel, wherein the wait command is designed to stop the source processor until the notification is received; executing in the target processor a notification command designed to transmit through the point-to-point link the notification expected by the source processor; executing in the target processor a wait command expecting a notification associated with the synchronization channel, wherein the wait command is designed to stop the target processor until the notification is received; and executing in the source processor a notification command designed to transmit through the point-to-point link the notification expected by the target processor.

Inter-processor synchronization system

A processor including multiple processing units for processing multiple elementary instructions in parallel, the elementary instructions including one or more syllables, each having a rank in the elementary instruction, and an input circuit configured to receive an instruction bundle including multiple elementary instructions, and to transmit to the processing units all syllables of first rank of the elementary instructions of the instruction bundle before syllables of second rank of the elementary instructions of the instruction bundle, the syllables of same rank being ordered according to the target processing unit of each syllable.

VLIW type instruction packet structure and processor suitable for processing such an instruction packet

The invention relates to a processor comprising, in its instruction set, a bit matrix multiplication instruction (sbmm) having a first double precision operand (A) representing a first matrix to multiply, a second operand (B) explicitly designating any two single precision registers whose joint contents represent a second matrix to multiply, and a destination parameter (C) explicitly designating any two single precision registers for jointly containing a matrix representing the result of the multiplication.

Bit-matrix multiplication using explicit register

A method for synchronizing multiple processing units, comprises the steps of configuring a synchronization register in a target processing unit so that its content is overwritten only by bits that are set in words written in the synchronization register; assigning a distinct bit position of the synchronization register to each processing unit; and executing a program thread in each processing unit. When the program thread of a current processing unit reaches a synchronization point, the method comprises writing in the synchronization register of the target processing unit a word in which the bit position assigned to the current processing unit is set, and suspending the program thread. When all the bits assigned to the processing units are set in the synchronization register, the suspended program threads are resumed.

Hardware synchronization barrier between processing units

A credit-based data flow control method between a consumer device and a producer device. The method includes the steps of decrementing a credit counter for each transmission of a sequence of data by the producer device, arresting data transmission when the credit counter reaches zero, sending a credit each time the consumer device has consumed a data sequence and incrementing the credit counter upon receipt of each credit.

Stream management in an on-chip network

A method for determining, by means of a circuit, a result sof an operation of the type where s, a, and aare fractional signed operands and symbol represents a saturating addition operation, comprising: a step of calculation of three sums representative of a possible value of the result, and a step of selection of one of said three sums according to overflows having occurred in the sum calculation. At least one step of the method uses the positive part and the negative part of at least one of the operands.

Growing community of inventors

Grenoble, France

Benoît Dupont De Dinechin