Method for decoding addresses for a defective memory array

Information

  • Patent Grant
  • 6381708
  • Patent Number
    6,381,708
  • Date Filed
    Tuesday, April 28, 1998
    27 years ago
  • Date Issued
    Tuesday, April 30, 2002
    23 years ago
Abstract
The use of a partially defective memory array to create a non-defective memory array. In a manner transparent to the memory controller, an address decoder is used to make a large memory array look like a smaller, non-defective memory array.
Description




FIELD OF THE INVENTION




The present invention relates generally to the use of partially defective memory chips or memory arrays. More particularly, the present invention relates to the use of a partially defective memory array to create a non-defective memory array.




BACKGROUND AND SUMMARY OF THE DISCLOSURE




As is well known in the art, during the production of monolithic memory devices from silicon wafers, memory storage cells can become defective and unreliable. These defective cells can be the result of a number of causes, such as impurities introduced in the process of manufacturing the monolithic memory device from the silicon wafer, or localized imperfections in the silicon substrate itself.




Often, while some memory cells in a particular memory array are defective, many other cells on the same memory array are not defective, and will work reliably and accurately. In addition, it is often the case that the defective cells are localized and confined to particular regions within the memory array. The remaining, non-defective regions, however, can be relied upon to provide a consistent and accurate representation of the information in the storage cell. What is needed, therefore, is a system or method for salvaging non-defective portions of memory arrays, even where the non-defective portions are not localized to any particular outputs on the memory module or memory array. Such a system preferably works transparently to the memory controller and is compatible with existing systems.




SUMMARY OF INVENTION




The present invention relates to techniques for salvaging non-defective portions of a memory array or memory module. In one embodiment of the present invention, the present invention relates to a method comprising the acts of: receiving an address from a processor; dividing the address into a row portion and a column portion; and modifying the address to preclude access to defective memory.




In another embodiment of the present invention, the present invention relates to a method of performing an operation on memory having defective memory cells comprising the acts of: receiving an address from a host bus; converting the address into a row address and a column address; and modifying the row address so that the defective cells in the memory are not addressed by the row address and the column address.




Additional embodiments and features, and the nature of the present invention may be more clearly understood by reference to the following detailed description of the invention, the appended claims, and to the several drawings herein:











BRIEF DESCRIPTION OF THE DRAWINGS





FIG. 1

is a block diagram of a computer system having a processor and a memory array that are connected through a memory controller.





FIG. 2

is a representation of a 2048×2048 memory array.





FIG. 3

is a representation of a memory address, having a row address portion and a column address portion.





FIG. 4

is a timing diagram illustrating a memory read cycle in a system using a multiplexed address.





FIG. 5

is a representation of a memory array having a defective portion and a non-defective portion divided at a column address boundary.





FIG. 6

is a block diagram of a system using a decoder in connection with memory addressing operations between the memory controller and the memory array.





FIG. 7

is a timing diagram of a memory read cycle in the system of FIG.


6


.





FIG. 8

is a timing diagram of a memory write cycle in the system of FIG.


6


.





FIG. 9

is a representation of a memory array having a defective portion and a non-defective portion divided at a row address boundary.





FIG. 10

is a timing diagram of a memory read cycle for a system having the partially-defective memory array shown in FIG.


9


.





FIG. 11

is a representation of a memory array having a defective portion and a non-defective portion divided at both a row and column address boundary.





FIG. 12

is a timing diagram of a memory read cycle for a system having the partially-defective memory array shown in FIG.


11


.





FIG. 13

is a block diagram of a memory array made up of eight partially defective components to make a 32-bit non-defective memory array.











DETAILED DESCRIPTION





FIG. 1

is a block diagram of a computer system comprising a microprocessor


102


, a memory controller


104


, and a host bus


106


. The memory controller interfaces a memory array


108


to the processor


102


. The memory controller


104


communicates with the memory array


108


over a data bus


110


and an address bus


112


. Control signals are also communicated between the memory controller


104


and the memory array


108


over the connection


114


.





FIG. 2

is a representation of a 2048×2048 memory array


200


having 2


22


(4 Meg.) memory cells in the array.

FIG. 3

