Memory block identified by group of logical block addresses, storage device with movable sectors, and methods

Abstract
In an embodiment, a non-volatile memory has erasable blocks of memory cells. The one or more of the erasable blocks include a particular block to be identified by a particular group of logical block addresses corresponding to a predetermined group of sectors.
Description
FIELD

This invention relates to the field of mass storage for computers. More particularly, this invention relates to an architecture for replacing a hard disk with a semiconductor nonvolatile memory and in particular flash memory.


BACKGROUND

Computers conventionally use rotating magnetic media for mass storage of documents, data, programs and information. Though widely used and commonly accepted, such hard disk drives suffer from a variety of deficiencies. Because of the rotation of the disk, there is an inherent latency in extracting information from a hard disk drive.


Other problems are especially dramatic in portable computers. In particular, hard disks are unable to withstand many of the kinds of physical shock that a portable computer will likely sustain. Further, the motor for rotating the disk consumes significant amounts of power decreasing the battery life for portable computers.


Solid state memory is an ideal choice for replacing a hard disk drive for mass storage because it can resolve the problems cited above. Potential solutions have been proposed for replacing a hard disk drive with a semiconductor memory. For such a system to be truly useful, the memory must be nonvolatile and alterable. The inventors have determined that FLASH memory is preferred for such a replacement.


FLASH memory is a transistor memory cell which is programmable through hot electron, source injection, or tunneling, and erasable through Fowler-Nordheim tunneling. The programming and erasing of such a memory cell requires current to pass through the dielectric surrounding floating gate electrode. Because of this, such types of memory have a finite number of erase-write cycles. Eventually, the dielectric deteriorates. Manufacturers of FLASH cell devices specify the limit for the number of erase-write cycles between 100,000 and 1,000,000.


One requirement for a semiconductor mass storage device to be successful is that its use in lieu of a rotating media hard disk mass storage device be transparent to the designer and the user of a system using such a device. In other words, the designer or user of a computer incorporating such a semiconductor mass storage device could simply remove the hard disk and replace it with a semiconductor mass storage device. All presently available commercial software should operate on a system employing such a semiconductor mass storage device without the necessity of any modification.


SanDisk proposed an architecture for a semiconductor mass storage using FLASH memory at the Silicon Valley PC Design Conference on Jul. 9, 1991. That mass storage system included read-write block sizes of 512 Bytes to conform with commercial hard disk sector sizes.


Earlier designs incorporated erase-before-write architectures. In this process, in order to update a file on the media, if the physical location on the media was previously programmed, it has to be erased before the new data can be reprogrammed.


This process would have a major deterioration on overall system throughput. When a host writes a new data file to the storage media, it provides a logical block address to the peripheral storage device associated with this data file. The storage device then translates this given logical block address to an actual physical block address on the media and performs the write operation. In magnetic hard disk drives, the new data can be written over the previous old data with no modification to the media. Therefore, once the physical block address is calculated from the given logical block address by the controller, it will simply write the data file into that location. In solid state storage, if the location associated with the calculated physical block address was previously programmed, before this block can be reprogrammed with the new data, it has to be erased. In one previous art, in erase-before-write architecture where the correlation between logical block address given by the host is one to one mapping with physical block address on the media. This method has many deficiencies. First, it introduces a delay in performance due to the erase operation before reprogramming the altered information. In solid state flash, erase is a very slow process.


Secondly, hard disk users typically store two types of information, one is rarely modified and another which is frequently changed. For example, a commercial spread sheet or word processing software program stored on a user's system are rarely, if ever, changed. However, the spread sheet data files or word processing documents are frequently changed. Thus, different sectors of a hard disk typically have dramatically different usage in terms of the number of times the information stored thereon is changed. While this disparity has no impact on a hard disk because of its insensitivity to data changes, in a FLASH memory device, this variance can cause sections of the mass storage to wear out and be unusable significantly sooner than other sections of the mass storage.


In another architecture, the inventors previously proposed a solution to store a table correlating the logical block address to the physical block address. The inventions relating to that solution are disclosed in U.S. patent application Ser. No. 08/038,668 filed on Mar. 26, 1993, now U.S. Pat. No. 5,388,083, and U.S. patent application Ser. No. 08/037,893 also filed on Mar. 26, 1993, now U.S. Pat. No. 5,479,638. Those applications are incorporated herein by reference.


The inventors' previous solution discloses two primary algorithms and an associated hardware architecture for a semiconductor mass storage device. It will be understood that “data file” in this patent document refers to any computer file including commercial software, a user program, word processing software document, spread sheet file and the like. The first algorithm in the previous solution provides means for avoiding an erase operation when writing a modified data file back onto the mass storage device. Instead, no erase is performed and the modified data file is written onto an empty portion of the mass storage.


The semiconductor mass storage architecture has blocks sized to conform with commercial hard disk sector sizes. The blocks are individually erasable. In one embodiment, the semiconductor mass storage can be substituted for a rotating hard disk with no impact to the user, so that such a substitution will be transparent. Means are provided for avoiding the erase-before-write cycle each time information stored in the mass storage is changed.


According to the first algorithm, erase cycles are avoided by programming an altered data file into an empty block. This would ordinarily not be possible when using conventional mass storage because the central processor and commercial software available in conventional computer systems are not configured to track continually changing physical locations of data files. The previous solution includes a programmable map to maintain a correlation between the logical address and the physical address of the updated information files.


All the flags, and the table correlating the logical block address to the physical block address are maintained within an array of CAM cells. The use of the CAM cells provides very rapid determination of the physical address desired within the mass storage, generally within one or two clock cycles. Unfortunately, as is well known, CAM cells require multiple transistors, typically six. Accordingly, an integrated circuit built for a particular size memory using CAM storage for the tables and flags will need to be significantly larger than a circuit using other means for just storing the memory.


The inventors proposed another solution to this problem which is disclosed in U.S. patent application Ser. No. 08/131,495 filed on Oct. 4, 1993, now U.S. Pat. No. 5,485,595. That application is incorporated herein by reference.


This additional previous solution invented by these same inventors is also for a nonvolatile memory storage device. The device is also configured to avoid having to perform an erase-before-write each time a data file is changed by keeping a correlation between logical block address and physical block address in a volatile space management RAM. Further, this invention avoids the overhead associated with CAM cell approaches which require additional circuitry.


Like the solutions disclosed above by these same inventors, the device includes circuitry for performing the two primary algorithms and an associated hardware architecture for a semiconductor mass storage device. In addition, the CAM cell is avoided in this previous solution by using RAM cells.


Reading is performed in this previous solutions by providing the logical block address to the memory storage. The system sequentially compares the stored logical block addresses until it finds a match. That data file is then coupled to the digital system. Accordingly, the performance offered by this solution suffers because potentially all of the memory locations must be searched and compared to the desired logical block address before the physical location of the desired information can be determined.


What is needed is a semiconductor hard disk architecture which provides rapid access to stored data without the excessive overhead of CAM cell storage.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 shows a schematic block diagram of an architecture for a semiconductor mass storage according to the present invention.



FIG. 2 shows an alternative embodiment to the physical block address 102 of the RAM storage of FIG. 1.



FIG. 3 shows a block diagram of a system incorporating the mass storage device of the present invention.



FIGS. 4 through 8 show the status of several of the flags and information for achieving the advantages of the present invention.



FIG. 9 shows a flow chart block diagram of the first algorithm according to the present invention.



FIG. 10 shows a high-level block diagram of a digital system, such as a digital camera, including a preferred embodiment of the present invention.



FIGS. 11-21 illustrate several examples of the state of a mapping table that may be stored in the digital system of FIG. 10 including LBA-PBA mapping information.



FIG. 22 depicts an example of a nonvolatile memory device employed in the preferred embodiment of FIG. 10.



FIG. 23 shows a high-level flow chart of the general steps employed in writing a block of information to the nonvolatile devices of FIG. 10.





DETAILED DESCRIPTION


FIG. 1 shows an architecture for implementation of a solid state storage media according to the present invention. The storage media is for use with a host or other external digital system. The mass storage is partitioned into two portions, a volatile RAM array 100 and a nonvolatile array 104. According to the preferred embodiment, all of the nonvolatile memory storage is FLASH. The FLASH may be replaced by EEPROM. The RAM can be of any convenient type.


The memory storage 104 is arranged into N blocks of data from zero through N−1. Each of the blocks of data is M Bytes long. In the preferred embodiment, each data block is 512 Bytes long to correspond with a sector length in a commercially available hard disk drive plus the extra numbers of bytes to store the flags and logical block address (LBA) information and the associated ECC. The memory 104 can contain as much memory storage as a user desires. An example of a mass storage device might include 100 M Byte of addressable storage.


There are a plurality of RAM locations 102. Each RAM location 102 is uniquely addressable by controller using an appropriate one of the logical block addresses provided by the host system or the actual physical address of the nonvolatile media. The RAM location 102 contains the physical block address of the data associated with the logical block address and the flags associated with a physical block address on the nonvolatile media.


It is possible that the physical block address (PBA) can be split into two fields as shown in FIG. 2. These fields can be used for cluster addresses of a group of data blocks. The first such field 290 is used to select a cluster address and the second such field 292 can be used to select the start address of the logical block address associated with this cluster.


A collection of information flags is also stored for each nonvolatile memory location 106. These flags include an old/new flag 110, a used/free flag 112, a defect flag 114, and a single/sector flag 116. Additionally, there is also a data store 122.


When writing data to the mass storage device of the present invention, a controller determines the first available physical block for storing the data. The RAM location 102 corresponding to the logical block address selected by the host is written with the physical block address where the data is actually stored within the nonvolatile memory array in 104 (FIG. 1).


Assume for example that a user is preparing a word processing document and instructs the computer to save the document. The document will be stored in the mass storage system. The host system will assign it a logical block address. The mass storage system of the present invention will select a physical address of an unused block or blocks in the mass storage for storing the document. The address of the physical block address will be stored into the RAM location 102 corresponding to the logical block address. As the data is programmed, the system of the present invention also sets the used free flag 112 in 104 and 293 to indicate that this block location is used. One used/free flag 112 is provided for each entry of the nonvolatile array 104.


