text:
|Publication number
|Publication type
|Application number
|Publication date
|Aug 20, 2002
|Filing date
|Jul 22, 1998
|Priority date
|Aug 8, 1996
|Fee status
|Also published as
|Publication number
|Robert Norman
|Original Assignee
|Micron Technology, Inc.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (21), Referenced by (43), Classifications (15), Legal Events (6)
|External Links: USPTO, USPTO Assignment, Espacenet
This application is a continuation of U.S. patent application Ser. No. 08/689,369, filed Aug. 8, 1996 now U.S. Pat. No. 5,787,484.
1. Field of the Invention
The invention is a memory system which includes at least one array of memory cells (e.g., flash memory cells) and circuitry which compares new data to be written to a set of the cells with data already stored in a corresponding set of the cells and writes the new data to the array only if the new data is not identical to the previously stored data, and a computer system which includes such a memory system, and method performed by such a computer system. In preferred embodiments, the memory system is designed to emulate a magnetic disk drive.
2. Description of Related Art
It is conventional to implement a memory system as an integrated circuit including an array of flash memory cells and circuitry for independently erasing selected blocks of the cells. FIG. 1 is a simplified block diagram of such an integrated circuit (flash memory chip 103). An integrated flash memory chip such as memory chip 103 of FIG. 1 (or a memory system including such a memory chip) can be modified in accordance with the present invention to avoid unnecessary writes of data to sectors of flash memory array circuit 16.
Flash memory array circuit 16 of memory chip 103 comprises rows and columns of nonvolatile flash memory cells. Memory chip 103 also includes I/O pins DQ0-DQ15 (for asserting output data to an external device or receiving input data from an external device), input buffer circuits 122, 122A, and 122B, output buffer circuits 128, 128A, and 128B, address buffer 17 for receiving address bits A0 through A17 from an external device, row decoder circuit (X address decoder) 12, column multiplexer circuit (Y multiplexer) 14, and control unit 29 (also denoted herein as "controller" 29).
Each of the cells (storage locations) of memory array circuit 16 is indexed by a row index (an "X" index determined by decoder circuit 12) and a column index (a "Y" index determined by Y decoder circuit 13 of circuit 14). Each column of cells of memory array 16 comprises "n" memory cells, each cell implemented by a floating-gate N-channel transistor. The drains of all transistors of a column are connected to a bitline, and the gate of each of the transistors is connected to a different wordline, and the sources of the transistors are held at a source potential (which is usually ground potential for the chip during a read or programming operation). Each memory cell is a nonvolatile memory cell since the transistor of each cell has a floating gate capable of semipermanent charge storage. The current drawn by each cell (i.e., by each of the N-channel transistors) depends on the amount of charge stored on the cell's floating gate. Thus, the charge stored on each floating gate determines a data value that is stored "semipermanently" in the corresponding cell. In cases in which each of the N-channel transistors is a flash memory device, the charge stored on the floating gate of each is erasable (and thus the data value stored by each cell is erasable) by appropriately changing the voltage applied to the gate and source (in a well known manner).
The individual memory cells (not depicted) are addressed by eighteen address bits (A0-A17), with nine bits being used by X decoder circuit 12 to select the row of array 16 in which the target cell (or cells) is (or are) located and the remaining nine bits being used by Y decoder circuit 13 (of Y-multiplexer 14) to select the appropriate column (or columns) of array 16. Typically, a set of eight or sixteen target cells (or 256 target cells) in a single row of the array are selected by a single set of eighteen address bits A0-A17, with Y decoder circuit 13 determining the column addresses of such cells in response to a nine-bit subset of the set of address bits. In response to the other nine address bits A0-A17, X decoder circuit 12 determines a row address which selects one cell in the selected column.
In a normal operating mode, chip 103 executes a write operation as follows. Address buffer 17 asserts appropriate ones of address bits A0-A17 to circuit 14 and decoder circuit 12. In response to these address bits, circuit 14 determines a column address (which selects one of the columns of memory cells of array 16), and circuit 12 determines a row address (which selects one cell in the selected column). In response to a write command supplied from controller 29, a signal (indicative of data) present at the output of input buffer 122, 122A, and/or 122B is asserted through circuit 14 to the cell of array 16 determined by the row and column address (e.g., to the drain of such cell). During such write operation, output buffers 128, 128A, and 128B are disabled.
In the normal operating mode, chip 103 executes a read operation as follows. Address buffer 17 asserts appropriate ones of address bits A0-A17 to circuit 14 and address decoder circuit 12. In response to these address bits, circuit 14 asserts a column address to memory array 16 (which selects one of the columns of memory cells), and circuit 12 asserts a row address to memory array 16 (which selects one cell in the selected column). In response to a read command supplied from control unit 29, a current signal indicative of a data value stored in the cell of array 16 (a "data signal") determined by the row and column address is supplied from the drain of the selected cell through the bitline of the selected cell and then through circuit 14 to sense amplifier circuitry 33. This data signal is processed in amplifier circuitry 33, buffered in output buffers 128, 128A, and/or 128B, and finally asserted at pins DQ0-DQ15. During such read operation, input buffers 122, 122A, and 122B are disabled.
Chip 103 also includes a pad which receives a high voltage Vpp from an external device, and a switch 121 connected to this pad. During some steps of a typical erase or program sequence (in which the cells of array 16 are erased or programmed), control unit 29 sends a control signal to switch 121 to cause switch 121 to close and thereby assert the high voltage Vpp to various components of the chip including X decoder 12. Voltage Vpp is higher (typically Vpp=12 volts) than the normal operating mode supply voltage (typically Vcc=5 volts or Vcc=5.5 volts) for the MOS transistors of chip 103.
When reading a selected cell of array 16, if the cell is in an erased state, the cell will conduct a first current which is converted to a first voltage in sense amplifier circuitry 33. If the cell is in a programmed state, it will conduct a second current which is converted to a second voltage in sense amplifier circuitry 33. Sense amplifier circuitry 33 determines the state of the cell (i.e., whether it is programmed or erased corresponding to a binary value of 0 or 1, respectively) by comparing the voltage indicative of the cell state to a reference voltage. The outcome of this comparison is an output which is either high or low (corresponding to a digital value of one or zero) which sense amplifier circuitry 33 sends to output buffers 128 and 128B (and through multiplexer 124 to output buffer 128A). One or more of the output buffers in turn asserts a corresponding data signal to corresponding ones of pins DQ0-DQ15 (from which it can be accessed by an external device).
It is important during a write operation to provide the wordline of the selected cell with the proper voltage and the drain of the selected cell with the appropriate voltage level (the voltage determined by the output of each input buffer, asserted through latch/multiplexer 130 to circuit 14), in order to successfully write data to the cell without damaging the cell.
Internal state machine 120 of control unit 29 of chip 103 controls detailed operations of chip 103 such as the various individual steps necessary for carrying out programming, reading and erasing operations. State machine 120 thus functions to reduce the overhead required of a processor (not depicted) typically used in association with chip 103.
Memory operations, including programming, reading, and erasing can be initiated in various ways. For all operations, the chip enable signal {overscore (CE)} must be made active (low). To perform a read operation, write enable signal {overscore (WE)} must be made inactive (high). For a write operation, signal {overscore (WE)} must be made active (low). In order to reduce the likelihood of accidental modification of data, erase and program operations require receipt of two consecutive commands that are processed by command execution logic unit 124. The program and erase commands are provided by the associated processor to data I/O pins DQ0-DQ7, forwarded to input buffer 122, and then forwarded to the command execution logic unit 124 for processing.
If memory array 16 is to be erased (typically, all or large blocks of cells are erased at the same time), the processor causes the Output Enable {overscore (OE)} pin to be inactive (high), and the Chip Enable {overscore (CE)} and Write Enable {overscore (WE)} pins to be active (low). The processor then issues an 8 bit command 20H (0010 0000) on data I/O pins DQ0-DQ7, typically called an Erase Setup command (each of I/O pins DQ0-DQ7 corresponds to an I/O pad). This is followed by issuance of a second eight bit command D0H (1101 0000), typically called an Erase Confirm command. Two separate commands are used to reduce the possibility of an inadvertent erase operation.
The commands are transferred to data input buffer 122, and the commands are then transferred to command execution logic unit 124 of control unit 29. Logic unit 124 then instructs state machine 120 to perform all the numerous and well known steps for erasing array 16.
Once an erase sequence is completed, state machine 120 updates an 8 bit status register 126, the contents of which are transferred to data output buffer 128A which is connected to data I/O pins DQ0-DQ7 of the memory system. The processor periodically polls the data I/O pins to read the contents of status register 126 in order to determine whether an erase sequence has been completed and whether it has been completed successfully.
During a typical erase operation, it is desired to erase all the cells of array 16 (or an erase block of the cells) so that the threshold voltages are all within a specified voltage range. That range is typically a small positive voltage range such as from +1.5 to +3.0 volts. If the erased cells fall within this range, the cell to be read (the "selected" or "target") cell will produce a cell current in a read operation. The presence of cell current flow indicates that the cell is in an erased state (logic "1") rather than a programmed state (logic "0"). Cell current is produced in a selected erased cell if the voltage applied to the control gate of the cell, by way of the wordline connected to X decoder 12, exceeds the threshold voltage of the erased cell. In addition, cells which are not being read ("deselected" cells) are prevented from producing a cell current even if such cells have been erased to a low threshold voltage state. By way of example, for cells located in the same row as the selected cell, by definition, share the same wordline as the selected cell. However, the drains of the deselected cells will be floating thereby preventing a cell current from being generated. Deselected cells in the same column will not conduct cell current because the wordlines of such deselected cells are typically grounded. Thus, the gate-source voltage of these cells will be insufficient to turn on these deselected cells even if they are in an erased state.
An example of a flash memory array which can be employed as memory array 16 of chip 103 is described in U.S. patent application Ser. No. 08/606,246, entitled "Segmented Non-Volatile Memory Array with Multiple Sources with Improved Word Line Control Circuitry," filed on Feb. 23, 1996 and assigned to the assignee of the present application.
The present invention is useful as an improvement to flash memory systems of the type designed to emulate magnetic disk drive systems. This type of flash memory system is typically implemented as a card (for insertion into a computer system) with a chip set mounted thereon, where the chip set includes an onboard controller and several memory chips controlled by the controller. Each memory chip implements an array of flash memory cells organized into independently erasable blocks. A conventional flash memory system of this type can be modified in accordance with the invention to avoid unnecessary writes of data to sectors of the flash memory array.
In the past, magnetic hard disk systems have been the dominant storage media for computers and related systems. The low cost and high capacity offered by this technology has made magnetic hard disk systems the mainstay in the computer industry. Because of the dominance of this technology, virtually all computer systems use and support this technology. The support of magnetic disk systems is evident by the software associated with the disk drives. The dominant computer operating system known as "DOS" (Disk Operating System) is essentially a software package used to manage a disk system. The DOS software has been developed by IBM Corporation, Microsoft Corporation, and Novell as the heart of widely used computer software. The first generation of Microsoft Corporation's "Windows" operating system software was essentially a continuation of the original DOS software with a user friendly shell added for ease of use.
The DOS software was developed to support the physical characteristics of hard drive structures, supporting file structures based on heads, cylinders and sectors. The DOS software stores and retrieves data based on these physical attributes. Magnetic hard disk drives operate by storing polarities on magnetic material. This material is able to be rewritten quickly and as often as desired. These characteristics has allowed DOS to develop a file structure that stores files at a given location which is updated by a rewrite of that location as information is changed. Essentially all locations in DOS are viewed as fixed and do not change over the life of the disk drive being used therewith, and are easily updated by rewrites of the smallest supported block of this structure. A sector (of a magnetic disk drive) is the smallest unit of storage that the DOS operating system will support. In particular, a sector has come to mean 512 bytes (each byte consisting of eight bits) of information for DOS and most other operating systems in existence. DOS also uses clusters as a storage unit. Clusters, however, are nothing more than the logical grouping of sectors to form a more efficient way of storing files and tracking them with less overhead.
The development of flash memory integrated circuits has enabled a new technology to offer competition to magnetic hard drives and offer advantages and capabilities that are hard to support by disk drive characteristics and features. The low power, high ruggedness, and small sizes offered by a solid state flash memory system make such a flash memory system attractive and able to compete with a magnetic hard disk drive system. Although a memory implemented with flash memory technology may be more costly than a hard disk drive system, computers and other processing systems are being developed that require (or benefit greatly from) use of flash memory features.
Thus, flash memory systems have been developed that emulate the storage characteristics of hard disk drives. Such a flash memory system is preferably structured to support storage in 512 byte blocks along with additional storage for overhead associated with mass storage, such as ECC (error correction code) bits and/or redundant bits. A key to this development is to make the flash memory array respond to a host processor in a manner that looks like a magnetic disk assembly so the operating system can store and retrieve data in a known manner and be easily integrated into a computer system including the host processor.
To make a flash memory easily integratable into a host computer, two basic approaches have been developed. One approach is to configure the flash memory as a storage array, and to load special software into the host to translate conventional operating system (e.g., DOS) commands into flash commands and procedures for assertion to the flash memory. This approach uses the host computing power to act as a controller for the utility that manages the flash memory (rather than including such a controller in the flash memory itself).
Another approach is to make the interface to the flash memory identical to a conventional interface to a conventional magnetic hard disk drive. This approach has been adopted by the PCMCIA standardization committee, which committee has promulgated a standard for supporting flash memory systems with a hard disk drive protocol. A flash memory card (including one or more flash memory array chips) whose interface meets this standard can be plugged into a host system having a standard DOS operating system with a PCMCIA-ATA (or standard ATA) interface. Such a flash memory card is designed to match the latter standard interfaces, but must include an onboard controller which manages each flash memory array independent of the host system. This approach has several advantages, including the following: there are no special system requirements for the host system (so ease of host system design is assured); no extra memory is required in the host, allowing for better use of the host memory; and the flash memory system runs independently of the host, freeing the host computer to do other tasks while the flash memory is storing or retrieving data from a flash memory array. However, the approach requires a controller onboard the flash memory to implement the equivalent of an operating system behind the PCMCIA interface.
An example of a flash memory array for use in a flash memory system that emulates a magnetic disk drive will be described with reference to FIG. 2. The flash memory array structure shown in FIG. 2 may be suitable for low cost applications of the type commonly implemented using low cost magnetic disk drives. Memory array 16 of FIG. 2 has 544 bytes per row of cells (each byte consisting of eight bits, where each memory cell is capable of storing one bit). Thus, each row of cells is equivalent to a magnetic disk sector (512 bytes of data plus 32 bytes of "overhead").
Memory array 16 of FIG. 2 is partitioned into large "decode" blocks of cells (e.g., eight large decode blocks as shown in FIG. 2) that are physically isolated from one another. This partitioning of blocks allows defects in one decode block (e.g., decode block 16A) to be isolated from the other decode blocks in the array, allows defective decode blocks to be bypassed by a controller, and allows for high usage of die and enhances overall yield of silicon produced (driving down the cost of flash mass storage systems).
The expression "decode block" is used to denote a block of cells of a memory array which are sufficiently physically isolated from the other cells of the array that the disturb effect on the cells in the decode block (due to high voltage application to the other cells of the array, e.g., during erasing or. programming of the other cells) is negligible. In one case, an entire memory array is a single decode block. More typically, a memory array includes two or more decode blocks.
In the array of FIG. 2, each decode block is subdivided into eight independently erasable blocks, sometimes referred to herein as "erase blocks." In the FIG. 2 example, each erase block (e.g., erase block 16B) consists of rows of flash memory cells, with each row being capable of storing seventeen "packets" of bits, and each packet consisting of 32 bytes (each byte consisting of eight bits). Thus, each row (capable of storing 544 bytes) corresponds to one conventional disk sector (comprising 544 bytes), and each row can store 512 bytes of user data as well as a field of 32 ECC bytes for use in error detection and correction and other bits associated with sector management. In the FIG. 2 example, each erase block corresponds to two "cylinders" of data (in the sense that this expression is used in a conventional magnetic disk drive), with each cylinder consisting of 256K bits of data organized into 64 sectors. Thus, each erase block in the FIG. 2 example consists of 128 sectors of data.
Still with reference to FIG. 2, each erase block (e.g., erase block 16B) can be independently erased in response to signals from the controller. All flash memory cells in each erase block are erased at the same (or substantially the same) time, so that erasure of an erase block amounts to erasure of a large portion of array 16 at a single time.
In many normal usages of flash memory systems (other than disk emulation systems), an entire memory is written (or erased) or entire decode blocks are written (or erased) at one time. However, in a disk emulation system this is typically not done, as the data is typically very dynamic with small portions (e.g., individual rows of flash memory cells) being rewritten many times while other small portions remain unchanged. To accomplish the latter type of data updating, the controller will write data to free locations (e.g., rows) and when the memory is to be updated it will write the new (updated) data to other free rows (not previously written), marking the previously written rows as old (obsolete, and ready to be erased). The system will keep track of these obsolete rows and will erase an entire erase block when it becomes filled or almost filled with obsolete rows. Updated data (to replace data in one row of one erase block) may be placed in another erase block or even another decode block or possibly even a different flash memory chip. The constant rewriting and moving of files will result in erase blocks being constantly programmed and erased. In DOS it is typical for new files to be updated heavily and unused files to be not updated or never changed once generated. This typical use of files will result in portions of memory being updated frequently while other areas will remain stagnant and unchanged.
In flash memory systems, writes of data to flash memory cells are slow and they cause wear on the cells. This wear limits the useful life of conventional flash memory systems and reduces their overall reliability. The present invention overcomes these limitations (by applying data discrimination to avoid unnecessary writes to flash memory cells).
A file of data to be written to cells of a disk emulation system (a flash memory system which emulates a magnetic disk drive) typically consists of sectors of data. During writing of a file to cells of such a system, each of the sectors of data is typically written to a different row of cells (or to another distinct set of cells which has capacity to store a sector of data, and which is thus sometimes denoted herein as a "sector" of cells). The inventor has recognized that in many cases, a file of new data to be written to the cells corresponds to a previously written file of "old" data, with many sectors of the new data being identical to corresponding sectors of the old data.
It would be desirable to reduce the number of writes to an array (of flash memory cells) that must be performed in order to keep the array updated. Doing so would result in less stress on the cells, and would thus increase the operating life of the array and achieve better system reliability. In addition, system performance would be greatly improved, by reducing the time spent by system in writing data to cells and reducing overall command overhead. However, until the present invention, it had not been known how to achieve such write reduction in flash memory systems which emulate magnetic disk drives or in other types of flash memory systems.
In preferred embodiments, the invention is a memory system including one or more arrays of memory cells (e.g., flash memory cells or other nonvolatile memory cells), and each array is organized into sectors of cells, either physically (e.g., with each row of cells corresponding to a sector) or logically (with no specific correspondence between each sector and the physical position of the cells comprising the sector). Each cell is indicative of a stored data bit (whether the cell is in an erased or programmed state), and each sector of cells is indicative of a sector of stored data. The system includes circuitry which compares new data (to be written to the array) with stored data that has been "preread" from a selected sector (or other set) of the cells, where the selected sector (or other set) is to be updated with the new data. The system prevents a write of the new data to the array if the new data is identical to the stored data. If the new data is not identical to the stored data, the system writes the new data to a second one of the sectors (or other sets) of the cells, where the second one of the sectors (or sets) corresponds to the selected sector (or set) in the following sense: the system marks the selected sector (or set) as "old" (or "obsolete") and keeps track of the fact that the second one of the sectors (or sets) contains updated data which replaces data in the obsolete selected sector (or set).
In preferred embodiments, the memory system is designed to emulate a magnetic disk drive, the cells of the array are organized into sectors, and each of the sectors of cells can store the same amount of data as can a sector of a conventional magnetic disk drive supported by the DOS operating system (i.e., 512 bytes of data). In some of such preferred embodiments, each array of nonvolatile memory cells is organized into rows and columns of the cells, and each of the rows is a sector of cells capable of storing a sector of data.
Preferably, the system includes a controller which includes logic circuitry for performing the comparison. In response to the comparison determining that the new data is identical to the previously stored data, the controller preferably generates a confirmation signal indicating that the new data has been written to the array (rather than actually writing the new data to the array). Typically, the memory system communicates with a host processor (host) and the confirmation signal is sent to the host (in response to a command from the host that the new data be written to the array).
Other aspects of the invention are the method implemented by any of the described embodiments of the memory system of the invention.
FIG. 1 is block diagram of a conventional nonvolatile (flash) memory circuit (implemented as an integrated circuit), including a conventional controller for controlling memory operations of the circuit.
FIG. 2 is a diagram of the manner in which cells of a flash memory array are organized in one flash memory system which emulates a magnetic disk drive.
FIG. 3 is a block diagram of a computer system including a processor and an embodiment of the integrated flash memory system of the invention.
FIG. 4 is a block diagram of another embodiment of the flash memory system of the invention, including several flash memory arrays (each implemented as a separate integrated circuit) and a controller for controlling memory operations of any selected one of the arrays and for implementing the invention.
FIG. 5 is a block diagram of another embodiment of the flash memory system of the invention.
FIG. 6 is a schematic diagram of a preferred embodiment of comparator circuit 110 of FIG. 3.
Preferred embodiments of the invention will be described with reference to FIGS. 3, 4, 5, and 6. One such embodiment is the computer system shown in FIG. 3. This computer system includes processor 2 (sometimes referred to herein as a host processor), input device 1 (which can be a keyboard) which can be manipulated by a human user to enter data and/or commands to processor 2, and flash memory chip 3. Flash memory chip 3, which is a memory subsystem of the computer system of FIG. 3, replaces a conventional magnetic disk drive system (or other, memory subsystem). Variations on the system of FIG. 3 include both a flash memory chip (such as chip 3 of FIG. 3) and at least one other memory subsystem (such as a conventional magnetic disk drive system). Of course, it is contemplated that the computer system of FIG. 3 can also include other peripheral devices, such as a display device.
Flash memory chip 3 shown in FIG. 3 includes controller 129 and array 216 of nonvolatile memory cells (which are preferably nonvolatile flash memory cells). Memory chip 3 of FIG. 3 can be identical to chip 103 of FIG. 1, except in that chip 3 includes controller 129 which is designed and programmed in accordance with the invention (rather than controller 29 of FIG. 1), and in that controller 129 includes host interface 102, multiplexer 130, error detection and correction circuit 132, and flash interface 114. In preferred implementations, interface 102 receives binary data and address bits from host processor 2 (and sends binary data bits from memory array 216 to processor 2). Preferably, processor 2 is programmed with a standard DOS operating system and includes a PCMCIA-ATA interface (of the type discussed above), and interface 102 complies with the PCMCIA-ATA standard and thus can communicate with the standard PCMCIA-ATA interface of processor 2.
Flash memory array 216 of FIG. 3 preferably includes a cell array identical to array 116 of FIG. 2 (which can be identical to array 16 of FIG. 1) and circuitry which performs the functions of elements 12, 14, and 33 of FIG. 1. Flash interface 114 receives data (to be written to array 114) and address bits from other elements of chip 3 and asserts corresponding data and address bits with appropriate timing and format to array 216. Flash interface 114 also reads data bits from cells of array 216 (e.g., from any selected sector of cells of array 216) and asserts the data bits which it reads with appropriate timing and format to other elements of chip 3 (including to comparator circuit 110). The description of those components of FIG. 3 which correspond to components of FIG. 1 has been provided above with reference to FIG. 1, and will not be repeated below.
The cells of flash memory array 216 of FIG. 3 (and the cells of array 16 of FIG. 1) are organized into decode blocks. Each decode block is organized into independently erasable erase blocks (as is each decode block of array 116 shown in FIG. 2). In some implementations of the FIG. 3 embodiment, memory array 216 is an array of nonvolatile memory cells other than flash memory cells. Preferably however, each cell of array 216 is implemented as a flash memory cell.
With reference to FIG. 3, in response to control signals and address bits from processor 2 (or another external host), interface 102 sends the address bits (including bits identifying cylinder, head, and sector addresses) to control engine 130 of controller 129, and asserts internal control signals to appropriate components of controller 129 (including control engine 130) as required to implement each memory operation specified by each control signal from host processor 2 (e.g., a read of some or all cells of array 216, an erase of one or more erase blocks of array 216, or a write of data to some or all cells of array 216). In response to the address bits, control engine 130 generates translated address bits and sends the translated address bits to flash interface 114. Among the internal control signals asserted by interface 102 are enable/disable signals (as well as presets) which are asserted (from control engine 130) to comparator circuit 110 at appropriate times. FIG. 6 is a preferred embodiment of circuit 110.
In the FIG. 6 embodiment, comparator circuit 110 includes an array of XNOR (exclusive NOR) gates 400-406 whose outputs are all connected to NAND gate 408. The output of NAND gate 408 is presented to the input of JK register 410 at the J input, with the K input connected to ground (logic low). During preread checks (i.e., during the inventive preread and compare operations), the controller (controller 129 of FIG. 3) will first issue a control signal (Reset Compare Register) that will force register 410 to the clear (reset) state. The controller will then fetch a byte of data from flash memory array 216 and a corresponding byte of data from buffer memory 104. The corresponding bits of each byte will be input to the XNOR gates 400-406 resulting in a positive output from each of the XNOR gates if the inputs thereto are the same (1,1 or 0,0) or a negative output from each XNOR gate whose inputs are different (0,1 or 1,0). if all bits of each byte match each other (i.e., the byte read from flash array 216 is identical to that read from buffer memory 104), the eight XNOR outputs will be all logic high and will drive the output of NAND 408 low. The low output of NAND 408 is presented to the J input of JK register 410. The controller will then generate a clock sampling the compare condition, as determined by the logic level of the J input. If the J is low (the two bytes match each other), the JK register will remain clear indicating that the data has compared. The controller will then fetch the next sequential byte of data from flash memory array 216 and the next byte of data from buffer memory 104, again repeating the compare and sample operation. If any of the bytes of data read from flash memory 216 miscompares with a corresponding one of the bytes of write data in buffer 104, the J input of circuit 410 will be driven to a logic high and the JK register will toggle to the set state when sampled by the compare clock. Once the JK register becomes set, it will remain set indicating a miscompare has occurred, regardless of any further clocking. The controller will monitor this JK register output and will abort the compare operation as soon as the miscompare status is detected. Aborting the operation when a miscompare is detected will result in saved overhead time (avoiding wasted time in clocking to the end of the sector). This translates to performance savings to the system. If a miscompare is detected, the controller will then generate the necessary control signals to write the new set of data in buffer memory 104 to a new (erased) sector of flash memory array 216. It will also mark the sector just read from flash memory array 216, which has been found to miscompare, to an "obsolete" state.
If the compare operation has compared all bytes of the sector and found no miscompare (between any byte read from array 216 and a corresponding byte read from memory 104), the two sectors (stored in array 216 and memory 104) are of identical value, resulting in no need to write the new sector to array 216. In this case, the sector residing in array 216 is left untouched and the host is notified that the sector write is complete. This bypass of a write operation results in a big time savings, since flash writes are slow compared to reads. A flash write of a sector can take 1 to 5 milliseconds while a read compare will take approximately 50 microseconds. Thus, a large savings is gained when a sector is not required to be written to array 216. If all the data in a file is changing (i.e., each compare operation performed on a sector in array 216 and a new sector of the file in memory 104 determines that the two sectors are not identical), the compare operation will result in unnecessary overhead that degrades system performance. To avoid this problem, the controller preferably has two ways of preventing this overhead from occurring (or reducing its magnitude).
The simplest feature to prevent the preread comparisons from adding to the overall overhead is to design the controller to be operable in a mode in which it does not perform the compare operation (i.e., in response to a command from the host). This capability is preferably supported by a vendor unique command from the host that tells the controller not to perform the read compares when issued a write command.
With reference again to FIG. 6, circuit 110 preferably also includes an arithmetic logic unit (ALU) 412 which performs desired arithmetic operations on either or both of the bit streams received at the "A" and "B" inputs of circuit 110. In response to control signals from control engine 130, ALU 412 can pass through unaltered either the data received at its "A" input (from buffer memory 104 via the "A" input of circuit 110) or the data received at its "B" input (from array 216, via interface 114 and the "B" input of circuit 110), at appropriate times during system operation.
When the controller is operating in a mode in which read compares are allowed (and performed), some typical considerations of file usage are preferably taken into account to allow the controller not to do a read compare of all write files. In a computer that is storing a file in a group of sectors, the file tends to change toward the end of the file, as the end of the file is typically the most recently worked on portion. In a file with a change (relative to a previously stored version of the file), many times a small change will result in data being shifted, resulting in everything after the change looking like a change since it will be bit/byte shifted. Noting this characteristic, the controller is preferably programmed to start a write operation by doing a preread and compare on each successive sector. As soon as a miscompare is detected, the controller preferably aborts the process of performing preread and compares, and instead enters a mode in which it automatically writes each succeeding new sector to memory cells of the array and obsoletes each older sector corresponding to (and replaced by) each succeeding new sector, without any further comparisons.
Typically, the control signals and address bits received at interface 102 from the external host (processor 2) indicate one or more sectors of array 216 which are to be updated with new data (also received from the host or from a memory controlled by the host). In response to the internal control signals and address bits asserted by interface 102 (in response to the control signals and address bits received from host processor 2), controller 129 writes each sector of the data to a "free" sector (e.g., row) of array 216 which corresponds to the sector (and cylinder and head) specified by the host (or controller 129 determines that there is no need to perform such write, in accordance with the invention). When controller 129 determines that a previously written sector of array 216 needs to be updated with new data received from host processor 2, controller 129 causes chip 3 to execute the following operations: controller 129 causes flash interface to write the new data to a "free" sector of array 216, which is an erased sector other than the previously written sector (i.e., an erased sector of array 216 to which data has not been written since the last erase of the entire erase block containing the erased sector); controller 129 marks the previously written sector as old (obsolete, and ready to be erased); and typically also controller 129 asserts a confirmation signal to interface 102 (to be relayed to the host to confirm that the requested write operation has been performed). As will be explained below, control engine 130 of controller 129 is preferably programmed in accordance with the invention to assert such a confirmation signal even when it has prevented a write of the updating data to array 216 (after controller 129 has determined that there is no need for such a write, because the updating data is identical to previously written data which the updating data is intended to replace). Controller 129 is programmed to keep track of the obsolete sectors of array 216 (typically, each sector is a row of cells of array 216) and to cause the erasing of an entire erase block when it becomes filled or almost filled with obsolete sectors. Controller 129 can cause the new data (updating data) from the host to be written to another erase block (an erase block other than the erase block containing the previously written sector to be updated) or even another decode block or possibly even a different flash memory chip.
With reference again to FIG. 3, control engine 130 asserts control signals to the other elements of controller 129 (including elements 106 and 110) and to flash interface 114 in response to the internal control signals it receives from interface 102, to cause controller 129 and interface 114 to execute operations in accordance with the present invention. Control engine 130 determines which set of sub-operations or functions need to be performed to implement the memory operation specified by processor 2 (e.g., a write of data in buffer memory 104 to array 216, or a read of data from array 216 to buffer memory 104). In a typical implementation of control engine 130, control engine 130 includes a microcontroller which performs the high level operations, such as command and status handshaking with the host via interface 102. This microcontroller is responsible for locating the proper memory location (within array 216) from a given cylinder, head and sector address from the host. This microcontroller will handle error correction (ECC) calculations and will also correct errant data bits found by the ECC calculations. While such a microcontroller can be programmed to efficiently handle these activities, it will typically be too slow to control the real time operations of managing the data flow and flash interface gating. Because of the performance limitations, a specially designed sequencer will often be included in control engine 130 to control the real time functions of the flash data gating and flash interface control. In an implementation using a microcontroller and a specially designed sequencer, the microcontroller will typically act as the master to the slave sequencer. This is done by having the microcontroller activate the sequencer to do specific functions in response to the microcontroller's commands. In this environment, the sequencer will be given commands such as "read sector," "write enable," or "erase a block." The locations of the cells of array on which to do these operations are given to the sequencer from the microcontroller.
Typically, the sequencer would perform the specified operation by managing the DMA circuit 120 and the bad location hardware (error detection circuitry), as well as handling the address and command handshaking with the flash port logic (flash interface 114).
Various structures of microcontroller and sequencer logic are possible, but the overall methodology will preferably resemble the structures used by conventional magnetic hard disk drives.
An alternate design approach that may be used to implement control engine 130 is to replace the microcontroller and sequencer by a single RISC processor or DSP (digital signal processor). Use of such processor cores provides the speed required (which otherwise would be provided by a sequencer) as well as the high level intelligence required. This approach would simplify the design and would shift the development burden more to firmware design. This approach would also give better flexibility for design changes, through firmware, and would possibly reduce cost where a small core would replace large blocks of logic.
Data to be written to array 216 are received at interface 102, and written from interface 102 to buffer memory 104. Buffer memory 104 is preferably an SRAM circuit, but it can alternatively be an array of nonvolatile memory cells or some other memory circuit. Memory 104 has capacity to store a set of data. This set can be a "sector" of the data, and such a sector of data can consist of a number (e.g., sixteen) of "Packets" of the data (where "sector" and "packet" have been explained above). In accordance with the invention, comparator circuit 110 operates in a mode in which it compares a set (e.g., a sector) of new data temporarily stored in buffer 104 to be later written to flash memory array 216 (e.g., to a sector of array 216), with a previously stored set (e.g., sector) of data. The previously stored set of data is data, stored in cells of flash memory array 216 (e.g., in a sector of array 216 to which a sector of data in buffer 104 is to be written), which is to be replaced by the new data in buffer memory 104. The previously stored set of data is preread from array 216 and asserted to comparator 110 in accordance with the invention.
For specificity, the rest of the detailed description will describe embodiments in which a "sector" of new data in a buffer memory is to be written to a "sector" of cells of a flash memory array. However, it is contemplated that in other embodiments, a set of new data (not necessarily a "sector" of new data) in a buffer memory is to be written to memory cells of a flash memory array (not necessarily to a "sector" of such cells).
With reference again to FIG. 3, in accordance with another aspect of the invention, control engine 130 is programmed to prevent a write of the new data from memory 104 to array 216 when comparator 110 has determined that the new data in buffer 104 is identical to the previously stored data (in array 216) which the new data is intended to replace.
In preferred implementations of the FIG. 3 system, array 216 is organized into erase blocks of cells, and each row of each erase block stores a quantity of bits which corresponds to a sector of a magnetic disk drive (and thus each row is denoted as a sector of cells). In one such implementation, memory 104 receives from interface 102 (and stores) a burst of 512 eight-bit bytes of new data (4096 bits) and each row of array 216 consists of 4352 cells (and thus each row can store the 4096 bits of new data plus an additional 256-bit packet of "overhead" bits). In variations on the single chip embodiment of FIG. 3, array 216 and controller 129 are implemented in two or more separate chips. Array 216 can itself be replaced by an array implemented in two or more chips.
With reference to FIG. 3, memory system 3 operates as follows when a sector of new data to be written to a sector of array 216 has been stored in buffer memory 104. Control engine 130 (e.g., a sequencer within control engine 130) sends a control signal to direct memory access circuit 120 ("DMA unit" 120) to set the DMA pointer to the start of a sector, sets comparator logic circuit 110 to a mode of operation in which it compares the data value asserted to its "A" input to the data value asserted to its "B" input and asserts to control engine 130 a status bit indicative of whether each pair of a sequence of pairs of data values simultaneously asserted to circuit 110 match (or alternatively, a sequence of status bits, each indicative of whether each pair of data values simultaneously asserted to circuit 110 match), sets DMA 120 to a mode of operation in which it sequentially asserts the 8-bit bytes of one sector of data from memory 104 to multiplexer 106, causes multiplexer 106 to enter a mode of operation in which multiplexer 106 passes the data it receives from memory 104 to the "A" input of circuit 110, and causes a sequence of eight-bit bytes of a corresponding sector of stored data to be read from array 216 and passed through interface 114 to the "B" input of circuit 110. Multiplexer 106 can be controlled to select either eight bits of data received in parallel from shift register 118, or eight bits of data received in parallel from buffer memory 4, and asserting each set of selected bits to circuit 110.
Preferably, circuit 110 includes a register for an interim status bit indicative of whether all pairs of data values already asserted to circuit 110 (in parallel to the "A" and "B" inputs of circuit 110) are matching pairs. E.g., circuit 110 can add a "zero" bit to the contents of the register each time a matching pair of data values is received at the "A" and "B" inputs of circuit 110, and circuit 110 can add a "one" bit to the contents of the register each time a non-matching pair of data values is received at the "A" and "B" inputs of circuit 110. The "one" bit will be held and will not be reset to zero. Preferably, circuit 110 includes logic circuitry for asserting a first status signal (e.g., a single "one" bit) to control engine 130 when the contents of the status register within circuit 110 changes from a "zero" bit to a "one" bit, and for asserting a second status signal (e.g., a single "zero" bit) to control engine 130 if the status register (within circuit 110) still contains a "zero" bit after an entire sector of data has been received at each of the "A" and "B" inputs of circuit 110 and been processed by comparator 110.
In response to such a "first" status signal from comparator circuit 110 (indicating that the new sector of data in buffer 104 does not match the previously stored sector of data read from array 216), the comparison operation (which had been performed by circuit 110) is aborted, and control engine 130 sets circuit 110 to operate in a mode in which it does not alter data received at its "A" input (and instead passes the data through to its output terminal), and control engine 130 puts flash interface 114 into a mode in which it receives the output of circuit 110. Control engine 130 also causes DMA unit 120 to set the DMA address back by one sector, and DMA unit 120 causes the same sector of data bits to be reread from memory 104 to multiplexer 106 (as a sequence of eight-bit bytes). Multiplexer 106 then asserts the sector of data from buffer memory 104 to circuit 110, circuit 110 passes the data through (unaltered) to its output terminal, and the data asserted at circuit 110's output terminal is received by flash interface 114 and written by flash interface 114 to a sector of cells (a "free" sector of erased cells) of flash memory array 216 in a well known manner. In preferred implementations, multiple streams of the bits from buffer memory 104 are written to array 216 in parallel, so that at any one time, bits are being written to two or more cells of array 216. In one preferred implementation, two hundred fifty six (256) streams of bits are written to array 216 in parallel (so that a packet of 32 eight-bit bytes of the data is written to array 216 during a single write operation). Control engine 130 keeps track of the sector of array 216 to which the new data has been written, generates a confirmation signal indicating that the new sector of data has been written to the sector of cells specified by the host (processor 2), and asserts the confirmation signal to host interface 102. In response, interface 102 relays the confirmation signal (or asserts a corresponding confirmation signal) to the host. Typically, control engine 130 does not keep track of the status of each packet of a sector, and it confirms the writing of a sector of data but not a subset (e.g., a packet) of a sector of data.
In response to the described "second" status signal from comparator circuit 110 (indicating that the new sector of data in buffer 104 matches the previously stored sector of data read from array 216), control engine 130 prevents a write of the new sector of data to array 216. In the preferred embodiments, control engine 130 instead generates a confirmation signal indicating that the new sector of data has been written to the sector of cells of array 216 in which the matching sector of data has previously been stored (rather than actually writing the new data to array 216), and asserts the confirmation signal to host interface 102. In response, interface 102 relays the confirmation signal (or asserts a corresponding confirmation signal) to the host (processor 2).
Shift register 118 is optionally employed to store temporarily one or more overhead bits, to be written to array 216 for use in subsequent processing of data bits to be written from buffer memory 104 to array 216. Also, overhead bits read from array 216 can be stored in register 118 for use at appropriate times during processing of corresponding data read from array 216. Preferably, control engine 130 is capable of monitoring the contents of shift register 118 and shifting the contents of register 118 by sequencer control to assert from register 118 selected overhead bits corresponding to any selected packet of a sector of data (read from array 216 or to be written to array 216).
Also preferably, control engine 130 can alter the length of each DMA transfer to fit the desired volume of data to be written to array 216 (i.e., the size of each sector, packet, or other quantity of data asserted from buffer memory 104 is preferably controllable). Preferably, control engine 130 can alter the DMA address to allow multiple reads (rereads) of the same quantity of data from buffer 104 during a DMA transfer operation.
After an entire sector of data in buffer memory 104 has been processed in accordance with the invention (by performing a comparison in circuit 110 and writing the sector of data to array 216), the sequencer within control engine 130 selects shift register 118 as a data source. At this point, shift register 118 contains overhead bits corresponding to the sector of data written to array 216, typically because controller 129 has caused ECC check bits (e.g., from circuit 132 discussed below), defect bits, and system flags for the sector of data to be written to register 118 as a set of overhead bits for the sector. The overhead bits are sequentially asserted (as a sequence of eight-bit words) from shift register 118 through multiplexer 106 and circuit 110 to flash interface 114, and are then written to cells of array 216. In the above-mentioned implementation of array 216 in which each row of array 216 consists of 4352 cells (and can store sixteen 256-bit packets of data plus an additional 256-bit packet of overhead bits), a sector of data (4096 bits of data stored in buffer 104) is written to a single row of array 216, and a packet of 256 overhead bits from register 118 are also written to the same row of array 216.
To read a sector of data from array 216, the FIG. 3 system operates as follows. The sequencer within control engine 130 causes flash interface 114 to read the overhead bits for the sector from array 216. The overhead bits that are read from array 216 are asserted through circuit 110 to shift register 118 (and/or to circuit 132 discussed below). Control engine 130 (e.g., the sequencer within control engine 130) then sets the DMA address to the start of the sector, and causes DMA unit 120 and flash interface 114 to execute a DMA operation in which the first packet of bits (e.g., the first 32 eight-bit bytes of bits) is read from array 216, asserted from interface 114 to circuit 110, and written from the output of circuit 110 to buffer memory 104 (and optionally through multiplexer 130 to circuit 132). Control engine 130 (e.g., the sequencer within control engine 130) monitors the DMA operation for completion of the packet transfer to memory 104.
Upon completion of the packet transfer, control engine 130 causes another DMA operation to be performed to read the next packet from array 216 and write the packet to buffer memory 104. This sequence of steps is repeated for each packet of the sector to be read from array 216, until all packets of the sector have been read from array 216 and written to buffer memory 104.
The error correction code for the sector (error correction code bits which are a subset of the overhead bits previously read from array 216 and stored in register 118) is preferably also checked, under control of control engine 130, to determine if there is any detectible error in the data in buffer memory 104. If no error is detected, the data are transferred from buffer memory 104 through host interface 102 to host processor 2.
More specifically, circuit 3 preferably includes multiplexer circuit 130 and error detection and correction circuit 132 (ECC 132) connected as shown in FIG. 3 (with the input of ECC 132 connected to the output of multiplexer 130). When circuit 3 operates in a write mode in which it writes data from buffer memory 104 to array 216, the data being written (or to be written) to array 216 is asserted from buffer memory 104 through multiplexer 106, circuit 110, and multiplexer 130 to ECC 132. In this mode, ECC 132 processes the data to calculate check bits. ECC 132 asserts the check bits to flash interface 114, and flash interface 114 causes the check bits to be written to array 216.
When circuit 3 operates in a read mode in which it reads data from array 216, flash interface 114 asserts the data (and corresponding check bits) which it reads from array 216 through circuit 110 and multiplexer 130 to ECC 132. In this mode, ECC 132 processes the check bits and data to identify errors in the data, and ECC 132 asserts appropriate signals to control engine 130 (e.g., signals indicative of syndrome bits) as a result of this operation. ECC 132 thus performs error detection on the data read from array 216. Control engine 130 reads the syndrome bits from ECC 132 and calculates a correction vector based thereon (e.g., in a well known manner). Once the correction vector and displacement are known, control engine 130 alters the data in buffer memory 104 to correct at least one detected error therein. The corrected data will then be sent to the host (via host interface 102).
In some embodiments, to read a set of data bits (and any corresponding overhead bits for the set) from a location (e.g., a sector) of a flash memory array, the controller of the inventive flash memory system identifies the location where the set of data is stored and reads any corresponding overhead bits (typically stored in a sublocation distinct from that where the data of interest is stored). The controller stores and/or processes the overhead bits. Then, the first subset of the set of data is then DMA gated from the flash memory array and written into an internal data buffer. The next subset of the set of data is then DMA gated from the flash memory array and written into the internal data buffer, and this process repeats until all subsets of the set of data have been read from the array and written to the internal data buffer. After the entire set of data has been stored in the internal data buffer, the controller preferably performs error detection (using ECC check bits read from the flash memory array), and if the data is found correct the controller causes the data to be sent from the internal data buffer to a host over a controller interface. Reads of different locations (e.g., sectors) of the flash memory proceed with this same procedure until data from all desired locations has been sent to the host. When all the data has been sent to the host, the read operation is complete.
Control engine 130 is preferably programmed with software for implementing the invention as described with reference to FIG. 3. Throughout the specification, including in the claims, the expression that a device is "programmed with software" for performing an operation in accordance with the invention is used in a broad sense to denote s that the device includes software, firmware, or dedicated hardware which gives the device the capability of performing the operation. Also throughout the specification, including in the claims, the term "circuitry" is used to denote any hardware comprising active and/or passive electrical components (e.g., semiconductor devices, tubes, resistors, etc.) whether or not such hardware is programmed with software (unless the term "circuitry" is qualified to refer to a narrower class of such hardware). A general purpose processor which includes transistors or other electrical components and which is programmed with software causing the processor to process electrical signals (indicative of binary data) that it receives in accordance with an algorithm is an example of "circuitry" within the scope of this definition.
In the FIG. 3 circuit, controller 129 includes hardware as specified (including comparator 110 which is implemented by hardwired logic circuitry). It is contemplated that in alternative embodiments, controller 129 can be a general purpose processor (including a memory) which is programmed with software enabling the processor to perform an operation in accordance with the invention (e.g., in response to external signals from host processor 2 specifying operations on memory array 216).
It should be understood that although controller 129 is a component of the same integrated circuit (chip 3) as is flash memory array 216 in the FIG. 3 embodiment of the invention, in other embodiments of the invention the controller and flash memory array will be implemented in distinct chips. For example, it is contemplated that the invention can be embodied in a chip set (such as that shown in FIG. 4) which includes a controller chip and two or more memory array chips, each of which operates under control of the controller chip. Such a chip set can be implemented to emulate a magnetic disk drive (with the controller chip operating in response to commands received from a remote host). It is contemplated that the controller would be capable of performing a memory operation on any selected one of the memory array chips. For example, when instructed to write a sector of data to non-volatile memory cells of a selected one of the memory array chips, it would compare the sector to a previously stored sector of data read from the selected memory array chip in accordance with the invention, and either write the sector of data to the selected memory array chip or generate a confirmation signal indicating that the sector has been written to selected memory array chip without actually writing the sector to the chip (depending on the outcome of the comparison).
FIG. 4 is a block diagram of a multi-chip embodiment of the inventive flash memory system, including identical nonvolatile memory arrays 316, 416, and 516 (each implemented as a separate integrated circuit) and controller 129′. Each cell of each of arrays 316, 416, and 516 is preferably a flash memory cell. Also preferably, each of arrays 316, 416, and 516 comprises at least one decode block of flash memory cells (and preferably several such decode blocks), each decode block includes at least one erase block of cells, and each of the erase blocks includes at least one row of cells. Controller 129′ is programmed to control memory operations of any selected one of arrays 316, 416, and 516, and to process a sector of data to be written to any selected one of arrays 316, 416, and 516 in accordance with the invention. Controller 129′ can differ from controller 129 of FIG. 3 only in that controller 129′ includes hardware and/or software for selecting one of the flash memory arrays (whereas controller 129 need not have such a capability).
Another embodiment of the flash memory system of the invention is shown in FIG. 5. In the FIG. 5 embodiment, flash memory chip 300 is controlled by an external controller chip 229. Flash memory chip 300 includes an array 16 of flash memory cells, and array 16 consists of decode blocks of cells (such as decode block 16E). Controller 229 operates with microcontroller chip 200. In FIG. 5, chips 200 and 229 together perform the functions of controller 129 of the FIG. 3 embodiment. Flash memory chip 300 of FIG. 5 need not include control logic circuitry (of the type included in control unit 29 of memory chip 103 of FIG. 1), and instead controller 229 of FIG. 5 includes hardware and software for controlling memory operations of chip 300 (and for implementing the present invention).
Several embodiments of the method and apparatus of the invention have been described with reference to FIGS. 3, 4, 5, and 6. Although these embodiments have been described in some detail, it is contemplated that changes from these embodiments can be made without departing from the spirit and scope of the invention as defined by the appended claims.
|Cited Patent
|Filing date
|Publication date
|Jun 20, 1986
|Mar 7, 1989
|Mitsubishi Denki Kabushiki Kaisha
|Data integrity verifying circuit for electrically erasable and programmable read only memory (EEPROM)
|Dec 4, 1990
|Jan 4, 1994
|Micron Technology, Inc.
|Spare memory arrangement
|Oct 30, 1992
|Oct 18, 1994
|Intel Corporation
|Method for detaching sectors in a flash EEPROM memory array
|Sep 17, 1992
|Oct 18, 1994
|Rexon/Tecmar, Inc.
|Data compression controller
|Feb 8, 1991
|Feb 21, 1995
|Quantum Corporation
|Addressing technique for a fault tolerant block-structured storage device
|Jul 1, 1993
|Jun 27, 1995
|Quantum Corp.
|System and method for verifying the integrity of data written to a memory
|Feb 19, 1993
|Oct 17, 1995
|Conner Peripherals, Inc.
|Flash solid state drive that emulates a disk drive and stores variable length and fixed lenth data blocks
|Mar 26, 1993
|Dec 26, 1995
|Cirrus Logic, Inc.
|Flash memory mass storage architecture incorporation wear leveling technique
|Oct 4, 1993
|Jan 16, 1996
|Cirrus Logic, Inc.
|Flash memory mass storage architecture incorporating wear leveling technique without using cam cells
|Feb 23, 1995
|Apr 30, 1996
|Micron Technology, Inc.
|Flash memory having transistor redundancy
|Jun 17, 1994
|May 7, 1996
|Hitachi, Ltd.
|Semiconductor memory
|Jun 30, 1993
|May 21, 1996
|Intel Corporation
|Method of pipelining sequential writes in a flash memory
|Jun 29, 1995
|Jun 4, 1996
|Micron Quantum Devices, Inc.
|Circuit for generating a delayed standby signal in response to an external standby command
|Feb 23, 1995
|Sep 24, 1996
|Micron Technology, Inc.
|Flash memory having transistor redundancy
|Feb 19, 1993
|Dec 3, 1996
|Intel Corporation
|Method and apparatus for retaining flash block structure data during erase operations in a flash EEPROM memory array
|May 5, 1995
|Feb 11, 1997
|Kabushiki Kaisha Toshiba
|Semiconductor disk system having a plurality of flash memories
|Sep 21, 1992
|Jun 10, 1997
|Hitachi, Ltd.
|Recording apparatus
|Jun 7, 1995
|Jul 22, 1997
|Sgs-Thomson Microelectronics, S.A.
|Programmable integrated circuit memory comprising emulation means
|Oct 21, 1994
|Sep 16, 1997
|Cirrus Logic, Inc.
|Error correction method and apparatus for disk drive emulator
|Sep 6, 1996
|May 19, 1998
|Intel Corporation
|Method and apparatus for correcting a multilevel cell memory by using interleaving
|Oct 15, 1996
|May 19, 1998
|Micron Quantum Devices, Inc.
|Write reduction in flash memory systems through ECC usage
|Citing Patent
|Filing date
|Publication date
|Aug 4, 2000
|Feb 18, 2003
|Abb Service S.R.L.
|Method for off-line programming an industrial robot
|Nov 8, 2001
|Jan 13, 2004
|3Dlabs, Inc., Ltd
|Graphics request buffer caching method
|Apr 26, 2002
|Aug 31, 2004
|International Business Machines Corporation
|MRAM and access method thereof
|Dec 5, 2003
|Apr 18, 2006
|Stmicroelectronics S.R.L.
|Method and device for programming an electrically programmable non-volatile semiconductor memory
|Feb 7, 2003
|May 23, 2006
|Dell Products L.P.
|Method and system for managing optical storage medium file system structures
|Oct 13, 2006
|Aug 7, 2007
|Micron Technology, Inc.
|Method of comparison between cache and data register for non-volatile memory
|Dec 16, 2004
|Nov 20, 2007
|Fujitsu Limited
|Magnetic resistance memory and method of writing data
|Jun 2, 2005
|Apr 29, 2008
|Sun Microsystems, Inc.
|Reducing resource consumption by ineffective write operations in a shared memory system
|Apr 28, 2005
|Feb 3, 2009
|Micron Technology, Inc.
|Method of comparison between cache and data register for non-volatile memory
|Apr 1, 2005
|Feb 24, 2009
|Sun Microsystems, Inc.
|Reducing resource consumption by ineffective write operations
|Nov 26, 2003
|Jul 28, 2009
|Jan Hoogerbrugge
|Memory controller and method for writing to a memory
|Jul 24, 2007
|Apr 27, 2010
|Kabushiki Kaisha Toshiba
|Control apparatus with fast I/O function, and control method for control data thereof
|Mar 27, 2008
|Jun 7, 2011
|Kabushiki Kaisha Toshiba
|Semiconductor storage device and method of controlling the same
|Nov 12, 2010
|Aug 9, 2011
|Kabushiki Kaisha Toshiba
|Memory system with controller for managing management data and reverse flag for reversing write data
|Sep 15, 2008
|Oct 18, 2011
|Seagate Technology Llc
|System and method of managing memory
|Jul 30, 2007
|Nov 8, 2011
|Samsung Electronics Co., Ltd.
|Semiconductor memory system performing data error correction using flag cell array of buffer memory
|Nov 12, 2010
|Mar 12, 2013
|Kabushiki Kaisha Toshiba
|Semiconductor memory system with first and second nonvolatile memories storing user and management data and a controller controlling read/write of the memories and having simultaneous data transfer in and out of one of the memories
|Feb 6, 2013
|Apr 22, 2014
|Kabushiki Kaisha Toshiba
|Semiconductor storage device having nonvolatile flash and ram with simultaneous data copy and data receive
|Mar 4, 2014
|Dec 2, 2014
|Kabushiki Kaisha Toshiba
|Semiconductor memory system controlling writing of data to nonvolatile memories using consecutive logical addresses
|Apr 11, 2008
|Oct 25, 2016
|Micron Technology, Inc.
|Method and apparatus for a volume management system in a non-volatile memory device
|Dec 27, 2000
|Jun 27, 2002
|Linden Minnick
|Accessing information from memory
|Jan 31, 2002
|Jul 31, 2003
|Maghielse William T.
|LCD controller architecture for handling fluctuating bandwidth conditions
|Dec 5, 2003
|Sep 2, 2004
|Stmicroelctronics S.R.L
|Method and device for programming an electrically programmable non-volatile semiconductor memory
|Feb 7, 2003
|Sep 2, 2004
|Lo Hong-Jing (James)
|Method and system for managing optical storage medium file system structures
|May 25, 2004
|Dec 1, 2005
|Chih-Chiang Wen
|Optical disc drive that downloads operational firmware from an external host
|Jun 18, 2004
|Dec 1, 2005
|Chih-Chiang Wen
|Optical Disc Drive that Downloads Operational Firmware from an External Host
|Dec 16, 2004
|Mar 2, 2006
|Fujitsu Limited
|Magnetic resistance memory and method of writing data
|Nov 26, 2003
|May 18, 2006
|Koninklijke Philips Electronics N.V.
|Memory controller and method for writing to a memory
|Apr 28, 2005
|Nov 2, 2006
|Micron Technology, Inc.
|Method of comparison between cache and data register for non-volatile memory
|Oct 13, 2006
|Feb 8, 2007
|Micron Technology, Inc.
|Method of comparison between cache and data register for non-volatile memory
|Oct 24, 2006
|Apr 26, 2007
|Kabushiki Kaisha Toshiba
|Information processing apparatus, data storage method, and data storage program
|Jul 24, 2007
|Feb 21, 2008
|Kabushiki Kaisha Toshiba
|Control apparatus with fast i/o function, and control method for control data thereof
|Dec 1, 2006
|Apr 3, 2008
|Yutaka Nakagawa
|Storage system having data comparison function
|Jul 30, 2007
|Jul 31, 2008
|Sun Kwon Kim
|Semiconductor memory system performing data error correction using flag cell array of buffer memory
|Mar 27, 2008
|Aug 7, 2008
|Yoshiyuki Tanaka
|Semiconductor storage device and method of controlling the same
|Jun 17, 2008
|Dec 4, 2008
|Chih-Chiang Wen
|Electronic device that Downloads Operational Firmware from an External Host
|Sep 24, 2007
|Mar 26, 2009
|Mediatek Inc.
|Apparatus and method for updating firmware stored in a memory
|Apr 11, 2008
|Oct 15, 2009
|Micron Technology, Inc.
|Method and apparatus for a volume management system in a non-volatile memory device
|Sep 15, 2008
|Mar 18, 2010
|Seagate Technology Llc
|System and method of managing memory
|Nov 12, 2010
|Mar 10, 2011
|Yoshiyuki Tanaka
|Semiconductor storage device and method of controlling the same
|Nov 12, 2010
|Mar 10, 2011
|Yoshiyuki Tanaka
|Semiconductor storage device and method of controlling the same
|Nov 12, 2010
|Mar 10, 2011
|Yoshiyuki Tanaka
|Semiconductor storage device and method of controlling the same
|Sep 4, 2002
|Apr 22, 2008
|Matsushita Electric Industrial Co., Ltd.
|Apparatus and method of partially transferring data through bus and bus master control device
|U.S. Classification
|711/159, 711/103, 711/133
|International Classification
|Cooperative Classification
|European Classification
|Jan 27, 2006
|Fee payment
Year of fee payment: 4
|Jan 29, 2010
|Fee payment
Year of fee payment: 8
|Jan 22, 2014
|Fee payment
Year of fee payment: 12
|May 12, 2016
Owner name: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGEN
Free format text: SECURITY INTEREST;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:038669/0001
Effective date: 20160426
|Jun 2, 2016
Owner name: MORGAN STANLEY SENIOR FUNDING, INC., AS COLLATERAL
Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:038954/0001
Effective date: 20160426
|Jun 8, 2017
Owner name: U.S. BANK NATIONAL ASSOCIATION, AS COLLATERAL AGEN
Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE REPLACE ERRONEOUSLY FILED PATENT #7358718 WITH THE CORRECT PATENT #7358178 PREVIOUSLY RECORDED ON REEL 038669 FRAME 0001. ASSIGNOR(S) HEREBY CONFIRMS THE SECURITY INTEREST;ASSIGNOR:MICRON TECHNOLOGY, INC.;REEL/FRAME:043079/0001
Effective date: 20160426


