Electrical computers and digital processing systems: memory – Storage accessing and control – Control technique
Reexamination Certificate
2000-08-31
2004-07-20
Sparks, Donald (Department: 2187)
Electrical computers and digital processing systems: memory
Storage accessing and control
Control technique
C711S005000, C711S120000, C711S124000, C711S162000, C711S168000, C711S117000, C714S006130
Reexamination Certificate
active
06766429
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Technical Field of the Invention
This invention relates in general to the field of memory architecture in computer systems, and more specifically to an improved method and apparatus for high availability redundant memory.
2. Background
Computer systems generally consist of one or more processors that execute program instructions stored within a medium. This mass storage medium is most often constructed of the lowest cost per bit, yet slowest storage technology, typically magnetic or optical media. To increase the system performance, a higher speed, yet smaller and more costly memory, known as the main memory, is first loaded with information from the mass storage for more efficient direct access by the processors. Even greater performance is achieved when a higher speed, yet smaller and more costly memory, known as a cache memory, is placed between the processor and main memory to provide temporary storage of recent/and or frequently referenced information. As the difference between processor speed and access time of the final storage increases, more levels of cache memory are provided, each level backing the previous level to form a storage hierarchy. Each level of the cache is managed to maintain the information most useful to the processor.
Often more than one cache memory will be employed at the same hierarchy level, for example when an independent cache is employed for each processor. Caches have evolved into quite varied and sophisticated structures, but always address the tradeoff between speed and both cost and complexity, while functioning to make the most useful information available to the processor as efficiently as possible.
Recently, cost reduced computer system architectures have been developed that more than double the effective size of the main memory by employing high speed compression/decompression hardware based on common compression algorithms, in the path of information flow to and from the main memory. Processor access to main memory within these systems is performed indirectly through the compressor and decompressor apparatuses, both of which add significantly to the processor access latency costs.
Large high speed cache memories are implemented between the processor and the compressor and decompressor hardware to reduce the frequency of processor references to the compressed memory, mitigating the effects of the high compression/decompression latency. These caches are partitioned into cache lines, equal in size to the fixed information block size required by the compressor and decompressor.
Referring to
FIG. 1
, a block diagram of a prior art computer system
100
is shown. The computer system includes one or more processors
101
connected to a common shared memory controller
102
that provides access to a system main memory
103
. The shared memory controller contains a compressor
104
for compressing fixed size information blocks into as small a unit as possible for ultimate storage into the main memory, a decompressor
105
for reversing the compression operation after the stored information is later retrieved from the main memory, and write queue
113
for queuing main memory store request information block(s) destined for the compressor. The processor data bus
108
is used for transporting uncompressed information between other processors and/or the shared memory controller. Information may be transferred to the processor data bus
108
from the main memory
103
, either through or around the decompressor
105
via a multiplexor
111
. Similarly, information may be transferred to the main memory
103
from the processor data bus
108
to the write buffer and then either through or around the compressor
104
via a multiplexor
112
.
The main memory
103
is typically constructed of synchronous dynamic random access memory (SDRAM) with access controlled by a memory controller
106
. Scrub control hardware within the memory controller can periodically and sequentially read and write SDRAM content through error detection and correction logic for the purpose of detecting and correcting bit errors that tend to accumulate in the SDRAM. Addresses appearing on the processor address bus
107
are known as Real Addresses, and are understood and known to the programming environment. Addresses appearing on the main memory address bus
109
are known as Physical Addresses, and are used and relevant only between the memory controller and main memory SDRAM. Memory Management Unit (MMU) hardware within the memory controller
106
is used to translate the real processor addresses to the virtual physical address space. This translation provides a means to allocate the physical memory in small increments for the purpose of efficiently storing and retrieving compressed and hence, variable size information.
The compressor
104
operates on a fixed size block of information, say 1024 bytes, by locating and replacing repeated byte strings within the block with a pointer to the first instance of a given string, and encoding the result according to a protocol. This process occurs through a byte-wise compare over a fixed length and is paced by a sequence counter, resulting in a constant completion time. The post process output block ranges from just a few bytes to the original block size, when the compressor could not sufficiently reduce the starting block size to warrant compressing at all. The decompressor
105
functions by reversing the compressor operation by decoding resultant compressor output block to reconstruct the original information block by inserting byte strings back into the block at the position indicated by the noted pointers. Even in the very best circumstances, the compressor is generally capable of only ¼-½ the data rate bandwidth of the surrounding system. The compression and decompression processes are naturally linear and serial too, implying quite lengthy memory access latencies through the hardware.
Referring to
FIG. 2
, prior art for partitioning the main memory is shown
200
. The main memory
205
is a logical entity because it includes the processor(s) information as well as all the required data structures necessary to access said information. The logical main memory
205
is physically partitioned from the physical memory address space
206
. In many cases, the main memory partition
205
is smaller than the available physical memory to provide a separate region to serve as a cache with either an integral directory, or one that is implemented externally
212
. It should be noted that when implemented, the cache storage may be implemented as a region
201
of the physical memory
206
, a managed quantity of uncompressed sectors, or as a separate storage array that may be directly accessed by the processor buses
107
and
108
. In any case, when implemented, the cache controller will request accesses to the main memory in a similar manner as a processor would if the cache were not present.
The logical main memory
205
is partitioned into the sector translation table
202
, with the remaining memory being allocated to sector storage
203
which may contain compressed or uncompressed information, free sector pointers, or any other information as long as it is organized into sectors. The sector translation table region size varies in proportion to the real address space size which is defined by a programmable register within the system. Particularly, equation 1) governs the translation of the sector translation table region size as follows:
sector_translation
_table
_size
=
real
memory
size
compression_block
_size
·
Translation_table
_entry
_size
(
1
)
Each entry is directly mapped to a fixed address range in the processor's real address space, the request address being governed in accordance with equation 2) as follows:
sector_translation
_table
_entry
_address
=
real
address
compression_block
_size
·
translation_table
_entry
_size
+
offset_size
(
2
)
For exampl
Bland Patrick Maurice
Smith, III Thomas Basil
Tremaine Robert Brett
Wazlowski Michael Edward
International Business Machines - Corporation
Jennings Derek S.
Scully Scott Murphy & Presser
Sparks Donald
Truong Bao Q
LandOfFree
Low cost and high RAS mirrored memory does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Low cost and high RAS mirrored memory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low cost and high RAS mirrored memory will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3199799