shows a bit diagram of the address used to address a particular cell in the array


200


. Addressing a particular cell within the array involves generating an eleven bit row address, which forms a portion of the complete address shown in FIG.


3


. The row portion of the address selects one of the 2048 horizontal rows in the array


200


. An eleven bit column address, also shown in

FIG. 3

, addresses one of the 2048 vertical columns shown in FIG.


2


. The row and column addresses are typically presented to the memory array or memory module in a multiplexed fashion, with the row address preceding the column address. Together, the row and column address select exactly one particular cell in the array, thereby effectively addressing a desired memory location.




Although the memory array


200


shown in

FIG. 2

represents one bank of memory, it should be understood that memory arrays often have more than one bank of memory. For simplicity, the present invention is described principally in terms of a memory array having a single bank of memory, but it should be understood that the present invention could be implemented with memory arrays or systems having more than one bank of memory.





FIG. 4

is a timing diagram illustrating the operation of a read cycle for a memory array using multiplexed memory addressing. Since the row and column addresses are presented in a consecutive fashion, rather than at the same time, only eleven address lines (e.g., A


0


to A


10


) are needed to present the address to the memory array, and these lines are used for both the row and column addresses. The eleven bit row address is first presented to the memory array over lines A


0


to A


10


, and then the eleven bit column address is presented to the memory array over the same lines A


0


to A


10


after the row address is removed.




At time t


1


in

FIG. 4

, the row address has been placed on the address lines A


0


to A


10


, and by time t


2


, the active-low row address strobe (RAS) control signal is asserted to strobe the address lines to the memory array. At time t


3


, the row address has been removed from the address lines A


0


to A


10


, and the column address is placed on these same lines A


0


to A


10


. By time t


4


, the column address strobe (CAS), which is also active-low, has been asserted, and the data from the memory array becomes available thereafter at time t


5


. The row address strobe in the timing diagram of

FIG. 4

continues to be asserted during the times t


4


and t


5


to allow the column address to be toggled in a burst mode or fast-paging mode. And since the operation illustrated in

FIG. 4

is a read operation, the (active-low) write enable (WE) control line is inactive throughout the cycle.





FIG. 5

is a representation of a memory array


500


of size 2048×2048. As with the array


200


shown in

FIG. 2

, individual memory locations within the array are addressed using a row and column address. In the array shown in

FIG. 5

, the cells within region A in the memory array (columns


0


to


1023


for all rows) are not defective, and provide reliable data. However, at least some of the memory cells within region B (columns


1024


to


2047


for all rows) are defective, and cannot be relied upon for valid and accurate data. Thus, at least some of the cells within region B in

FIG. 5

are unusable.




The unusable cells within region B fall on one side of a column address boundary. When a higher order bit, and in this case the most significant column address bit, is high (see bit


302


in FIG.


3


), the addressed memory cell falls within region B of

FIG. 5

, but when the most significant column address bit is low, the addressed memory cell falls within region A of FIG.


5


. Thus, for the memory map of

FIG. 5

, the state of the most significant column address bit determines whether the addressed memory cell is within region A or region B. Thus, Region A in the device represented by the map of

FIG. 5

can be effectively addressed with an eleven bit row address and a ten bit column address. In other words, by using an eleven bit row address, and a ten bit column address and one additional bit that is forced low, only addresses within Region A will be addressed.





FIG. 6

is a block diagram of a memory controller


602


and a memory array


604


connected by a bidirectional data bus


608


, and an address bus


610


. Control lines


612


also connect the memory controller


602


with the memory array


604


. Also shown in

FIG. 6

is a decoder


605


, which is used to decode and modify some of the signals for the memory array


604


. In the embodiment of

FIG. 6

, the address bus


610


carries address lines A


0


to A


9


. The remaining address line, A


10


, is passed to the decoder


605


over the connection (or bus)


616


.




The purpose of the decoder


605


shown in

FIG. 6

is to mask out the defective memory cells in the memory array


604


so the memory controller uses only non-defective portions of the memory array


604


. The decoder


605


modifies the address bit A


10


on connection


616


to ensure that the memory controller accesses a non-defective memory cell. The modified address bit A


10


