Method and apparatus for partitioning a resource between multiple threads within a multi-threaded processor

    公开(公告)号:GB2377529B

    公开(公告)日:2004-10-27

    申请号:GB0224460

    申请日:2001-01-16

    Applicant: INTEL CORP

    Abstract: A method of partitioning a memory resource, associated with a multi-threaded processor, includes defining the memory resource to include first and second portions that are dedicated to the first and second threads respectively. A third portion of the memory resource is then designated as being shared between the first and second threads. Upon receipt of an information item, (e.g., a microinstruction associated with the first thread and to be stored in the memory resource), a history of Least Recently Used (LRU) portions is examined to identify a location in either the first or the third portion, but not the second portion, as being a least recently used portion. The second portion is excluded from this examination on account of being dedicated to the second thread. The information item is then stored within a location, within either the first or the third portion, identified as having been least recently used.

    Method and apparatus for partitioning a resource between multiple threads within a multi-threaded processor

    公开(公告)号:GB2377529A

    公开(公告)日:2003-01-15

    申请号:GB0224460

    申请日:2001-01-16

    Applicant: INTEL CORP

    Abstract: A method of partitioning a memory resource, associated with a multi-threaded processor, includes defining the memory resource to include first and second portions that are dedicated to the first and second threads respectively. A third portion of the memory resource is then designated as being shared between the first and second threads. Upon receipt of an information item, (e.g., a microinstruction associated with the first thread and to be stored in the memory resource), a history of Least Recently Used (LRU) portions is examined to identify a location in either the first or the third portion, but not the second portion, as being a least recently used portion. The second portion is excluded from this examination on account of being dedicated to the second thread.

    Faster address calculation in a pipelined microprocessor

    公开(公告)号:GB2261087A

    公开(公告)日:1993-05-05

    申请号:GB9222512

    申请日:1992-10-27

    Applicant: INTEL CORP

    Abstract: A processor includes a mechanism in which logical addresses are translated into physical addresses by a translation lookaside buffer (TLB) 11 within one clock cycle. This is achieved by the TLB translation being performed in parallel with the calculation of the effective address, the effective address being calculated by a "base-plus-displacement/offset" computation. Such a computation usually does not cross a page boundary, that is, the upper 20 bits, which correspond to the logical page number, are the same after the add. Therefore, only the upper 20 bits of the logical address are translated by the TLB, since it is assumed that these will not change. After the add, if the upper 20 bits did not change, then the 20 physical address bits from the TLB plus the lower 12 bits from the address computation are concatenated to produce the complete correct 32-bit physical address within a single clock cycle. If, however, the upper 20 bits did not change then a signal is generated which enables the translation using the correct logical address, as computed by the effective address generation hardware, to be performed.

    Dynamic partial power down of memory-side cache in a 2-level memory hierarchy

    公开(公告)号:GB2510760A

    公开(公告)日:2014-08-13

    申请号:GB201408834

    申请日:2011-12-20

    Applicant: INTEL CORP

    Abstract: A system and method are described for flushing a specified region of a memory side cache (MSC) within a multi-level memory hierarchy. For example, a computer system according to one embodiment comprises: a memory subsystem comprised of a non-volatile system memory and a volatile memory side cache (MSC) for caching portions of the non-volatile system memory; and a flush engine for flushing a specified region of the MSC to the non-volatile system memory in response to a deactivation condition associated with the specified region of the MSC.

    Method and apparatus for partitioning a resource between multiple threads withina multi-threaded processor

    公开(公告)号:AU2956701A

    公开(公告)日:2001-10-23

    申请号:AU2956701

    申请日:2001-01-16

    Applicant: INTEL CORP

    Abstract: A method of partitioning a memory resource, associated with a multi-threaded processor, includes defining the memory resource to include first and second portions that are dedicated to the first and second threads respectively. A third portion of the memory resource is then designated as being shared between the first and second threads. Upon receipt of an information item, (e.g., a microinstruction associated with the first thread and to be stored in the memory resource), a history of Least Recently Used (LRU) portions is examined to identify a location in either the first or the third portion, but not the second portion, as being a least recently used portion. The second portion is excluded from this examination on account of being dedicated to the second thread. The information item is then stored within a location, within either the first or the third portion, identified as having been least recently used.

    29.
    发明专利
    未知

    公开(公告)号:DE3716229C2

    公开(公告)日:1996-08-14

    申请号:DE3716229

    申请日:1987-05-14

    Applicant: INTEL CORP

    Abstract: A plurality of global registers are provided on the microprocessor chip. One of a global registers is a frame pointer register containing the current frame pointer, and the remainder of the global registers are available to a current process as general registers. A plurality of floating point registers are also provided for use by the current process in execution of floating point arithmetic operations. A register set pool made up of a plurality of register sets is provided, each register set being comprised of a number of local registers. When a call instruction is decoded, a register set of local registers from the register set pool is allocated to the called procedure, and the frame pointer register is initialized. When a return instruction is decoded, the register set is freed for allocation to another procedure called by a subsequent call instruction. If the register set pool is depleted a register set associated with a previous procedure is saved in the main memory, and that register set is allocated to the current procedure. The local registers in a register set associated with a procedure contain linkage information including a pointer to the previous frame and an instruction pointer, thus enabling most call and return instructions to execute without needing any references to off-chip memory.

Patent Agency Ranking