text:
"We are delighted to support our exclusive charity The Little Princess Trust for another year. It is a charity that is not only close to our hearts, but also one where we are making a real difference to the work that they do. We have raised over an incredible £110,000 for the charity in the past two years, thanks to the sustained enthusiasm from our office, field and store teams as well as our generous customers. Every little bit of effort that we make can help the charity fulfill their promise of helping children look and feel great during what is a very stressful time in their lives."
- Warren Scarr, Chief Marketing Officer VP
Little Princess 15ml
€12.99 each
Little Princess shade only
Diva Veloce 3800 Pro
€53.98 each
Forfex Palm Pro
€19.99 each
Pouty Lipzz Plumping
€19.99 each
BaByliss PRO Conical
Wand 25–13mm
€32.99 each
Salon Services Pink Heat
Retainer - 44mm
€7.95 each
Salon Services Pink Heat
Retainer - 34mm
€6.99 each
Salon Services Pink Heat
Retainer - 25mm
€5.99 each
Salon Services Pink Heat
Retainer - 15mm
€5.99 each
Denman D90 Tangle Tamer
€7.98 each
Salon Services Styling Mousse
– Super Hold
€7.98 each
Ion Super Hold
€1.25 each
Pink Wax
€5.29 each

subset: commoncrawl


text:
Finance: FV, PV, amortization and annuity problems
How much will $1.00 deposited in a savings account earning a compound annual interest rate of 6 percent be worth at the end of the following number of years? a. 3 b. 5 c. 10 If you require a 9 percent return on your investments, which would be preferred. Why? a. $5,000 today b. $15,000 five years from today c.