is then passed to the memory array


604


over connection


617


. Although for purposes of illustration the decoder


605


is shown separate from the memory controller, it should be understood that the decoder


605


could be integrated into the memory controller


602


, or into another device within the system.





FIG. 7

is a timing diagram that illustrates a memory read cycle in the system of

FIG. 6

, where the memory array being read from is defective as shown in FIG.


5


. At t


1


in

FIG. 7

, the first ten bits of the row address A


0


to A


9


are received from the memory controller and placed on the address bus


610


. The eleventh bit, A


10


, has been passed to the decoder


605


over connection


616


, and then passed unchanged to the memory array


604


on connection


617


(MODA


10


in FIG.


7


). Because the eleventh row bit is passed through unchanged, all 2048 rows are accessible. At time t


2


,


6


the row address strobe (RAS) is activated, thereby strobing the full eleven bit row address (i.e., on lines


612


and


617


) into the memory array


604


.




By time t


3


, the ten column bits of the column address have been placed on lines A


0


to A


9


on bus


610


. The memory array appears to the memory controller to be a memory array of size 2048×1024, addressable with an eleven bit row address and a ten bit column address. Therefore, the memory controller does not provide an eleventh column address bit. The line A


10


is forced low by the decoder


605


and passed through to the memory array on line


617


as MODA


10


. Thus, regardless of the column address generated by the memory controller


602


, the decoder


605


ensures that only the first 1024 columns are addressable, thereby hiding region B in FIG.


5


. In this manner, the decoder


605


effectively hides the region B in

FIG. 5

, and makes a partially defective memory array appear to the memory controller


602


to be a smaller, but non-defective memory array. At some time after the column address strobe (CAS) is activated at time t


4


, the data being read from the addressed location in the memory array


604


becomes valid at t


5


.





FIG. 8

is a timing diagram illustrating a write operation in the system of

FIGS. 5 and 6

. As can be seen from

FIG. 8

, the addressing procedure and the operation of the decoder


605


are the same as that of FIG.


7


. The decoder


605


forces the most significant column address bit low, and ensures that only the first 1024 columns are addressable. The write enable (WE) control signal is activated at time t


6


in

FIG. 8

, and the data that is on the data bus


608


is written into the addressed location at time t


7


. As in

FIG. 7

, the 2048×2048 memory array of

FIG. 5

appears to be a 2048×1024 memory array.





FIG. 9

illustrates a row and column addressable memory array


900


of size 2048×2048, similar to those shown in

FIGS. 2 and 5

. In the array shown in

FIG. 9

, the cells within region A in the memory array (rows


0


to


1023


for all columns) are not defective, and provide reliable data. However, at least some of the memory cells within region B (rows


1024


to


2047


for all columns) are defective, and cannot be relied upon for valid and accurate data. At least some of the cells within region B in

FIG. 9

are unusable.




The unusable cells shown in

FIG. 9

within region B fall on one side of a row address boundary. When the most significant row address bit is high (see bit


304


in FIG.


3


), the addressed memory cell falls within region B of FIG.


9


. When the most significant row address bit is low, the addressed memory cell falls within region A of FIG.


9


. Thus, for the memory map of

FIG. 9

, the state of the most significant row address bit determines whether the addressed memory cell is within region A or region B. The memory array corresponding to the memory map of

FIG. 9

can therefore be treated as a 1024×2048 memory array, addressable with a ten bit row address and eleven bit column address.




Referring again to

FIG. 6

, a modified version of the decoder


605


again can be used to mask out the defective memory cells in the memory array


604


where the defective memory array


604


has defects that follow the pattern of FIG.


9


. To hide the defective memory cells, the decoder


605


this time modifies the row address bit on A


10


to ensure that the memory controller always accesses a non-defective memory cell.




For example,

FIG. 10

is a timing diagram of a memory read cycle in the system of

FIG. 6

, where the memory array being read from is defective as shown in FIG.


9


. The memory controller in this embodiment is configured to use an


11


bit row address and a ten bit column address, even though the memory array is treated as a 1024×2048 memory array. At t


1


in

FIG. 10

, the first ten bits of the row address A


0


to A


9


are placed on the address bus


610


