WO2001016722A1 - Branch instruction for processor - Google Patents

Branch instruction for processor Download PDF

Info

Publication number
WO2001016722A1
WO2001016722A1 PCT/US2000/023994 US0023994W WO0116722A1 WO 2001016722 A1 WO2001016722 A1 WO 2001016722A1 US 0023994 W US0023994 W US 0023994W WO 0116722 A1 WO0116722 A1 WO 0116722A1
Authority
WO
WIPO (PCT)
Prior art keywords
branch
instruction
register
specified
bit
Prior art date
Application number
PCT/US2000/023994
Other languages
French (fr)
Inventor
Gilbert Wolrich
Matthew J. Adiletta
William Wheeler
Debra Bernstein
Donald Hooper
Original Assignee
Intel Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Intel Corporation filed Critical Intel Corporation
Priority to CA002383528A priority Critical patent/CA2383528C/en
Priority to AU70985/00A priority patent/AU7098500A/en
Priority to US10/069,195 priority patent/US7421572B1/en
Priority to EP00959712A priority patent/EP1236097A4/en
Publication of WO2001016722A1 publication Critical patent/WO2001016722A1/en
Priority to HK02108083.9A priority patent/HK1046566A1/en
Priority to HK03102109.1A priority patent/HK1049902B/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003—Arrangements for executing specific machine instructions
    • G06F9/30007—Arrangements for executing specific machine instructions to perform operations on data operands
    • G06F9/30036—Instructions to perform operations on packed data, e.g. vector, tile or matrix operations
    • G06F9/30038—Instructions to perform operations on packed data, e.g. vector, tile or matrix operations using a mask
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003—Arrangements for executing specific machine instructions
    • G06F9/3004—Arrangements for executing specific machine instructions to perform operations on memory
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003—Arrangements for executing specific machine instructions
    • G06F9/3005—Arrangements for executing specific machine instructions to perform operations for flow control
    • G06F9/30058—Conditional branch instructions
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003—Arrangements for executing specific machine instructions
    • G06F9/30076—Arrangements for executing specific machine instructions to perform miscellaneous control operations, e.g. NOP
    • G06F9/30087—Synchronisation or serialisation instructions
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30145—Instruction analysis, e.g. decoding, instruction word fields
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30145—Instruction analysis, e.g. decoding, instruction word fields
    • G06F9/3016—Decoding the operand specifier, e.g. specifier format
    • G06F9/30167—Decoding the operand specifier, e.g. specifier format of immediate specifier, e.g. constants
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/32—Address formation of the next instruction, e.g. by incrementing the instruction counter
    • G06F9/321—Program or instruction counter, e.g. incrementing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/38—Concurrent instruction execution, e.g. pipeline or look ahead
    • G06F9/3824—Operand accessing
    • G06F9/3834—Maintaining memory consistency
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/38—Concurrent instruction execution, e.g. pipeline or look ahead
    • G06F9/3836—Instruction issuing, e.g. dynamic instruction scheduling or out of order instruction execution
    • G06F9/3842—Speculative instruction execution
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/38—Concurrent instruction execution, e.g. pipeline or look ahead
    • G06F9/3836—Instruction issuing, e.g. dynamic instruction scheduling or out of order instruction execution
    • G06F9/3851—Instruction issuing, e.g. dynamic instruction scheduling or out of order instruction execution from multiple instruction streams, e.g. multistreaming