text:
Hey there, time traveller!
This article was published 12/3/2014 (1254 days ago), so information in it may no longer be current.
THE PAS — The late Sam Waller was nothing if not honest about his penchant for accumulating miscellanies.
"I am a chronic collector," he once said. "I always have been. I collect anything and everything."
But could he have imagined his hoarding would one day flourish into a northern Manitoba landmark?
Welcome to the Sam Waller Museum.
Situated in the heart of The Pas in a nearly century-old building, it's crammed with thousands of artifacts ranging from the historically momentous to the just plain quirky.
"Just a little bit of everything," says Laura Hrabarchuk, the museum's weekend host, in summing up the inventory of artifacts.
Indeed, the Sam Waller Museum is one of those places where you'll notice something new each visit, no matter how many times you stop by.
Up the smooth concrete steps and through the chocolate-brown doors, visitors know they're in for a curious experience once greeted by a two-headed calf fashioned from papier-m¢ché.
Soon they see the real two-headed calf, a preserved, glass-encased marvel of nature that was born on a farm near The Pas in 1950. It's so synonymous with this facility the museum's website assures there's "more than a two-headed calf" to see.
It's true. There are many other stuffed animals on display here, including an armadillo, a wolverine and the head of what would have been one helluva moose.
If you find smaller creatures more captivating, just open the drawers in the Sam's Gallery area to view the butterflies or, even more intriguingly, the dressed-up fleas.
I won't even attempt to categorize the rest of the exhibits, but among their highlights are a sharp-looking RCMP red serge, beautiful Inuit sculptures, compelling photographs, vintage pop bottles and old wristwatches.
It all started with Waller, whose stockpiling ways dated back at least as far as his service in the First World War.
Despite the ever-present danger of battle, Waller reportedly carried around more than his share of war keepsakes as he fought for his native England.
After the war, he found his way to the safe soil of Canada and, eventually, his true career calling in teaching. He arrived in The Pas in 1939 to teach at Big Eddy Day School.
By the time he retired from teaching in 1958, Waller was already known for his trove of war mementoes and teaching aids -- and his love of showing them off.
Waller took the unusual step of buying a couple of small bunkhouses from a lumber company to establish his own historical repository, known as the Little Northern Museum.
It was an instant hit, averaging well over 600 visits a month early on with the kindly Waller as the live-in curator.
Waller kept his museum open 12 hours a day, seven days a week, always putting his inquisitive visitors ahead of his own diversions.
Even when Waller was busy, he was never too busy. Sometimes visitors would stop by to find a sign hung on the front door: "Attendant in Garden."
Though Waller died in 1978, his legacy lives on. No longer confined to its original modest abode, the Sam Waller Museum today occupies the former The Pas community building and courthouse, a gallant brown-bricked structure along bustling Fischer Avenue.
Visitors can still descend into the basement to look at the cramped jail cells that once housed northerners accused of various misdeeds.
A separate, much more inviting room is used to display a range of travelling exhibits.
"(From) all throughout the world, actually, we've had temporary exhibits," notes Hrabarchuk.
Designated as a "Star Attraction" by Travel Manitoba, the museum is a definitive symbol of The Pas, whose few thousand residents hold it in high esteem.
"It receives a substantial amount of community support," says museum director Sharain Jones.
Fittingly, the museum's still-growing selection of artifacts is overseen by a life-size cardboard cutout of Waller, standing amid some well-stocked shelves.
Even in death, the chronic collector continues to amass things.
Jonathon Naylor is editor of the Reminder newspaper in Flin Flon.