Later, assume the user retrieves the document, makes a change and again instructs the computer to store the document. To avoid an erase-before-write cycle, the system of the present invention provides means for locating a block having its used/free flag 112 in 100 unset (not programmed) which indicates that the associated block is erased. The system then sets the used/free flag for the new block 112 of 106 and 293 of 100 and then stores the modified document in that new physical block location 106 in the nonvolatile array 104. The address of the new physical block location is also stored into the RAM location 102 corresponding the logical block address, thereby writing over the previous physical block location in 102. Next, the system sets the old/new flag 110 of the previous version of the document indicating that this is an old unneeded version of the document in 110 of 104 and 293 of 109. In this way, the system of the present invention avoids the overhead of an erase cycle which is required in the erase-before-write of conventional systems to store a modified version of a previous document.


Because of RAM array 100 will lose its memory upon a power down condition, the logical block address with the active physical block address in the media is also stored as a shadow memory 108 in the nonvolatile array 104. It will be understood the shadow information will be stored into the appropriate RAM locations 102 by the controller. During power up sequence, the RAM locations in 100 are appropriately updated from every physical locations in 104, by reading the information 106 of 104. The logical address 108 of 106 is used to address the RAM location of 100 to update the actual physical block address associated with the given logical block address. Also since 106 is the actual physical block address associated with the new data 122, the flags 110, 112, 114, and 116 are updated in 293 of 102 with the physical block address of 106 in 100. It will be apparent to one of ordinary skill in the art that the flags can be stored in either the appropriate nonvolatile memory location 106 or in both the nonvolatile memory location and also in the RAM location 102 associated with the physical block address.


During power up, in order to assign the most recent physical block address assigned to a logical block address in the volatile memory 100, the controller will first read the Flags 110, 112, 114, and 116 portion of the nonvolatile memory 104 and updates the flags portion 293 in the volatile memory 100. Then it reads the logical block address 108 of every physical block address of the nonvolatile media 104 and by tracking the flags of the given physical block address in the volatile memory 100, and the read logical block address of the physical block address in the nonvolatile memory 104, it can update the most recent physical block address assigned to the read logical block address in the volatile memory 100.



FIG. 3 shows a block diagram of a system incorporating the mass storage device of the present invention. An external digital system 300 such as a host computer, personal computer and the like is coupled to the mass storage device 302 of the present invention. A logical block address is coupled via an address bus 306 to the volatile RAM array 100 and to a controller circuit 304. Control signals are also coupled to the controller 304 via a control bus 308. The volatile RAM array 1.00 is coupled for providing the physical block address to the nonvolatile RAM array 400. The controller 304 is coupled to control both the volatile RAM 100, the nonvolatile array 104, and for the generation of all flags.


A simplified example, showing the operation of the write operation according to the present invention is shown in FIGS. 4 through 8. Not all the information flags are shown to avoid obscuring these features of the invention in excessive detail. The data entries are shown using decimal numbers to further simplify the understanding of the invention. It will be apparent to one of ordinary skill in the art that in a preferred embodiment binary counting will be used.



FIG. 4 shows an eleven entry mass storage device according to the present invention. There is no valid nor usable data stored in the mass storage device of FIG. 4. Accordingly, all the physical block addresses are empty. The data stored in the nonvolatile mass storage location ‘6’ is filled and old. Additionally, location ‘9’ is defective and cannot be used.


The host directs the mass storage device of the example to write data pursuant to the logical block address ‘3’ and then to ‘4’. The mass storage device will first write the data associated with the logical block address ‘3’. The device determines which is the first unused location in the nonvolatile memory. In this example, the first empty location is location ‘0’.


Accordingly, FIG. 5 shows that for the logical block address ‘3’, the corresponding physical block address ‘0’ is stored and the used flag is set in physical block address ‘0’. The next empty location is location ‘1’. FIG. 6 shows that for the logical block address ‘4’, the corresponding physical block address ‘1’ is stored and the used flag is set in physical block address ‘1’.


The host instructs that something is to be written to logical block address ‘3’ again. The next empty location is determined to be location ‘2’. FIG. 7 shows that the old flag in location ‘0’ is set to indicate that this data is no longer usable, the used flag is set in location ‘2’ and the physical block address in location ‘3’ is changed to ‘2’.


Next, the host instructs that something is to be written to logical block address ‘4’ again. The next empty location is determined to, be location ‘3’. FIG. 8 shows that the old flag in location ‘1’ is set to indicate that this data is no longer usable, the used flag is set in location ‘3’ and the physical block address in location ‘4’ is changed to ‘3’. (Recall that there is generally no relation between the physical block address and the data stored in the same location.).



FIG. 9 shows algorithm 1 according to the present invention. When the system of the present invention receives an instruction to program data into the mass storage (step 200), then the system attempts to locate a free block (step 202), i.e., a block having an unset (not programmed) used/free flag. If successful, the system sets the used/free flag for that block and programs the data into that block (step 206).


If on the other hand, the system is unable to locate a block having an unset used/free flag, the system erases the flags (used/free and old/new) and data for all blocks having a set old/new flag and unset defect flag (step 204) and then searches for a block having an unset used/free flag (step 202). Such a block has just been formed by step 204. The system then sets the used/flag for that block and programs the data file into that block (step 206).


If the data is a modified version of a previously existing file, the system must prevent the superseded version from being accessed. The system determines whether the data file supersedes a previous data file (step 208). If so, the system sets the old/new flag associated with the superseded block (step 210). If on the other hand, the data file to be stored is a newly created data file, the step of setting the old/new flag (step 210) is skipped because there is no superseded block. Lastly, the map for correlating the logical address 308—to the physical addresses updated (step 212).


By following the procedure outlined above, the overhead associated with an erase cycle is avoided for each write to the memory 104 except for periodically. This vastly improves the performance of the overall computer system employing the architecture of the present invention.


In the preferred embodiment of the present invention, the programming of the flash memory follows the procedure commonly understood by those of ordinary skill in the art. In other words, the program impulses are appropriately applied to the bits to be programmed and then compared to the data being programmed to ensure that proper programming has occurred. In the event that a bit fails to be erased or programmed properly, a defect flag 148 is set which prevent that block from being used again.



FIG. 10 depicts a digital system 500 such as a digital camera employing an alternative embodiment of the present invention. Digital system 500 is illustrated to include a host 502, which may be a personal computer (PC) or simply a processor of any generic type commonly employed in digital systems, coupled to a controller circuit 506 for storing in and retrieving information from non-volatile memory unit 508.


The controller circuit 506 may be a semiconductor (otherwise referred to as an “integrated circuit” or “chip”) or optionally a combination of various electronic components. In the preferred embodiment, the controller circuit is depicted as a single chip device. The nonvolatile memory unit 508 is comprised of one or more memory devices, which may each be flash or EEPROM types of memory. In the preferred embodiment of FIG. 10, memory unit 508 includes a plurality of flash memory devices, 510-512, each flash device includes individually addressable locations for storing information. In the preferred application of the embodiment in FIG. 10, such information is organized in blocks with each block having one or more sectors of data. In addition to the data, the information being stored may further include status information regarding the data blocks, such as flag fields, address information and the like.


The host 502 is coupled through host information signals 504 to a controller circuit 506. The host information signals comprise of address and data busses and control signals for communicating command, data and other types of information to the controller circuit 506, which in turn stores such information in memory unit 508 through flash address bus 512, flash data bus 514, flash signals 516 and flash status signals 518 (508 and 513-516 collectively referred to as signals 538). The signals 538 may provide command, data and status information between the controller 506 and the memory unit 508.


The controller 506 is shown to include high-level functional blocks such as a host interface block 520, a buffer RAM block 522, a flash controller block 532, a microprocessor block 524, a microprocessor controller block 528, a microprocessor storage block 530, a microprocessor ROM block 534, an ECC logic block 540 and a space manager block 544. The host interface block 520 receives host information signals 504 for providing data and status information from buffer RAM block 522 and microprocessor block 524 to the host 502 through host information signals 504. The host interface block 520 is coupled to the microprocessor block 524 through the microprocessor information signals 526, which is comprised of an address bus, a data bus and control signals.


The microprocessor block 524 is shown coupled to a microprocessor controller block 528, a microprocessor storage block 530 and a microprocessor ROM block 534, and serves to direct operations of the various functional blocks shown in FIG. 10 within the controller 506 by executing program instructions stored in the microprocessor storage block 530 and the microprocessor ROM block 534. Microprocessor 524 may, at times, execute program instructions (or code) from microprocessor ROM block 534, which is a non-volatile storage area. On the other hand, microprocessor storage block 530 may be either volatile, i.e., read-and-write memory (RAM), or non-volatile, i.e., EEPROM, type of memory storage. The instructions executed by the microprocessor block 524, collectively referred to as program code, are stored in the storage block 530 at some time prior to the beginning of the operation of the system of the present invention. Initially, and prior to the execution of program code from the microprocessor storage location 530, the program code may be stored in the memory unit 508 and later downloaded to the storage block 530 through the signals 538. During this initialization, the microprocessor block 524 can execute instructions from the ROM block 534.


Controller 506 further includes a flash controller block 532 coupled to the microprocessor block 524 through the microprocessor information signals 526 for providing and receiving information from and to the memory unit under the direction of the microprocessor. Information such as data may be provided from flash controller block 532 to the buffer RAM block 522 for storage (may be only temporary storage) therein through the microprocessor signals 526. Similarly, through the microprocessor signals 526, data may be retrieved from the buffer RAM block 522 by the flash controller block 532.


ECC logic block 540 is coupled to buffer RAM block 522 through signals 542 and further coupled to the microprocessor block 524 through microprocessor signals 526. ECC logic block 540 includes circuitry for generally performing error coding and correction functions. It should be understood by those skilled in the art that various ECC apparatus and algorithms are commercially available and may be employed to perform the functions required of ECC logic block 540. Briefly, these functions include appending code that is for all intensive purposes uniquely generated from a polynomial to the data being transmitted and when data is received, using the same polynomial to generate another code from the received data for detecting and potentially correcting a predetermined number of errors that may have corrupted the data. ECC logic block 540 performs error detection and/or correction operations on data stored in the memory unit 508 or data received from the host 502.