. The eleventh bit, A


10


, is passed to the decoder


605


over connection


616


, and is stored for use when the column address is presented. Line


617


(MODA


10


in FIG.


10


), which corresponds to the eleventh row bit input on the memory array


604


, is driven low by the decoder


605


. Thus, regardless of the row address generated by the memory controller


602


, the decoder


605


ensures that only the first 1024 rows are addressable. The row address strobe (RAS) is asserted at time t


2


.




At time t


3


, the memory controller places the ten column address bits on the bus


610


, and the stored eleventh row bit is placed on the line MODA


10


, thereby presenting an eleven bit column address to the memory array. At some time after the column address strobe (CAS) is activated at time t


4


, the data being read from the addressed location becomes valid at t


5


. Because eleven column bits are presented to the memory array


604


, all 2048 columns are accessible, although only the first 1024 rows are accessible. The decoder


605


effectively hides the region B in

FIG. 9

, and makes a partially defective memory array appear to the memory controller


602


to be a smaller, but non-defective 1024×2048 memory array, which is the size of region A.





FIG. 11

illustrates another row and column addressable memory array


1100


of size 2048×2048, similar to those shown in

FIGS. 2

,


5


, and


9


. In the array shown in

FIG. 11

, the cells within region A in the memory array (rows


1024


to


2047


for columns


0


to


1023


) are not defective, and provide reliable data. However, at least some of the remaining memory cells (those within region B) are defective, and cannot be relied upon for valid and accurate data. At least some of the cells within region B in

FIG. 11

are thus unusable.




The unusable cells shown in

FIG. 11

within region B fall on one side of both a row and column address boundary. When the most significant row address bit is low (see bit


304


in FIG.


3


), or if the most significant column address is high (see bit


302


in FIG.


3


), the addressed memory cell falls within region B of FIG.


11


. When both the most significant row address bit is high and the most significant column address is low, the addressed memory cell falls within region A of FIG.


11


. Thus, the most significant row and column address bits determine whether the addressed location falls within region A or region B. Where a multiplexed addressing procedure is used, these bits will be passed to the memory array on the same address line, A


10


.




Referring again to

FIG. 6

, another version of the decoder


605


is used to mask out the defective memory cells in the memory array


604


where the defective memory array


604


has defects that follow the pattern of FIG.


11


. To hide the defective memory cells, the decoder


605


modifies both the row and column address bit on Al


0


to ensure that the memory controller always accesses a non-defective memory cell. This makes the memory array appear to be a 1024×1024 memory array, addressable with a ten bit row address, and a ten bit column address.





FIG. 12

is a timing diagram illustrating a memory read cycle in the system of

FIG. 6

, where the memory array being read from is defective as shown in FIG.


11


. At t


1


in

FIG. 10

, the ten row bits of the row address A


0


to A


9


are placed on the address bus


610


. The memory controller does not provide an eleventh bit, A


10


, so the line


617


is forced high by the decoder


605


. The decoder


605


thus ensures that only the first 1024 rows are addressable. The row address strobe (RAS) is asserted at time t


2


.




At time t


3


, the ten column bits of the column address have been placed on lines A


0


and A


9


of bus


610


. Again, there is no eleventh column address bit, so the line


617


is forced low by the decoder


605


and passed through to the memory array on connection


617


, ensuring that only the first 1024 rows are addressable. At some time after the column address strobe (CAS) is activated at time t


4


, the data being read from the addressed location becomes valid at t


5


. The decoder


605


thus effectively hides the region B in

FIG. 12

, and makes a partially defective memory array appear to the memory controller


602


to be a non-defective memory array of the size of region A.





FIG. 13

is a schematic diagram of a memory module in one embodiment of the present invention, where eight partially defective RAM components


1301


-


1308


are combined to create a non-defective memory array. Each component


1301


to


1308


constitutes a memory array that is 2048×2048, having a data width of 4 bits. When the components


1301


to


1308


are aggregated, they make up a memory array of 2048×2048, with a data width of 32 bits.




Logic


1309


acts as the decoder, which generates a modified A


10