text:
Top of the Hub Send to Phone
OpenLunch Mon.-Sat., Dinner nightly, Brunch Sun.
Open late
- Dress code: Casual dressy
- Entertainment: Live jazz nightly (Lounge)
- Full bar
- Great Wine List
- Private room(s)
- Reservations suggested
- Romantic setting
- View
* Click here for rating key
Text data on Top of the Hub to your phone, or a friend's cell phone.
Find out which restaurants and chefs top the list of GAYOT's 2016 Annual Restaurant Awards.


text:
Education, Industry, Trade and Development of European and Eurasian Countries in 1980-99
This paper presents a comparative analysis of economic development in European and Eurasian countries, focusing on the educational level of population, fertility rates, production by sector and foreign trade. Countries are classified into 5 large areas: three for Western Europe, one for Central Europe, Baltic and East Mediterranean, and the other for Eurasia. The highest levels of development in Western European countries are mainly explained by educational level of population and a high degree of industrialization. We analyse the main challenges and opportunities in terms of institutional, physical and human capital, for Central and East countries with low levels of development.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Volume (Year): 3 (2003)
Issue (Month): 1 ()
Pages: 115-141
|Contact details of provider:
| Web page: http://www.usc.es/economet/eaa.htm
|Order Information:
| Web: http://www.usc.es/economet/info.htm Email:
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Neira, Isabel & Guisan, M.Carmen, 2002. "Modelos econometricos de capital humano y crecimiento economico: Efecto Inversion y otros efectos indirectos," Economic Development 62, University of Santiago de Compostela. Faculty of Economics and Business. Econometrics..
- Cancelo, M.Teresa & Guisan, M.Carmen & Frias, Isidro, 2001. "Supply and Demand on Manufacturing Output in OECD countries: econometric models and specification test," Applied Econometrics and International Development, Euro-American Association of Economic Development, vol. 1(2), pages 7-42.
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.
When requesting a correction, please mention this item's handle: RePEc:eaa:aeinde:v:3:y:2003:i:3_6. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (M. Carmen Guisan)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.


