Atomic quad word storage in a simultaneous multithreaded system

Electrical computers and digital processing systems: processing – Dynamic instruction dependency checking – monitoring or...

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

06981128

ABSTRACT:
In a system with multiple execution units, instructions are queued to allow efficient dispatching. One load/store unit (LSU) may have a store instruction pending to a real address and a second LSU may have a load instruction pending to the same real address. An SMT system has an atomic store quad word (SQW) instruction with a data path that is only double wide and the SQW requires two cycles to complete. The SMT system requires a method to prevent between collisions in a store reorder queue (SRQ) STQ. The real address of a load word (LW) one thread is compared to the real addresses in the SRQ of the second thread. If the SQW with a real address matching the real address of the LW has not committed both of its double words, then the LW of the second thread is rejected.

REFERENCES:
patent: 6282629 (2001-08-01), Sager
patent: 6351805 (2002-02-01), Janik et al.
patent: 2003/0069920 (2003-04-01), Melvin et al.
patent: 2004/0221138 (2004-11-01), Rosner et al.
patent: 2835329 (2003-08-01), None
patent: WO 200133352 (2001-05-01), None

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

Atomic quad word storage in a simultaneous multithreaded system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Atomic quad word storage in a simultaneous multithreaded system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Atomic quad word storage in a simultaneous multithreaded system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3493951

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