The space manager block 544 employs a preferred apparatus and algorithm for finding the next unused (or free) storage block within one of the flash memory devices for storing a block of information, as will be further explained herein with reference to other figures. As earlier discussed, the address of a block within one of the flash memory devices is referred to as PBA, which is determined by the space manager by performing a translation on an LBA received from the host. A variety of apparatus and method may be employed for accomplishing this translation. An example of such a scheme is disclosed in U.S. Pat. No. 5,485,595, entitled “Flash Memory Mass Storage Architecture Incorporating Wear Leveling Technique Without Using CAM Cells”, the specification of which is herein incorporated by reference. Other LBA to PBA translation methods and apparatus may be likewise employed without departing from the scope and spirit of the present invention.


Space manager block 544 includes SPM RAM block 548 and SPM control block 546, the latter two blocks being coupled together. The SPM RAM block 548 stores the LBA-PBA mapping information (otherwise herein referred to as translation table, mapping table, mapping information, or table) under the control of SPM control block 546. Alternatively, the SPM RAM block 548 may be located outside of the controller, such as shown in FIG. 3 with respect to RAM array 100.


In operation, the host 502 writes and reads information from and to the memory unit 508 during for example, the performance of a read or write operation through the controller 506. In so doing, the host 502 provides an LBA to the controller 506 through the host signals 504. The LBA is received by the host interface block 520. Under the direction of the microprocessor block 524, the LBA is ultimately provided to the space manager block 544 for translation to a PBA and storage thereof, as will be discussed in further detail later.


Under the direction of the microprocessor block 524, data and other information are written into or read from a storage area, identified by the PBA, within one of the flash memory devices 510-512 through the flash controller block 532. The information stored within the flash memory devices may not be overwritten with new information without first being erased, as earlier discussed. On the other hand, erasure of a block of information (every time prior to being written), is a very time and power consuming measure. This is sometimes referred to as erase-before-write operation. The preferred embodiment avoids such an operation by continuously, yet efficiently, moving a sector (or multiple sectors) of information, within a block, that is being rewritten from a PBA location within the flash memory to an unused PBA location within the memory unit 508 thereby avoiding frequent erasure operations. A block of information may be comprised of more than one sector such as 16 or 32 sectors. A block of information is further defined to be an individually-erasable unit of information. In the past, prior art systems have moved a block stored within flash memory devices that has been previously written into a free (or unused) location within the flash memory devices. Such systems however, moved an entire block even when only one sector of information within that block was being re-written. In other words, there is waste of both storage capacity within the flash memory as well as waste of time in moving an entire block's contents when less than the total number of sectors within the block are being re-written. The preferred embodiments of the present invention, as discussed herein, allow for “moves” of less than a block of information thereby decreasing the number of move operations of previously-written sectors, consequently, decreasing the number of erase operations.


Referring back to FIG. 10, it is important to note that the SPM RAM block 548 maintains a table that may be modified each time a write operation occurs thereby maintaining the LBA-PBA mapping information and other information regarding each block being stored in memory unit 508. Additionally, this mapping information provides the actual location of a sector (within a block) of information within the flash memory devices. As will be further apparent, at least a portion of the information in the mapping table stored in the SPM RAM block 548 is “shadowed” (or copied) to memory unit 508 in order to avoid loss of the mapping information when power to the system is interrupted or terminated. This is, in large part, due to the use of volatile memory for maintaining the mapping information. In this connection, when power to the system is restored, the portion of the mapping information stored in the memory unit 508 is transferred to the SPM RAM block 548.


It should be noted, that the SPM RAM block 548 may alternatively be nonvolatile memory, such as in the form of flash or EEPROM memory architecture. In this case, the mapping table will be stored within nonvolatile memory thereby avoiding the need for “shadowing” because during power interruptions, the mapping information stored in nonvolatile memory will be clearly maintained.


When one or more sectors are being moved from one area of the flash memory to another area, the preferred embodiment of the present invention first moves the sector(s) from the location where they are stored in the flash memory devices, i.e., 510-512, to the buffer RAM block 522 for temporary storage therein. The moved sector(s) are then moved from the buffer RAM block 522 to a free area within one of the flash memory devices. It is further useful to note that the ECC code generated by the ECC logic block 540, as discussed above, is also stored within the flash memory devices 510-512 along with the data, as is other information, such as the LBA corresponding to the data and flag fields.



FIGS. 11-21 are presented to show examples of the state of a table 700 in SPM RAM block 548 configured to store LBA-PBA mapping information for identification and location of blocks (and sectors within the blocks) within the memory unit 508. Table 700 in all of these figures is shown to include an array of columns and rows with the columns including virtual physical block address locations or VPBA block address locations 702, move virtual physical address locations or MVPBA block address locations 704, move flag locations 706, used/free flag locations 708, old/new flag locations 710, defect flag locations 712 and sector move status locations 714.


The rows of table include PBA/LBA rows 716, 718 through 728 with each row having a row number that may be either an LBA or a PBA depending upon the information that is being addressed within the table 700. For example, row 716 is shown as being assigned row number ‘00’ and if PBA information in association with LBA ‘00’ is being retrieved from table 700, then LBA ‘00’ may be addressed in SPM RAM block 548 at row 716 to obtain the associated PBA located in 730. On the other hand, if status information, such as flag fields, 706-712, regarding a block is being accessed, the row numbers of rows 716-728, such as ‘00’, ‘10’, ‘20’, ‘30’, ‘40’, ‘50’, ‘N−1’ represent PBA, as opposed to LBA, values. Furthermore, each row of table 700 may be thought of as a block entry wherein each entry contains information regarding a block. Furthermore, each row of table 700 may be addressed by an LBA.