text:
Brendon is definitely the party type... however, Dallon really isn't.
Dallon lost a bet, Brendon lost a bet.
Don't Threaten Me with a Good Time
Basically in which Dallon and Brendon meet at a party, and are instantly attracted to each other. But Brendon's got a lot of crazy things that went down in the past, and Dallon is there for him when they come back to haunt him.
msbreezyandpals Sep 07, 2016
Omfg I'm just imagining these two dorks climbing the fireplace like Tina Fey in Sisters😍😍😍


text: I reached my goal of $300 thanks to donors like Kathleen! If you donated to my MS ride, I promised to pick up trash in our local parks as a way of showing extra thanks! This journey was all in thanks to Kathleen. Donate to my MS ride, and I'll pick up trash in my local parks as a way of thanking you! - Tackk I will be participating in a 2 day, 150 mile bike ride to help support finding a cure for MS. My goal is raise $300 for the MS ride!If you are able to donate, I will happily pick up litter in some of my local parks as a way of thanking you for... OHA 2015 Bike MS: Buckeye Breakaway: Mr. Justin Barlock - National MS Society For cyclists and all those seeking a personal challenge and a world free of MS, Bike MS is the premier fundraising cycling series in the nation. Rockcliff Springs located in the Rocky River Reservation Once again, the entire MS community thanks you!


