1.
    发明专利
    未知

    公开(公告)号:DE69831282T2

    公开(公告)日:2006-08-10

    申请号:DE69831282

    申请日:1998-02-05

    Applicant: IBM

    Abstract: The invention relates to the area of register renaming and allocation in superscalar computer systems. When a multitude of instructions in the instruction stream reads from or writes to a certain logical register, said logical register will have to be represented by a multitude of physical registers. Therefore, there have to exist several physical rename registers per logical register. The oldest one of said rename registers defines the architected state of the computer system, the in-order state. The invention provides a method for administration of the various register instances. Both the registers representing the in-order state and the various rename instances are kept in one common circular buffer. There exist two pointers per logical register: The first one, the in-order pointer, points to the register that represents the in-order state, the second one, the rename pointer, points to the most recent rename instance.

    3.
    发明专利
    未知

    公开(公告)号:DE69122860T2

    公开(公告)日:1997-04-03

    申请号:DE69122860

    申请日:1991-07-06

    Applicant: IBM

    Abstract: A multiplexer circuit is described which is built up from a series of smaller submultiplexers (241-247, 251-254). It selects a number of adjacent bits, bytes or words from one register and places them in the same order in a second register. The multiplexer can be used in cache memories or instruction buffers.

    4.
    发明专利
    未知

    公开(公告)号:DE69122860D1

    公开(公告)日:1996-11-28

    申请号:DE69122860

    申请日:1991-07-06

    Applicant: IBM

    Abstract: A multiplexer circuit is described which is built up from a series of smaller submultiplexers (241-247, 251-254). It selects a number of adjacent bits, bytes or words from one register and places them in the same order in a second register. The multiplexer can be used in cache memories or instruction buffers.

    Serialisation of operating requests in a multiprocessor system

    公开(公告)号:DE4307139A1

    公开(公告)日:1994-09-08

    申请号:DE4307139

    申请日:1993-03-06

    Applicant: IBM

    Abstract: A method of making processors (PU0 to Pn) of a multiprocessor system (MP) quiescent, or of serialising bus assignments for the individual processors, is described. This serialisation becomes necessary if one or more processors simultaneously want to execute commands which require uninterrupted ownership of the bus for as long as they are being executed, e.g. to prevent damage to the integrity of data. For this purpose, a quiescent-making network (QN), which connects all processors, is used. Processors which execute such atomic commands receive their bus assignment on a priority basis. The processor with the highest rank puts its competitors into conditional branch command loops (BC loops), in which they wait for a specified condition, e.g. "QN not blocked" (QU+). If this condition is fulfilled, e.g. after the end of an atomic command, the processor with the next lower priority receives the bus. Processors which are executing other commands are forced into a no-operation state (NOP), from which they are released after completion of the atomic command of another processor, to resume their interrupted commands.

Patent Agency Ranking