Electrical computers and digital processing systems: memory – Storage accessing and control – Memory configuring
Reexamination Certificate
2005-12-27
2005-12-27
Padmanabhan, Mano (Department: 2189)
Electrical computers and digital processing systems: memory
Storage accessing and control
Memory configuring
C711S118000, C711S129000, C711S134000, C711S173000, C710S068000
Reexamination Certificate
active
06981119
ABSTRACT:
A memory system may use the storage space freed by compressing a unit of data to store performance-enhancing data associated with that unit of data. For example, a memory controller may be configured to allocate several of storage locations within a memory to store a unit of data. If the unit of data is compressed, the unit of data may not occupy a portion of the storage locations allocated to it. The memory controller may store performance-enhancing data associated with the unit of data in the portion of the storage locations allocated to but not occupied by the first unit of data.
REFERENCES:
patent: 5812817 (1998-09-01), Hovis et al.
patent: 5974471 (1999-10-01), Belt
patent: 6145069 (2000-11-01), Dye
patent: 6170047 (2001-01-01), Dye
patent: 6173381 (2001-01-01), Dye
patent: 6208273 (2001-03-01), Dye et al.
patent: 6324621 (2001-11-01), Singh et al.
patent: 6370631 (2002-04-01), Dye
“Effective Jump-Pointer Prefetching for Linked Data Structures,” Roth, et al., Computer Science Dept., Univ. of Wisconsin, Madison, May 1999, 18 pages.
“Frequent Value Compression in Data Caches,” Yang et al., Dept. of Computer Science, Univ. of Arizona, Tuscon, Jun. 2000, 10 pages.
“Push vs. Pull: Data Movement for Linked Data Structures,” Chia-Lin Yang et al., International Conference on Supercomputing, May 2000, 11 pages.
Memory-Side Prefetching for Linked Data Structures, Christopher Hughes, et al., Dept. of Computer Science, Univ. of Illinois at Urbana-Campaign, UIUC CS Technical Report UIUCDCS-R-2001-2221, May 2001, 25 pages.
“MLP yes! ILP no!,” Memory Level Parallelism, or why I no longer care about Instruction Level Parallelism, Andrew Glew, Intel Microcopmuter Research Lbas and University of Wisconsin, Oct. 98, 10 pages.
“IBM Memory Expansion Technology (MXT),” R. B. Termaine, et al., IBM J. RES. & DEV., vol. 45, No. 2, Mar. 2001, 15 pages.
“Research Report: On Management of Free Space in Compressed Memory Systems,” Peter Franaszek, et al., IBM Research Division, Oct. 22, 1998, 21 pages.
“On Internal Organization in Compressed Random-Access Memories,” P.A. Franaszek, et al., IBM J. RES. & DEV. vol. 45, No. 2, Mar. 2001, 12 pages.
“Memory expansion Architecture (MXT) Support,” http://www-123.ibm.com/mxt/publications/mxt.txt, Bulent Abali, Oct. 24, 200111 pages.
Lepak Kevin Michael
Sander Benjamin Thomas
Kowert Robert C.
Meyertons Hood Kivlin Kowert & Goetzel P.C.
Namazi Mehdi
Padmanabhan Mano
LandOfFree
System and method for storing performance-enhancing data in... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for storing performance-enhancing data in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for storing performance-enhancing data in... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3470377