text:
What is JotForm?
JotForm is a free online form builder which helps you create online forms without writing a single line of code. No sign-up required.
At JotForm, we want to make sure that you're getting the online form builder help that you need. Our friendly customer support team is available 24/7.
We believe that if one user has a question, there could be more users who may have the same question. This is why many of our support forum threads are public and available to be searched and viewed. If you'd like help immediately, feel free to search for a similar question, or submit your question or concern.
Authorize Form Not WorkingAsked by openstudiospress on August 17, 2015 at 10:26 AM
Authorize form isn't working. And the results (submissions) are missing payment details. I've deleted the payment block thinking I could start over but now it's very messed up and I'm afraid I will lose the initial form and the results. Please fix the form and revert my form to before it got messed up.
We are also having the same problem. And no new payment field can be created.
Tons of people reporting the same problem. Haven't seen any response yet. We are in desperate need to get are forms working. We have many different registrations currently that are not working and or are letting people sign up without paying.
I directed them to my support thread http://bit.ly/1Lf6mT0 on twitter and Ben from support said that he would reply to me there.
He had no idea that there was an issue when I first tweeted at them.
Thanks I sent them a tweet.
All of our forms are also missing PAYPAL Wizard...rebuilding these will take hours and hours!!!
Thank you all for commenting and alerting us about this. Unfortunately, as you have seen we do not always know about some issues since not all forms show it, or all of our users experience the same issues (most of the time at least), so opening a forum thread and posting on twitter is a great way to let us know - thank you for that :)
I have already notified our developers and they are working on the fix for the issue, and as soon as it is done, we will update you all about it on this thread and your own threads.
I do believe that it will not be long now, but I would suggest not to add new payment options to your forms for now, just so that there are no further issues.
Thank you for your understanding and I apologize for any inconvenience that this might have caused .
Hi everyone.
I wanted to update you that the issue has been resolved to a certain degree, so you will be able to add payment processing tools to new forms or to those that did not have it before, but the forms are not yet reverted - to include the payment tool.
You can however do that easily with the use of the Revision Tool: How to View Form Revision History
Basically find the latest version of your form that has the payment integration on it and you will be able to revert back to it and have it working and showing the old payment integration data on them.
If you simply add a new payment integration, the old data might not be shown to you - which is why I am suggesting the revision tool from above.
Do let us know how it goes and I am still leaving this raised and opened to our developers so if they make the 'restoration' for you that you can be updated about it.


