Memory access address comparison of load and store queques

Electrical computers and digital processing systems: processing – Processing control – Processing control for data transfer

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C712S218000

Reexamination Certificate

active

06701425

ABSTRACT:

The invention relates to apparatus and methods for accessing memory in a computer system and particularly for comparing load and store addresses.
BACKGROUND OF THE INVENTION
Computer systems may comprise a plurality of parallel execution pipelines used to generate access addresses for load and store operations in a memory as well as data for storing in the memory. Where more than one pipeline is used, instructions may pass through the pipelines at different rates so that data and addresses from the different pipelines may arrive at a memory access unit at different times. Addresses and data may be put onto queues for use in memory access operations.
It is an object of the present invention to provide improved apparatus and methods for handling load and store queues in accessing a computer data memory.
SUMMARY OF THE INVENTION
The invention provides a computer system having a memory, a plurality of parallel execution pipelines and a memory access controller, said access controller providing a plurality of queues including store address queues holding addresses for store operations to be effected in the memory, store data queues holding a plurality of data for storing in the memory at locations identified by the store address queues, and load address storage holding addresses for load operations to be effected from the memory, said access controller including comparator circuitry to compare load addresses received by the controller with addresses in the store address queue and locate any addresses which are the same, each of said addresses including a first set of bits representing a word address together with a second set of byte enable bits and said comparator having circuitry to compare the byte enable bits of two addresses as well as said first set of bits.
Preferably said memory includes two separately accessible memory banks, each bank storing half a word at each word address.
Preferably said byte enable signals indicate which byte positions at each word address are to be accessed.
Preferably said comparator comprises a plurality of comparator devices, two of which effect comparison of addresses in respective memory banks, each of said two comparator devices having first inputs for comparing the bank word addresses for a pair of load and store addresses and second inputs for comparing respective byte enable signals of a pair of load and store addresses.
Preferably control circuitry is provided to select memory access operations from said queues, said control circuitry being responsive to the output of said comparator circuitry to select a load operation before a store address operation if the comparator circuitry does not indicate a store operation at the same address as the load operation.
Preferably said control circuitry is operable to select store operations before load operations when said comparator circuitry outputs a hit signal to indicate the same address on a store address queue as a received load address.
Preferably said control circuitry includes hit flag circuitry responsive to execution of an instruction to effect all current store operations in the store address queue before executing any further load operations, said hit flag being set in response to execution of said instruction.
Preferably said hit flag is operable when set to provide to the control circuitry the same input as said comparator circuitry when the comparator outputs a hit signal to indicate the same address on a store address queue as a received load address.
Preferably said plurality of execution pipelines include one or more pipelines in a data unit arranged to execute arithmetic operations and one or more pipelines in an address unit arranged to execute memory addressing operations.
Preferably at least two parallel pipelines are provided in the data unit and at least two parallel pipelines are provided in the address unit.
Preferably said memory includes two or more memory regions having different mapping within the addressable memory space of the computer system, said comparator circuitry including comparator means to compare the mapping of load addresses with each entry in the store address queues as well as comparing the word address and the byte enable signals.
The invention includes a method of operating a computer system having a memory, a plurality of parallel execution pipelines and a memory access controller, said method comprising forming a plurality of queues including store address queues holding addresses for store operations to be effected in the memory, store data queues holding a plurality of data for storing in the memory at locations identified by the store address queue and load address storage holding addresses for load operations to be effected from the memory, said method further comprising comparing received load addresses with addresses in a store address queue to locate addresses which are the same, each of said addresses including a first set of bits representing a word address together with a second set of byte enable bits, the comparison including comparing the byte enable bits of the two addresses as well as comparing said first set of bits.
Preferably, store addresses are removed from the store address queue in accordance with the order of entries in the queue and said comparison of addresses compares the next load address with all entries in the store address queue.
Preferably data is stored in said memory in two separately addressable memory banks sharing common addresses, each bank storing half a word at each word address, said comparison being effected by comparing bank word addresses in two comparison devices each for a respective bank and each for saving the same bank word address, and comparing in a further comparison device byte enable signals which represent respectively byte enable signals for the two different banks.
The method may include executing an instruction to set a hit flag indicating that all current store addresses in the store address queue should be accessed for a store operation before executing any further load operation.


REFERENCES:
patent: 4247920 (1981-01-01), Springer et al.
patent: 4467414 (1984-08-01), Akigi et al.
patent: 4855904 (1989-08-01), Daberkow et al.
patent: 5280593 (1994-01-01), Bullions, III et al.
patent: 5323489 (1994-06-01), Bird
patent: 5465336 (1995-11-01), Imai et al.
patent: 5471598 (1995-11-01), Quattromani et al.
patent: 5835747 (1998-11-01), Trull
patent: 5854914 (1998-12-01), Bodas et al.
patent: 5881262 (1999-03-01), Abramson et al.
patent: 5937178 (1999-08-01), Bluhm
patent: 6032251 (2000-02-01), Tran et al.
patent: 2 489 021 (1982-02-01), None
European Search Report from European application No. 99410056, filed May 3, 1999.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Memory access address comparison of load and store queques does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Memory access address comparison of load and store queques, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory access address comparison of load and store queques will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3212763

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.