EP0363174A2 - Traitement de branchement sur bit - Google Patents

Traitement de branchement sur bit Download PDF

Info

Publication number
EP0363174A2
EP0363174A2 EP89310148A EP89310148A EP0363174A2 EP 0363174 A2 EP0363174 A2 EP 0363174A2 EP 89310148 A EP89310148 A EP 89310148A EP 89310148 A EP89310148 A EP 89310148A EP 0363174 A2 EP0363174 A2 EP 0363174A2
Authority
EP
European Patent Office
Prior art keywords
bits
priority
address
branch
instruction
Prior art date
Legal status (The legal status 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 status listed.)
Withdrawn
Application number
EP89310148A
Other languages
German (de)
English (en)
Other versions
EP0363174A3 (fr
Inventor
Gordon Taylor Davis
Baiju Dhirajlal Mandalia
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
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 International Business Machines Corp filed Critical International Business Machines Corp
Publication of EP0363174A2 publication Critical patent/EP0363174A2/fr
Publication of EP0363174A3 publication Critical patent/EP0363174A3/fr
Withdrawn legal-status Critical Current

Links

Images

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/38—Concurrent instruction execution, e.g. pipeline or look ahead
    • G06F9/3885—Concurrent instruction execution, e.g. pipeline or look ahead using a plurality of independent parallel functional units
    • 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/30094—Condition code generation, e.g. Carry, Zero flag
    • 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/3802—Instruction prefetching
    • G06F9/3804—Instruction prefetching for branches, e.g. hedging, branch folding

Definitions

  • the invention relates to branch on bit processing in a computer architecture with emphasis to branch processing.
  • Microprocessor technology for real time programming environments is considered an environmental basis for this architecture.
  • a branch on bit detection unit comprising: an input register to receive and store a set of bits representing a set of conditions in the system; the bits having binary states denoting active and inactive states of respective system conditions; means storing a set of branch target addresses associated with the set of condition representing bits, each address in the address set denoting the location of an instruction for initiating a branch program routine required to attend to the condition represented when the associated condition representing bit is active; an output register for storing an address designating location of a next program instruction to be executed by the system; and priority encoder means responsive to a selected active bit in the input register for causing an associated one of the target addresses to be extracted from the means for storing the target addresses and transferred to the output register, the selected active bit being determined by a coded priority ranking assigned to the active bits by the encoding means and the associated address being located by the code assigned to the selected bit, in other words, to a mechanism for executing priority branch on bit detection (BBD) operations, in response to a
  • a set of status bits representing branch condition parameters is evaluated to ascertain which currently represent active conditions requiring branch program action, and of the latter which should be given priority.
  • the output of this mechanism is a branch address representing the starting instruction of a branch program segment associated with the selected status bit.
  • the present invention equally provides a counterpart method.
  • the present invention can provide for branching on variable branch condition or status parameters selectable by program instructions.
  • the present invention can provide for varied priority ordering which the user can set by programming.
  • branch addresses can provide for user-variable associations between branch condition parameters and addresses of target instructions (also referred to hereafter as branch addresses).
  • an advantage of the priority selection process and associated circuitry is their accessibility to user program variation.
  • Registers determining relative priorities of the status bits are dynamically loadable, under user program control, with different patterns of priority selection codes, and registers presenting the status bits to be evaluated are also loadable under program control.
  • a single BBD circuit unit may be shared dynamically by multiple sets of status functions.
  • contents of the registers determining priority ordering can be suitably varied.
  • branch addresses which are selectable as the ultimate output of such BBD circuitry are stored in a stack of registers which are also accessible to dynamic change by user programs.
  • a suitable associated set of branch target addresses can be loaded.
  • a feature of one disclosed embodiment is that the registers for holding branch addresses and priority selection information may be extended in capacity to hold plural sets of respective parameters that can be associated with plural sets of status bit functions. Thus, the frequency of register loading operations required to adapt to different conditions can be reduced.
  • Another advantage of the disclosed arrangement is that it reduces the normally complex series of operations associated with priority branching to a simple operation executable in a single clock cycle (machine cycle) of the system in which it is used.
  • registers holding priority determining functions and address information are arranged for access in direct one-to-one correspondence with individual status bits, so that the number of registers needed is considerably less than would be required if the status bits were to be used in combination to address registers in a table lookup mode.
  • priority branch on bit circuitry prefferably arranged in a manner to facilitate execution of the complete priority branch operation (including priority selection and address selection action elements) in a single clock cycle of the associated data processing system, whereby such operations when fre­quently encountered in a processing system can be performed at enhanced throughput rates.
  • FIG. 1 shows the overall architecture of a communications protocol processor (CPP), for a description thereof, in greater detail, see co-pending application .
  • the CPP contains both special purpose circuits geared towards increasing throughput for certain complex and frequently encountered operations, and general purpose circuits including a more or less conventional ALU (arithmetic logic circuit).
  • the special purpose circuits include a branch on bit detect (BBD) circuit.
  • BBD branch on bit detect
  • ALU unit 1 supports basic arithmetic operations (ADD, SUBTRACT, COMPARE), logical operations (OR, AND, XOR), and register transfer operations.
  • Multiplier unit (MUL) 2 operating in coordination with the ALU, supports 16 by 16 multiplication with scaling and rounding functions.
  • Memory access unit 3 header processing unit 4, and frame processing unit 5 provide special purpose operations. Of particular interest presently is a portion of the header processing unit providing BBD (Branch On Bit Detect) operations.
  • BBD Brain On Bit Detect
  • CPP elements include a general purpose data register stack 6, and an address index register stack 7. These comprise portions of internal variably allocatable storage that can be used as input and output for processing units 1-5 using control bus 12 and data bus 13.
  • Control Unit 8 containing elements 8.1-8.7 shown in the lower portion of Figure 1, controls and monitors operation execution.
  • Instruction register 8.1 receives instructions from instruction memory (IRAM) shown elsewhere via instruction data bus 17.
  • Instruction operation codes (opcodes) in the instruction register are gated to decoder 8.2 which generates control signals to units 1-5 through control bus 12 and provides immediate data or address information via data bus 13.
  • System clock 8.3 provides timed control signals to the other elements.
  • Fetch controls 8.4 at clocked intervals direct instruction fetching action relative to IRAM.
  • Data bus 13 consists of a multiplicity of bi-directional data paths allowing for parallel transfer of data between register stacks 6 and 7 and process units 1-5.
  • Program counter 8.5 and next branch (or interrupt) control logic 8.6 generate next instruction addresses, one of which is selected by multiplexer 8.7 for application to IRAM via IRAM address bus 16.
  • Data address (DA) bus 15 is used to connect memory access unit 3 to Data Ram (DRAM, also shown elsewhere), for transfer of memory data via bus (GD) 13.
  • FIG. 3 illustrates a typical application environment for the CPP, the latter shown at 31 in this Figure.
  • Data Ram 32 also termed DRAM
  • Instruction Ram 35 stores instructions of application programs that the CPP supports and allows dynamic execution of functions required at interface 34.
  • Host interface 36 provides a systematic handshake for flow of data and control commands to and from a host processing system.
  • Block 37 represents layered protocol applications and signal processing functions which can be integrally accommodated in this environment.
  • FIG. 4 depicts components of header process unit 4 which perform unique operations on packet header parameters in each protocol layer.
  • Branch on priority bit detect (BBD) unit 60 performs priority branch on bit detect operations relative to communication status bit parameters contained in headers within each protocol layer.
  • BBD branch on priority bit detect
  • This mechanism performs its operation of priority bit selection and target address retrieval in a single CPP machine cycle, thereby enhancing throughput relative to high speed communication media.
  • the same mechanism and its underlying method of operation are considered universally applicable to other processing systems and applications; as should be more fully appreciated from the following description.
  • header process unit 4 Other special purpose units within header process unit 4 include register reshape unit 61, for rearranging registered header data to extract parameters related to the registered data but by known transformations, and address routing unit 62 for translating header address information for message routing purposes.
  • register reshape unit 61 for rearranging registered header data to extract parameters related to the registered data but by known transformations
  • address routing unit 62 for translating header address information for message routing purposes.
  • BBD unit 60 evaluates multiple status bits and selects a target branch address associated with one of the bits.
  • the bits represent conditions which are either active or inactive and which when active require special action via branch program segments.
  • the bits representing active conditions are evaluated in a predetermined order of priority and the target address selected is one associated with the bit having highest priority.
  • a circuit embodying general characteristics of the unit 60 is shown in Figure 5. Since it performs its priority branch address selection operation in response to BBD instructions, this circuit is called the BBD Instruction Execution Circuit.
  • Information in input latch 80 is processed for priority bit branching to a destination address using priority address mechanism 81, output of which is transferred to output register 82.
  • Stack initialise register 83 is used to initialise branch address stack elements (shown elsewhere) in priority address mechanism 81.
  • Decoders 84 and 85 responsive to a BBD instruction opcode on control bus 12, generate signals for gating priority branch status bits in input latch 80 to priority address mechanism 81 and also to latch the branch address extracted from the priority address mechanism to branch address register 82.
  • Decoder 84 responsive to a register transfer operation via data bus 13 generates a signal to load stack initialise register 83.
  • the contents of the branch address stack are alterable by programming to adjust the branch address selections to associate variably to the status bits in latch 80.
  • FIG. 6 is a schematic showing of principal block elements of the priority mechanism 81 of Figure 5.
  • Such elements include a priority select register stack 102 within a priority encoding unit 103, and a branch address register stack 104 within associated access decode mechanism 104. Both register stacks 102 and 104 are loadable with new information by programmed register loading operations conducted through bus 107.
  • unit 103 selects a priority designating code value from one of the registers in stack 102 and applies it as an addressing input to stack 104, whereby a selected branch address is transferred to output register 82.
  • the input latch bits are applied individually to different registers in stack 102, and the bits representing active branch request conditions gate out contents of respective registers in the stack.
  • the operation of unit 103 effectively compares the magnitudes of the values gated out from stack 102, such values effectively denoting the relative priorities of respective input latch bits, and selects as access input to stack 104 the value with highest magnitude.
  • the branch address selected from stack 104 corresponds to a currently active highest priority bit in latches 80. Since the contents of stack 102 are loadable by programming, it should be understood that the relative priorities accorded to the input latch bits are correspondingly variable.
  • registers 104 are alterable by programming, it will be understood that associations between bits in latches 80 and branch addresses extractable by mechanism 105 are correspondingly variable.
  • circuit composed of units 103 and 105 is that it can be easily arranged to complete its entire operation of priority determination and branch address extraction in a single "machine" or clocking cycle of the processing system in which it is used. As a result, frequently encountered complex branch on bit detect operations can be rapidly performed and thereby improve system throughput. This is particularly beneficial in processing systems interfacing to high speed communication media, as described in referenced co-pending application above.
  • stacks 102 and 104 can be enlarged to segmented stacks 110 and 111, respectively, in order to allow for preloading segments of such stacks simultaneously with priority determination information and/or branch address information associated with multiple sets of conditions or events represented by the bits presented in input latches 80 (Fig. 5).
  • differently coded BBD instructions designating individual stack segments can be executed repeatedly to evoke actions associated with different sets of branching associations, without having to reload the stacks between repetitions.
  • Figure 7 shows how the priority selection stack 110 and branch address stack 111 may be segmented to accommodate multiple sets of different respective data types.
  • Figure 8 shows logic 112 for accessing such stack segments, wherein the desired segment is selectable by a data type code, and the branch address selection within the selected branch stack segment is made by the output of the priority encoder.
  • the data type code could be provided either as part of the instruction opcode or as part of the operand information accompanying or designated by the opcode. This may be predefined or coded within the instruction set, depending on resources of the instruction set.
  • Figure 9 shows a mechanism to access the various stacks for initialisation and direct execution of the BBD instruction.
  • decoder 118 processes signals from control bus 12 associated with register loading instructions, to load data from input bus 115 into appropriate registers 116.
  • priority encoder 103 responsive to a BBD instruction, supplies a priority encode address to 118 directing branch address data to data bus 13 via output path 119.
  • stack 116 may contain plural sets or segments of branch address registers for relating different branching functions to conditions in input latch 80. As previously noted, this requires definition of different BBD instructions for branch on bit detection to different stack segments/protocols.
  • FIG. 10 A plurality of bits from input latch 80 ( Figure 6) labled bits 1 through 16, serve as selection control inputs for the priority encoder.
  • Each input bit has an associated priority register 120x; where register 120a is associated with input bit 1, 120b with input bit 2, etc.
  • Each priority register 120x may be initialised responsive to one or more register loading instructions of the processor, such as Data Move instructions (Register to Register or Memory to Register),or Load Immediate instructions. Multiple registers 120x may be initialised in parallel since the processor bus width will typically be wider than the length of a single priority register.
  • initialising priority registers 120x The purpose of initialising priority registers 120x is to set into each a unique priority code to associate under user program control with the condition represented by the respective bit from the input latch 80. Since there are 16 input bits in the example, 4 bits are required to assign each of these inputs a unique binary code number. In general, N bits are required in each priority encoder to handle 2 to the Nth power input bits. Such programmably assigned N bit numbers in registers 120x are evaluated by logic to which the register outputs couple in a manner such that of the numbers associated with input latch bits currently having active or ON states, the number with the largest binary magnitude will be selected for application to the selection input of the branch address stack, and thereby the selected branch will be associated with an input bit programmably designated (by system users or others) as having highest priority.
  • the circuit is ready to execute the priority branch BBD instruction.
  • the array of logic gates shown in Figure 10 will determine which of all the input bits which are "ON" is associated with a priority number with largest relative magnitude. This number is gated to outputs P0, P1, P2, and P3 (P3 being the most significant bit) which are used to address the register stack 116 ( Figure 9) in order to select an associated branch address.
  • operation of the array of gates proceeds as follows.
  • Each active or "ON" input in the set of input bits 1-16 from latches 80 enables the four-bit output 121x of the associated priority register 120x to be transferred to the associated row of gates 122x - 127x.
  • Input bits which are inactive or "OFF” will force outputs of associated priority registers to be all zeros or "OFF”.
  • Outputs from priority registers 120x are compared by respective rows of gates, starting with the most significant bit.
  • OR gate 129a examines the most significant bits of the outputs of all priority registers 120x, and sets its output P3 "ON” if at least one of its inputs is "ON”. If all inputs to this OR gate are OFF P3 is set OFF. P3 feeds back to Compare circuits 122x in each row (122a, 122b, 122c...), and causes further transfer of an ON condition through such compare circuits in each row where the most significant bit output from the respective register 120x is equal to the state of P3. Thus, if P3 is ON, then in each row where the highest order output of respective register 120x is ON, respective compare circuit 122x will have its output ON, and in all other rows, the outputs of respective compare circuits 122x will be OFF. On the other hand, if P3 is OFF, then presumably all highest order outputs of 120x are OFF and all compare circuits 122x will have their outputs ON.
  • Outputs of AND circuits 125x couple to OR circuit 129c producing third most significant result output digit P1.
  • the latter operates through compare circuits 126x and respective AND circuits 127x to evaluate respective least significant bit outputs of registers 120x.
  • Outputs of 127x couple to OR circuit 129d determining the least significant result output P0.
  • outputs P0 - P3 are used to address the branch address stack with an encoded address representing the priority number associated with a highest priority active input latch bit. This results in a one to one positional correspondence between addresses in the address stack and priority levels programmed into registers 120x.
  • outputs of circuits in Fig. 10 may be used to develop signals positionally associated with input bits 1-16 for direct application to individual registers in the branch address stack, and such outputs when active would directly gate contents of the respective branch address registers to the stack output.

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Executing Machine-Instructions (AREA)
  • Devices For Executing Special Programs (AREA)
EP19890310148 1988-10-07 1989-10-04 Traitement de branchement sur bit Withdrawn EP0363174A3 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US07/254,985 US4972342A (en) 1988-10-07 1988-10-07 Programmable priority branch circuit
US254985 1988-10-07

Publications (2)

Publication Number Publication Date
EP0363174A2 true EP0363174A2 (fr) 1990-04-11
EP0363174A3 EP0363174A3 (fr) 1992-07-08

Family

ID=22966348

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19890310148 Withdrawn EP0363174A3 (fr) 1988-10-07 1989-10-04 Traitement de branchement sur bit

Country Status (4)

Country Link
US (1) US4972342A (fr)
EP (1) EP0363174A3 (fr)
JP (1) JPH0619711B2 (fr)
CA (1) CA1321653C (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0706126A1 (fr) * 1994-10-07 1996-04-10 International Business Machines Corporation Planification de tâches à niveaux multiples de priorité

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6253307B1 (en) * 1989-05-04 2001-06-26 Texas Instruments Incorporated Data processing device with mask and status bits for selecting a set of status conditions
US5197130A (en) * 1989-12-29 1993-03-23 Supercomputer Systems Limited Partnership Cluster architecture for a highly parallel scalar/vector multiprocessor system
US5168570A (en) * 1989-12-29 1992-12-01 Supercomputer Systems Limited Partnership Method and apparatus for a multiple request toggling priority system
US5630157A (en) * 1991-06-13 1997-05-13 International Business Machines Corporation Computer organization for multiple and out-of-order execution of condition code testing and setting instructions
FR2737591B1 (fr) * 1995-08-03 1997-10-17 Sgs Thomson Microelectronics Dispositif d'organisation d'acces a un bus memoire
DE10062995A1 (de) * 2000-12-16 2002-07-11 Micronas Gmbh Unterbrecher-Steuereinrichtung
US8908564B2 (en) * 2010-06-28 2014-12-09 Avaya Inc. Method for Media Access Control address learning and learning rate suppression
US9471317B2 (en) * 2012-09-27 2016-10-18 Texas Instruments Deutschland Gmbh Execution of additional instructions in conjunction atomically as specified in instruction field

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3979725A (en) * 1973-08-06 1976-09-07 Xerox Corporation Multi-way program branching circuits
US4006466A (en) * 1975-03-26 1977-02-01 Honeywell Information Systems, Inc. Programmable interface apparatus and method
US4315314A (en) * 1977-12-30 1982-02-09 Rca Corporation Priority vectored interrupt having means to supply branch address directly
EP0055392A2 (fr) * 1980-12-18 1982-07-07 HONEYWELL INFORMATION SYSTEMS ITALIA S.p.A. Unité de commande microprogrammée à faculté de branchement multiple
EP0130381A2 (fr) * 1983-06-30 1985-01-09 International Business Machines Corporation Mécanisme pour la réalisation d'instructions d'aiguillage sur n'importe quel bit dans n'importe quel registre exécutable en un cycle de machine dans un système ordinateur à jeu d'instructions primitif
EP0218424A2 (fr) * 1985-09-30 1987-04-15 Fujitsu Limited Système de commande d'interruption

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
IT971304B (it) * 1972-11-29 1974-04-30 Honeywell Inf Systems Sistema di accesso a priorita variabile dinamicamente
US3967104A (en) * 1974-11-26 1976-06-29 Texas Instruments Incorporated Direct and indirect addressing in an electronic digital calculator
US4009470A (en) * 1975-02-18 1977-02-22 Sperry Rand Corporation Pre-emptive, rotational priority system
US4034349A (en) * 1976-01-29 1977-07-05 Sperry Rand Corporation Apparatus for processing interrupts in microprocessing systems
US4179737A (en) * 1977-12-23 1979-12-18 Burroughs Corporation Means and methods for providing greater speed and flexibility of microinstruction sequencing
US4271467A (en) * 1979-01-02 1981-06-02 Honeywell Information Systems Inc. I/O Priority resolver
US4246644A (en) * 1979-01-02 1981-01-20 Honeywell Information Systems Inc. Vector branch indicators to control firmware
IT1159351B (it) * 1983-02-03 1987-02-25 Cselt Centro Studi Lab Telecom Circuito di arbitraggio a struttura distribuita per le richieste di accesso al bus di un sistema multiprocessore
US4573118A (en) * 1983-03-31 1986-02-25 Fairchild Camera & Instrument Corporation Microprocessor with branch control
US4636544A (en) * 1985-02-25 1987-01-13 General Electric Company Flame retarded polyester molding composition with improved electrical performance

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3979725A (en) * 1973-08-06 1976-09-07 Xerox Corporation Multi-way program branching circuits
US4006466A (en) * 1975-03-26 1977-02-01 Honeywell Information Systems, Inc. Programmable interface apparatus and method
US4315314A (en) * 1977-12-30 1982-02-09 Rca Corporation Priority vectored interrupt having means to supply branch address directly
EP0055392A2 (fr) * 1980-12-18 1982-07-07 HONEYWELL INFORMATION SYSTEMS ITALIA S.p.A. Unité de commande microprogrammée à faculté de branchement multiple
EP0130381A2 (fr) * 1983-06-30 1985-01-09 International Business Machines Corporation Mécanisme pour la réalisation d'instructions d'aiguillage sur n'importe quel bit dans n'importe quel registre exécutable en un cycle de machine dans un système ordinateur à jeu d'instructions primitif
EP0218424A2 (fr) * 1985-09-30 1987-04-15 Fujitsu Limited Système de commande d'interruption

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0706126A1 (fr) * 1994-10-07 1996-04-10 International Business Machines Corporation Planification de tâches à niveaux multiples de priorité

Also Published As

Publication number Publication date
US4972342A (en) 1990-11-20
EP0363174A3 (fr) 1992-07-08
CA1321653C (fr) 1993-08-24
JPH02162422A (ja) 1990-06-22
JPH0619711B2 (ja) 1994-03-16

Similar Documents

Publication Publication Date Title
JP3916680B2 (ja) プロセッサ
US6961841B2 (en) Multiprocessor computer architecture incorporating a plurality of memory algorithm processors in the memory subsystem
US5748950A (en) Method and apparatus for providing an optimized compare-and-branch instruction
US7287152B2 (en) Conditional execution per lane
CA1319997C (fr) Processeur de communication specialise pour protocoles en couches
EP0096575B1 (fr) Eléments processeurs simultanés pour utiliser un code indépendant
US8521997B2 (en) Conditional execution with multiple destination stores
EP0096576B1 (fr) Mécanisme de création de code indépendant pour des éléments processeurs multiples
US6112299A (en) Method and apparatus to select the next instruction in a superscalar or a very long instruction word computer having N-way branching
EP0410105A2 (fr) Architecture de calculateur permettant l'exécution simultanée de programmes séquentiels
US4228498A (en) Multibus processor for increasing execution speed using a pipeline effect
EP0476722B1 (fr) Système de traitement de données
US7017032B2 (en) Setting execution conditions
JPH0778738B2 (ja) ディジタル・コンピュータ・システム
EP0363174A2 (fr) Traitement de branchement sur bit
US6694407B1 (en) Cache memory with data transfer control and method of operating same
US6857063B2 (en) Data processor and method of operation
EP0012242B1 (fr) Processeur de données digitales pour le traitement orienté vers le mot et le caractère
US4956805A (en) Circuitry for character translate functions
JPH03168832A (ja) 分散型マイクロプログラム制御方式
JPS6313216B2 (fr)

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): DE FR GB IT

17P Request for examination filed

Effective date: 19900820

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): DE FR GB IT

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 19940503