signal, thereby hiding a defective portion of the memory array, and making the memory array appear to be a smaller, but non-defective memory array. Thus, the memory array acts as a memory array that is smaller than 2048×2048. The modified A


10


signal is used as an input to each of the components


1301


-


1308


. The four outputs from each of the eight components are combined to create a 32 bit data bus, which communicates with edge connector


1311


over bus


1313


.




Although the present invention has been shown and described with respect to preferred embodiments, various changes and modifications, even if not shown or specifically described herein, are deemed to lie within the spirit and scope of the invention and the following claims. For example, although the present invention has been described as modifying the most significant row and/or column address bits, the present invention may encompass embodiments where other bits are modified, or where more than one bit or address line is modified. Accordingly, it is the appended claims, and not the foregoing illustrations and descriptions that define the scope of the invention.



Claims
  • 1. A method of performing an operation on memory having defective memory cells in a first region, the method comprising the acts of:receiving an address from a processor; dividing the address into a row portion and a column portion; and modifying at least a portion of the address to preclude access to the first region of the memory and to address without reference to defects of the location identified by the received address, so as a second region of the memory.
  • 2. The method of claim 1, further comprising the acts of:presenting the row portion of the address to the memory over an address bus; presenting the column portion of the address to the memory over the address bus; and accessing the memory.
  • 3. The method of claim 2, wherein the act of modifying the address includes the act of:modifying the row portion of the address.
  • 4. The method of claim 3, wherein the act of modifying the row portion of the address includes the act of:modifying a higher order bit in the row portion of the address.
  • 5. The method of claim 2, wherein the act of modifying the address includes the act of:modifying the column portion of the address.
  • 6. The method of claim 5, wherein the act of modifying the column portion of the address includes the act of:modifying a higher order bit in the column portion of the address.
  • 7. The method of claim 6, wherein the act of modifying the column portion of the address includes the act of:modifying at least one bit in the column portion of the address that shares at least one line on the address bus with a modified portion of the row address.
  • 8. The method of claim 7, further comprising the act of:strobing the row address and the column address to the memory.
  • 9. The method of claim 8, further comprising the act of:toggling the column address to enable a burst mode for the memory.
  • 10. The method of claim 1 further comprising the act of:providing a memory controller which is connected to the processor by a host bus, wherein the memory controller receives the address from the host bus; and providing a first line directly connecting the memory controller to a decoder such that at least a portion of the address is communicated from the memory controller to the decoder via said first line, wherein said decoder modifies said at least a portion of the address so that the selected region of the memory module is not accessed.
  • 11. The method of claim 10 further comprising the act of providing a second line directly connecting the decoder to an address bus such that at least a portion of the modified address is communicated from the decoder to the address bus via said second line.
  • 12. A method of performing an operation on memory having defective memory cells, the method comprising the acts of:receiving an address from a host bus; converting the address into a row address and a column address; and modifying the row address without reference to defects of the location identified by the received address, such that a selected region of the memory that includes defective cells is not addressed by the row address and the column address.
  • 13. The method of claim 10, further comprising the acts of:presenting the modified row address and the column address to the memory consecutively; and performing the operation.
  • 14. The method of claim 13, wherein the act of modifying the row address includes the act of:modifying a higher order bit in the row portion of the address.
  • 15. The method of claim 14, further comprising the act of:strobing the row address a nd the column address to the memory.
  • 16. The method of claim 15, further comprising the act of:toggling the column address to enable a burst mode for the memory.
  • 17. The method of claim 13, further comprising the act of:modifying the column portion of the address.
  • 18. The method of claim 17, further comprising the act of:modifying a higher order bit in the column portion of the address.
  • 19. A method of performing an operation on memory having defective memory cells, the method comprising the acts of:receiving an address from a host bus; converting the address into a row address and a column address; modifying the column address without reference to defects of the location identified by the received address, such that a selected region of the memory that includes defective cells is not addressed by the row address and the column address; presenting the row address to the memory; presenting the modified column address to the memory; and performing the operation.
  • 20. The method of claim 17, wherein the act of modifying the column address includes the act of:modifying a higher order bit in the column portion of the address.
  • 21. The method of claim 20, further comprising the act of:strobing the row address and the column address to the memory.
  • 22. The method of claim 21, further comprising the act of:toggling the column address to enable a burst mode for the memory.
  • 23. The method of claim 22, further comprising the act of:modifying the row portion of the address.
  • 24. The method of claim 23, further comprising the act of:modifying a higher order bit in the row portion of the address.
  • 25. A method of performing an operation on memory having defective memory cells, the method comprising the acts of:receiving an address from a host bus; converting the address into a row address and a column address; and modifying a higher order bit in at least one of the row and column addresses, without reference to defects of the location identified by the received address, such that a selected region that includes both defective and non-defective cells is not addressed by the row address and column address.
  • 26. A method of performing an operation on memory of a first size, having defective memory cells, the method comprising the acts of:identifying a region of the memory which includes defective memory cells; and providing a signal defining a higher order bit in an address of a location in the memory, such that said signal precludes access to the identified region; wherein the memory appears to a memory controller as being of a second size which is smaller than the first size.
