International Business Machines Corporation

Andre Pauporte

Gerald Lebizay

Jean-Marie L Munier

Victor Spagnol

Claude Basso

Jean M Munier

Claude R Galand

Jean L Calvignac

Didier F Giroir

Francois Kermarec

Daniel Mauduit

Clement Y Poiraud

Eric Saint-Georges

Michel A Lechaczynski

Francois Jacob

Haissam Alaiwan

Alvin P Mullery

Pierre Thery

Jacques-Louis Combes

Georges Gallet

Didier D d'Angeac

Jean-Marie Munier

Daniel G Mauduit

The object of the present invention is to improve the execution of instructions using speculative operations in Superscalar or Very Long Instruction Word (VLIW) processors having multiple Arithmetic Logic Units (ALUs). More particularly, the invention relates to a system and method for using standard registers as shadow registers. The addresses of all standard registers are translated using a Relocation Table (RT) array. The addresses of registers used as shadow registers are translated another time using a Speculative Registers Table (SRT) array. At branch completion time, for the speculative operations that have previously been executed and correctly predicted, the Relocation Table (RT) is updated with the Speculative Registers Table (SRT) content. For the speculative operations that have previously been executed and incorrectly predicted, the Relocation Table (RT) remains unchanged. The present invention performs the same function as processors using state of the art hardware shadow registers while using a limited number of read/write ports standard register array.

Speculative instructions exection in VLIW processors

A data transmission network congestion control mechanism requires knowledge of the sequence of occurrence of two dates d1 and d2, respectively defined by times t1 and t2 provided by a wraparound timer as respective numbers A and B coded in a 2's-complement form. Relative date discrimination is implemented by dividing the wraparound timer period into four consecutive intervals, each defined by the two most significant bits of the timer count. The value of the most significant bits and the sign of A-B, are used to derive a one-bit 'X' indicator, the binary value of which indicates which of the two dates d1 and d2 was first to occur.

Method and system for implementing relative time discriminations in a

The present invention relates to an efficient point-to-point and multi-points routing system and method for programmable data communication adapters in packet switching nodes of high speed networks. The general principles of this efficiency are the following:

Efficient point-to-point and multi-point routing mechanism for

A high performance data packet buffering method and a programmable data communication adapter for high speed packet transmission networks are disclosed. The line adapter includes programmable processing means, for receiving and transmitting data packets of fixed or variable length. This system is characterized in that it comprises

Programmable high performance data communication adapter for high speed

An elastic buffer is provided between two busses working with independent clocking. The buffer is implemented by a piece of RAM memory (37) partitioned into sectors (41), each of which contains successive memory addresses. Each sector (41), can be alternatively written and read, so that at a given moment, a sector in write mode and a sector in read mode may coexist. Each sector is controlled by a mark flag (MF), a set flag corresponding to a fully written sector, and a reset flag corresponding to a sector that has been read onto the destination bus. The mark flag of each sector is set, respectively reset, upon the event of a move in pointer, respectively move out pointer, reaching the next adjacent sector. For a given elastic buffer size, the size of the sectors (41) and the number of mark flags are adaptable to the specifications of the data flow between the origin and destination busses.

Elastic configurable buffer for buffering asynchronous data

A device which switches data processing from an active processor, about to fail, to a back-up processor includes a memory change detector which captures memory changes in the memory of the active processor and a mirroring control circuit which causes the memory changes when committed by establishing recovery point signals generated by the active processor to be dumped into the memory of the back-up processor so that the back-up processor resumes operation of the active processor from the last established recovery point.

Checkpointing mechanism for fault-tolerant systems

In a shared memory system, wherein several memory users MU wish access to a plurality of memory banks, a set of high level commands (CREATE, PUT, GET, RELEASE) is provided, to transfer data between a given memory user and the memory banks or another memory user. The high level commands sent by the memory users are built up by memory interfaces MI connected to the memory users, and transmitted through an interconnection network to Packet Memory Command Executors PMCE integrated into each memory bank. The high level commands work with data records identified by Logical Record Addresses (LRA) known by the memory users. During execution of the high level commands by the PMCE, the LRA are translated into physical addresses corresponding to physical address space in the memory banks. The physical address space is created dynamically and released upon need, through the Create or Release Commands. A given memory user is not involved at all by management of physical address space, and works only with the LRA of a record.

Interface for independently establishing a link and transmitting high

A non-locking queueing mechanism is described for transferring information from a sending unit to a receiving unit through a queue in which there is no interference between the independent units (sender and receiver) during enqueueing or dequeueing. The invention thus avoids any form of interlock or serialism. The mechanism includes a first pointer (D), identifying the element area in the queueing device where the last dequeued information element, if any, was located, and a second pointer register for logging a second pointer (E) identifying the element area in the queueing device where the last enqueued information element, if any, was located, a first control block activated by the sending unit to enqueue the information element into the queueing device and for updating the second pointer, and a second control block activated by the recieving unit to dequeue the information element from the queueing device and for updating the first pointer.

Non-locking queueing mechanism for enabling a receiver device to read

A device for loading data in and reading data out of latch strings located in field replaceable units containing the circuitry of a data processing system realized in accordance with the Level-Scan Sensitive Design (LSSD) technique. Each field replaceable unit includes an addressing circuit. The addressing circuits are interconnected by a monitoring loop over which a configuration of address bits is serially transmitted by a control circuit. The data to be loaded and read out propagate in a data loop and are entered in a latch string under control of the addressing circuit.

Growing community of inventors

La Colle Sur Loup, France

Andre Pauporte