Memory rank burst scheduling

Details Memory rank burst scheduling Memory rank burst scheduling

2008-03-27

2011-10-25

Bataille, Pierre-Michel (Department: 2186)

Electrical computers and digital processing systems: memory

Storage accessing and control

Access timing

C711S152000, C711SE12001

Reexamination Certificate

active

08046559

ABSTRACT:
A method, device, and system are disclosed. In one embodiment the method includes grouping multiple memory requests into multiple of memory rank queues. Each rank queue contains the memory requests that target addresses within the corresponding memory rank. The method also schedules a minimum burst number of memory requests within one of the memory rank queues to be serviced when the burst number has been reached in the one of the plurality of memory rank queues. Finally, if a memory request exceeds an aging threshold, then that memory request will be serviced.

REFERENCES:
patent: 4570195 (1986-02-01), Shimaoka et al.
patent: 6112265 (2000-08-01), Harriman
patent: 6880028 (2005-04-01), Kurth
patent: 7299324 (2007-11-01), Shrader
patent: 7669044 (2010-02-01), Fitzgerald et al.
patent: 7870351 (2011-01-01), Resnick
patent: 2003/0177296 (2003-09-01), Kurth
patent: 2005/0135355 (2005-06-01), Muthukrishnan et al.
International Search Report and Written Opinion mailed Nov. 3, 2009 for International Patent Application No. PCT/US2009/038522; 10 pages.

Affiliated with

Also associated with

Rating

Memory rank burst scheduling 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 rank burst scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory rank burst scheduling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4287246