RELATED APPLICATIONS

This application is related to U.S. Pat. Application Ser. No. 09/067,347, entitled “SYSTEM FOR DECODING ADDRESSES FOR A DEFECTIVE MEMORY ARRAY,” filed on Apr. 28, 1998.

US Referenced Citations (105)
Number Name Date Kind
3444526 Fletcher May 1969 A
3681757 Allen et al. Aug 1972 A
3714637 Beausoleil Jan 1973 A
3715735 Moss Feb 1973 A
3735368 Beausoleil May 1973 A
3772652 Hilberg Nov 1973 A
3781826 Beausoleil Dec 1973 A
3800294 Lawlor Mar 1974 A
3845476 Boehm Oct 1974 A
4355376 Gould Oct 1982 A
4376300 Tsang Mar 1983 A
4404647 Jones et al. Sep 1983 A
4450560 Conner May 1984 A
4475194 LaVallee et al. Oct 1984 A
4479214 Ryan Oct 1984 A
4493075 Anderson et al. Jan 1985 A
4527251 Nibby, Jr. et al. Jul 1985 A
4646299 Schinabeck et al. Feb 1987 A
4807191 Flannagan Feb 1989 A
4837747 Dosaka et al. Jun 1989 A
4876685 Rich Oct 1989 A
4881200 Urai Nov 1989 A
4908798 Urai Mar 1990 A
4918662 Kondo Apr 1990 A
4935899 Morigami Jun 1990 A
4992984 Busch et al. Feb 1991 A
5051994 Bluethman et al. Sep 1991 A
5060197 Park et al. Oct 1991 A
5124948 Takizawa et al. Jun 1992 A
5126973 Gallia et al. Jun 1992 A
5134584 Boler et al. Jul 1992 A
5200959 Gross et al. Apr 1993 A
5208775 Lee May 1993 A
5233614 Singh Aug 1993 A
5243570 Saruwatari Sep 1993 A
5251174 Hwang Oct 1993 A
5268866 Feng et al. Dec 1993 A
5270974 Reddy Dec 1993 A
5270976 Tran Dec 1993 A
5315552 Yoneda May 1994 A
5327380 Kersh, III et al. Jul 1994 A
5331188 Acovic et al. Jul 1994 A
5332922 Oguchi et al. Jul 1994 A
5337277 Jang Aug 1994 A
5349556 Lee Sep 1994 A
5371866 Cady Dec 1994 A
5379415 Papenberg et al. Jan 1995 A
5390129 Rhodes Feb 1995 A
5392247 Fujita Feb 1995 A
5400263 Rohrbaugh et al. Mar 1995 A
5400342 Matsumura et al. Mar 1995 A
5406565 MacDonald Apr 1995 A
5410545 Porter et al. Apr 1995 A
5424989 Hagiwara et al. Jun 1995 A
5434792 Saka et al. Jul 1995 A
5465234 Hannai Nov 1995 A
5469390 Sasaki et al. Nov 1995 A
5475648 Fujiwara Dec 1995 A
5475695 Caywood et al. Dec 1995 A
5491664 Phelan Feb 1996 A
5497381 O'Donoghue et al. Mar 1996 A
5502333 Bertin et al. Mar 1996 A
5513135 Dell et al. Apr 1996 A
5513327 Farmwald et al. Apr 1996 A
5528553 Saxena Jun 1996 A
5535328 Harari et al. Jul 1996 A
5538115 Koch Jul 1996 A
5539697 Kim et al. Jul 1996 A
5544106 Koike Aug 1996 A
5548553 Cooper et al. Aug 1996 A
5553231 Papenberg et al. Sep 1996 A
5576999 Kim et al. Nov 1996 A
5588115 Augarten Dec 1996 A
5600258 Graham et al. Feb 1997 A
5602987 Harai et al. Feb 1997 A
5631868 Termullo, Jr. et al. May 1997 A
5633826 Tsukada May 1997 A
5636173 Schaefer Jun 1997 A
5654204 Anderson Aug 1997 A
5668763 Fujioka et al. Sep 1997 A
5717694 Ohsawa Feb 1998 A
5734621 Ito Mar 1998 A
5745673 Di Zenzo et al. Apr 1998 A
5754753 Smelser May 1998 A
5758056 Barr May 1998 A
5768173 Seo et al. Jun 1998 A
5798962 Di Zenzo et al. Aug 1998 A
5841710 Larsen et al. Nov 1998 A
5862314 Jeddeloh Jan 1999 A
5896346 Dell et al. Apr 1999 A
5913020 Rohwer Jun 1999 A
5920512 Larsen Jul 1999 A
5920513 Jacobson Jul 1999 A
5956233 Yew et al. Sep 1999 A
5963463 Rondeau, II et al. Oct 1999 A
5966724 Ryan Oct 1999 A
5970008 Zagar et al. Oct 1999 A
5974564 Jeddeloh Oct 1999 A
5991215 Brunelle Nov 1999 A
5995409 Holland Nov 1999 A
5996096 Dell et al. Nov 1999 A
6009536 Rohwer Dec 1999 A
6115828 Tsutsumi Sep 2000 A
6192486 Correale, Jr. et al. Feb 2001 B1
6192487 Douceur Feb 2001 B1
Non-Patent Literature Citations (12)
Entry
Intel, PC SDRAM Specification, Revision 1.63, pp. i-54, Oct. 1998.
Intel, PC SDRAM Unbuffered DIMM Specification, Revision 1.0, pp. 1-47, Feb. 1998.
Shanley, T. and D. Anderson, ISA System Architecture, Third Edition, pp. 126-132, 221-232, 1995, Copyright 1995 by MindShare, Inc.
Micron Electronics, Inc.—Assignee, U.S. App. S/N 09/035,629, Filed Mar. 5, 1998, “Recover of Partially Defective Synchronous Memory Components”.
Micron Electronics, Inc.—Assignee, U.S. App. S/N 08/903,819, Filed Jul. 31, 1997, “System for Remapping Defective Memory Bit Sets”.
Micron Electronics, Inc.—Assignee, U.S. App. S/N 09/217,781, Filed Dec. 21, 1998, “Use of Partially Dysfunctional Memory Devices”.
Micron Electronics, Inc.—Assignee, U.S. App. S/N 08/903,819, Filed Jul. 31, 1997, “System for Remapping Defective Memory Bit Sets”.
Micron Electronics, Inc.—Assignee, U.S. App. S/N 09/519,641, Filed Mar. 6, 2000, “Method and Apparatus for Recovery of Useful Areas of Partially Defective Rambus RIMM Components”.
Micron Electronics, Inc.—Assignee, U.S. App. S/N 09/548,826, Filed Apr. 13, 2000, “Method and Apparatus for Storing Failing Part Locations in a Module”.
Micron Electronics, Inc.—Assignee, U.S. App. S/N 09/217,781, Filed Dec. 21, 1998, “Use of Partially Dysfunctional Memory Devices”.
Micron Electronics, Inc.—Assignee, U.S. App. S/N 09/035,629, Filed Mar. 5, 1998, “Recovery of Partially Defective Synchronous Memory Components”.
Micron Electronics, Inc.—Assignee, U.S. App. S/N 09/035,739, Filed Aug. 3, 2000, Method for Recovery of Useful Areas of Partially Defective Synchronous Memory Components.