In the preferred embodiment, each block is shown to include 16 sectors. This is due to the capability of selectively erasing an entire block of 16 sectors (which is why the block size is sometimes referred to as an “erase block size”. If an erase block size is 16 sectors, such as shown in FIGS. 11-21, each block entry (or row) includes information regarding 16 sectors. Row 716 therefore includes information regarding a block addressed by LBA ‘00’ through LBA ‘15’ (or LBA ‘00’ through LBA ‘0F’ in Hex. notation). The next row, row 718, includes information regarding blocks addressed by LBA ‘16’ (or ‘10’ in Hex.) through LBA ‘31’ (or ‘1F’ in Hex.) The same is true for PBAs of each block.


It should be noted however, other block sizes may be similarly employed. For example, a block may include 32 sectors and therefore have an erase block size of 32 sectors. In the latter situation, each block entry or row, such as 716, 718, 720 . . . , would include information regarding 32 sectors.


The VPBA block address locations 702 of table 700 stores information generally representing a PBA value corresponding to a particular LBA value. The MVPBA block address locations 704 store information representing a PBA value identifying, within the memory unit 508, the location of where a block (or sector portions thereof) may have been moved. The move flag locations 706 store values indicating whether the block being accessed has any sectors that may have been moved to a location whose PBA is indicated by the value in the MVPBA block address location 704 (the PBA value within 704 being other than the value indicated in VPBA block address 702 wherein the remaining block address information may be located). The used/new flag location 708 stores information to indicate whether the block being accessed is a free block, that is, no data has been stored since the block was last erased. The old/new flag location 710 stores information representing the status of the block being accessed as to whether the block has been used and re-used and therefore, old. The defect flag location 712 stores information regarding whether the block is defective. If a block is declared defective, as indicated by the value in the defect flag location 712 being set, the defective block can no longer be used. Flags 708-712 are similar to the flags 110-114 shown and described with respect to FIG. 1.


Sector move status location 714 is comprised of 16 bits (location 714 includes a bit for each sector within a block so for different-sized blocks, different number of bits within location 714 are required) with each bit representing the status of a sector within the block as to whether the sector has been moved to another block within the memory unit 508. The moved block location within the memory unit 508 would be identified by a PBA that is other than the PBA value in VPBA block address location 702. Said differently, the status of whether a sector within a block has been moved, as indicated by each of the bits within 714, suggests which one of either the VPBA block address locations 702 or the MBPBA block address locations 704 maintain the most recent PBA location for that sector.


Referring still to FIG. 11, an example of the status of the table 700 stored in SPM RAM block 548 (in FIG. 10) is shown when, by way of example, LBA ‘0’ is being written. As previously noted, in the figures presented herein, a block size of sixteen sectors (number 0-15 in decimal notation or 0-10 in hexadecimal notation) is used to illustrate examples only. Similarly, N blocks (therefore N LBAs) are employed, numbered from 0-N−1. The block size and the number of blocks are both design choices that may vary for different applications and may depend upon the memory capacity of each individual flash memory device (such as 510-512) being employed. Furthermore, a preferred sector size of 512 bytes is used in these examples whereas other sector sizes may be employed without departing from the scope and spirit of the present invention.


Assuming that the operation of writing to LBA ‘0’ is occurring after initialization or system power-up when all of the blocks within the flash memory devices 510-512 (in FIG. 10) have been erased and are thus free. The space manager block 548 is likely to determine that the next free PBA location is ‘00’. Therefore, ‘00’ is written to 730 in VPBA block address 702 of row 716 wherein information regarding LBA ‘0’ is maintained, as indicated in table 700 by LBA row number ‘00’. Since no need exists for moving any of the sectors within the LBA 0 block, the MVPBA block address 704 for row 716, which is shown as location 732 may include any value, such as an initialization value (in FIG. 11, ‘XX’ is shown to indicate a “don't care” state).


The value in 734 is at logic state ‘0’ to show that LBA ‘0’ block does not contain any moved sectors. Location 736 within the used flag 708 column of row 716 will be set to logic state ‘1’ indicating that the PBA ‘0’ block is in use. The state of location 738, representing the old flag 710 for row 716, is set to ‘0’ to indicate that PBA ‘0’ block is not “old” yet. Location 740 maintains logic state ‘0’ indicating that the PBA ‘0’ block is not defective and all of the bits in move status location 714 are at logic state ‘0’ to indicate that none of the sectors within the LBA ‘0’ through LBA ‘15’ block have been moved.


In FIG. 11, the status information for LBA ‘0’ in row 716, such as in move flag location 706, used flag location 708, old flag location 710, defect flag location 712 and move status location 714 for all remaining rows, 716-728, of table 700 are at logic state ‘0’. It is understood that upon power-up of the system and/or after erasure of any of the blocks, the entries for the erased blocks, which would be all blocks upon power-up, in table 700, are all set to logic state ‘0’.


At this time, a discussion of the contents of one of the flash memory devices within the memory unit 508, wherein the LBA ‘0’ block may be located is presented for the purpose of a better understanding of the mapping information shown in table 700 of FIG. 11.


Turning now to FIG. 22, an example is illustrated of the contents of the flash memory device 510 in accordance with the state of table 700 (as shown in FIG. 11). LBA ‘0’, which within the memory unit 508 is identified at PBA ‘0’ by controller 506 (of FIG. 10) is the location wherein the host-identified block is written. A PBA0 row 750 is shown in FIG. 22 to include data in sector data location 752. An ECC code is further stored in ECC location 754 of PBA0 row 750. This ECC code is generated by the ECC logic block 540 in association with the data being written, as previously discussed. Flag field 756 in PBA0 row 750 contains the move, used, old and defect flag information corresponding to the sector data of the block being written. In this example, in flag field 756, the “used” flag and no other flag is set, thus, flag field 756 maintains a logic state of ‘0100’ indicating that PBA ‘0’ is “used” but not “moved”, “old” or “defective”.


PBA0 row 750 additionally includes storage location for maintaining in LBA address location 758, the LBA number corresponding to PBA ‘0’, which in this example, is ‘0’. While not related to the example at hand, the remaining PBA locations of LBA ‘0’ are stored in the next 15 rows following row 750 in the flash memory device 510.


It will be understood from the discussion of the examples provided herein that the information within a PBA row of flash memory device 510 is enough to identify the data and status information relating thereto within the LBA ‘0’ block including any moves associated therewith, particularly due to the presence of the “move” flag within each PBA row (750, 762, 764, . . . ) of the flash memory. Nevertheless, alternatively, another field may be added to the first PBA row of each LBA location within the flash, replicating the status of the bits in the move status location 714 of the corresponding row in table 700. This field is optionally stored in sector status location 760 shown in FIG. 22 to be included in the first PBA row of each LBA block, such as row 750, 780 and so on. Although the information maintained in location 760 may be found by checking the status of the “move” flags within the flag fields 756 of each PBA row, an apparent advantage of using location 760 is that upon start-up (or power-on) of the system, the contents of table 700 in SPM RAM block 548 may be updated more rapidly due to fewer read operations (the reader is reminded that table 700 is maintained in SPM RAM 548, which is volatile memory whose contents are lost when the system is power-down and needs to be updated upon power-up from non-volatile memory, i.e. memory unit 508).


That is, rather than reading every PBA row (altogether 16 rows in the preferred example) to update each LBA entry of the table 700 upon power-up, only the first PBA row of each LBA must be read from flash memory and stored in SPM RAM 548 thereby saving time by avoiding needless read operations. On the other hand, clearly more memory capacity is utilized to maintain 16 bits of sector status information per LBA.


In the above example, wherein location 760 is used, the value in sector status location 760 would be all ‘0’s (or ‘0000’ in hexadecimal notation).


In flash memory device 510, each of the rows 750, 762, 764, 768 . . . , is a PBA location with each row having a PBA row number and for storing data and other information (data and other information are as discussed above with respect to row 750) for a sector within a block addressed by a particular LBA. Furthermore, every sixteen sequential PBA rows represents one block of information. That is, PBA rows 750, 762, 764 through 768, which are intended to show 16 PBA rows correspond to LBA 0 (shown as row 716 in table 700 of FIG. 11) and each of the PBA rows maintains information regarding a sector within the block. The next block of information is for the block addressed by LBA ‘10’ (in Hex.) whose mapping information is included in row 718 of table 700, and which is stored in locations starting from ‘10’ (in hexadecimal notation, or ‘16’ in decimal notation) and ending at ‘1F’ (in hexadecimal notation, or ‘31’) in the flash memory device 510 and so on.


Continuing on with the above example, FIG. 12 shows an example of the state of table 700 when LBA 0 is again being written by the host. Since LBA 0 has already been written and is again being written without first being erased, another free location within the memory unit 508 (it may serve helpful to note here that the blocks, including their sectors, are organized sequentially and continuously through each of the flash memory devices of memory unit 508 according to their PBAs such that for example, the next flash memory device following device 510 picks up the PBA-addressed blocks where flash memory device 510 left off, an example of this is where flash memory device 510 includes PBAs of 0-FF (in Hex.) and the next flash memory device, which may be 512, may then include 100-1FF (in Hex.)) is located by space manager 544 for storage of the new information. This free location is shown to be PBA ‘10’ (in Hexadecimal notation, or 16 in decimal notation). In row 718, where the entries for LBA ‘10’ will remain the same as shown in FIG. 11 except the used flag in location 742 will be set (in the preferred embodiment, a flag is set when it is at logic state ‘1’ although the opposite polarity may be used without deviating from the present invention) to indicate that the PBA ‘10’ is now “in use”.


The entries in row 716 are modified to show ‘10’ in MVPBA block address location 732, which provides the PBA address of the moved portion for the LBA ‘00’ block. The move flag in location 734 is set to logic state ‘1’ to indicate that at least a portion (one or more sectors) of the LBA ‘00’ block have been moved to a PBA location other than the PBA location indicated in location 730 of table 700. Finally, the bits of the move status location 714 in row 716 are set to ‘1000000000000000’ (in binary notation, or ‘8000’ in hexadecimal notation), reflecting the status of the moved sectors within the block LBA ‘00’. That is, in this example, ‘8000’ indicates that the first sector, or sector ‘0’, within LBA ‘00’ block has been moved to a different PBA location.


Referring now to FIG. 22, the state of table 700 in FIG. 12 will affect the contents of the flash memory device 510 in that the moved sector of the LBA ‘0’ block will now be written to PBA ‘10’ in row 780. Row 780 will then include the data for the moved sector, which is 512 bytes in size. With respect to the moved sector information, row 780 further includes ECC code, a copy of the values in flag locations 734-740 of table 700 (in FIG. 12), and LBA ‘00’ for indicating that the data in row 780 belongs to LBA ‘00’ and may further include the move status for each of the individual sectors within the LBA ‘0’ block.


While not specifically shown in the figure, the move flag within location 756 of PBA row 750 is set to indicate that at least a portion of the corresponding block has been moved. The value stored in the move status location 714 of row 716 (in FIG. 12), which is ‘8000’ in Hex., is also stored within location 760 of the row 750. As earlier noted, this indicates that only sector ‘0’ of PBA ‘0’ was marked “moved” and the new block LBA ‘0’ was written to PBA ‘10’ in flash memory. Without further detailed discussions of FIG. 22, it should be appreciated that the examples to follow likewise affect the contents of the flash memory device 510.



FIG. 13 shows the status of table 700 when yet another write operation to LBA ‘00’ is performed. The values (or entries) in row 716 remain the same as in FIG. 12 except that the value in location 732 is changed to ‘20’ (in Hex. Notation) to indicate that the moved portion of block LBA ‘00’ is now located in PBA location ‘20’ (rather than ‘10’ in FIG. 12). As in FIG. 12, the value in move status location 714, ‘8000’, indicates that the first sector (with PBA ‘00’) is the portion of the block that has been moved.


Row 718 is modified to show that the LBA ‘10’ block is now old and can no longer be used before it is erased. This is indicated by the value in location 744 being set to logic state ‘1’. The entries for LBA ‘20’, row 720, remain unchanged except that location 746 is modified to be set to logic state ‘1’ for reflecting the state of the PBA ‘20’ block as being in use. It is understood that as in FIGS. 11 and 12, all remaining values in table 700 of FIG. 13 that have not been discussed above and are not shown as having a particular logic state in FIG. 13 are all unchanged (the flags are all set to logic state ‘0’).


Continuing further with the above example, FIG. 14 shows the state of table 700 when yet another write to LBA ‘0’ occurs. For ease of comparison, there is a circle drawn around the values shown in FIG. 14, which are at a different logic state with respect to their states shown in FIG. 13. In row 716, everything remains the same except for the new moved location, indicated as PBA ‘30’ shown in location 732. PBA ‘30’ was the next free location found by the space manager 544. As previously noted, this value indicates that a portion of the block of LBA ‘0’ is now in PBA ‘30’; namely, the first sector (shown by the value in 714 of row 716 being ‘8000’) in that block has been moved to PBA ‘30’ in the flash memory device 510.


Row 718 remains the same until it is erased. The flags in locations 742 and 744 are set to logic state ‘0’. Row 720 also remains unchanged except for the value in its old flag 710 column being modified to ‘1’ to show that the block of PBA ‘20’ is also old and can not be used until first erased. Row 722 remains the same except for the value in its used flag 708 column being changed to logic state ‘1’ to show that the block of LBA ‘30’ is now in use.



FIG. 15 is another example of the state of table 700, showing the state of table 700 assuming that the table was at the state shown in FIG. 13 and followed by the host writing to LBA ‘5’. Again, the changes to the values in table 700 from FIG. 13 to FIG. 15 are shown by a circle drawn around the value that has changed, which is only one change.


When writing to LBA ‘5’, it should be understood that the LBA entries of rows 716, 718, 720, etc. are only for LBA ‘00’, LBA ‘10’, LBA ‘20’, so on, and therefore do not reflect an LBA ‘5’ entry. The reader is reminded that each of the LBA row entries is for a block of information with each block being 16 sectors in the preferred embodiment. For this reason, LBA ‘5’ actually addresses the fifth sector in row 716. Since PBA ‘20’ was used to store LBA ‘0’, only the sector within PBA ‘20’, corresponding to LBA ‘5’, is yet not written and “free”. Therefore, the data for LBA ‘5’ is stored in PBA ‘20’ in sector ‘5’. The move status location 714 of row 716 will be modified to logic state ‘8400’ (in Hex. Notation). This reflects that the location of the first and fifth sectors within LBA ‘0’ are both identified at PBA ‘20’ in the flash memory device 510. The remaining values in table 700 of FIG. 15 remain the same as those shown in FIG. 13.



FIGS. 16-18 show yet another example of what the state of table 700 may be after either power-up or erasure of the blocks with the memory unit 508. In FIGS. 16 and 17, the same write operations as those discussed with reference to FIGS. 11 and 12 are performed. The state of table 700 in FIGS. 16 and 17 resembles that of FIGS. 11 and 12, respectively (the latter two figures have been re-drawn as FIGS. 16 and 17 for the sole convenience of the reader). Briefly, FIG. 16 shows the state of table 700 after a write to LBA ‘0’ and FIG. 17 shows the state of table 700 after another write to LBA ‘0’.



FIG. 18 picks up after FIG. 17 and shows the state of table 700 after the host writes to LBA ‘5’. As indicated in FIG. 18, LBA ‘5’ has been moved to PBA ‘10’ where LBA ‘0’ is also located. To this end, MBPBA block address location 732 is set to ‘10’ in row 716 and the move flag is set at location 734 in the same row. Moreover, the state of move status location 714 in row 716 is set to ‘8400’ (in Hex.) indicating that LBA ‘0’ and LBA ‘5’ have been moved, or that the first and fifth sectors within LBA ‘00’ are moved. Being that these two sectors are now located in the PBA ‘10’ location of the flash memory device 510, the move flag for each of the these sectors are also set in the flash memory device 510. It should be understood that LBA ‘5’ was moved to PBA ‘10’ because remaining free sectors were available in that block. Namely, even with LBA ‘0’ of that block having been used, 15 other sectors of the same block were available, from which the fifth sector is now in use after the write to LBA ‘5’.


Continuing on with the example of FIG. 18, in FIG. 19, the state of the table 700 is shown after the host writes yet another time to LBA ‘0’. According to the table, yet another free PBA location, ‘20’, is found where both the LBA ‘5’ and LBA ‘0’ are moved. First, LBA ‘5’ is moved to the location PBA ‘10’ to PBA ‘20’ and then the new block of location LBA ‘0’ is written to PBA ‘20’. As earlier discussed, any time there is a move of a block (for example, here the block of LBA ‘5’ is moved) it is first moved from the location within flash memory where it currently resides to a temporary location within the controller 506, namely with the buffer RAM block 522, and then it is transferred from there to the new location within the flash memory devices.


The used flag in location 746 of row 720 is set to reflect the use of the PBA ‘20’ location in flash memory and the old flag in location 744 is set to discard use of PBA ‘10’ location until it is erased. Again, in flash memory, the state of these flags as well as the state of the move flag for both the LBA ‘0’ and LBA ‘5’ sectors are replicated.



FIG. 20 picks up from the state of the table 700 shown in FIG. 18 and shows yet another state of what the table 700 may be after the host writes to LBA ‘5’. In this case, the block of LBA ‘0’ is first moved from location PBA ‘10’ within the flash memory device 510 wherein it is currently stored to location PBA ‘20’ of the flash memory. Thereafter, the new block being written to LBA ‘5’ by the host is written into location PBA ‘20’ of the flash memory. The flags in both table 700 and corresponding locations of the flash memory device 510 are accordingly set to reflect these updated locations.



FIG. 21 also picks up from the state of the table 700 shown in FIG. 18 and shows the state of what the table 700 may be after the host writes to LBA ‘7’. In this case, the new block is simply written to location PBA ‘10’ of the flash memory since that location has not yet been used. Additionally, three of the bits of the move status location 714 in row 716 are set to show that LBA ‘0’, LBA ‘5’ and LBA ‘7’ have been moved to another PBA location within the flash memory. Location 732 shows that the location in which these three blocks are stored is PBA ‘10’.


As may be understood from the discussion presented thus far, at some point in time, the number of sectors being moved within a block makes for an inefficient operation. Thus, the need arises for the user to set a threshold for the number of sectors within a block that may be moved before the block is declared “old” (the old flag is set) and the block is no longer used, until it is erased. This threshold may be set at, for example, half of the number of sectors within a block. This is demonstrated as follows: For a block having 16 sectors, when 8 of the sectors are moved into another block, the “original” block and the “moved” block (the block in which the moved sectors reside) are combined into the same PBA block. The combined PBA block may be stored in a new block altogether or, alternatively, the “original” block may be combined with and moved into the “moved” block. In the latter case, the “original” block is then marked as “old” for erasure thereof. If the combined PBA block is stored in a new block, both of the “original” and the “moved” blocks are marked as “old”.



FIG. 23 depicts a general flow chart outlining some of the steps performed during a write operation. It is intended to show the sequence of some of the events that take place during such an operation and is not at all an inclusive presentation of the method or apparatus used in the preferred embodiment of the present invention.


The steps as outlined in FIG. 23 are performed under the direction of the microprocessor block 524 as it executes program code (or firmware) during the operation of the system.


When the host writes to a block of LBA M, step 800, the space manager block 544, in step 802, checks as to whether LBA M is in use by checking the state of the corresponding used flag in table 700 of the SPM RAM block 548. If not in use, in step 804, a search is performed for the next free PBA block in memory unit 508. If no free blocks are located, an “error” state is detected in 808. But where a free PBA is located, in step 806, its used flag is marked (or set) in table 700 as well as in flash memory. In step 810, the PBA of the free block is written into the VPBA block address 702 location of the corresponding LBA row in table 700.


Going back to step 802, if the LBA M block is in use, search for the next free PBA block is still conducted in step 812 and upon the finding of no such free block, at 814, an “error” condition is declared. Whereas, if a free PBA location is found, that PBA is marked as used in table 700 and flash memory, at step 816. Next, in step 818, the state of the block is indicated as having been moved by setting the move flag as well as the setting the appropriate bit in the move status location 714 of table 700. The new location of where the block is moved is also indicated in table 700 in accordance with the discussion above.


Finally, after steps 818 and 810, data and all corresponding status information, ECC code and LBA are written into the PBA location within the flash memory.


As earlier indicated, when a substantial portion of a block has sectors that have been moved (in the preferred embodiment, this is eight of the sixteen sectors), the block is declared “old” by setting its corresponding “old” flag. Periodically, blocks with their “old” flags set, are erased and may then be re-used (or re-programmed, or re-written).


As can be appreciated, an advantage of the embodiments of FIGS. 10-23 is that a block need not be erased each time after it is accessed by the host because if for example, any portions (or sectors) of the block are being re-written, rather than erasing the block in the flash memory devices or moving the entire block to a free area within the flash, only the portions that are being re-written need be transferred elsewhere in flash, i.e. free location identified by MVPA block address. In this connection, an erase cycle, which is time consuming is avoided until later and time is not wasted in reading an entire block and transferring the same.


CONCLUSION

Although the present invention has been described in terms of specific embodiments, it is anticipated that alterations and modifications thereof will no doubt become apparent to those skilled in the art. It is therefore intended that the following claims be interpreted as covering all such alterations and modification as fall within the true spirit and scope of the invention.

Claims
  • 1. A storage device, comprising: a non-volatile memory organized into physical blocks, wherein each physical block comprises a plurality of sectors corresponding to a plurality of logical block addresses; anda controller coupled to the memory;wherein only one sector in each physical block comprises a sector status location configured to store information that indicates a move status of each sector of a respective physical block; andwherein the only one sector in each physical block that comprises the sector status location is configured to store a sector of data in addition to the information that indicates the move status.
  • 2. The storage device of claim 1, wherein, upon power-up, the controller is configured to read the information from each sector status location and store it in a memory of the controller.
  • 3. The storage device of claim 2, wherein the memory of the controller is accessible without accessing the particular physical block.
  • 4. The storage device of claim 3, wherein the memory of the controller comprises a table comprising a plurality of fields, wherein the fields respectively store the information from sector status locations upon power up.
  • 5. The storage device of claim 1, wherein the sector status location of the only one sector in each physical block comprises bits corresponding to respective ones of the sectors in a respective physical block, and wherein a value of a bit indicates whether the corresponding sector has been moved.
  • 6. A non-volatile memory, comprising: erasable blocks of memory cells;wherein one or more of the erasable blocks includes a particular block to be identified by a particular group of logical block addresses corresponding to a predetermined group of sectors of the particular block;wherein fewer than all of the sectors of the predetermined group of sectors of the particular block can be moved to an erasable block other than the particular block;wherein only one sector of the particular block comprises a sector status location for storing information indicating the move status of each of the sectors of the predetermined group of sectors of the particular block; andwherein the only one sector of the particular block that comprises the sector status location is configured to store a sector of data in addition to the information that indicates the move status.
  • 7. A method of operating a storage system, comprising: transferring a sector of data from a first used erasable block within a non-volatile memory over a data bus to a temporary storage location within a memory controller that is located externally of the non-volatile memory and that is coupled to the non-volatile memory by the data bus; andtransferring the sector of data over the data bus from the temporary storage location within memory controller to a free erasable block within the non-volatile memory;wherein the sector of data transferred from the first used erasable block replaces a sector of data in a sector of a plurality of sectors in a second used erasable block, wherein each sector of the plurality of sectors in the second used erasable block corresponds to a logical block address and is configured to store a sector of data; andwherein only one sector of the plurality of sectors in the second used erasable block comprises a sector status location that indicates a move status of each of the sectors of the second used erasable block so that the only one sector of the plurality of sectors in the second used erasable block is configured to store the sector of data in addition to the move status of each of the sectors of the second used erasable block.
  • 8. The method of claim 7, wherein transferring the sector of data from the first used erasable block within the non-volatile memory over the data bus to the temporary storage location within the memory controller comprises transferring the sector of data from the first used erasable block within the non-volatile memory over the data bus to a RAM buffer within the memory controller.
  • 9. The method of claim 7, wherein transferring the sector of data from the first used erasable block within the non-volatile memory comprises transferring the sector of data from a first used erasable block within a non-volatile memory device of the non-volatile memory.
  • 10. The method of claim 9, wherein transferring the sector of data over the data bus from the temporary storage location within memory controller to the free erasable block within the non-volatile memory comprises transferring the sector of data over the data bus from the temporary storage location within the memory controller to a free erasable block within the non-volatile memory device of the non-volatile memory or within another non-volatile memory device of the non-volatile memory.
  • 11. The method of claim 7, further comprising writing information in the sector status location that indicates the move status of the sector that has been moved to the free erasable block.
  • 12. The method of claim 7, wherein transferring the sector of data over the data bus from the temporary storage location within memory controller to the free erasable block comprises transferring that sector of data from the temporary storage location to a free sector in the free erasable block, and further comprising, after transferring the sector of data from the temporary storage location to the free sector in the free erasable block, rewriting an other sector of data in the first used erasable block to another free sector in the free erasable block.
  • 13. The method of claim 12, further comprising, after rewriting the other sector of data in the first used erasable block to the another free sector in the free erasable block, writing information into a storage location within the controller indicating that the used erasable block cannot be used prior to erasure.
  • 14. A method of operating a storage system, comprising: receiving a logical block address at a controller, the logical block address corresponding to a particular sector of a plurality of sectors, corresponding to a plurality of logical block addresses, of a first erasable memory block of a non-volatile memory, wherein only one sector of the plurality of sectors of a the first erasable memory block comprises a sector status location that is configured to store information indicating a replacement status of each of the sectors in the first erasable memory block;determining at the controller whether the particular sector of the plurality of sectors of the first erasable memory block is programmed;if the particular sector of the plurality of sectors of the first erasable memory block is programmed, finding an unprogrammed sector within a second erasable memory block of the non-volatile memory;writing data to the unprogrammed sector within the second erasable memory block so that the unprogrammed sector within the second erasable memory block is now a programmed sector within the second erasable memory block; andwriting information to the sector status location indicating that the particular sector of the plurality of sectors of the first erasable memory block is replaced;wherein the only one sector of the plurality of sectors of the first erasable memory block that comprises the sector status location is further configured to store a sector of data in addition to the information indicating the replacement status of each of the sectors in the first erasable memory block.
  • 15. The method of claim 14, further comprising moving the data contained in the programmed sector within the second erasable memory block from the programmed sector within the second erasable memory block to an unprogrammed sector of a third erasable memory block in response to determining at the controller that data in an other sector in the second erasable memory block is to be rewritten and in response to determining at the controller that the data in the other sector in the second erasable memory block replaces data in another sector of the first erasable memory block of a non-volatile memory.
  • 16. The method of claim 15, wherein moving the data contained in the programmed sector within the second erasable memory block comprises: moving the data contained in the programmed sector within the second erasable memory block from the programmed sector within the second erasable memory block to a storage location within the controller over a data bus coupled between the non-volatile memory and the controller; andmoving the data that was moved from the programmed sector within the second erasable memory block to the storage location within the controller from the storage location within the controller to the unprogrammed sector of the third erasable memory block over the data bus.
  • 17. The method of claim 15, further comprising after moving the data contained in the programmed sector within the second erasable memory block from the programmed sector within the second erasable memory block to the unprogrammed sector of the third erasable memory block, writing information to a storage location within the controller indicating that the second erasable memory block cannot be used unless it is erased.
  • 18. The storage device of claim 14, wherein the only one sector of the plurality of sectors of the first erasable memory block is the particular sector of the plurality of sectors of the first erasable memory block.
  • 19. A non-volatile memory, comprising: erasable blocks of memory cells;wherein one or more of the erasable blocks includes a particular block to be identified by a particular group of logical block addresses corresponding to a predetermined group of sectors of the particular block;wherein fewer than all of the sectors of the predetermined group of sectors of the particular block can be moved to an erasable block other than the particular block; andwherein only one sector of the particular block comprises a sector status location for storing information indicating the move status of each of the sectors of the predetermined group of sectors of the particular block; andwherein the only one sector of the particular block that comprises the sector status location further comprises a sector data location configured to store a sector of data.
  • 20. The non-volatile memory of claim 19, wherein the fewer than all of the sectors of the predetermined group of sectors of the particular block that have been moved to the erasable block other than the particular block and other sectors of the predetermined group of sectors of the particular block that have not been moved are part of a same single logical block specified by a host.
  • 21. The non-volatile memory of claim 19, wherein upon power up, the information in the sector status location is read from the sector status location and stored in a controller coupled to the non-volatile memory.
  • 22. The non-volatile memory of claim 19, wherein the erasable block other than the particular block is addressable by a move virtual physical block address from a controller coupled to the non-volatile memory, wherein the move virtual physical block address represents a physical block address value identifying a location of the erasable block other than the particular block.
  • 23. The non-volatile memory of claim 19, wherein each sector of the particular block comprises a flag field for indicating whether that sector has been moved to the erasable block other than the particular block.
  • 24. The non-volatile memory of claim 19, wherein the sector status location is configured to store a plurality of bits, where the bits respectively correspond to the sectors predetermined group of sectors.
  • 25. The non-volatile memory of claim 24, wherein the bits that respectively correspond to the fewer than all of the sectors of the predetermined group of sectors of the particular block that have been moved to the erasable block other than the particular block have a first value and the bits that respectively correspond to other sectors of the predetermined group of sectors of the particular block that have not been moved have a second value different from the first value.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 12/243,538, filed on Oct. 1, 2008, now U.S. Pat. No. 7,908,426, issued Mar. 15, 2011, titled “Moving Sectors Within A Block of Information In A Flash Memory Mass Storage Architecture,” which is a divisional of U.S. application Ser. No. 11/201,612 of the same title, filed on Aug. 10, 2005, now U.S. Pat. No. 7,441,090, which is a continuation of U.S. application Ser. No. 09/620,544 of the same title, filed on Jul. 21, 2000, now U.S. Pat. No. 6,978,342, which is a continuation of U.S. application Ser. No. 09/264,340 of the same title, filed on Mar. 8, 1999, now U.S. Pat. No. 6,145,051, which is a continuation of U.S. application Ser. No. 08/831,266 of the same title, filed on Mar. 31, 1997, now U.S. Pat. No. 5,907,856, which is a continuation-in-part of U.S. application Ser. No. 08/509,706, filed on Jul. 31, 1995, now U.S. Pat. No. 5,845,313, and entitled “Direct Logical Block Addressing Flash Memory Mass Storage Architecture,” all of which are incorporated herein by reference.

US Referenced Citations (264)
Number Name Date Kind
4099069 Cricchi et al. Jul 1978 A
4130900 Watanabe Dec 1978 A
4210959 Wozniak Jul 1980 A
4309627 Tabata Jan 1982 A
4355376 Gould Oct 1982 A
4398248 Hsia et al. Aug 1983 A
4405952 Slakmon Sep 1983 A
4414627 Nakamura Nov 1983 A
4450559 Bond et al. May 1984 A
4456971 Fukuda et al. Jun 1984 A
4468730 Dodd et al. Aug 1984 A
4473878 Zolnowsky et al. Sep 1984 A
4476526 Dodd Oct 1984 A
4498146 Martinez Feb 1985 A
4525839 Nozawa et al. Jun 1985 A
4532590 Wallach et al. Jul 1985 A
4609833 Guterman Sep 1986 A
4616311 Sato Oct 1986 A
4654847 Dutton Mar 1987 A
4710871 Belknap et al. Dec 1987 A
4746998 Robinson et al. May 1988 A
4748320 Yorimoto et al. May 1988 A
4757474 Fukushi et al. Jul 1988 A
4774700 Satoh et al. Sep 1988 A
4780855 Iida et al. Oct 1988 A
4788665 Fukuda et al. Nov 1988 A
4797543 Watanabe Jan 1989 A
4800520 Iijima Jan 1989 A
4829169 Watanabe May 1989 A
4843224 Ohta et al. Jun 1989 A
4896262 Wayama et al. Jan 1990 A
4914529 Bonke Apr 1990 A
4920518 Nakamura et al. Apr 1990 A
4924331 Robinson et al. May 1990 A
4943745 Watanabe et al. Jul 1990 A
4953122 Williams Aug 1990 A
4970642 Yamamura Nov 1990 A
4970727 Miyawaki et al. Nov 1990 A
5070474 Tuma et al. Dec 1991 A
5093785 Iijima Mar 1992 A
5168465 Harari Dec 1992 A
5198380 Harari Mar 1993 A
5200959 Gross et al. Apr 1993 A
5218695 Noveck et al. Jun 1993 A
5220518 Haq Jun 1993 A
5226168 Kobayashi et al. Jul 1993 A
5227714 Lou Jul 1993 A
5253351 Yamamoto et al. Oct 1993 A
5267218 Elbert Nov 1993 A
5268318 Harari Dec 1993 A
5268870 Harari Dec 1993 A
5270979 Harari et al. Dec 1993 A
5293560 Harari Mar 1994 A
5297148 Harari et al. Mar 1994 A
5303198 Adachi et al. Apr 1994 A
5305276 Uenoyama Apr 1994 A
5305278 Inoue Apr 1994 A
5315541 Harari et al. May 1994 A
5315558 Hag May 1994 A
5329491 Brown et al. Jul 1994 A
5337275 Garner Aug 1994 A
5341330 Wells et al. Aug 1994 A
5341339 Wells Aug 1994 A
5341341 Fukuzo Aug 1994 A
5353256 Fandrich et al. Oct 1994 A
5357475 Hasbun et al. Oct 1994 A
5359569 Fujita et al. Oct 1994 A
5365127 Manley Nov 1994 A
5369615 Harari et al. Nov 1994 A
5371702 Nakai et al. Dec 1994 A
5381539 Yanai et al. Jan 1995 A
5382839 Shinohara Jan 1995 A
5384743 Rouy Jan 1995 A
5388083 Assar et al. Feb 1995 A
5396468 Harari et al. Mar 1995 A
5404485 Ban Apr 1995 A
5406527 Honma Apr 1995 A
5418752 Harari et al. May 1995 A
5422842 Cernea et al. Jun 1995 A
5422856 Sasaki et al. Jun 1995 A
5428621 Mehrotra et al. Jun 1995 A
5430682 Ishikawa et al. Jul 1995 A
5430859 Norman et al. Jul 1995 A
5431330 Wieres Jul 1995 A
5434825 Harari Jul 1995 A
5438573 Mangan et al. Aug 1995 A
5455926 Keele et al. Oct 1995 A
5465235 Miyamoto Nov 1995 A
5465338 Clay Nov 1995 A
5471478 Mangan et al. Nov 1995 A
5473765 Gibbons et al. Dec 1995 A
5479638 Assar et al. Dec 1995 A
5485595 Assar et al. Jan 1996 A
5490117 Oda et al. Feb 1996 A
5495442 Cernea et al. Feb 1996 A
5504760 Harari et al. Apr 1996 A
5508971 Cernea et al. Apr 1996 A
5513138 Manabe et al. Apr 1996 A
5515333 Fujita et al. May 1996 A
5519847 Fandrich et al. May 1996 A
5523980 Sakui et al. Jun 1996 A
5524230 Sakaue et al. Jun 1996 A
5530673 Tobita et al. Jun 1996 A
5530828 Kaki et al. Jun 1996 A
5530938 Akasaka et al. Jun 1996 A
5532962 Auclair et al. Jul 1996 A
5532964 Cernea et al. Jul 1996 A
5534456 Yuan et al. Jul 1996 A
5535328 Harari et al. Jul 1996 A
5541551 Brehner et al. Jul 1996 A
5544118 Harari Aug 1996 A
5544356 Robinson et al. Aug 1996 A
5552698 Tai et al. Sep 1996 A
5554553 Harari Sep 1996 A
5563825 Cernea et al. Oct 1996 A
5566314 DeMarco et al. Oct 1996 A
5568439 Harari Oct 1996 A
5572466 Sukegawa Nov 1996 A
5579502 Konishi et al. Nov 1996 A
5581723 Hasbun et al. Dec 1996 A
5583812 Harari Dec 1996 A
5592415 Kato et al. Jan 1997 A
5592420 Cernea et al. Jan 1997 A
5596526 Assar et al. Jan 1997 A
5598370 Niijima et al. Jan 1997 A
5602987 Harari et al. Feb 1997 A
5603001 Sukegawa et al. Feb 1997 A
5606660 Estakhri et al. Feb 1997 A
5611067 Okamoto et al. Mar 1997 A
5640528 Harney et al. Jun 1997 A
5642312 Harari Jun 1997 A
5648929 Miyamoto Jul 1997 A
5663901 Wallace et al. Sep 1997 A
5693570 Cernea et al. Dec 1997 A
5712819 Harari Jan 1998 A
5719808 Harari et al. Feb 1998 A
5723990 Roohparvar Mar 1998 A
5734567 Griffiths et al. Mar 1998 A
5734816 Niijima et al. Mar 1998 A
5740396 Mason Apr 1998 A
5745418 Ma et al. Apr 1998 A
5754567 Norman May 1998 A
5757712 Nagel et al. May 1998 A
5758100 Odisho May 1998 A
5761117 Uchino et al. Jun 1998 A
5768190 Tanaka et al. Jun 1998 A
5768195 Nakamura et al. Jun 1998 A
5773901 Kantner Jun 1998 A
5778418 Auclair et al. Jul 1998 A
5781478 Takeuchi et al. Jul 1998 A
5787445 Daberko Jul 1998 A
5787484 Norman Jul 1998 A
RE35881 Barrett et al. Aug 1998 E
5799168 Ban Aug 1998 A
5802551 Komatsu et al. Sep 1998 A
5809515 Kaki et al. Sep 1998 A
5809558 Matthews et al. Sep 1998 A
5809560 Schneider Sep 1998 A
5818350 Estakhri et al. Oct 1998 A
5818781 Estakhri et al. Oct 1998 A
5822245 Gupta et al. Oct 1998 A
5822252 Lee et al. Oct 1998 A
5822781 Wells et al. Oct 1998 A
5831929 Manning Nov 1998 A
5835935 Estakhri et al. Nov 1998 A
5838614 Estakhri et al. Nov 1998 A
5845313 Estakhri et al. Dec 1998 A
5847552 Brown Dec 1998 A
5860083 Sukegawa Jan 1999 A
5860124 Matthews et al. Jan 1999 A
5862099 Gannage et al. Jan 1999 A
5890192 Lee et al. Mar 1999 A
5901086 Wang et al. May 1999 A
5907856 Estakhri et al. May 1999 A
5909586 Anderson Jun 1999 A
5920884 Jennings, III et al. Jul 1999 A
5924113 Estakhri et al. Jul 1999 A
5928370 Asnaashari Jul 1999 A
5930815 Estakhri et al. Jul 1999 A
5933368 Ma et al. Aug 1999 A
5933846 Endo Aug 1999 A
5936971 Harari et al. Aug 1999 A
5937425 Ban Aug 1999 A
5953737 Estakhri et al. Sep 1999 A
5956473 Ma et al. Sep 1999 A
5959926 Jones et al. Sep 1999 A
5966727 Nishino Oct 1999 A
5986933 Takeuchi et al. Nov 1999 A
5987563 Itoh et al. Nov 1999 A
5987573 Hiraka Nov 1999 A
5991849 Yamada et al. Nov 1999 A
6011322 Stumfall et al. Jan 2000 A
6011323 Camp Jan 2000 A
6018265 Keshtbod Jan 2000 A
6021408 Ledain et al. Feb 2000 A
6026020 Matsubara et al. Feb 2000 A
6026027 Terrell, II et al. Feb 2000 A
6034897 Estakhri et al. Mar 2000 A
6035357 Sakaki Mar 2000 A
6040997 Estakhri Mar 2000 A
6041001 Estakhri Mar 2000 A
6047352 Lakhani et al. Apr 2000 A
6055184 Acharya et al. Apr 2000 A
6055188 Takeuchi et al. Apr 2000 A
6069827 Sinclair May 2000 A
6072796 Christensen et al. Jun 2000 A
6076137 Asnaashari Jun 2000 A
6081447 Lofgren et al. Jun 2000 A
6081878 Estakhri et al. Jun 2000 A
6084483 Keshtbod Jul 2000 A
6097666 Sakui et al. Aug 2000 A
6115785 Estakhri et al. Sep 2000 A
6122195 Estakhri et al. Sep 2000 A
6125424 Komatsu et al. Sep 2000 A
6125435 Estakhri et al. Sep 2000 A
6128695 Estakhri et al. Oct 2000 A
6134145 Wong Oct 2000 A
6134151 Estakhri et al. Oct 2000 A
6141249 Estakhri et al. Oct 2000 A
6145051 Estakhri et al. Nov 2000 A
6151247 Estakhri et al. Nov 2000 A
6172906 Estakhri et al. Jan 2001 B1
6173362 Yoda Jan 2001 B1
6181118 Meehan et al. Jan 2001 B1
6182162 Estakhri et al. Jan 2001 B1
6202138 Estakhri et al. Mar 2001 B1
6223308 Estakhri et al. Apr 2001 B1
6226708 McGoldrick et al. May 2001 B1
6230234 Estakhri et al. May 2001 B1
6262918 Estakhri et al. Jul 2001 B1
6272610 Katayama et al. Aug 2001 B1
6275436 Tobita et al. Aug 2001 B1
6279069 Robinson et al. Aug 2001 B1
6279114 Toombs et al. Aug 2001 B1
6285607 Sinclair Sep 2001 B1
6327639 Asnaashari Dec 2001 B1
6345367 Sinclair Feb 2002 B1
6374337 Estakhri Apr 2002 B1
6385667 Estakhri et al. May 2002 B1
6393513 Estakhri et al. May 2002 B2
6397314 Estakhri et al. May 2002 B1
6411546 Estakhri et al. Jun 2002 B1
6467021 Sinclair Oct 2002 B1
6490649 Sinclair Dec 2002 B2
6567307 Estakhri May 2003 B1
6578127 Sinclair Jun 2003 B1
6587382 Estakhri et al. Jul 2003 B1
6711059 Sinclair et al. Mar 2004 B2
6721819 Estakhri et al. Apr 2004 B2
6721843 Estakhri Apr 2004 B1
6725321 Sinclair et al. Apr 2004 B1
6728851 Estakhri et al. Apr 2004 B1
6751155 Gorobets Jun 2004 B2
6757800 Estakhri et al. Jun 2004 B1
6772274 Estakhri Aug 2004 B1
6813678 Sinclair et al. Nov 2004 B1
6898662 Gorobets May 2005 B2
6912618 Estakhri et al. Jun 2005 B2
6950918 Estakhri Sep 2005 B1
6957295 Estakhri Oct 2005 B1
6973519 Estakhri et al. Dec 2005 B1
6978342 Estakhri et al. Dec 2005 B1
7000064 Payne et al. Feb 2006 B2
20030033471 Lin et al. Feb 2003 A1
Foreign Referenced Citations (83)
Number Date Country
0 557 723 Jan 1987 AU
0 220 718 May 1987 EP
0 243 503 Nov 1987 EP
0 392 895 Oct 1990 EP
0 424 191 Apr 1991 EP
0 489 204 Jun 1992 EP
0 522 780 Jan 1993 EP
0 522 780 Jan 1993 EP
0 544 252 Jun 1993 EP
0 613 151 Aug 1994 EP
0 617 363 Sep 1994 EP
0 619 541 Oct 1994 EP
0 663 636 Jul 1995 EP
0 686 976 Dec 1995 EP
0 897 579 Jul 2000 EP
0 891 580 Nov 2000 EP
0 896 669 Nov 2000 EP
0 852 766 May 2001 EP
0 852 765 Sep 2001 EP
0 722 585 May 2002 EP
0 910 826 Jun 2002 EP
0 691 008 Nov 2002 EP
0 861 468 Apr 2003 EP
0 978 040 May 2004 EP
1 157 328 May 2005 EP
93 01908 Aug 1993 FR
2 251 323 Jul 1992 GB
2 291 990 Feb 1996 GB
2 297 637 Jul 1996 GB
2 304 428 Mar 1997 GB
2 348 991 Dec 2002 GB
2 351 822 Jan 2003 GB
2 384 337 Jul 2003 GB
2 384 883 Oct 2005 GB
2 384 338 Nov 2005 GB
2 384 072 Dec 2005 GB
2 411 499 Feb 2006 GB
117881 May 2003 IS
59-45695 Sep 1982 JP
58-21594 Dec 1983 JP
58-215795 Dec 1983 JP
59-092483 May 1984 JP
59-162695 Sep 1984 JP
60-212900 Oct 1985 JP
61-96598 May 1986 JP
62-283496 Dec 1987 JP
62-283497 Dec 1987 JP
63-183700 Jul 1988 JP
1-138694 May 1989 JP
3-228377 Oct 1991 JP
4-057295 Feb 1992 JP
4-254994 Sep 1992 JP
4-268284 Sep 1992 JP
4-278297 Oct 1992 JP
4-332999 Nov 1992 JP
5-128877 May 1993 JP
5-282883 Oct 1993 JP
6-004399 Jan 1994 JP
6-036578 Feb 1994 JP
6-124175 May 1994 JP
6-124231 May 1994 JP
6-131889 May 1994 JP
6-132747 May 1994 JP
6-149395 May 1994 JP
6-266596 Sep 1994 JP
7-084871 Mar 1995 JP
7-093499 Apr 1995 JP
7-114499 May 1995 JP
7-141258 Jun 1995 JP
7-235193 Sep 1995 JP
7-311708 Nov 1995 JP
7-334996 Dec 1995 JP
8-018018 Jan 1996 JP
8-069696 Mar 1996 JP
08-137634 May 1996 JP
9-147581 Jun 1997 JP
1388877 Apr 1988 SU
1408439 Jul 1988 SU
1515164 Oct 1989 SU
1541619 Feb 1990 SU
1573458 Jun 1990 SU
1686449 Oct 1991 SU
WO 9420906 Sep 1994 WO
Non-Patent Literature Citations (36)
Entry
Kai Hwang & Faye A. Briggs, Computer Architecture and Parallel Processing, McGraw-Hill Book Co., 1984, p. 64.
Walter Lahti and Dean McCarron, “State of the Art: Magnetic VS Optical Store Data in a Flash”, Byte Magazine, Nov. 1, 1990. 311, vol. 15, No. 12.
Ron Wilson, Technology Updates, Integrated Circuits, “I-Mbit flash memories seek their role in system design”, Computer Design 28 Mar. 1, 1989, No. 5, Tulsa OK, US, pp. 30 and 32.
S. Mehoura et al., SunDisk Corporation, Santa Clara, CA. R.W. Gregor et al., AT&T Bell Laboratories, Allentown, PA. 1992 Symposium of VLSJ Circuits Digest of Technical Papers, “EEPROM for Solid State Disk Applications”, pp. 24 and 25.
Mendel Rosenblum and John K. Ousterhout, “The Design and Implementation of a Log-Structured File System,” 1991, 15 pgs., Berkeley, USA.
Brian Dipert and Markus Levy, Designing with Flash Memory, Annabooks, Apr. 1994, 445 pgs.
Science Forum, Inc. “Flash Memory Symposium '95”, 1995, 13 pgs. Tokyo.
Ross S. Finlayson and David R. Cheriton, “An Extended File Service Exploiting Write-Once Storage,” ACM Symposium on Operating Systems Principles, 1987, 10 pgs.
Jason Gait, “The Optical File Cabinet: A Random-Access File System for Write-Once Storage”, Computer, Jun. 1988, 12 pgs.
Henry G. Baker, Memory Management, 1995, Springer-Verlag Heidelberg, Germany, 19 pgs.
Sape J. Mullender and Andrew S. Tanenbaum, “A Distributed File Service Based on Optimistic Concurrency Control”, ACM Press, 1985, 12 pgs. New York, New York.
Hiroshi Nakamura, Junichi Miyamoto, Kenichi Imamiya and Yoshihisa Iwata, “A Novel Sense Amplifier for Flexible Voltage Operation NAND Flash Memories”, VLSI Circuits, 1995, Digest of Technical Papers, 2 pgs.
Hiroshi Nakamura, Junichi Miyamoto, Kenichi Imamiya, Yoshihisa Iwata and Hideko Oodaira, “A Novel Sensing Scheme with On-Chip Page for Flexible Voltage NAND Flash Memories”, IEICE Transactions on Electronics, vol. E79-C, No. 6, pp. 836-844, Jun. 20, 1996.
Takaaki Nozaki, Toshiaki Tanaka, Yoshiro Kijiya, Eita Kinoshita, Tatsuo Tsuchiya and Yutaka Hayashi, “A 1-Mb EEPROM with MONOS Memory Cell for Semiconductor Disk Application”, Journal of Solid-State Circuits, vol. 26, No. 4, 5 pgs. Apr. 1991.
Kai Hwang and Faye A. Briggs, Computer Architecture and Parallel Processing, 1984, McGraw-Hill, Inc.
Ron Wilson, “Integrated Circuits; 1-Mb flash memories seek their role in system design”, Mar. 1, 1989, 2 pgs. Tulsa, OK.
S. Mehroura, J.H. Yuan, R.A. Cemea, W.Y. Chien, D.C. Guteman, G. Samachisa, R.D. Norman, M. Mofidi, W. Lee, Y. Fong, A. Mihnea, E. Hann, R.W. Gregor, E.P. Eberhardt, J.R. Radosevich, K.R. Stiles, R.A. Kohler, C.W. Leung, and T.J. Mulrooney, “Serial 9Mb F EEPROM for Solid State Disk Applications”, symposium, 2 pgs., 1992, Mountain View, CA.
Steven H. Leibson, “Nonvolatile, In-Circuit-Reprogrammable Memories”, EDN Special Report, Jan. 3, 1991, No. 12, 12 pgs.
Walter Lahti and Dean McCarron, “State of the Art: Magnetic vs. Optical Store Data in a Flash”, Byte Magazine, 1990, vol. 15, No. 12, 7 pgs.
Ramon Caceres, Fred Douglis, Kai Li and Brian Marsh, “Operating System Implications of Solid-State Mobile Computers”, Workshop on Workstation Operating Systems, Oct. 1993, pp. 21-27.
Michael Wu and Wily Zwaenepoel, “A Non-Volatile, Main Memory Storage System”, ACM Press, 1994, 12 pgs., San Jose, CA.
Dave Bursky, “Innovative flash memories match DRAM densities: available with a choice of features, flash memories are finding homes in many systems (including related articles on the origins of flash, and on the differences between NAND and NOR flash memories)”, Electronic Design, May 16, 1994, vol. 42, No. 10, 9 pgs.
Anthony Cataldo, “New flash enhancements up ante. (Intel's 28F400BV-120 and 28F004BV-120, Atmel's AT29BV010 and AT29BV020, and Samsung Semiconductor's KM29V3200 flash memory devices)” (product announcement), Electronic News, Mar. 13, 1995, vol. 41, No. 2056, 4 pgs.
Sam Weber, “Flash modules' portability, reusability, small size valued for a host of APPs-Consumer formats flocking to flash”, Electronic Engineering Times, Jul. 22, 1996, No. 911, 9 pgs.
Stan Baker, “But Integration Calls for Hardware, Software Changes: Flash designers face the dawn of a new memory age”, Electronic Engineering Times, Dec. 3, 1990, vol. 41, No. 619, 5 pgs.
Toshiba, MOS Memory (Non-Volatile), 1995, Data Book.
Toshiba, Toshiba MOS Digital Integrated Circuit Silicon Gate CMOS, (TC58NS512DC), Mar. 21, 2001, 43 pgs., Data Book.
Toshiba, Toshiba Corporation, SMIL (Smartmedia Interface Library) Hardware Edition Version 1.00, Jul. 1, 2000, 136 pgs., Data Book.
Toshiba, Toshiba MOS Digital Integrated Circuit Silicon Gate, (TC58512FT), Mar. 5, 2001, 43 pgs., Data Book.
Toshiba, Toshiba MOS Digital Integrated Circuit Silicon Gate, (TC58DVM92A1FT00), Jan. 10, 2003, 44 pgs., Data Book.
Toshiba, Toshiba MOS Digital Integrated Circuit Silicon Gate, (TC58DVG02A1FT00), Jan. 10, 2003, 44 pgs., Data Book.
Toshiba, Toshiba MOS Digital Integrated Circuit Silicon Gate, (TC58100FT), Mar. 5, 2001, 43 pgs., Data Book.
Toshiba, MOS Memory (Non-Volatile), 1996, 279 pgs., Data Book.
“Fifth Biennial Nonvolatile Memory Technology Review,” 1993 Conference, Jun. 22-24, 1993, Linthicum Heights, MD, USA.
Dan Auclair, “Optimal Solid State Disk Architecture for Portable Computers”, Silicon Valley PC Design Conference, Jul. 9-10, 1991, pp. 811-815.
O. Kobayashi, et al. “Flash EEPROM The Use Environment for External Storage Devices is Put Into Place,” Nikkei Electronics, Apr. 11, 1994, pp. 21.
Related Publications (1)
Number Date Country
20110167204 A1 Jul 2011 US
Divisions (1)
Number Date Country
Parent 11201612 Aug 2005 US
Child 12243538 US
Continuations (4)
Number Date Country
Parent 12243538 Oct 2008 US
Child 13045159 US
Parent 09620544 Jul 2000 US
Child 11201612 US
Parent 09264340 Mar 1999 US
Child 09620544 US
Parent 08831266 Mar 1997 US
Child 09264340 US
Continuation in Parts (1)
Number Date Country
Parent 08509706 Jul 1995 US
Child 08831266 US