text:
The Agricultural Revolution of the 20th Century
Not available
(If any tax is payable it will be calculated and shown at checkout.)
Preview (read now) Add to my own site Add to my wishlist Author's page Publisher's page
About the authorDon Paarlberg, Ph.D., professor emeritus in the Department of Agricultural Economics at Purdue University, is now self-employed as writer, speaker, and consultant. He has a distinguished record of government service that includes appointments from Presidents Eisenhower, Nixon, and Ford, as well as serving as: economic advisor for Secretaries of Agriculture Benson, Hardin, Butz, and Knebel; director of agricultural economics of the U.S. Department of Agriculture (1969-76); special assistant (economics) to the president and coordinator of Food for Peace(1958-61); and assistant secretary of agriculture (1957-58). Dr. Paarlberg received the D. Howard Doane Award for Distinguished Service to American Agriculture from the American Society of Farm Managers and Rural Appraisers.
Philip Paarlberg, Ph.D., is an associate professor in the Department of Agriculture Economics at Purdue University. His research interests include international trade, agriculture policy, and Eastern Europe. He analyzed international trade policy issues in the Economic Research Service (1977-85) and was a visiting professor at the University of Göttingen, Germany (1991-92). He has received awards for superior service and research from the USDA and from the ERS, respectively.
A book for a varied audience: college students of agriculture and sociology; high school students of vocation agriculture; members of the American Agricultural Economics Association; people with a long-standing background in agriculture; and other readers interested in 20th century agriculture.
The book reads like a story and is supplemented with excellent photographs, contrasting past practices with modern technology.
Wiley; Read online
Title: The Agricultural Revolution of the 20th Century
Author: Don Paarlberg; Philip Paarlberg
Title: The Agricultural Revolution of the 20th Century
Author: Don Paarlberg; Philip Paarlberg
More Technology
Be Your Own House Contractor 2012 US$ 15.95 177 pages
Welding 2013 US$ 22.99 160 pages
Norman Hall's Firefighter Exam Preparation Book 2004 US$ 13.99 320 pages
Numerical Methods in Engineering with Python 3 2013 US$ 78.99 531 pages
Subject categories


