Dynamic selection of a memory access size

Details Dynamic selection of a memory access size Dynamic selection of a memory access size

2011-06-07

2011-06-07

Kim, Matt (Department: 2186)

Electrical computers and digital processing systems: memory

Storage accessing and control

Hierarchical memories

C711SE12021

Reexamination Certificate

active

07958309

ABSTRACT:
A method of data processing in a processing unit supported by a memory hierarchy includes the processing unit performing a plurality of memory accesses to the memory hierarchy. The plurality of memory accesses includes one or more memory accesses targeting a full cache line of data. The processing unit monitors utilization of data accessed by the plurality of memory accesses, and based upon the utilization of the data, dynamically alters a memory access mode of operation so that a subsequent storage-modifying memory access targets less than a full cache line of data.

REFERENCES:
patent: 4694395 (1987-09-01), Young et al.
patent: 5555391 (1996-09-01), De Subijana et al.
patent: 6199107 (2001-03-01), Dujari
patent: 6345342 (2002-02-01), Arimilli et al.
patent: 6353877 (2002-03-01), Duncan et al.
patent: 6499085 (2002-12-01), Bogin et al.
patent: 6564302 (2003-05-01), Yagi et al.
patent: 6615321 (2003-09-01), Arimilli et al.
patent: 6763433 (2004-07-01), Arimilli et al.
patent: 6772288 (2004-08-01), Flake et al.
patent: 6848071 (2005-01-01), Chaudhry et al.
patent: 6971000 (2005-11-01), Sinharoy et al.
patent: 6978351 (2005-12-01), Osbourne et al.
patent: 7065548 (2006-06-01), Van Oldenborgh et al.
patent: 2002/0092029 (2002-07-01), Smith
patent: 2002/0138698 (2002-09-01), Kalla
patent: 2003/0084250 (2003-05-01), Gaither et al.
patent: 2003/0110117 (2003-06-01), Saidenberg et al.
patent: 2004/0117510 (2004-06-01), Arimilli et al.
patent: 2005/0027911 (2005-02-01), Hayter et al.
patent: 2005/0053057 (2005-03-01), Deneroff et al.
patent: 2005/0080994 (2005-04-01), Cohen et al.
patent: 2005/0240729 (2005-10-01), Van Berkel et al.
patent: 2006/0085600 (2006-04-01), Miyashita et al.
patent: 2006/0173851 (2006-08-01), Singh et al.
patent: 2006/0179254 (2006-08-01), Clark et al.
patent: 2006/0251092 (2006-11-01), Matterne et al.
patent: 2007/0038846 (2007-02-01), Kadambi et al.
patent: 2007/0050592 (2007-03-01), Gschwind et al.
patent: 2007/0136374 (2007-06-01), Guedalia
patent: 2007/0294264 (2007-12-01), Bayardo, Jr. et al.
patent: 2008/0244185 (2008-10-01), O'Krafka et al.
patent: 2008/0256303 (2008-10-01), Croxford et al.
Hwang et al.; “Delayed Precise Invalidation a Software Cache Coherence Scheme”; IEEE Proceeding Computer and Digital Techniques; vol. 143, No. 5, pp. 337-344; Sep. 1996.
Gilbert et al.; “Distributed Data Cache Designs for Clustered VLIW Processors”; IEEE Transaction on Computers; vol. 54, No. 10, pp. 1227-1241; Oct. 2005.
Guo et al., “Cooperative Caching for Peer Assisted Video Distribution”; Advances in Multimedia Modeling, 13th International Multimedia Modeling Conference; MMM 2007; Lecture Notes in Computer Science; vol. 4351; pp. 135-144.
Emma et al.; “Partial Store Lines in Store in Caches”; IBM TDB; p. 4240; Dec. 1984.
J. Hoogerbrugge; “Cost Efficient Branch Target Buffers” Euro-Par 2004 Parallel Processing; 10th International Euro-Par Conference; Lecture Notes in Computer Science; vol. 1900; pp. 950-959; Aug.-Sep. 2000.
Parmentier et al.; Cache Based Parallelization of Multiple Sequence Alignment Problem'; Euro-Par Parallel Processing; 10th International Euro-Par Conference; Lecture Notes in Computer Science; vol. 3149; pp. 950-959.

Affiliated with

Also associated with

Rating

Dynamic selection of a memory access size does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic selection of a memory access size, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic selection of a memory access size will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2622666