Definitions

  • Parallel processing is an efficient form of information processing of concurrent events in a computing process.
  • Parallel processing demands concurrent execution of many programs in a computer.
  • Sequential processing or serial processing has all tasks performed sequentially at a single station whereas, pipelined processing has tasks performed at specialized stations.
  • Computer code whether executed in parallel processing, pipelined or sequential processing machines involves branches in which an instruction stream may execute in a sequence and branch from the sequence to a different sequence of instructions.
  • FIG. 1 is a block diagram of a communication system employing a processor.
  • FIG. 2 is a detailed block diagram of the processor.
  • FIG. 3 is a block diagram of a microengine used in the processor of FIGS. 1 and 2.
  • FIG. 4 is a diagram of a pipeline in the microengine.
  • FIG. 5 shows exemplary formats for branch instructions.
  • FIG. 6 is a block diagram of general purpose registers.
  • a communication system 10 includes a processor 12.
  • the processor is a hardware-based multithreaded processor 12.
  • the processor 12 is coupled to a bus such as a PCI bus 14, a memory system 16 and a second bus 18.
  • the system 10 is especially useful for tasks that can be broken into parallel sub- tasks or functions.
  • hardware-based multithreaded processor 12 is useful for tasks that are bandwidth oriented rather than latency oriented.
  • the hardware-based multithreaded processor 12 has multiple microengines 22 each with multiple hardware controlled threads that can be simultaneously active and independently work on a task.
  • the hardware-based multithreaded processor 12 also includes a central controller 20 that assists in loading microcode control for other resources of the hardware-based multithreaded processor 12 and performs other general purpose computer type functions such as handling protocols, exceptions, extra support for packet processing where the microengines pass the packets off for more detailed processing such as in boundary conditions.
  • the processor 20 is a Strong Arm ® (Arm is a trademark of ARM Limited, United Kingdom) based architecture.
  • the general purpose microprocessor 20 has an operating system. Through the operating system the processor 20 can call functions to operate on microengines 22a-22f.
  • the processor 20 can use any supported operating system preferably a real time operating system.
  • operating systems such as, MicrosoftNT ® real-time, VXWorks and OCUS, a freeware operating system available over the Internet, can be used.
  • the hardware-based multithreaded processor 12 also includes a plurality of function microengines 22a-22f.
  • Functional microengines (microengines) 22a-22f each maintain a plurality of program counters in hardware and states associated with the program counters. Effectively, a corresponding plurality of sets of threads can be simultaneously active on each of the microengines 22a-22f while only one is actually operating at any one time.
  • Microengines 22a-22f each have capabilities for processing four hardware threads.
  • the microengines 22a-22f operate with shared resources including memory system 16 and bus interfaces 24 and 28.
  • the memory system 16 includes a Synchronous Dynamic Random Access Memory (SDRAM) controller 26a and a Static Random Access Memory (SRAM) controller 26b.
  • SDRAM Synchronous Dynamic Random Access Memory
  • SRAM Static Random Access Memory
  • SDRAM memory 16a and SDRAM controller 26a are typically used for processing large volumes of data, e.g., processing of network payloads from network packets.
  • the SRAM controller 26b and SRAM memory 16b are used in, e.g., networking packet processing, postscript processor, or as a processor for a storage subsystem, i.e., RAID disk storage, or for low latency, fast access tasks, e.g., accessing look-up tables, memory for the core processor 20, and so forth.
  • the processor 12 includes a bus interface 28 that couples the processor to the second bus 18.
  • Bus interface 28 in one embodiment couples the processor 12 to the so-called FBUS 18 (FIFO bus).
  • the processor 12 includes a second interface e.g., a PCI bus interface 24 that couples other system components that reside on the PCI 14 bus to the processor 12.
  • the PCI bus interface 24 provides a high speed data path 24a to the SDRAM memory 16a. Through that path data can be moved quickly from the SDRAM 16a through the PCI bus 14, via direct memory access (DMA) transfers.
  • DMA direct memory access
  • the hardware-based multithreaded processor 12 also is constructed such that the sum of the bandwidths of the internal buses in the processor 12 exceed the bandwidth of external buses coupled to the processor 12.
  • the processor 12 includes an internal core processor bus 32, e.g., an ASB bus (Advanced System Bus) that couples the processor core 20 to the memory controller 26a, 26c and to an ASB translator 30 described below.
  • the ASB bus is a subset of the so called AMBA bus that is used with the Strong Arm processor core.
  • the processor 12 also includes a private bus 34 that couples the microengine units to SRAM controller 26b, ASB translator 30 and FBUS interface 28.
  • a memory bus 38 couples the memory controller 26a, 26b to the bus interfaces 24 and 28 and memory system 16 including flashrom 16c used for boot operations and so forth.
  • each of the microengines 22a-22f includes an arbiter that examines flags to determine the available threads to be operated upon. Any thread from any of the microengines 22a-22f can access the SDRAM controller 26a, SDRAM controller 26b or FBUS interface 28.
  • the memory controllers 26a and 26b each include a plurality of queues to store outstanding memory reference requests.
  • the FBUS interface 28 supports Transmit and Receive flags for each port that a MAC device supports, along with an Interrupt flag indicating when service is warranted.
  • the FBUS interface 28 also includes a controller 28a that performs header processing of incoming packets from the FBUS 18. The controller 28a extracts the packet headers and performs a microprogrammable source/destination/protocol hashed lookup (used for address smoothing) in SRAM.
  • the core processor 20 accesses the shared resources.
  • the core processor 20 has a direct communication to the SDRAM controller 26a to the bus interface 24 and to SRAM controller 26b via bus 32.
  • the core processor 20 access the microengines 22a-22f via the ASB Translator 30 over bus 34.
  • the ASB translator 30 can physically reside in the FBUS interface 28, but logically is distinct.
  • the ASB Translator 30 performs an address translation between FBUS microengine transfer register locations and core processor addresses (i.e., ASB bus) so that the core processor 20 can access registers belonging to the microengines 22a-22c.
  • a scratchpad memory 27 is also provided to permit microengines to write data out to the memory for other microengines to read.
  • the scratchpad 27 is coupled to bus 34.
  • the processor core 20 includes a RISC core 50 implemented in a five stage pipeline performing a single cycle shift of one operand or two operands in a single cycle, provides multiplication support and 32 bit barrel shift support.
  • This RISC core 50 is a standard Strong Arm® architecture but it is implemented with a five stage pipeline for performance reasons.
  • the processor core 20 also includes a 16 kilobyte instruction cache 52, an 8 kilobyte data cache 54 and a prefetch stream buffer 56.
  • the core processor 20 performs arithmetic operations in parallel with memory writes and instruction fetches.
  • the core processor 20 interfaces with other functional units via the ARM defined ASB bus.
  • the ASB bus is a 32-bit bi-directional bus 32.
  • an exemplary microengine 22f includes a control store 70 that includes a RAM which stores a microprogram. The microprogram is loadable by the core processor 20.
  • the microengine 22f also includes controller logic 72.
  • the controller logic includes an instruction decoder 73 and program counter (PC) units 72a- 72d.
  • the four micro program counters 72a-72d are maintained in hardware.
  • the microengine 22f also includes context event switching logic 74.
  • Context event logic 74 receives messages (e.g., SEQ_#_EVENT_RESPONSE; FBI_EVENT_RESPONSE; SRAM _EVENT_RESPONSE; SDRAM _EVENT_RESPONSE; and ASB _EVENT_RESPONSE) from each one of the shared resources, e.g., SRAM 26a, SDRAM 26b, or processor core 20, control and status registers, and so forth. These messages provide information on whether a requested function has completed. Based on whether or not a function requested by a thread has completed and signaled completion, the thread needs to wait for that completion signal, and if the thread is enabled to operate, then the thread is placed on an available thread list (not shown).
  • the microengine 22f can have a maximum of e.g., 4 threads available.
  • the microengmes 22 employ signaling states that are global. With signaling states, an executing thread can broadcast a signal state to all microengines 22. Receive Request or Available signal, any and all threads in the microengines can branch on these signaling states. These signaling states can be used to determine availability of a resource or whether a resource is due for servicing.
  • the context event logic 74 has arbitration for the four (4) threads. In one embodiment, the arbitration is a round robin mechanism. Other techniques could be used including priority queuing or weighted fair queuing.
  • the microengine 22f also includes an execution box (EBOX) data path 76 that includes an arithmetic logic unit 76a and general purpose register set 76b.
  • the arithmetic logic unit 76a performs arithmetic and logical functions as well as shift functions.
  • the arithmetic logic unit includes condition code bits that are used by instructions described below.
  • the registers set 76b has a relatively large number of general purpose registers that are windowed as will be described so that they are relatively and absolutely addressable.
  • the microengine 22f also includes a write transfer register stack 78 and a read transfer stack 80. These registers are also windowed so that they are relatively and absolutely addressable.
  • Write transfer register stack 78 is where write data to a resource is located.
  • read register stack 80 is for return data from a shared resource. Subsequent to or concurrent with data arrival, an event signal from the respective shared resource e.g., the SRAM controller 26a, SDRAM controller 26b or core processor 20 will be provided to context event arbiter 74 which will then alert the thread that the data is available or has been sent.
  • Both transfer register banks 78 and 80 are connected to the execution box (EBOX) 76 through a data path.
  • the microengine datapath maintains a 5 -stage micropipeline 82.
  • This pipeline includes lookup of microinstruction words 82a, formation of the register file addresses 82b, read of operands from register file 82c, ALU, shift or compare operations 82d, and write-back of results to registers 82e.
  • the microengine can perform a simultaneous register file read and write, which completely hides the write operation.
  • the instruction set supported in the microengines 22a-22f support conditional branches.
  • the worst case conditional branch latency occurs when the branch decision is a result of condition codes being set by the previous microcontrol instruction.
  • the latency is shown below in Table 1 : TABLE 1
  • nx is pre-branch microword (nl sets cc's)
  • cb is conditional branch
  • bx is post-branch microword
  • XX is an aborted microword
  • the microengines support selectable deferred branches. Selectable deferring branches are when a microengine allows 1 or 2 micro instructions after the branch to execute before the branch takes effect (i.e. the effect of the branch is "deferred” in time). Thus, if useful work can be found to fill the wasted cycles after the branch microword, then the branch latency can be hidden.
  • a 2-cycle deferred branch is shown in TABLE 3 where n2 and n3 are both allowed to complete before the branch to bl occurs. Note that a 2-cycle branch deferment is only allowed when the condition codes are set on the microword preceding the branch.
  • the microengines also support condition code evaluation. If the condition codes upon which a branch decision are made are set 2 or more microwords before the branch, then 1 cycle of branch latency can be eliminated because the branch decision can be made 1 cycle earlier as in Table 4. TABLE 4 I 1 I 2
  • nl sets the condition codes and n2 does not set the conditions codes. Therefore, the branch decision can be made at cycle 4 (rather than 5), to eliminate 1 cycle of branch latency.
  • the 1 -cycle branch deferment and early setting of condition codes are combined to completely hide the branch latency. That is, the condition codes (cc's) are set 2 cycles before a 1 -cycle deferred branch.
  • the microengine supports branch guessing which attempts to reduce the 1 cycle of exposed branch latency that remains. By "guessing" the branch path or the sequential path, the microsequencer pre-fetches the guessed path 1 cycle before it definitely knows what path to execute. If it guessed correctly, 1 cycle of branch latency is eliminated as shown in Table 6. TABLE 6 guess branch taken /branch is taken
  • the microengine can combine branch guessing with 1 -cycle branch deferment to improve the result further.
  • For guess branch taken with 1 -cycle deferred branch/branch is taken is in Table 10.
  • microcode correctly guesses a branch NOT taken then the pipeline flows sequentially in the normal unperturbed case. If microcode incorrectly guesses branch NOT taken, the microengine again exposes 1 cycle of unproductive execution as shown in Table 12.
  • the microengines 22a-22f support various branch instructions such as those that branch on condition codes. In addition, the microengines also support branch instructions that branch on any specified bit being set or cleared.
  • This class of branch instructions allows a programmer to specify which bit of a register to use as a branch control bit.
  • the instruction format includes a bit_position field that specifies the bit position in a longword. Valid bit postions in this implementation are bits 0:31.
  • the branch target is a label specified in the instruction.
  • branch instruction requires that the processor shift bits into a control path where the processor has condition codes from an ALU and then performs the branch operation.
  • This branch instruction allows observability of branch codes.
  • the branches can be controlled from the data path of the processor.
  • BRJ3CLR, BR_BSET are branch instructions that branch to an instruction at a specified label when a specified bit of a register specified by the instruction is cleared or set. These instructions set the condition codes.
  • the field reg A is an address of a context-relative transfer register or general-purpose register that holds the operand.
  • the field bit_position A is a number that specifies a bit position in a longword. Bit 0 is the least significant bit. Valid bit_position values are 0 through 31.
  • the field label# is a symbolic label corresponding to the address of an instruction to branch to.
  • the value optional_token can have several values. The value is selected by the programmer based on programming considerations.
  • the tokens can be:
  • Defer 1 which execute the instruction following the branch instruction before performing the branch operation.
  • Defer 2 which executes two instructions following the branch instruction before performing the branch operation. (In some implementations this may not be allowed with guess branch.)
  • Defer 3 which executes three instructions following the branch instruction before performing the branch operation. (In some implementations this may not be allowed with guess branch.)
  • Another token can be "guess_branch” which causes the branch instruction to prefetche the instruction for the "branch taken" condition rather than the next sequential instruction.
  • This token guess_branch can be used with the defer token, e.g., defer 1 to improve performance. In some architectures this might not be allowed with defer 2 or defer 3.
  • the two register address spaces that exist are Locally accessibly registers, and Globally accessible registers accessible by all microengines.
  • Each bank is capable of performing a simultaneous read and write to two different words within its bank.
  • the register set 76b is also organized into four windows 76b 0 -76b 3 of 32 registers that are relatively addressable per thread.
  • thread_0 will find its register 0 at 77a (register 0)
  • the thread_l will find its register_0 at 77b (register 32)
  • thread_2 will find its register_0 at 77c (register 64)
  • thread_3 at 77d (register 96).
  • Relative addressing is supported so that multiple threads can use the exact same control store and locations but access different windows of register and perform different functions.
  • the use of register window addressing and bank addressing provide the requisite read bandwidth while using only dual ported RAMS in the microengine 22f. These windowed registers do not have to save data from context switch to context switch so that the normal push and pop of a context swap file or stack is eliminated. Context switching here has a 0 cycle overhead for changing from one context to another.
  • Relative register addressing divides the register banks into windows across the address width of the general purpose register set. Relative addressing allows access any of the windows relative to the starting point of the window. Absolute addressing is also supported in this architecture where any one of the absolute registers may be accessed by any of the threads by providing the exact address of the register.
  • Addressing of general purpose registers 78 can occur in 2 modes depending on the microword format. The two modes are absolute and relative. In absolute mode, addressing of a register address is directly specified in 7-bit source field (a6-a0 or b6-b0), as shown in Table 14:
  • a GPR I a4
  • a4 0
  • b4 0

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Multimedia (AREA)
  • Advance Control (AREA)
  • Multi Processors (AREA)
  • Executing Machine-Instructions (AREA)
  • Debugging And Monitoring (AREA)
  • Image Processing (AREA)
  • Stored Programmes (AREA)
  • Document Processing Apparatus (AREA)
  • Memory System Of A Hierarchy Structure (AREA)
  • Harvester Elements (AREA)
  • Control Of Transmission Device (AREA)
  • Fittings On The Vehicle Exterior For Carrying Loads, And Devices For Holding Or Mounting Articles (AREA)

Abstract

A processor such as a parallel hardware-based multithreaded processor (12) is described. The processor (12) can execute a computer instruction that is a branch instruction that causes an instruction sequence in the processor to branch on any specified bit of a register (80, 78, 76b) being set or cleared and which specifies which bit of the specified register to use as a branch control bit.

Description

BRANCH INSTRUCTION FOR PROCESSOR
BACKGROUND This invention relates to branch instructions. Parallel processing is an efficient form of information processing of concurrent events in a computing process. Parallel processing demands concurrent execution of many programs in a computer. Sequential processing or serial processing has all tasks performed sequentially at a single station whereas, pipelined processing has tasks performed at specialized stations. Computer code whether executed in parallel processing, pipelined or sequential processing machines involves branches in which an instruction stream may execute in a sequence and branch from the sequence to a different sequence of instructions.
BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a block diagram of a communication system employing a processor.
FIG. 2 is a detailed block diagram of the processor.
FIG. 3 is a block diagram of a microengine used in the processor of FIGS. 1 and 2. FIG. 4 is a diagram of a pipeline in the microengine.
FIG. 5 shows exemplary formats for branch instructions. FIG. 6 is a block diagram of general purpose registers.
DESCRIPTION Referring to FIG. 1, a communication system 10 includes a processor 12.
In one embodiment, the processor is a hardware-based multithreaded processor 12. The processor 12 is coupled to a bus such as a PCI bus 14, a memory system 16 and a second bus 18. The system 10 is especially useful for tasks that can be broken into parallel sub- tasks or functions. Specifically hardware-based multithreaded processor 12 is useful for tasks that are bandwidth oriented rather than latency oriented. The hardware-based multithreaded processor 12 has multiple microengines 22 each with multiple hardware controlled threads that can be simultaneously active and independently work on a task. The hardware-based multithreaded processor 12 also includes a central controller 20 that assists in loading microcode control for other resources of the hardware-based multithreaded processor 12 and performs other general purpose computer type functions such as handling protocols, exceptions, extra support for packet processing where the microengines pass the packets off for more detailed processing such as in boundary conditions. In one embodiment, the processor 20 is a Strong Arm® (Arm is a trademark of ARM Limited, United Kingdom) based architecture. The general purpose microprocessor 20 has an operating system. Through the operating system the processor 20 can call functions to operate on microengines 22a-22f. The processor 20 can use any supported operating system preferably a real time operating system. For the core processor implemented as a Strong Arm architecture, operating systems such as, MicrosoftNT® real-time, VXWorks and OCUS, a freeware operating system available over the Internet, can be used.
The hardware-based multithreaded processor 12 also includes a plurality of function microengines 22a-22f. Functional microengines (microengines) 22a-22f each maintain a plurality of program counters in hardware and states associated with the program counters. Effectively, a corresponding plurality of sets of threads can be simultaneously active on each of the microengines 22a-22f while only one is actually operating at any one time. Microengines 22a-22f each have capabilities for processing four hardware threads. The microengines 22a-22f operate with shared resources including memory system 16 and bus interfaces 24 and 28. The memory system 16 includes a Synchronous Dynamic Random Access Memory (SDRAM) controller 26a and a Static Random Access Memory (SRAM) controller 26b. SDRAM memory 16a and SDRAM controller 26a are typically used for processing large volumes of data, e.g., processing of network payloads from network packets. The SRAM controller 26b and SRAM memory 16b are used in, e.g., networking packet processing, postscript processor, or as a processor for a storage subsystem, i.e., RAID disk storage, or for low latency, fast access tasks, e.g., accessing look-up tables, memory for the core processor 20, and so forth. The processor 12 includes a bus interface 28 that couples the processor to the second bus 18. Bus interface 28 in one embodiment couples the processor 12 to the so-called FBUS 18 (FIFO bus). The processor 12 includes a second interface e.g., a PCI bus interface 24 that couples other system components that reside on the PCI 14 bus to the processor 12. The PCI bus interface 24, provides a high speed data path 24a to the SDRAM memory 16a. Through that path data can be moved quickly from the SDRAM 16a through the PCI bus 14, via direct memory access (DMA) transfers.
Each of the functional units are coupled to one or more internal buses. The internal buses are dual, 32 bit buses (i.e., one bus for read and one for write). The hardware-based multithreaded processor 12 also is constructed such that the sum of the bandwidths of the internal buses in the processor 12 exceed the bandwidth of external buses coupled to the processor 12. The processor 12 includes an internal core processor bus 32, e.g., an ASB bus (Advanced System Bus) that couples the processor core 20 to the memory controller 26a, 26c and to an ASB translator 30 described below. The ASB bus is a subset of the so called AMBA bus that is used with the Strong Arm processor core. The processor 12 also includes a private bus 34 that couples the microengine units to SRAM controller 26b, ASB translator 30 and FBUS interface 28. A memory bus 38 couples the memory controller 26a, 26b to the bus interfaces 24 and 28 and memory system 16 including flashrom 16c used for boot operations and so forth.
Referring to FIG. 2, each of the microengines 22a-22f includes an arbiter that examines flags to determine the available threads to be operated upon. Any thread from any of the microengines 22a-22f can access the SDRAM controller 26a, SDRAM controller 26b or FBUS interface 28. The memory controllers 26a and 26b each include a plurality of queues to store outstanding memory reference requests. The FBUS interface 28 supports Transmit and Receive flags for each port that a MAC device supports, along with an Interrupt flag indicating when service is warranted. The FBUS interface 28 also includes a controller 28a that performs header processing of incoming packets from the FBUS 18. The controller 28a extracts the packet headers and performs a microprogrammable source/destination/protocol hashed lookup (used for address smoothing) in SRAM.
The core processor 20 accesses the shared resources. The core processor 20 has a direct communication to the SDRAM controller 26a to the bus interface 24 and to SRAM controller 26b via bus 32. However, to access the microengines 22a-22f and transfer registers located at any of the microengines 22a-22f, the core processor 20 access the microengines 22a-22f via the ASB Translator 30 over bus 34. The ASB translator 30 can physically reside in the FBUS interface 28, but logically is distinct. The ASB Translator 30 performs an address translation between FBUS microengine transfer register locations and core processor addresses (i.e., ASB bus) so that the core processor 20 can access registers belonging to the microengines 22a-22c.
Although microengines 22 can use the register set to exchange data as described below, a scratchpad memory 27 is also provided to permit microengines to write data out to the memory for other microengines to read. The scratchpad 27 is coupled to bus 34.
The processor core 20 includes a RISC core 50 implemented in a five stage pipeline performing a single cycle shift of one operand or two operands in a single cycle, provides multiplication support and 32 bit barrel shift support. This RISC core 50 is a standard Strong Arm® architecture but it is implemented with a five stage pipeline for performance reasons. The processor core 20 also includes a 16 kilobyte instruction cache 52, an 8 kilobyte data cache 54 and a prefetch stream buffer 56. The core processor 20 performs arithmetic operations in parallel with memory writes and instruction fetches. The core processor 20 interfaces with other functional units via the ARM defined ASB bus. The ASB bus is a 32-bit bi-directional bus 32.
Referring to FIG. 3, an exemplary microengine 22f includes a control store 70 that includes a RAM which stores a microprogram. The microprogram is loadable by the core processor 20. The microengine 22f also includes controller logic 72. The controller logic includes an instruction decoder 73 and program counter (PC) units 72a- 72d. The four micro program counters 72a-72d are maintained in hardware. The microengine 22f also includes context event switching logic 74. Context event logic 74 receives messages (e.g., SEQ_#_EVENT_RESPONSE; FBI_EVENT_RESPONSE; SRAM _EVENT_RESPONSE; SDRAM _EVENT_RESPONSE; and ASB _EVENT_RESPONSE) from each one of the shared resources, e.g., SRAM 26a, SDRAM 26b, or processor core 20, control and status registers, and so forth. These messages provide information on whether a requested function has completed. Based on whether or not a function requested by a thread has completed and signaled completion, the thread needs to wait for that completion signal, and if the thread is enabled to operate, then the thread is placed on an available thread list (not shown). The microengine 22f can have a maximum of e.g., 4 threads available.
In addition to event signals that are local to an executing thread, the microengmes 22 employ signaling states that are global. With signaling states, an executing thread can broadcast a signal state to all microengines 22. Receive Request or Available signal, any and all threads in the microengines can branch on these signaling states. These signaling states can be used to determine availability of a resource or whether a resource is due for servicing.
The context event logic 74 has arbitration for the four (4) threads. In one embodiment, the arbitration is a round robin mechanism. Other techniques could be used including priority queuing or weighted fair queuing. The microengine 22f also includes an execution box (EBOX) data path 76 that includes an arithmetic logic unit 76a and general purpose register set 76b. The arithmetic logic unit 76a performs arithmetic and logical functions as well as shift functions. The arithmetic logic unit includes condition code bits that are used by instructions described below. The registers set 76b has a relatively large number of general purpose registers that are windowed as will be described so that they are relatively and absolutely addressable. The microengine 22f also includes a write transfer register stack 78 and a read transfer stack 80. These registers are also windowed so that they are relatively and absolutely addressable. Write transfer register stack 78 is where write data to a resource is located. Similarly, read register stack 80 is for return data from a shared resource. Subsequent to or concurrent with data arrival, an event signal from the respective shared resource e.g., the SRAM controller 26a, SDRAM controller 26b or core processor 20 will be provided to context event arbiter 74 which will then alert the thread that the data is available or has been sent. Both transfer register banks 78 and 80 are connected to the execution box (EBOX) 76 through a data path.
Referring to FIG. 4, the microengine datapath maintains a 5 -stage micropipeline 82. This pipeline includes lookup of microinstruction words 82a, formation of the register file addresses 82b, read of operands from register file 82c, ALU, shift or compare operations 82d, and write-back of results to registers 82e. By providing a writeback data bypass into the ALU/shifter units, and by assuming the registers are implemented as a register file (rather than a RAM), the microengine can perform a simultaneous register file read and write, which completely hides the write operation. The instruction set supported in the microengines 22a-22f support conditional branches. The worst case conditional branch latency (not including jumps) occurs when the branch decision is a result of condition codes being set by the previous microcontrol instruction. The latency is shown below in Table 1 : TABLE 1 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | + — + — + — + — + — + — +. — + — + microstore lookup | nl | cb | n2 | XX | bl | b2 | b3 | b4 | reg addr gen | | nl | cb | XX | XX | bl | b2 | b3 | reg file lookup | | | nl | cb | XX | XX | bl | b2 | ALU/shifter/cc | | | | nl j cb | XX j XX | bl | write back | | | m2| | nl | cb | XX | XX |
where nx is pre-branch microword (nl sets cc's), cb is conditional branch, bx is post-branch microword and XX is an aborted microword
As shown in Table 1, it is not until cycle 4 that the condition codes of nl are set, and the branch decision can be made (which in this case causes the branch path to be looked up in cycle 5). The microengine 22f incurs a 2-cycle branch latency penalty because it must abort operations n2 and n3 (the 2 microwords directly after the branch) in the pipe, before the branch path begins to fill the pipe with operation bl. If the branch is not taken, no microwords are aborted and execution continues normally. The microengines have several mechanisms to reduce or eliminate the effective branch latency.
The microengines support selectable deferred branches. Selectable deferring branches are when a microengine allows 1 or 2 micro instructions after the branch to execute before the branch takes effect (i.e. the effect of the branch is "deferred" in time). Thus, if useful work can be found to fill the wasted cycles after the branch microword, then the branch latency can be hidden. A 1 -cycle deferred branch is shown below in Table 2 where n2 is allowed to execute after cb, but before bl : TABLE 2 | 1 | 2| 3| 4| 5| 6| 7| 8| + — + — + — + — + — + — + — + — + microstore lookup | nl | cb | n2 | XX | bl | b2 | b3 | b4 | reg addr gen | | nl | cb | n2 | XX | bl | b2 | b3 | reg file lookup | | | nl | cb | n2 | XX | bl | b2 | ALU/shifter/cc | | | | nl j cb | n2 | XX | bl | write back | | | | | nl | cb | n2 | XX |
A 2-cycle deferred branch is shown in TABLE 3 where n2 and n3 are both allowed to complete before the branch to bl occurs. Note that a 2-cycle branch deferment is only allowed when the condition codes are set on the microword preceding the branch.
TABLE 3 | 1| 2| 3| 4| 5| 6| 7| 8| 9| +- — +- — +- — +- — +- — +- — +- — +- — +- — + microstore lookup | nl | cb | n2 | n3 | bl | b2 | b3 | b4 | b5 | reg addr gen | | nl | cb | n2 | n3 | bl | b2 | b3 | b4 | reg file lkup | | | nl | cb | n2 | n3 | bl | b2 | b3 | ALU/shftr/cc | | | | nl | cb | n2 | n3 | bl | b2 | write back | | | | | nl | cb | n2 | n3 | bl |
The microengines also support condition code evaluation. If the condition codes upon which a branch decision are made are set 2 or more microwords before the branch, then 1 cycle of branch latency can be eliminated because the branch decision can be made 1 cycle earlier as in Table 4. TABLE 4 I 1 I 2 | 3 | 4 | 5 | 6 | 7 | 8 | +. — +- — +- — +- — +- — +- — +- — +- — + microstore lookup | nl | n2 | cb | XX | bl | b2 | b3 | b4 | reg addr gen | | nl | n2 | cb | XX | bl | b2 | b3 | reg file lookup | | | nl | n2 | cb | XX | bl | b2 | ALU/shifter/cc | | | | nl | n2 | cb | XX | bl | write back | | | | | nl | n2 | cb | XX |
In this example, nl sets the condition codes and n2 does not set the conditions codes. Therefore, the branch decision can be made at cycle 4 (rather than 5), to eliminate 1 cycle of branch latency. In the example in Table 5 the 1 -cycle branch deferment and early setting of condition codes are combined to completely hide the branch latency. That is, the condition codes (cc's) are set 2 cycles before a 1 -cycle deferred branch.
TABLE 5
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
microstore lookup | nl | n2 | cb | n3 | bl | b2 | b3 | b4 | reg addr gen | | nl | n2 | cb | n3 | bl | b2 | b3 | reg file lookup | | | nl | n2 | cb | n3 | bl | b2 | ALU/shifter/cc | | | | nl | n2 | cb | n3 | bl | write back | | | | | nl j n2 | cb | n3 |
In the case where the condition codes cannot be set early (i.e. they are set in the microword preceding the branch), the microengine supports branch guessing which attempts to reduce the 1 cycle of exposed branch latency that remains. By "guessing" the branch path or the sequential path, the microsequencer pre-fetches the guessed path 1 cycle before it definitely knows what path to execute. If it guessed correctly, 1 cycle of branch latency is eliminated as shown in Table 6. TABLE 6 guess branch taken /branch is taken
| 1| 2| 3| 4| 5| 6| 7| 8|
microstore lookup | nl | cb | nl | bl | b2 | b3 | b4 | b5 | reg addr gen | | nl | cb | XX | bl | b2 | b3 | b4 | reg file lookup | | | nl | cb | XX | bl | b2 | b3 | ALU/shifter/cc | | | | nl | cb | XX | bl | b2 | write back | | | | j nl | cb | XX | bl |
If the microcode guessed a branch taken incorrectly, the microengine still only wastes 1 cycle as in TABLE 7
TABLE 7 guess branch taken /branch is NOT taken
| 1| 2| 3| 4| 5| 6| 7| 8|
microstore lookup | nl | cb | nl | XX | n2 | n3 | n4 | n5 | reg addr gen | | nl | cb | nl | XX | n2 | n3 | n4 | reg file lookup | | | nl | cb | nl | XX | n2 | n3 |
ALU/shifter/cc | | | | nl | cb | nl | XX | n2 | write back | | | | | nl | cb | nl | XX |
However, the latency penalty is distributed differently when microcode guesses a branch is not taken. For guess branch NOT taken / branch is NOT taken there are no wasted cycles as in Table 8. Table 8
I 1 I 2| 3| 4| 5| 6| 7| 8| +. — +- — +- — +- — +- — +- — +- — +- — + microstore lookup | nl | cb | nl | n2 | n3 | n4 | n5 | n6 | reg addr gen | | nl | cb | nl | n2 | n3 | n4 | n5 | reg file lookup | | | nl | cb | nl | n2 | nl | b4 | ALU/shifter/cc | | | | nl | cb | nl | n2 | n3 | write back | | | | | nl | cb | nl | n2 |
However for guess branch NOT taken /branch is taken there are 2 wasted cycles as in Table 9.
Table 9
I 1 I 2| 3| 4| 5| 6| 7| 8| + — + — + — + — + — + — + — + — + microstore lookup | nl | cb | nl | XX | bl | b2 | b3 | b4 | reg addr gen | | nl | cb | XX | XX | bl | b2 | b3 | reg file lookup | | | nl j cb | XX | XX | bl | b2 | ALU/shifter/cc | | | | nl | cb | XX | XX | bl | write back | | | | | nl | cb | XX | XX |
The microengine can combine branch guessing with 1 -cycle branch deferment to improve the result further. For guess branch taken with 1 -cycle deferred branch/branch is taken is in Table 10.
Table 10
| 1 | 2| 3| 4| 5| 6| 7| 8| + — +. — + — +. — +. — +. — +. — +. — + microstore lookup | nl | cb | n2 | bl | b2 | b3 | b4 | b5 | reg addr gen | | nl | cb | n2 | bl | b2 | b3 | b4 | reg file lookup | | | nl | cb | n2 | bl | b2 | b3 | ALU/shifter/cc | | | | nl | cb | n2 | bl | b2 | write back I I I I I nl I cb I n2 I bl I In the case above, the 2 cycles of branch latency are hidden by the execution of n2, and by correctly guessing the branch direction.
If microcode guesses incorrectly, 1 cycle of branch latency remains exposed as in Table 11 (guess branch taken with 1 -cycle deferred branch/branch is NOT taken).
Table 11 | 1| 2| 3| 4| 5| 6| 7| 8| 9| + — + — +-— + — + — +-— + — + — + — + microstore lookup | nl | cb | n2 | XX | n3 | n4 | n5 | n6 | n7 | reg addr gen | | nl | cb | n2 | XX | n3 | n4 | n5 | n6 | reg file lkup | | | nl | cb | n2 | XX | n3 | n4 | n5 | ALU/shftr/cc | | | | nl | cb | n2 | XX | n3 | n4 | write back I I I I I nl I cb I n2 I XX I n3 I
If microcode correctly guesses a branch NOT taken, then the pipeline flows sequentially in the normal unperturbed case. If microcode incorrectly guesses branch NOT taken, the microengine again exposes 1 cycle of unproductive execution as shown in Table 12.
Table 12 guess branch NOT taken/branch is taken
| 1 | 2| 3| 4| 5| 6| 7| 8| 9| +_ — +_ — +. — +. — +- — +. — +. — +. — +. — + microstore lookup | nl | cb | n2 | XX | bl | b2 | b3 | b4 | b5 | reg addr gen | | nl | cb | n2 | XX | bl | b2 | b3 | b4 | reg file lkup | | | nl | cb | n2 | XX | bl | b2 | b3 | ALU/shftr/cc | | | | nl | cb | n2 | XX | bl | b2 | write back | | | | | nl | cb | n2 | XX | bl | where nx is pre-branch microword (nl sets cc's) cb is conditional branch bx is post-branch microword XX is aborted microword
In the case of a jump instruction, 3 extra cycles of latency are incurred because the branch address is not known until the end of the cycle in which the jump is in the ALU stage (Table 13).
Table 13 | 1| 2| 3| 4| 5| 6| 7| 8| 9| +- — +- — +- — +- — +- — +- — +- — +- — +- — + microstore lookup | nl | jp | XX | XX | XX | j 1 | j2 | j3 | j4 | reg addr gen | | nl | jp | XX | XX | XX | jl | j2 | j3 | reg file lkup | | | nl | jp | XX | XX | XX | jl | j2 | ALU/shftr/cc | | | | nl | jp | XX | XX | XX | jl | write back | | | | | nl | jp | XX | XX | XX | Referring to FIG. 5, the microengines 22a-22f support various branch instructions such as those that branch on condition codes. In addition, the microengines also support branch instructions that branch on any specified bit being set or cleared. This class of branch instructions allows a programmer to specify which bit of a register to use as a branch control bit. The instruction format includes a bit_position field that specifies the bit position in a longword. Valid bit postions in this implementation are bits 0:31. The branch target is a label specified in the instruction.
Usually branch instruction requires that the processor shift bits into a control path where the processor has condition codes from an ALU and then performs the branch operation. This branch instruction allows observability of branch codes. Thus, rather than having the processor push the branch codes out into the control path the branches can be controlled from the data path of the processor.
BRJ3CLR, BR_BSET are branch instructions that branch to an instruction at a specified label when a specified bit of a register specified by the instruction is cleared or set. These instructions set the condition codes.
Format: br_bclr[reg, bit_position, label#], optional_token br_bset[reg, bit_position, label#], optional_token
The field reg A is an address of a context-relative transfer register or general-purpose register that holds the operand. The field bit_position A is a number that specifies a bit position in a longword. Bit 0 is the least significant bit. Valid bit_position values are 0 through 31. The field label# is a symbolic label corresponding to the address of an instruction to branch to. The value optional_token can have several values. The value is selected by the programmer based on programming considerations. The tokens can be:
Defer 1 which execute the instruction following the branch instruction before performing the branch operation.
Defer 2 which executes two instructions following the branch instruction before performing the branch operation. (In some implementations this may not be allowed with guess branch.) Defer 3 which executes three instructions following the branch instruction before performing the branch operation. (In some implementations this may not be allowed with guess branch.)
Another token can be "guess_branch" which causes the branch instruction to prefetche the instruction for the "branch taken" condition rather than the next sequential instruction. This token guess_branch can be used with the defer token, e.g., defer 1 to improve performance. In some architectures this might not be allowed with defer 2 or defer 3.
Referring to FIG. 6, the two register address spaces that exist are Locally accessibly registers, and Globally accessible registers accessible by all microengines. The General Purpose Registers (GPRs) are implemented as two separate banks (A bank and B bank) whose addresses are interleaved on a word-by-word basis such that A bank registers have lsb=0, and B bank registers have lsb=l. Each bank is capable of performing a simultaneous read and write to two different words within its bank. Across banks A and B, the register set 76b is also organized into four windows 76b0-76b3 of 32 registers that are relatively addressable per thread. Thus, thread_0 will find its register 0 at 77a (register 0), the thread_l will find its register_0 at 77b (register 32), thread_2 will find its register_0 at 77c (register 64), and thread_3 at 77d (register 96). Relative addressing is supported so that multiple threads can use the exact same control store and locations but access different windows of register and perform different functions. The use of register window addressing and bank addressing provide the requisite read bandwidth while using only dual ported RAMS in the microengine 22f. These windowed registers do not have to save data from context switch to context switch so that the normal push and pop of a context swap file or stack is eliminated. Context switching here has a 0 cycle overhead for changing from one context to another. Relative register addressing divides the register banks into windows across the address width of the general purpose register set. Relative addressing allows access any of the windows relative to the starting point of the window. Absolute addressing is also supported in this architecture where any one of the absolute registers may be accessed by any of the threads by providing the exact address of the register.
Addressing of general purpose registers 78 can occur in 2 modes depending on the microword format. The two modes are absolute and relative. In absolute mode, addressing of a register address is directly specified in 7-bit source field (a6-a0 or b6-b0), as shown in Table 14:
Table 14 7 6 5 4 3 2 1 0
+._.+ — + — +— + — + — + — +— +
AGPR: |a6|0|a5|a4|a3|a2|al|a0| a6=0 BGPR: |b6| 1 |b5|b4|b3|b2|bl|b0| b6=0
SRAM/ASB:|a6|a5|a4|0|a3|a2|al|aO| a6=l, a5=0, a4=0 SDRAM: |a6|a5|a4|0|a3|a2|al|a0| a6=l, a5=0, a4=l
register address directly specified in 8-bit dest field (d7-d0) Table 15:
Table 15 7 6 5 4 3 2 1 0
+ — + — + — + — + — + — + — + — +
A GPR: I d7| d6| d5| d4| d3| d2| dl| d0| d7=0, d6=0 B GPR: I d7| d6| d5| d4| d3| d2| dl| d0| d7=0, d6=l SRAM/ASB:| d7| d6| d5| d4| d3| d2| dl| d0| d7=l, d6=0, d5=0 SDRAM: | d7| d6| d5| d4| d3| d2| dl| d0| d7=l, d6=0, d5=l
If <a6:a5>=l,l, <b6:b5>=l,l, or <d7:d6>=l,l then the lower bits are interpreted as a context-relative address field (described below). When a non-relative A or B source address is specified in the A, B absolute field, only the lower half of the SRAMASB and SDRAM address spaces can be addressed. Effectively, reading absolute SRAM/SDRAM devices has the effective address space; however, since this restriction does not apply to the dest field, writing the SRAM/SDRAM still uses the full address space.
In relative mode, addresses a specified address is offset within context space as defined by a 5-bit source field (a4-a0 or b4-bO)Table 16: Table 16 7 6 5 4 3 2 1 0
+ — + — + — + — + — + — + — + — +
A GPR: I a4| 0 |context| a3| a2| al| a0| a4=0 B GPR: | b4| 1 |context| b3| b2| bl| b0| b4=0
SRAM/ASB :|ab4| 0 |ab3|context| b2| bl|abO| ab4=l, ab3=0 SDRAM: |ab4| 0 |ab3|context| b2| bl|abO| ab4=l, ab3=l
or as defined by the 6-bit dest field (d5-d0) Table 17:
Table 17 7 6 5 4 3 2 1 0
+ — + — + — + — + — + — + — + — +
A GPR: | d5| d4|context| d3| d2| dl| d0| d5=0, d4=0 B GPR: | d5| d4|context| d3| d2| dl| d0| d5=0, d4=l
SRAM/ASB:| d5| d4| d3|context| d2| dl| d0| d5=l, d4=0, d3=0 SDRAM: | d5| d4| d3|context| d2| dl| d0| d5=l, d4=0, d3=l
If <d5:d4>=l,l, then the destination address does not address a valid register, thus, no dest operand is written back.
Other embodiments are within the scope of the appended claims. What is claimed is:

Claims

1. A computer instruction comprises: a branch instruction that causes an instruction stream to branch to an instruction based on any specified bit of a specified register being set or cleared and that specifies which bit of the specified register to use as a branch control bit.
2. The instruction of claim 1 further comprising: a bit_postion field that specifies the bit position of the branch control bit in a longword contained in a register.
3. The instruction of claim 1 further comprising: a branch target field specified as a label in the instruction.
4. The instruction of claim 1 further comprising: an optional token that is set by a programmer and specifies a number i of instructions to execute following the branch instruction before performing the branch operation.
5. The instruction of claim 1 further comprising: an optional token that is set by a programmer and specifies a number i of instructions to execute following the branch instruction before performing the branch operation where the number of instructions can be specified as one, two or three.
6. The instruction of claim 1 wherein the register is a context-relative transfer register or a general-purpose register that holds the operand.
7. The instruction of claim 1 further comprising: an optional token that is set by a programmer and which specifies a guess_branch prefetch for the instruction for the "branch taken" condition rather than the next sequential instruction.
8. The instruction of claim 1 further comprising: an optional token that is set by a programmer and specifies a number i of instructions to execute following the branch instruction before performing the branch operation; and a second optional token that is set by a programmer and which specifies a guess_branch prefetch for the instruction for the "branch taken" condition rather than the next sequential instruction.
9. The instruction of claim 1 wherein the instruction allows a programmer to select which bit of the register to use to determine the branch operation.
10. The instruction of claim 1 wherein the instructions allows branches to occur based on evaluation of a bit that is in a data path of a processor.
11. A method of operating a processor comprises : evaluating a specified bit of a specified register designated to use as a branch control bit; and performing a branching operation based on the specified bit of the specified register being set or cleared.
12. The method of claim 11 wherein the specified bit position is in a longword contained in a register.
13. The method of claim 11 further comprising: branching to an instruction at a branch target field specified as a label in the instruction.
14. The method of claim 11 wherein the specified bit is specified by a programmer.
15. The method of claim 11 further comprising: executing a number i of instructions following execution of the branch instruction before performing the branch operation based on evaluating an optional token that is set by a programmer.
16. The method of claim 11 wherein the register is a context-relative transfer register or a general-purpose register that holds the operand.
17. The method of claim 11 further comprising: prefetching a branch taken instruction based on an optional token that is set by a programmer, and which specifies a guess_branch prefetch for the instruction for the "branch taken" condition rather than the next sequential instruction.
18. The method of claim 1 further comprising: executing a number i of instructions following execution of the branch instruction before performing the branch operation based on evaluating a first optional token that is set by a programmer; and prefetching a branch taken instruction based on an second optional token that is set by a programmer, and which specifies a guess_branch prefetch for the instruction for the "branch taken" condition rather than the next sequential instruction.
19. The method of claim 11 wherein the instruction allows a programmer to select which bit of the specified register to use to determine the branch operation.
20. The method of claim 11 wherein branch evaluation occurs based on evaluation of bits that are in a data path of the processor.
21. A processor comprises: a register stack; an arithmetic logic unit coupled to the register stack and a program control store that stores a branch instruction that causes the processor to: evaluate a specified bit of a specified one of the registers of the register stack, the specified bit designated to use as a branch control bit; and perform a branching operation specified by the branch instruction based on the specified bit of the register being set or cleared.
22. The processor of claim 21 wherein the specified bit is in a longword in a general purpose register.
23. The processor of claim 21 further comprising: a branch target field specified as a label in the instruction.
24. The processor of claim 21 wherein the specified bit is specified by a programmer.
25. The processor of claim 21 wherein the register is a context-relative transfer register or a general-purpose register that holds an operand.
PCT/US2000/023994 1999-09-01 2000-08-31 Branch instruction for processor WO2001016722A1 (en)

Priority Applications (6)

Application Number Priority Date Filing Date Title
CA002383528A CA2383528C (en) 1999-09-01 2000-08-31 Branch instruction for processor
AU70985/00A AU7098500A (en) 1999-09-01 2000-08-31 Branch instruction for processor
US10/069,195 US7421572B1 (en) 1999-09-01 2000-08-31 Branch instruction for processor with branching dependent on a specified bit in a register
EP00959712A EP1236097A4 (en) 1999-09-01 2000-08-31 Branch instruction for processor
HK02108083.9A HK1046566A1 (en) 1999-09-01 2002-11-07 Branch instruction for processor
HK03102109.1A HK1049902B (en) 1999-09-01 2003-03-24 Branch instruction for processor

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US15196199P 1999-09-01 1999-09-01
US60/151,961 1999-09-01

Publications (1)

Publication Number Publication Date
WO2001016722A1 true WO2001016722A1 (en) 2001-03-08

Family

ID=22540994

Family Applications (8)

Application Number Title Priority Date Filing Date
PCT/US2000/024006 WO2001016713A1 (en) 1999-09-01 2000-08-31 Branch instruction for processor
PCT/US2000/023992 WO2001018646A1 (en) 1999-09-01 2000-08-31 Branch instruction for multithreaded processor
PCT/US2000/023996 WO2001016716A1 (en) 1999-09-01 2000-08-31 Branch instruction for processor architecture
PCT/US2000/024000 WO2001016714A1 (en) 1999-09-01 2000-08-31 Fast write instruction for micro engine used in multithreaded parallel processor architecture
PCT/US2000/023994 WO2001016722A1 (en) 1999-09-01 2000-08-31 Branch instruction for processor
PCT/US2000/023982 WO2001016758A2 (en) 1999-09-01 2000-08-31 Double shift instruction for micro engine used in multithreaded parallel processor architecture
PCT/US2000/023983 WO2001016715A1 (en) 1999-09-01 2000-08-31 Branch instructions in a multithreaded parallel processing system
PCT/US2000/024095 WO2001016698A2 (en) 1999-09-01 2000-09-01 Memory reference instructions for micro engine used in multithreaded parallel processor architecture

Family Applications Before (4)

Application Number Title Priority Date Filing Date
PCT/US2000/024006 WO2001016713A1 (en) 1999-09-01 2000-08-31 Branch instruction for processor
PCT/US2000/023992 WO2001018646A1 (en) 1999-09-01 2000-08-31 Branch instruction for multithreaded processor
PCT/US2000/023996 WO2001016716A1 (en) 1999-09-01 2000-08-31 Branch instruction for processor architecture
PCT/US2000/024000 WO2001016714A1 (en) 1999-09-01 2000-08-31 Fast write instruction for micro engine used in multithreaded parallel processor architecture

Family Applications After (3)

Application Number Title Priority Date Filing Date
PCT/US2000/023982 WO2001016758A2 (en) 1999-09-01 2000-08-31 Double shift instruction for micro engine used in multithreaded parallel processor architecture
PCT/US2000/023983 WO2001016715A1 (en) 1999-09-01 2000-08-31 Branch instructions in a multithreaded parallel processing system
PCT/US2000/024095 WO2001016698A2 (en) 1999-09-01 2000-09-01 Memory reference instructions for micro engine used in multithreaded parallel processor architecture

Country Status (10)

Country Link
US (1) US7421572B1 (en)
EP (7) EP1236092A4 (en)
CN (7) CN1184562C (en)
AT (2) ATE475930T1 (en)
AU (11) AU7340700A (en)
CA (7) CA2386562A1 (en)
DE (2) DE60044752D1 (en)
HK (8) HK1046049A1 (en)
TW (11) TW559729B (en)
WO (8) WO2001016713A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10392470B4 (en) * 2002-03-29 2007-02-15 Intel Corporation, Santa Clara System and method for executing initialization commands of a secure environment

Families Citing this family (38)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7546444B1 (en) 1999-09-01 2009-06-09 Intel Corporation Register set used in multithreaded parallel processor architecture
US7681018B2 (en) 2000-08-31 2010-03-16 Intel Corporation Method and apparatus for providing large register address space while maximizing cycletime performance for a multi-threaded register file set
US7292586B2 (en) 2001-03-30 2007-11-06 Nokia Inc. Micro-programmable protocol packet parser and encapsulator
US6785793B2 (en) 2001-09-27 2004-08-31 Intel Corporation Method and apparatus for memory access scheduling to reduce memory access latency
US7360217B2 (en) * 2001-09-28 2008-04-15 Consentry Networks, Inc. Multi-threaded packet processing engine for stateful packet processing
US7437724B2 (en) * 2002-04-03 2008-10-14 Intel Corporation Registers for data transfers
GB2409062C (en) 2003-12-09 2007-12-11 Advanced Risc Mach Ltd Aliasing data processing registers
US7027062B2 (en) * 2004-02-27 2006-04-11 Nvidia Corporation Register based queuing for texture requests
US9038070B2 (en) 2004-09-14 2015-05-19 Synopsys, Inc. Debug in a multicore architecture
GB0420442D0 (en) * 2004-09-14 2004-10-20 Ignios Ltd Debug in a multicore architecture
SE0403128D0 (en) * 2004-12-22 2004-12-22 Xelerated Ab A method for a processor, and a processor
US8028295B2 (en) 2005-09-30 2011-09-27 Intel Corporation Apparatus, system, and method for persistent user-level thread
US7882284B2 (en) * 2007-03-26 2011-02-01 Analog Devices, Inc. Compute unit with an internal bit FIFO circuit
US7991967B2 (en) * 2007-06-29 2011-08-02 Microsoft Corporation Using type stability to facilitate contention management
US9384003B2 (en) * 2007-10-23 2016-07-05 Texas Instruments Incorporated Determining whether a branch instruction is predicted based on a capture range of a second instruction
US9207968B2 (en) * 2009-11-03 2015-12-08 Mediatek Inc. Computing system using single operating system to provide normal security services and high security services, and methods thereof
CN101950277B (en) * 2010-09-13 2012-04-25 青岛海信信芯科技有限公司 Data transmission method and device for micro control unit and data transmission system
GB2486737B (en) * 2010-12-24 2018-09-19 Qualcomm Technologies Int Ltd Instruction execution
US8880851B2 (en) * 2011-04-07 2014-11-04 Via Technologies, Inc. Microprocessor that performs X86 ISA and arm ISA machine language program instructions by hardware translation into microinstructions executed by common execution pipeline
US8645618B2 (en) * 2011-07-14 2014-02-04 Lsi Corporation Flexible flash commands
EP2798464B8 (en) 2011-12-30 2019-12-11 Intel Corporation Packed rotate processors, methods, systems, and instructions
CN102833336A (en) * 2012-08-31 2012-12-19 河海大学 Data sub-packet processing method in separate distributed information acquisition and concurrent processing system
US10140129B2 (en) * 2012-12-28 2018-11-27 Intel Corporation Processing core having shared front end unit
CN103186438A (en) * 2013-04-02 2013-07-03 浪潮电子信息产业股份有限公司 Method of improving disk array data reconstruction efficiency
CN103226328B (en) * 2013-04-21 2015-06-24 中国矿业大学(北京) Synchronous control method of multithreading data acquisition system in acquisition times control mode
US20150127927A1 (en) * 2013-11-01 2015-05-07 Qualcomm Incorporated Efficient hardware dispatching of concurrent functions in multicore processors, and related processor systems, methods, and computer-readable media
KR102254099B1 (en) 2014-05-19 2021-05-20 삼성전자주식회사 Method for processing memory swapping operation, and host device, storage device and data processing system adopting the same
CN103984235B (en) * 2014-05-27 2016-05-11 湖南大学 Space manipulator Control System Software framework and construction method based on C/S structure
US20160381050A1 (en) 2015-06-26 2016-12-29 Intel Corporation Processors, methods, systems, and instructions to protect shadow stacks
US10394556B2 (en) 2015-12-20 2019-08-27 Intel Corporation Hardware apparatuses and methods to switch shadow stack pointers
US10430580B2 (en) 2016-02-04 2019-10-01 Intel Corporation Processor extensions to protect stacks during ring transitions
US10838656B2 (en) 2016-12-20 2020-11-17 Mediatek Inc. Parallel memory access to on-chip memory containing regions of different addressing schemes by threads executed on parallel processing units
US10387037B2 (en) * 2016-12-31 2019-08-20 Intel Corporation Microarchitecture enabling enhanced parallelism for sparse linear algebra operations having write-to-read dependencies
PL3812900T3 (en) 2016-12-31 2024-04-08 Intel Corporation Systems, methods, and apparatuses for heterogeneous computing
CN107329812B (en) * 2017-06-09 2018-07-06 腾讯科技（深圳）有限公司 A kind of method and apparatus for running association's journey
CN112463327B (en) * 2020-11-25 2023-01-31 海光信息技术股份有限公司 Method and device for quickly switching logic threads, CPU chip and server
TWI769080B (en) * 2021-09-17 2022-06-21 瑞昱半導體股份有限公司 Control module and control method thereof for synchronous dynamic random access memory
US20230205869A1 (en) * 2021-12-23 2023-06-29 Intel Corporation Efficient exception handling in trusted execution environments

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3913074A (en) * 1973-12-18 1975-10-14 Honeywell Inf Systems Search processing apparatus
US4777587A (en) * 1985-08-30 1988-10-11 Advanced Micro Devices, Inc. System for processing single-cycle branch instruction in a pipeline having relative, absolute, indirect and trap addresses

Family Cites Families (138)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3373408A (en) 1965-04-16 1968-03-12 Rca Corp Computer capable of switching between programs without storage and retrieval of the contents of operation registers
US3478322A (en) 1967-05-23 1969-11-11 Ibm Data processor employing electronically changeable control storage
US3577189A (en) * 1969-01-15 1971-05-04 Ibm Apparatus and method in a digital computer for allowing improved program branching with branch anticipation reduction of the number of branches, and reduction of branch delays
BE795789A (en) 1972-03-08 1973-06-18 Burroughs Corp MICROPROGRAM CONTAINING A MICRO-RECOVERY INSTRUCTION
US3881173A (en) 1973-05-14 1975-04-29 Amdahl Corp Condition code determination and data processing
IT986411B (en) 1973-06-05 1975-01-30 Olivetti E C Spa SYSTEM TO TRANSFER THE CONTROL OF PROCESSING FROM A FIRST PRIORITY LEVEL TO A SECOND PRIORITY LEVEL
FR2253415A5 (en) * 1973-12-04 1975-06-27 Cii
US4130890A (en) 1977-06-08 1978-12-19 Itt Industries, Inc. Integrated DDC memory with bitwise erase
US4392758A (en) 1978-05-22 1983-07-12 International Business Machines Corporation Underscore erase
JPS56164464A (en) 1980-05-21 1981-12-17 Tatsuo Nogi Parallel processing computer
US4400770A (en) 1980-11-10 1983-08-23 International Business Machines Corporation Cache synonym detection and handling means
CA1179069A (en) 1981-04-10 1984-12-04 Yasushi Fukunaga Data transmission apparatus for a multiprocessor system
US4471426A (en) * 1981-07-02 1984-09-11 Texas Instruments Incorporated Microcomputer which fetches two sets of microcode bits at one time
US4454595A (en) 1981-12-23 1984-06-12 Pitney Bowes Inc. Buffer for use with a fixed disk controller
US4477872A (en) 1982-01-15 1984-10-16 International Business Machines Corporation Decode history table for conditional branch instructions
US4569016A (en) 1983-06-30 1986-02-04 International Business Machines Corporation Mechanism for implementing one machine cycle executable mask and rotate instructions in a primitive instruction set computing system
JPS6014338A (en) * 1983-06-30 1985-01-24 インタ−ナショナル　ビジネス　マシ−ンズ　コ−ポレ−ション Branch mechanism for computer system
US4606025A (en) 1983-09-28 1986-08-12 International Business Machines Corp. Automatically testing a plurality of memory arrays on selected memory array testers
US4808988A (en) 1984-04-13 1989-02-28 Megatek Corporation Digital vector generator for a graphic display system
US4868735A (en) 1984-05-08 1989-09-19 Advanced Micro Devices, Inc. Interruptible structured microprogrammed sixteen-bit address sequence controller
US4742451A (en) 1984-05-21 1988-05-03 Digital Equipment Corporation Instruction prefetch system for conditional branch instruction for central processor unit
US5187800A (en) 1985-01-04 1993-02-16 Sun Microsystems, Inc. Asynchronous pipelined data processing system
US5045995A (en) 1985-06-24 1991-09-03 Vicom Systems, Inc. Selective operation of processing elements in a single instruction multiple data stream (SIMD) computer system
US4754398A (en) * 1985-06-28 1988-06-28 Cray Research, Inc. System for multiprocessor communication using local and common semaphore and information registers
US4755966A (en) 1985-06-28 1988-07-05 Hewlett-Packard Company Bidirectional branch prediction and optimization
US4847755A (en) 1985-10-31 1989-07-11 Mcc Development, Ltd. Parallel processing method and apparatus for increasing processing throughout by parallel processing low level instructions having natural concurrencies
US5021945A (en) * 1985-10-31 1991-06-04 Mcc Development, Ltd. Parallel processor system for processing natural concurrencies and method therefor
US4745544A (en) 1985-12-12 1988-05-17 Texas Instruments Incorporated Master/slave sequencing processor with forced I/O
US4724521A (en) 1986-01-14 1988-02-09 Veri-Fone, Inc. Method for operating a local terminal to execute a downloaded application program
US5297260A (en) 1986-03-12 1994-03-22 Hitachi, Ltd. Processor having a plurality of CPUS with one CPU being normally connected to common bus
US5170484A (en) 1986-09-18 1992-12-08 Digital Equipment Corporation Massively parallel array processing system
US4992934A (en) 1986-12-15 1991-02-12 United Technologies Corporation Reduced instruction set computing apparatus and methods
US5073864A (en) 1987-02-10 1991-12-17 Davin Computer Corporation Parallel string processor and method for a minicomputer
US5142683A (en) 1987-03-09 1992-08-25 Unisys Corporation Intercomputer communication control apparatus and method
US4866664A (en) 1987-03-09 1989-09-12 Unisys Corporation Intercomputer communication control apparatus & method
US5189636A (en) 1987-11-16 1993-02-23 Intel Corporation Dual mode combining circuitry
US4816913A (en) 1987-11-16 1989-03-28 Technology, Inc., 64 Pixel interpolation circuitry as for a video signal processor
US5055999A (en) * 1987-12-22 1991-10-08 Kendall Square Research Corporation Multiprocessor digital data processing system
US5220669A (en) 1988-02-10 1993-06-15 International Business Machines Corporation Linkage mechanism for program isolation
DE68913629T2 (en) 1988-03-14 1994-06-16 Unisys Corp BLOCK LOCKING PROCESSOR FOR MULTIPLE PROCESSING DATA SYSTEM.
US5056015A (en) 1988-03-23 1991-10-08 Du Pont Pixel Systems Limited Architectures for serial or parallel loading of writable control store
US5165025A (en) 1988-10-06 1992-11-17 Lass Stanley E Interlacing the paths after a conditional branch like instruction
US5202972A (en) 1988-12-29 1993-04-13 International Business Machines Corporation Store buffer apparatus in a multiprocessor system
US5155854A (en) 1989-02-03 1992-10-13 Digital Equipment Corporation System for arbitrating communication requests using multi-pass control unit based on availability of system resources
US5155831A (en) 1989-04-24 1992-10-13 International Business Machines Corporation Data processing system with fast queue store interposed between store-through caches and a main memory
US5113516A (en) 1989-07-31 1992-05-12 North American Philips Corporation Data repacker having controlled feedback shifters and registers for changing data format
US5168555A (en) 1989-09-06 1992-12-01 Unisys Corporation Initial program load control
US5263169A (en) 1989-11-03 1993-11-16 Zoran Corporation Bus arbitration and resource management for concurrent vector signal processor architecture
DE3942977A1 (en) 1989-12-23 1991-06-27 Standard Elektrik Lorenz Ag METHOD FOR RESTORING THE CORRECT SEQUENCE OF CELLS, ESPECIALLY IN AN ATM SWITCHING CENTER, AND OUTPUT UNIT THEREFOR
US5544337A (en) 1989-12-29 1996-08-06 Cray Research, Inc. Vector processor having registers for control by vector resisters
US5247671A (en) 1990-02-14 1993-09-21 International Business Machines Corporation Scalable schedules for serial communications controller in data processing systems
JPH0799812B2 (en) 1990-03-26 1995-10-25 株式会社グラフイックス・コミュニケーション・テクノロジーズ Signal coding apparatus, signal decoding apparatus, and signal coding / decoding apparatus
US5390329A (en) 1990-06-11 1995-02-14 Cray Research, Inc. Responding to service requests using minimal system-side context in a multiprocessor environment
JPH0454652A (en) * 1990-06-25 1992-02-21 Nec Corp Microcomputer
US5432918A (en) 1990-06-29 1995-07-11 Digital Equipment Corporation Method and apparatus for ordering read and write operations using conflict bits in a write queue
EP0463973A3 (en) * 1990-06-29 1993-12-01 Digital Equipment Corp Branch prediction in high performance processor
US5404482A (en) 1990-06-29 1995-04-04 Digital Equipment Corporation Processor and method for preventing access to a locked memory block by recording a lock in a content addressable memory with outstanding cache fills
US5347648A (en) 1990-06-29 1994-09-13 Digital Equipment Corporation Ensuring write ordering under writeback cache error conditions
DE4129614C2 (en) * 1990-09-07 2002-03-21 Hitachi Ltd System and method for data processing
JP2508907B2 (en) * 1990-09-18 1996-06-19 日本電気株式会社 Control method of delayed branch instruction
DE69106384T2 (en) 1990-10-19 1995-08-10 Cray Research Inc SCALABLE PARALLEL VECTOR CALCULATOR SYSTEM.
US5367678A (en) 1990-12-06 1994-11-22 The Regents Of The University Of California Multiprocessor system having statically determining resource allocation schedule at compile time and the using of static schedule with processor signals to control the execution time dynamically
US5394530A (en) 1991-03-15 1995-02-28 Nec Corporation Arrangement for predicting a branch target address in the second iteration of a short loop
EP0522513A2 (en) 1991-07-09 1993-01-13 Hughes Aircraft Company High speed parallel microcode program controller
US5247675A (en) * 1991-08-09 1993-09-21 International Business Machines Corporation Preemptive and non-preemptive scheduling and execution of program threads in a multitasking operating system
US5255239A (en) 1991-08-13 1993-10-19 Cypress Semiconductor Corporation Bidirectional first-in-first-out memory device with transparent and user-testable capabilities
US5623489A (en) 1991-09-26 1997-04-22 Ipc Information Systems, Inc. Channel allocation system for distributed digital switching network
US5392412A (en) 1991-10-03 1995-02-21 Standard Microsystems Corporation Data communication controller for use with a single-port data packet buffer
US5392391A (en) 1991-10-18 1995-02-21 Lsi Logic Corporation High performance graphics applications controller
US5557766A (en) 1991-10-21 1996-09-17 Kabushiki Kaisha Toshiba High-speed processor for handling multiple interrupts utilizing an exclusive-use bus and current and previous bank pointers to specify a return bank
US5452437A (en) 1991-11-18 1995-09-19 Motorola, Inc. Methods of debugging multiprocessor system
US5357617A (en) 1991-11-22 1994-10-18 International Business Machines Corporation Method and apparatus for substantially concurrent multiple instruction thread processing by a single pipeline processor
US5442797A (en) 1991-12-04 1995-08-15 Casavant; Thomas L. Latency tolerant risc-based multiple processor with event driven locality managers resulting from variable tagging
JP2823767B2 (en) 1992-02-03 1998-11-11 松下電器産業株式会社 Register file
KR100309566B1 (en) 1992-04-29 2001-12-15 리패치 Method and apparatus for grouping multiple instructions, issuing grouped instructions concurrently, and executing grouped instructions in a pipeline processor
US5459842A (en) 1992-06-26 1995-10-17 International Business Machines Corporation System for combining data from multiple CPU write requests via buffers and using read-modify-write operation to write the combined data to the memory
DE4223600C2 (en) 1992-07-17 1994-10-13 Ibm Multiprocessor computer system and method for transmitting control information and data information between at least two processor units of a computer system
US5274770A (en) 1992-07-29 1993-12-28 Tritech Microelectronics International Pte Ltd. Flexible register-based I/O microcontroller with single cycle instruction execution
US5442756A (en) 1992-07-31 1995-08-15 Intel Corporation Branch prediction and resolution apparatus for a superscalar computer processor
US5692167A (en) * 1992-07-31 1997-11-25 Intel Corporation Method for verifying the correct processing of pipelined instructions including branch instructions and self-modifying code in a microprocessor
US5481683A (en) * 1992-10-30 1996-01-02 International Business Machines Corporation Super scalar computer architecture using remand and recycled general purpose register to manage out-of-order execution of instructions
US5463746A (en) 1992-10-30 1995-10-31 International Business Machines Corp. Data processing system having prediction by using an embedded guess bit of remapped and compressed opcodes
US5428779A (en) 1992-11-09 1995-06-27 Seiko Epson Corporation System and method for supporting context switching within a multiprocessor system having functional blocks that generate state programs with coded register load instructions
US5450603A (en) 1992-12-18 1995-09-12 Xerox Corporation SIMD architecture with transfer register or value source circuitry connected to bus
ATE188559T1 (en) 1992-12-23 2000-01-15 Centre Electron Horloger MULTI-TASKING CONTROL DEVICE WITH LOW ENERGY CONSUMPTION
US5404464A (en) 1993-02-11 1995-04-04 Ast Research, Inc. Bus control system and method that selectively generate an early address strobe
US5448702A (en) 1993-03-02 1995-09-05 International Business Machines Corporation Adapters with descriptor queue management capability
US6311286B1 (en) 1993-04-30 2001-10-30 Nec Corporation Symmetric multiprocessing system with unified environment and distributed system functions
WO1994027216A1 (en) 1993-05-14 1994-11-24 Massachusetts Institute Of Technology Multiprocessor coupling system with integrated compile and run time scheduling for parallelism
CA2122182A1 (en) 1993-05-20 1994-11-21 Rene Leblanc Method for rapid prototyping of programming problems
US5363448A (en) * 1993-06-30 1994-11-08 United Technologies Automotive, Inc. Pseudorandom number generation and cryptographic authentication
CA2107299C (en) 1993-09-29 1997-02-25 Mehrad Yasrebi High performance machine for switched communications in a heterogenous data processing network gateway
US5446736A (en) 1993-10-07 1995-08-29 Ast Research, Inc. Method and apparatus for connecting a node to a wireless network using a standard protocol
DE69415126T2 (en) 1993-10-21 1999-07-08 Sun Microsystems Inc., Mountain View, Calif. Counterflow pipeline processor
DE69430352T2 (en) 1993-10-21 2003-01-30 Sun Microsystems Inc., Mountain View Counterflow pipeline
TW261676B (en) * 1993-11-02 1995-11-01 Motorola Inc
US5450351A (en) 1993-11-19 1995-09-12 International Business Machines Corporation Content addressable memory implementation with random access memory
US6079014A (en) * 1993-12-02 2000-06-20 Intel Corporation Processor that redirects an instruction fetch pipeline immediately upon detection of a mispredicted branch while committing prior instructions to an architectural state
US5487159A (en) 1993-12-23 1996-01-23 Unisys Corporation System for processing shift, mask, and merge operations in one instruction
DE69420540T2 (en) * 1994-01-03 2000-02-10 Intel Corp., Santa Clara Method and apparatus for implementing a four-stage branch resolution system in a computer processor
US5490204A (en) 1994-03-01 1996-02-06 Safco Corporation Automated quality assessment system for cellular networks
US5659722A (en) * 1994-04-28 1997-08-19 International Business Machines Corporation Multiple condition code branching system in a multi-processor environment
US5542088A (en) 1994-04-29 1996-07-30 Intergraph Corporation Method and apparatus for enabling control of task execution
US5544236A (en) 1994-06-10 1996-08-06 At&T Corp. Access to unsubscribed features
US5574922A (en) 1994-06-17 1996-11-12 Apple Computer, Inc. Processor with sequences of processor instructions for locked memory updates
FR2722041B1 (en) 1994-06-30 1998-01-02 Samsung Electronics Co Ltd HUFFMAN DECODER
US5655132A (en) * 1994-08-08 1997-08-05 Rockwell International Corporation Register file with multi-tasking support
US5640538A (en) 1994-08-22 1997-06-17 Adaptec, Inc. Programmable timing mark sequencer for a disk drive
US5717760A (en) * 1994-11-09 1998-02-10 Channel One Communications, Inc. Message protection system and method
CN1306394C (en) * 1994-12-02 2007-03-21 现代电子美国公司 Limited run branch prediction
US5610864A (en) 1994-12-23 1997-03-11 Micron Technology, Inc. Burst EDO memory device with maximized write cycle timing
US5550816A (en) 1994-12-29 1996-08-27 Storage Technology Corporation Method and apparatus for virtual switching
US5649157A (en) 1995-03-30 1997-07-15 Hewlett-Packard Co. Memory controller with priority queues
JP3130446B2 (en) * 1995-05-10 2001-01-31 松下電器産業株式会社 Program conversion device and processor
US5592622A (en) 1995-05-10 1997-01-07 3Com Corporation Network intermediate system with message passing architecture
US5541920A (en) 1995-06-15 1996-07-30 Bay Networks, Inc. Method and apparatus for a delayed replace mechanism for a streaming packet modification engine
KR0180169B1 (en) * 1995-06-30 1999-05-01 배순훈 A variable length coder
US5613071A (en) 1995-07-14 1997-03-18 Intel Corporation Method and apparatus for providing remote memory access in a distributed memory multiprocessor system
US5933627A (en) * 1996-07-01 1999-08-03 Sun Microsystems Thread switch on blocked load or store using instruction thread field
US6061711A (en) * 1996-08-19 2000-05-09 Samsung Electronics, Inc. Efficient context saving and restoring in a multi-tasking computing system environment
US6058465A (en) * 1996-08-19 2000-05-02 Nguyen; Le Trong Single-instruction-multiple-data processing in a multimedia signal processor
DE69717369T2 (en) * 1996-08-27 2003-09-11 Matsushita Electric Ind Co Ltd Multi-thread processor for processing multiple instruction streams independently of one another through flexible throughput control in each instruction stream
JPH10177482A (en) * 1996-10-31 1998-06-30 Texas Instr Inc <Ti> Microprocessor and operating method
US5857104A (en) 1996-11-26 1999-01-05 Hewlett-Packard Company Synthetic dynamic branch prediction
US6088788A (en) * 1996-12-27 2000-07-11 International Business Machines Corporation Background completion of instruction and associated fetch request in a multithread processor
US6029228A (en) * 1996-12-31 2000-02-22 Texas Instruments Incorporated Data prefetching of a load target buffer for post-branch instructions based on past prediction accuracy's of branch predictions
US6470376B1 (en) * 1997-03-04 2002-10-22 Matsushita Electric Industrial Co., Ltd Processor capable of efficiently executing many asynchronous event tasks
US5835705A (en) * 1997-03-11 1998-11-10 International Business Machines Corporation Method and system for performance per-thread monitoring in a multithreaded processor
US5996068A (en) * 1997-03-26 1999-11-30 Lucent Technologies Inc. Method and apparatus for renaming registers corresponding to multiple thread identifications
US5907702A (en) * 1997-03-28 1999-05-25 International Business Machines Corporation Method and apparatus for decreasing thread switch latency in a multithread processor
US6009515A (en) * 1997-05-30 1999-12-28 Sun Microsystems, Inc. Digital data processing system including efficient arrangement to support branching within trap shadows
GB2326253A (en) * 1997-06-10 1998-12-16 Advanced Risc Mach Ltd Coprocessor data access control
US6385720B1 (en) * 1997-07-14 2002-05-07 Matsushita Electric Industrial Co., Ltd. Branch prediction method and processor using origin information, relative position information and history information
US6243735B1 (en) * 1997-09-01 2001-06-05 Matsushita Electric Industrial Co., Ltd. Microcontroller, data processing system and task switching control method
US5926646A (en) * 1997-09-11 1999-07-20 Advanced Micro Devices, Inc. Context-dependent memory-mapped registers for transparent expansion of a register file
UA55489C2 (en) * 1997-10-07 2003-04-15 Каналь+ Сосьєте Анонім Device for processing information in a number of information flows
US6567839B1 (en) * 1997-10-23 2003-05-20 International Business Machines Corporation Thread switch control in a multithreaded processor system
US6560629B1 (en) * 1998-10-30 2003-05-06 Sun Microsystems, Inc. Multi-thread processing

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3913074A (en) * 1973-12-18 1975-10-14 Honeywell Inf Systems Search processing apparatus
US4777587A (en) * 1985-08-30 1988-10-11 Advanced Micro Devices, Inc. System for processing single-cycle branch instruction in a pipeline having relative, absolute, indirect and trap addresses

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10392470B4 (en) * 2002-03-29 2007-02-15 Intel Corporation, Santa Clara System and method for executing initialization commands of a secure environment

Also Published As

Publication number Publication date
EP1236097A4 (en) 2006-08-02
HK1051730A1 (en) 2003-08-15
HK1051728A1 (en) 2003-08-15
EP1236088A4 (en) 2006-04-19
EP1236097A1 (en) 2002-09-04
CN1296818C (en) 2007-01-24
WO2001016714A1 (en) 2001-03-08
CN1402846A (en) 2003-03-12
EP1242867A4 (en) 2008-07-30
WO2001018646A1 (en) 2001-03-15
TW486666B (en) 2002-05-11
EP1236094A4 (en) 2006-04-19
TW559729B (en) 2003-11-01
CN1271513C (en) 2006-08-23
AU7098700A (en) 2001-03-26
CN1390323A (en) 2003-01-08
DE60038976D1 (en) 2008-07-03
CN100351781C (en) 2007-11-28
HK1046565A1 (en) 2003-01-17
TW571239B (en) 2004-01-11
WO2001016758A2 (en) 2001-03-08
EP1236094B1 (en) 2010-07-28
WO2001016758A9 (en) 2002-09-12
HK1046049A1 (en) 2002-12-20
HK1049902B (en) 2005-08-26
CA2383540A1 (en) 2001-03-08
CN1399736A (en) 2003-02-26
CN1184562C (en) 2005-01-12
CN1254739C (en) 2006-05-03
EP1236094A1 (en) 2002-09-04
CN1387640A (en) 2002-12-25
CA2383528C (en) 2008-06-17
CA2386558A1 (en) 2001-03-08
AU7099000A (en) 2001-03-26
AU7340400A (en) 2001-03-26
WO2001016714A9 (en) 2002-09-12
ATE475930T1 (en) 2010-08-15
EP1236088B9 (en) 2008-10-08
AU7342900A (en) 2001-03-26
TWI221251B (en) 2004-09-21
HK1051247A1 (en) 2003-07-25
EP1236093A1 (en) 2002-09-04
CA2383532A1 (en) 2001-03-08
AU7101200A (en) 2001-03-26
WO2001016715A1 (en) 2001-03-08
CA2383528A1 (en) 2001-03-08
AU7098400A (en) 2001-03-26
TW569133B (en) 2004-01-01
CN1402844A (en) 2003-03-12
WO2001016715A9 (en) 2002-09-12
HK1046566A1 (en) 2003-01-17
HK1051729A1 (en) 2003-08-15
WO2001018646A9 (en) 2002-09-12
DE60044752D1 (en) 2010-09-09
CN1402845A (en) 2003-03-12
EP1242869A1 (en) 2002-09-25
WO2001016698A3 (en) 2002-01-17
TWI220732B (en) 2004-09-01
WO2001016698A2 (en) 2001-03-08
WO2001016716A1 (en) 2001-03-08
EP1236092A1 (en) 2002-09-04
EP1236088A1 (en) 2002-09-04
HK1049902A1 (en) 2003-05-30
TW475148B (en) 2002-02-01
AU7098500A (en) 2001-03-26
AU7340600A (en) 2001-04-10
AU7097900A (en) 2001-03-26
EP1242869B1 (en) 2011-11-16
CA2386558C (en) 2010-03-09
WO2001016713A1 (en) 2001-03-08
TW594562B (en) 2004-06-21
EP1242869A4 (en) 2006-10-25
EP1236093A4 (en) 2006-07-26
TW486667B (en) 2002-05-11
US7421572B1 (en) 2008-09-02
EP1236092A4 (en) 2006-07-26
CA2383531A1 (en) 2001-03-08
AU7098600A (en) 2001-03-26
CN1387642A (en) 2002-12-25
EP1236088B1 (en) 2008-05-21
TW548584B (en) 2003-08-21
CN100342326C (en) 2007-10-10
CN100474236C (en) 2009-04-01
TW546585B (en) 2003-08-11
CA2383526A1 (en) 2001-03-15
EP1242867A2 (en) 2002-09-25
AU7340700A (en) 2001-03-26
CA2386562A1 (en) 2001-03-08
ATE396449T1 (en) 2008-06-15
WO2001016758A3 (en) 2001-10-25

Similar Documents

Publication Publication Date Title
US7421572B1 (en) Branch instruction for processor with branching dependent on a specified bit in a register
EP1221105B1 (en) Parallel processor architecture
EP1221086B1 (en) Execution of multiple threads in a parallel processor
CA2391792C (en) Sram controller for parallel processor architecture
US6983350B1 (en) SDRAM controller for parallel processor architecture
WO2001016702A1 (en) Register set used in multithreaded parallel processor architecture
WO2001016703A1 (en) Instruction for multithreaded parallel processor

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 2383528

Country of ref document: CA

WWE Wipo information: entry into national phase

Ref document number: IN/PCT/2002/00238/MU

Country of ref document: IN

WWE Wipo information: entry into national phase

Ref document number: 2000959712

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 008154376

Country of ref document: CN

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWP Wipo information: published in national office

Ref document number: 2000959712

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: JP