text:
Somerled House - Superbly Renovated
House, Port Fairy
Confirmation within 24hr
From $398 per night {{quote.pricing.message}} Total {{quote.pricing.price | format:'currency':'short'}} for
Min 2 - 7 nights stay
This is a lovingly restored home in the heart of historic Port Fairy voted the most liveable town in the world. Only minutes walk from the town centre and beaches. For those who love to entertain the butlers pantry is an added bonus. Perfect
This stunning renovation will leave you in awe Somerled is a four bedroom home with an open plan kitchen, living & dinning area with an outdoor entertaining area. The large enclosed yard makes this property perfect for families. Close to Port Fairy's fantastic restaurants and boutique shopping this large home is a perfect choice for your getaway.
There is a $100 cleaning fee for every booking.
Rating snapshot
Average customer ratings
No reviews have been submitted for this property.
{{review.SubmissionTime | format:'date':'full'}}
{{comment.UserNickname}} responded to this review
{{comment.SubmissionTime | format:'date':'full'}}
Have a question?
Feel free to send a message to the owner/manager if you have any specific needs, or if you require additional information before you can commit to a booking request.
Select request booking to access the quote calculator and to check availability.
Enter your check in and check out dates to see availability and a total price.
Special offer
|Sun to Thurs ($ p/n avg.)
|Fri & Sat night
|7 night stay
|Min night stay
|Extra adult ($ p/n)
|Extra child ($ p/n)
|{{tariff.weekdayMinimumRate | format:'currency':'short'}} -
|{{tariff.weekendRate | format:'currency':'short'}} -
|{{tariff.weeklyRate | format:'currency':'short'}} -
|{{tariff.extraAdultCost | format:'currency':'short'}} -
|{{tariff.extraChildCost | format:'currency':'short'}} -
The following dates have a special rate or exception applied. Please note any discounts applicable to these dates will still apply.
|{{exception.priceInCents / 100 | format:'currency':'short'}} p/n
|Security Deposit
|{{rates.bond | format:'currency':'short'}} p/s
|{{extra.valueInCents /100 | format:'currency':'short'}} p/n p/p p/np p/s
|Yes No
p/n = per night, p/s = per stay, p/p = per person, p/np = per night and person. Ask the owner to arrange optional extras
Note: Pricing is subject to change, and a minimum stay period and other conditions may apply. You should confirm pricing with the property owner. Bookings paid through the Stayz online booking system incur a 2% Service Fee.
Prices listed based on 8 adults. Property has 7 beds and can sleep a maximum 8 people.
- Available
- Unavailable


text:
AMIABLE just pred XviD, also Bluray 720p & 1080p Christopher McQuarrie's action thriller Jack Reacher (2012), starring Tom Cruise, Rosamund Pike, and Richard Jenkins.
Date: 17th April 2013
Video: 1280x544 (X264 @ 23.976fps) / 1920x816 (X264 @ 23.976fps)
Audio: DTS 1509k
Source: Retail Blu-Ray
Runtime: 02:10:24 English
Subs: English / French / Spanish / Italian / German / Dutch / Swedish / Norwegian / Danish / Finnish
Rating: 7.1/10 40,115 votes
Genre: Action | Crime | Thriller
A homicide investigator digs deeper into a case involving a trained military sniper who shot five random victims. Based on a book in Lee Child's crime series.
Starring: Tom Cruise, Rosamund Pike, Robert Duvall, Werner Herzog, Richard Jenkins, David Oyelowo
Director: Christopher McQuarrie
Download FileJack.Reacher.2012.BDRip.XviD-AMIABLE - Extabit - Datafile - Netload
Extabit - Subs
Datafile - Subs
Extabit Part1 Part2 Part3 Part4 Part5 Part6
Datafile - Subs


text:
Company will launch two plug-in hybrid later this year.
Mercedes has announced plans to invest more than $7.8 billion into green technologies within the next two years.
The sizable investment will pave the way for an assortment of new plug-in hybrid vehicles and a dedicated architecture for battery-electric vehicles. The first model to be based on the platform will be launched before the end of the decade.
In the short term, Mercedes will introduce the new E 350 e and GLC Coupe 350 e 4MATIC plug-in hybrids later this year. The company was coy on specifics but both models are slated to feature a hybridized powertrain that consists of a 211 horsepower petrol engine and a 116 horsepower electric motor. This setup will enable the models to have a combined maximum output of 320 hp. In terms of performance, the GLC Coupe 350 e 4MATIC will be able to accelerate from 0-62 miles per hour in 5.9 seconds and travel up to 18.6 miles on electricity alone.
Mercedes also reconfirmed plans to launch a significantly improved S 500 e in 2017. Based on the facelifted S-Class, the model will feature an upgraded lithium-ion battery and a "further optimized intelligent operating strategy" which will enable the sedan to travel over 31 miles on electricity alone. The model will also become on the first plug-in hybrids to be offered with an inductive / wireless recharging system.
Source: Mercedes-Benz


text:
Ultralite Ghillie Suit
Camo Systems
The Jackal Ghillie Ultralite Suit from Camo Systems is a high quality, lightweight, packable over suit offering excellent 3-D camouflage concealment. Suitable for a wide range of activities including hunting, paintball, airsoft, fancy dress or general stealth activities. Approximately 2 kilograms lighter than our regular ghillie suits, this ultralite model will increase your comfort and endurance for those long days.
- Created by military personnel and experienced hunters.
- Built on a comfortable Bug Proof Netting
- Lightweight 3-piece Suit
- Heavy-Duty Button Front Jacket with Velcro Cuffs
- Trousers with Drawstring Waist
- Detachable Hood
- Waterproof, 3-D Leaf-Like Fabric
- Rot & Mould Resistant
- Compacts Easily
- UV Treated
- Quiet and Rustle-free
- Specially coated to reduce shine and glare
- Hand Washable
- M to L chest size is 97cm to 112cm and waist size is 82cm to 97cm
- XL to 2XL chest size is117cm to 130cm and waist size is102cm to 117cm