Memory request reordering in a data processing system

Electrical computers and digital processing systems: memory – Storage accessing and control – Shared memory area

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S158000, C711S167000, C711S168000, C710S039000, C710S040000

Reexamination Certificate

active

06976135

ABSTRACT:
Memory transactions are carried out in an order that maximizes concurrency in a memory system such as a multi-bank interleaved memory system. Read data is collected in a buffer memory to be presented back to the bus in the same order as read transactions were requested. An adaptive algorithm groups writes to minimize overhead associated with transitioning from reading to writing into memory.

REFERENCES:
patent: 4590586 (1986-05-01), Zenk et al.
patent: 5581729 (1996-12-01), Nishtala et al.
patent: 5642494 (1997-06-01), Wang et al.
patent: 6026461 (2000-02-01), Baxter et al.
patent: 6240458 (2001-05-01), Gilbertson

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 request reordering in a data processing 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 Memory request reordering in a data processing system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory request reordering in a data processing system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3522403

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