RAIDed memory system management

Information

  • Patent Grant
  • 10176861
  • Patent Number
    10,176,861
  • Date Filed
    Tuesday, October 13, 2015
    10 years ago
  • Date Issued
    Tuesday, January 8, 2019
    7 years ago
  • Inventors
  • Original Assignees
    • VIOLIN SYSTEMS LLC (San Jose, CA, US)
  • Examiners
    • Talukdar; Arvind
    Agents
    • Schwabe Williamson & Wyatt
Abstract
A memory system is described, where a plurality of memory modules is connected to a memory controller. Erase operations of the memory modules are coordinated by the memory controller such that, when data is stored in a group of memory modules configured to be a RAID (Redundant Array of Independent “Disks”) group, erase or refresh operations performed on the memory modules of the RAID group are synchronized, scheduled, or controlled to reduce the latency in reading the data stored on the RAID modules.
Description
TECHNICAL FIELD

This application relates to a memory system, a module of a memory system, and a method for managing the memory system.


BACKGROUND

A typical computer system includes a central processing unit, input/output devices, and memory. The central processing unit (CPU) may include logical and arithmetic processing circuits, and may also include a high speed memory for instructions and data being immediately used by the CPU. Additional memory is used to store additional instructions and data used by the computer system, and the memory may be of a volatile or non-volatile form, and be of various types, depending on cost, access speed, storage capacity, access time and throughput considerations. Overall, the amount of memory in a computer system often substantially exceeds the quantity of instructions or data that are accessed by the CPU on a short term basis.


SUMMARY

A memory system is described, comprising a memory controller, a plurality of memory modules having a module controller, a bus interface and a memory circuit. The memory modules are in communication with the memory controller, and erase operations of the memory modules are coordinated by the memory controller.


The coordinated modules may comprise a RAID (Redundant Array of Inexpensive “Disks”) group where user data and redundant data for the user data are stored in the memory modules of the RAID group.


In an aspect, only one of the memory modules of the RAID group is enabled to perform an erase operation during an interval for an N+1 RAID group, and each memory module of the RAID group is enabled to perform the erase operation prior to any one of the memory modules in the RAID group performing the erase operation again. In another aspect, a memory system is described, including memory modules having a module controller, a bus interface and a memory circuit. The memory modules are connectable to a memory controller through a root module, and erase operations of a group of the memory modules are coordinated by the memory controller.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a simplified block diagram of a memory module having a configurable switching element (CSE);



FIG. 2 is a portion of a memory system having a branching tree architecture;



FIG. 3 is a state transition diagram for the CSE;



FIG. 4 is a block diagram of a memory module having a plurality of memory circuits;



FIG. 5 is a block diagram of a commercial memory circuit;



FIG. 6 is a state transition diagram for a memory circuit;



FIG. 7 is a timing diagram of a memory system, showing memory modules used in a RAID group, and the changing status of each memory module when the memory is operated so as to permit reading of 4 memory modules simultaneously; and



FIG. 8 is a block diagram of a plurality of memory modules of a memory system arranged in a tree structure with multiple roots.





DESCRIPTION

Exemplary embodiments may be better understood with reference to the drawings, but these examples are not intended to be of a limiting nature. Like numbered elements in the same or different drawings perform equivalent functions. Elements may be either numbered or designated by acronyms, or both, and the choice between the representation is made merely for clarity, so that an element designated by a numeral, and the same element designated by an acronym or alphanumeric indicator should not be distinguished on that basis.


When describing a particular example, the example may include a particular feature, structure, or characteristic, but every example may not necessarily include the particular feature, structure or characteristic. This should not be taken as a suggestion or implication that the features, structure or characteristics of two or more examples should not or could not be combined, except when such a combination is explicitly excluded. When a particular feature, structure, or characteristic is described in connection with an example, a person skilled in the art may give effect to such feature, structure or characteristic in connection with other examples, whether or not explicitly described.


Where specific hardware architectures or operating system characteristics are described herein, they should be understood to be examples only, so as to facilitate the description of the subject matter of the application, and not as a limitation on the scope of the application. Memory systems are undergoing continued development, and the specific characteristics of a memory module, such as bus connection, operation speed, capacity, power consumption, electronic technology, and the like, are merely for convenience in description.


Among the types of memory which may be used in a computer system, some of the memory may be described as main memory, and may be of a volatile or non-volatile type. Such memory may often be thought of as random access memory, where any memory location may be read independently of any other memory location, and the memory may indeed be organized so as to permit such access. However, many computer operating systems access main memory in blocks of data, known as cache lines, which are transferred to a higher-speed-access cache memory associated with the central processing unit (CPU). A typical cache line may be 128 bytes, however, the size of the cache line may be greater or smaller than this value. Some memory types can be read from, or written to, individual memory addresses in a random manner. Other memory types may be accessed in a block manner.


Where memory such as flash memory is used, the memory product may have a limitation that the minimum size of a block of data that can be read is, for example, a page of 512 bytes, or some other size, which may be larger or smaller. Not all of the data that is read from the memory may be transmitted to the cache or destination.


Data being stored in a memory may be of sufficient importance that a loss of data due to a memory failure, power failure, or a transient event needs to be avoided. Apart from providing error correcting codes (ECC) associated with the data storage and transmission, the data may be stored in a redundant format, or otherwise backed up. When the redundant data is stored in the same portion of the memory system, such as main memory, a technique called RAID (originally redundant array of inexpensive disks), where the data is partitioned amongst a plurality of memory modules in a manner whereby a data word may be reconstructed from the remaining data in case of a transient or permanent failure of an element of the memory system.


Data may be further backed up or stored on rotating magnetic media (disk drives), magnetic tapes, and other media. These media typically have longer access times and lesser throughput than the memory types used as main memory. Additional memory, similar to main memory may be used, having access times closer to that typical of main memory than the backup media, and such memory modules may be called “memory appliances.” Herein, the general term memory or memory system will be used for convenience. However, the examples herein would be understood by persons of skill in the art to be applicable to main memory, memory modules, memory appliances, or to any memory array, or the like.


A memory system may include a plurality of memory modules connected through a bus system to a CPU. Intermediate between the CPU and the memory system may be a memory controller, bridge, or the like, which may be considered to be either part of the CPU, the memory system, or a separate function. A memory bus may generally be described as an electrical interconnection between the CPU, or a memory controller MC, or the like, and a memory system comprised of memory modules MM. A description of a bus system may be found, for example in U.S. patent application Ser. No. 11/405,083. However, many other bus systems are known and may be used with the apparatus and method described herein.


In an example, the memory system may be considered to have one or more “root” modules, where a root module is the memory module proximate to the memory controller. As there may be more than one computer or memory controller, a memory system may have more than one root module. For simplicity of explanation, the description herein uses a single root module as an example.


A bus may carry for example, commands (such as READ, WRITE) from the MC to a MM, data read from the MM to the MC, and data written to the MM from the MC. Other commands, responses and status information are often carried over the bus. In some situations some of the information is carried over other transport mechanisms, which may be another bus, or a point-to-point connection; this may be called “out of band” signaling. It may also possible for data to be transferred between memory modules MM without passing through the MC.


The speed with which data can be transferred between the memory modules of a memory system and the CPU, through a single root and MC, may be termed the bus capacity. The bus capacity may be expressed in GB/s (gigabytes/second). Measurement of the bus capacity is often done by computer programs known as benchmark programs, so as to take into account any inefficiencies (so-called “overhead”) in the operation. Different benchmark programs, having different objectives may yield differing results. Herein, the raw bus capacity is used for convenience of description, and a person of skill in the art will understand how to adapt this description to a particular memory system or optimization. The raw bus capacity may be estimated as the width of the data portion of the data bus in bits, multiplied by the clock rate. As an example, a 16 bit wide bus with a bit rate of 1 Gb/s would be said to have a raw bus capacity of ((16/8)×1×109)=2 GB/s. Providing that the memory modules can read out data at at least this composite rate, the raw bus capacity at the root may be fully used in transferring data from the memory system to the CPU.


A memory module in a memory system may include a bus interface and individual memory circuits. Various bus systems and memory circuits are known, or are being developed. While a detailed example is provided below, the form of bus interface or the specific type or architecture of the memory components on the memory module shoud not be considered as a limitation.


In an example, the memory module MM may be as shown in FIG. 1. The memory module may include memory circuits M and a bus interface, which may be, for example, the CSE (configurable switching element) of U.S. application Ser. No. 11/405,083. This bus interface may include the electrical and protocol interface to the bus, as well as a controller and local memory. Groups of lines of a bus may be organized as a port. The memory module may have a single input port, and a single output port, in the upstream and the downstream directions, as may be typical for memory modules that are intended for a linear bus architecture, or may have an upstream port (port 1), and two or more downstream ports (ports 2 and 3), for use in a branching or tree-type memory system. In an aspect, a port may have bi-directional properties so as to be capable of moving data towards and away from the root module.


Each memory module may have a plurality of memory circuits, and the memory circuits may have differing internal organizations, electrical technologies, and grouping organizations depending on the specific technology used or, for example, changing industry standards and protocols. A memory circuit may be organized at a high level so as to be capable of reading or writing data (which may include executable code instructions) in a form usable by the computer system. Often the data size is a byte, which is 8 binary bits. As such, the capacity of a memory circuit, which may be one or more integrated circuit or similar devices, may be described in bytes: for example 1 GB (gigabyte)=109 bytes. (Without loss of generality, a distinction is not intended where a decimal approximation to an actual binary quantity is meant; for example 1 KB=1024 bytes.)


A memory circuit may be said to have a memory bandwidth. Again, there are various standards by which the bandwidth is measured, and for simplicity a raw bandwidth is used in this description. The raw bandwidth may be the width of the output data bus time the memory output clock speed. A contemporary memory circuit, such as a personal computer (PC) DIMM with a 64 bit bus interface (comprised, for example, of 8 8-bit wide DDR400 memory modules), may have a maximum raw memory bandwidth of about 3200 MB/s.



FIG. 2 shows the use of a plurality of memory modules in a binary tree of order n, where only one of the branches of the tree is shown. The size of such a tree, when fully populated with memory modules is (2n−1). In a situation where each of the memory modules MM (0, 1, 4, 8, 16) in a branch is transmitting data to the memory controller MC, and passing through MK, the total raw memory bandwidth supplying the data to the MC is 5×3200 MB/s, where each of the memory modules is considered to have one memory circuit with a bandwidth of 3200 MB/s. In this example, the capacity of any data bus linking electrically adjacent memory modules is considered to be the same and may be, for example, 16 GB/s. As such, when the data being read from each of the memory modules is merged at the MK upstream port interfacing with the MC, the data bandwidth of the data being read from each of the memory modules is cumulative, and the cumulative data rate is 16 GB/s. That is, the memory bandwidth may fully occupy the bus bandwidth, in this example.


Further, each of the memory modules may have a plurality of memory circuits, and the actual data bandwidth of the memory circuits on an individual memory module MM may therefore exceed the memory bandwidth of an individual memory circuit.


In the example of FIG. 2, where only one of the branches of the binary tree is shown, having 5 memory modules, there are another 26 memory modules that may have the capability of providing data to the memory controller MC. However, in this example, the bus interface to the memory controller, with a bus capacity, cannot pass additional data from other modules, as the bus capacity at the has been reached.


In an aspect, data may be transferred between other memory modules in the memory system even if the bus capacity of the bus link between MM0 and the MC has been reached, providing that the transfer of data is performed over other links, such as between MM4 and MM9 which may not presently be fully utilized. Such transfers may be useful in memory maintenance, such as relating to reconstruction of RAID groups, or in transferring data from a slower memory module to a faster memory module, as where both DRAM and flash, for example, are used in a memory system.


Where a memory module is not being used for the purposes of passing data from one module to another or to the root, or is not being accessed, for example, for the purposes of reading or writing data to a memory circuit on the memory module, some of the circuitry of the memory module may be placed in a low-power state, so as to reduce power consumption and heat generation. Such a state may be termed a memory module idle state (MMI). The MMI state may include interrupting the operation of various clocks, disabling some or all of the links or interfaces connecting to other memory modules, or by placing some or all of the memory circuits in a lower-power-consumption state. Thus, the MMI state may be considered to be capable of having sub-states, depending on which specific aspects of the circuitry are placed in a lower-power-consumption state. Functions that may be performed in the MMI state may include, for example maintaining clock synchronization between memory modules, determining whether the memory module is being accessed, responding to in-band or out-of-band commands, refreshing the memory and the like


When a memory module is being used for the purposes of passing data from one module to another or to the root, and is not currently being accessed for the purposes of reading or writing data to one or more memory circuits on the memory module, the circuitry of a memory circuit may be placed in a low-power state, so as to reduce power consumption and heat generation. Such a state may be termed a memory circuit idle state (MI). In this state, the circuitry of the CSE, or memory interface, may be in an active (MMA) state, at least in part, receiving and transmitting data between memory modules, and performing whatever other maintenance functions are needed. However the memory circuit remains in a low-power state. The MI state is one in which the data stored in the memory is preserved so that when the memory circuit is placed in a memory circuit active (MA) state, the previously stored data may be read from the memory circuit. Alternatively, data may be written to the memory circuit. Thus, the MI state may exist when the overall memory module MM is in the MA or MMI states. Table I summarizes the some of the state conditions for this example.












TABLE 1





State
CSE
Memory Circuit
Power consumption







Memory Module
Active
Idle (MI)
medium


Active (MMA) and


data in transit only


Memory Module
Idle
Idle (MI)
low


Idle (MMI)


Memory Module
Active
Active (MA)
high


Active (MMA) and


either reading or


writing data to local


memory









In this description, only one memory circuit per memory module has been considered. However, where more than one memory circuit is present on a memory module, each of the memory circuits may be active, or idle, depending on whether data is being written or read from the specific memory circuit.



FIG. 3 shows a state diagram for the CSE of a MM. The diagram does not show aspects of the operation of a CSE that relate to initialization, maintenance of clock synchronization, configuration of the CSE, and the like, which are generally considered to be overhead operations, and are incidental to the functions of the memory system of reading, writing and transmitting data. Such overhead functions may be performed while the CSE is in an idle, or low power, state. The idle state may be entered when there is no data to be read, written or transmitted by or through the memory module. The idle state is a lower power state than the active states, however, such functions as clock synchronization, and the like, may be periodically performed.


The CSE is used in this example as a local controller, and may include, for example, a microprocessor or similar computing device, scratch and program memory, various clocks, including a memory refresh clock, and interfaces to the bus and to the memory. Some of the functions may be performed by discrete circuits, by more than one processor, clock, or the like, and all of the components may not be in a single electronic package.


The term “low power state” or “idle state” may refer to any one of a plurality of operating conditions where the power consumption of a circuit or portion thereof is reduced by temporarily disabling or limiting a function, slowing a clock rate, or the like, in response to a schedule, to received commands, to sensing the state of another circuit, or the like. The examples herein are not intended to limit the number or characteristics of low-power states that may be configured or used, not the combinations of low-power states that are possible.


In an aspect, the presence of a routing or command signal may be detected by a signal presence indicator or, for example, by maintaining, for example, one lane of the bus interface, or a signal presence indicator, active so that routing signals may be received, interpreted, or forwarded. Where a signal presence indicator, or the routing signal, contains information relating to a function of the local memory module, the routing or command is interpreted and an appropriate action performed. Where the routing is such that the data or command is not intended for the local module, a portion of the CSE may be activated so as to pass the command or data to an appropriate output port, and then the CSE may return to the idle state. Although not shown, other states may exist, so that, for example, the reverse bus path may be pre-activated for a response from a downstream module after a predetermined period of time.


Where the routing information or command is intended for the local module, the command may, for example, be for a read or a write operation. The memory may be in a low-power or memory-circuit-idle (MI) state, and may need to be activated in order to perform the function of the command. Typically such a function would be a read or a write operation, but other memory operations may also be performed. After performing the read or write operation, which may be for a data element of a specified size, such as a byte, sector, page, or block, the memory may be returned to a low-power state by an operation which may be termed closing the memory, after which the CSE and/or the MM may return to an idle state.



FIG. 4 illustrates a memory module MM having a CSE or controller 50 and a plurality of memory circuits M. Each of the memory circuits M may have the capability of storing data in a form where a byte, word, group of words, page, or the like, may be accessed for reading or writing data on the basis of routing information or commands received by the memory module and interpreted by the CSE. For example, where data is being written or read from memory circuit M1, memory circuits M2-M5 may remain in an idle state.


In an aspect, the memory circuit may utilize flash memory or dynamic random access memory (DRAM), as examples of non-volatile and volatile memory types. Flash memory is known to retain data stored therein even when the power supply is interrupted. However, DRAM memory circuits store the information as electrical charge in capacitive circuit, and the electrical charge slowly leaks from the capacitor due to resistive paths. Hence, in order to avoid loss of the data in memory, the power supply needs to be present, and the charge on each capacitive element needs to be renewed (refreshed) within a specific time intervals. The process may be termed “refreshing the memory”. Maintaining the power supply may be performed at a module or system level by a battery, an uninterruptible power supply, or the like. However, a power supply that is dependent on the prime power, and does not have a power supply maintenance capability, such as a back-up battery or other uninterruptible power supply, may also be used. In such an instance, a power supply prime power failure may result in loss of data stored in the DRAM memory, or data held in intermediate memories, and such data may be recoverable if a back-up memory is used.


Refreshing the memory is usually performed at the memory circuit, although the process may be controlled or initiated elsewhere, for example, by the local controller such as the CSE, or by the memory controller MC.


For purposes of illustration, and not by way of limitation, a DRAM memory circuit may be one which meets the requirements of double-data-rate DRAM, as published by JEDEC, and which may be currently in use in industry standardized DIMM (dual in-line memory module) products. An example of a memory circuit which may be used in such a product is a MT48LC 128M4A2 synchronous DRAM (SDRAM) device, available from Micron Technology, Inc. (Boise, Id.). A block diagram of the memory circuit, as published by Micron, is shown in FIG. 5. Each of the memory banks in the memory circuit is organized as 8182 rows by 4096 columns by four bits. Read and write accesses to a DRAM circuit are burst oriented. That is, accesses start at a selected location and continue for a programmed number of locations in a programmed sequence. For purposes of this specification, the general operation of the DRAM circuit shown in FIG. 5 would be understood by persons of ordinary skill in the art, and only specific aspects of the operation are discussed in detail.


Operation of a DRAM is characterized by “opening” and “closing” a bank of the memory. The process is similar for both reading and writing, and for simplicity, the process will be described as reading, without intending to limit the generality of the description. Prior to executing a read command, the memory bank must be “opened.” A row of the memory bank remains open for accesses to data stored in the row of the memory bank until the bank is closed, or deactivated by a PRECHARGE command. The PRECHARGE command must be issued before opening a different row in the same bank, or another bank. Depending on the design of the computer operating system, and other factors, a bank may be left in the active state after a read operation, closed after a read operation, or a combination of either operation, depending on other system parameters.


The PRECHARGE command may be used to deactivate the open row in a particular bank, or the open row in all banks. After a time interval tRP (typically 20 ns), the banks will be available for a subsequent row access.


In order to maintain the integrity of the data, each of the rows of a DRAM memory circuit needs be refreshed periodically, or at least once during a specified time interval in order to avoid data loss or corruption. As specified for the Micron memory circuit, and for a case temperature less than 85° C., each of the rows is refreshed at least once about every 64 ms (tREF). Two different forms of refresh command may be used: AUTO REFRESH and SELF REFRESH. The AUTO REFRESH command is non persistent, and for a 512 MB DRAM, 8, 192 AUTO REFRESH commands, which may be issued as individual commands every 7.81 μs, will meet the specified refresh requirement and ensure that each row is refreshed. In an alternative, bursts of AUTO REFRESH commands may be issued at a minimum cycle rate interval (tRF).


The address of the row to be refreshed may be generated internally to the memory circuit and may not need to be provided by the local controller, memory controller or other external device. On the other hand, a PRECHARGE command and an address provided externally will accomplish a similar objective, but may have greater overhead.


The SELF REFRESH command can be used to retain the data integrity in the DRAM, even if the rest of the memory system is in a lower power state. That is, when in a self-refresh mode, the DRAM retains data without an external stimulus. Once the self-refresh mode is engaged, the DRAM provides its own internal clocking so as to perform refresh cycles. However, the DRAM may need to remain in the self-refresh mode for a minimum period, which may be up to about 2 μs.


During self-refresh mode, the memory circuit cycles through the DRAM array, performing the minimum refresh activity necessary to maintain the data. To accomplish this, the memory circuit maintains an internal row/bank address counter that is not accessible to the memory controller. Upon exiting the self-refresh mode, the memory controller is not aware of which row was last refreshed in self-refresh mode, and consequently cannot continue explicit refresh operations unless it first performs a burst refresh to every row in sequence. While this situation may be accommodated in applications where the objective of the self-refresh mode is to place the memory circuit in a low-power-consumption mode for an extended period of time, such as for a portable apparatus, the need for a burst refresh every time a self-refresh mode is interrupted for a read or a write operation introduces substantial overhead.


The electrical current requirements of a memory circuit vary considerably between the various modes of operation. For example, the average current in the SELF REFRESH or in STANDBY modes may be about 6 mA, while the operating current during a read or write operation may be about 115 mA or more. When the memory is in an active standby mode the operating current may be about 45 mA. The power consumption of a memory circuit may thus be reduced, when not reading or writing data, by operating the memory circuit either in SELF REFRESH mode, or in STANDBY or ACTIVE STANDBY mode with a wake-up to perform AUTOREFRESH. .


When describing higher power states and lower power states, the term is intended to be understood as a relative term, with respect to the particular electronic component being discussed. A lower power state of one type of component may be higher in quantitative power consumption than a high power state of another type of electronic component. Also, some low power states may have a low average power consumption, with occasional high power consumption intervals. One such example may be the state where a memory circuit has the clock disabled (CKE low) and the clock is periodically enabled (CKE high) so that an AUTORFRESH command may be executed, and the clock then disabled again.



FIG. 6 shows an example of the states of a memory circuit some of which may result in a lower overall power consumption. When a read or a write operation is not in progress, the memory circuit may be in an idle state (MI). During a MI state the command line CKE may be low, which would disable internal circuitry so as to save reduce power consumption. On a periodic basis, such as approximately every 7.81 μs, the CKE may be high so as to enable the internal circuitry, and a AUTO REFRESH command issued so as to refresh a row of one or more banks of the memory circuit. The memory circuit is then returned to the MI state by returning the CKE to a low state. This sequence of operations results in the periodic refresh of each of the rows of the memory circuit within the specified time for maintaining the integrity of the stored data. Other sequences of issuing an AUTO REFRESH command may be used, including bursts of AUTO REFRESH commands, so long as the overall effect is to refresh each of the rows within the specified time period.


When the CSE on the memory module has received an instruction that a read or write operation is to be performed on a memory circuit of the memory module, the CSE issues commands so as to make an appropriate addressed row of the memory circuit active. To use the terminology of the JEDEC standard, a /RAS command is asserted. The “/” is intended to be read as an overscore, and interpreted to mean that the command is asserted by a low data state on the command line. In the active state, the selected row is available for reading or writing and the function is selected by asserting /CAS+/WE for a write operation, or /CAS for a read operation. Upon completion of the operation, or a sequence of operations on a row of the memory circuit, the row is closed by a PRECHARGE command, which returns the memory circuit to an idle state.


The PRECHARGE command may issue as a result of the CSE issuing a /RAS+/WE command or where the read or write command included an AUTO PRECHARGE command.


AUTO REFRESH commands may be issued by the CSE, based on the state of the CSE, and active connectivity between the individual memory modules MM and the memory controller MC need not be maintained in order to manage the refreshing of the memory circuits. The individual memory modules MM may manage the refreshing of the associated memory circuits M depending on the usage of the memory circuits. The usage of the memory circuits is dependent on the data required to be read or written, for example, by the CPU, or by an external device.


In an example, the memory module of FIG. 4 may have 6 groups of memory circuits each having the ability to store 1 GB of data, so that the total memory capacity of the MM is 6 GB. Each of the memory circuit groups may have a memory bandwidth of 3200 MB/s. If the bus between the memory modules has a capacity of 16 GB/s, then a single group of memory circuits does not produce a sufficient data rate to occupy the entire bus capacity. However, where 5 of the 6 memory circuit groups were being read simultaneously, then the bus capacity would be reached. In this example, only one of the memory modules of the tree of memory modules is sufficient to satisfy the bus capacity at the root. Thus, the other memory modules MM in the memory system may be in states where at least one of the CSE (which includes the bus interface) or the memory circuits M are in an idle state.


The example has been simplified by describing the memory circuits being read as being on a single memory module, however, a person of skill in the art would recognize that the memory circuits being read may be distributed so as to be located on a plurality of memory modules MM.


In another example, the data for a cache line or other data size may be stored in a RAIDed fashion; for example, in a RAID 4+1 architecture, as shown in FIG. 7. The data is distributed over 4 separate memory modules, and a parity calculation may be performed as an exclusive-OR operation over the data so as to store the parity data in a fifth module. This method of storing data permits the recovery of the data if any one of the five modules fails, or the data is lost for another reason. In such a system, each read request for a cache line would result in activating five memory modules, rather than the one module in the previous examples. However, except for the increase in the amount of data resulting from the storage of the parity information, the overall data rate is unchanged, and therefore the individual memory circuits may be active for a shorter period of time.


This discussion does not take into account changes in the overhead associated with an increased number of commands, error checking and the like, but suggests that the performance and power consumption of a RAIDed system should be similar to that previously described. The actual performance obtained would depend on the loading models, block sizes accessed, and the like.


In an aspect, a memory module MM of a memory system may schedule and perform refresh operations on the memory circuits M independently of the memory controller MC. The local controller, such as the CSE may initiate or control the refresh operations for memory circuits associated therewith based on, for example, the lack of pending or forecast read or write operations. The refresh operations may be performed in a periodic sequence, or as a burst mode where a plurality of memory refresh operations are performed in rapid sequence. Such a burst sequence may be used to minimize the interaction between the refresh operations and the read or write requests. As such, each of the memory modules may schedule the refresh operations for the memory circuits associated with the module without synchronization with the memory controller.


As shown in FIG. 7, in an aspect such as where the memory is operated as a RAIDed memory, a memory module may be associated with a position in a RAID group where the operation of the individual memory modules MM or memory circuits M is synchronized such that, for example, in a 4+1 RAID configuration such as described in U.S. Pat. No. 12/079,364, four of the five memory modules may be immediately accessed for a read operation. In such a configuration, a group of memory modules may be synchronized by a memory controller MC so that only one of the memory modules associated with the RAID group is performing refresh operations at any time (or in the case of flash memory, erase or programming operations). Such refresh operations may be performed in a bust mode, rather than at a uniform periodic interval over the refresh interval (tREF). The memory module performing the refresh operations may not return data in response to a read request if the refresh operations are in progress at the time of the request. However, by using the data recovery properties of RAID configuration, the requested data may be available without an increase in latency. As described in U.S. application Ser. No. 12/079,364 where a 4+1 RAID configuration is employed, 4 of the 5 memory modules MM would be available for any read operation. Should the fifth memory module that is not available have information designated as data rather than parity information, the parity information, which would be available from one of the 4 modules being read maybe used to reconstruct the data using an XOR computation. When the memory modules have DRAM memory circuits as the memory circuits, the interval during which the refresh operations are performed may be shorter than tREF.


The refresh operations of a group of the memory modules MM may be scheduled by the memory controller MC so as to associate the memory modules with RAID groups. Alternatively, individual memory circuits M may be associated with RAID groups and the refresh timing of each of the memory circuits in the group may be controlled so as to provide immediate access to at least the minimum number of memory circuits so as to reconstruct the RAIDed data.


In a typical DRAM circuit, the memory needs to be entirely refreshed about every 64 msec by specification, in order to avoid loss of data. This is termed the static refresh time or refresh interval, and may be performed by distributing the refresh operations so that a refresh operation is performed every 7.81 usec. However the time to perform the refresh operation is approximately 75 nsec. As such, up to about 104 refresh operations could be performed during the inter-refresh interval of 7.81 usec associated with one distributed refresh interval. Only about 80 such burst intervals may be needed during a 64 msec period.


As four of the five memory modules in a RAID group are always available for reading, the effect of refreshing the DRAM memory is not apparent with respect to any read operation. The maximum latency for a write operation may be a single distributed refresh interval for one of the modules. Alternatively, the burst refresh operation may be suspended whenever there is a pending write request. In another aspect, a plurality of smaller bust refresh operations may be scheduled so that they may be completed without significant effect on the write latency. In this manner, the effect of the refresh operations for volatile memory on the read or write latency may be minimized or avoided.


In an analogous manner, when flash memory is used, lower power states of the memory module MM may be used for housekeeping operations such as memory scavenging, testing, or the like, when read or write operations on the local memory are not being performed in response to requests by the memory controller MC.



FIG. 8 is an example of a memory system having a plurality of modules and connected in a tree-like architecture. Each of the memory modules MM is numbered, with numbers from 0 to 83, and the interconnections between memory modules MM shown as lines connecting each of three ports, which may be bidirectional ports, on each module, to other modules. The details of this arrangement may be found in U.S. application Ser. No. 11/405,083. As configured, the memory system has six root memory modules, which are those numbered 14, 15, 16, 41, 43 and 68, connecting to a memory controller having ports A-E, so as to maintain connectivity in the event of a module failure and to permit hot-swapping of failed memory modules. In an aspect, a high speed bus may be used such that a mixture of memory types may be employed in the memory modules, and the interface characteristics harmonized by a controller on the module. The controller may be a CSE.


Each of the memory modules MM 0-83 may be operated such that the refreshing of the memory on modules is performed independently of each of the other modules, and without continual transmission of commands from the memory controller. Alternatively, groups of memory modules may have refresh or erase operations, for example, synchronized or scheduled, as has been described, so as to reduce the latency for read or write operations on the memory when the memory is operated, in whole or in part, as a RAIDed storage device.


A plurality of connections, which may be a PCI Express or other interface may be provided between the memory controller MC and one or more computers. The memory controller may be a plurality of memory controllers so as to provide for redundancy in case of a hardware failure. The connectivity of the modules, memory controllers, and computer interfaces may be arranged so as to permit reconfiguration of the data paths in the event of a hardware failure, and may permit the replacement of a failed module without taking the memory system out of service.


In a memory system, such as in the example of FIG. 8, not all of the memory modules MM may be active. This may arise if the computer systems using data from the memory system do not have a high demand for the data being stored in the memory system, or, if the bandwidth of the data bus at various places in the memory system is filled by the data rate of memory modules responding to read or write commands. Where one or more of the modules is not in a state where the module is being read from or written to, the module may be in a state of lower power consumption, as described previously. In an aspect, each memory module may be considered to be in a lower power state when the associated memory circuit on the memory module is idle, or being refreshed by a AUTOREFRESH or similar function. The memory module may be in another form of lower power consumption state where the memory module interface is not engaged in processing or forwarding commands or data to other modules, either upstream or downstream from the subject memory module.


A memory module may thus be configured to be in a lower power consumption state, and transition into an appropriate higher power state for the purposes of, for example, a read or write operation on the memory of the memory module, or the pass data or commands from one memory module to another, or to the memory controller. A memory module entering the higher power state may remain in that state until completion of the commanded operation, such as reading data, and then assess the operational requirements of the memory module. Providing that no further read or write operations are pending, and that the refresh status of the memory modules is satisfactory, the memory module may enter a lower power state. During the lower power state, the refresh operations for the memory circuit may be performed as required by, as previously described, in an example, by enabling the memory clock and issuing an AUTOREFRESH command or similar function.


Thus, whether the memory module is in a high power state or a lower power state is may be data dependent result, and the status of memory modules may change dynamically. However, as the memory module may transition to a lower power state when not responding to demands for service, the overall power consumption is reduced. This is accomplished while maintaining an appropriate refresh rate so as to avoid data loss. Where a plurality of memory modules are incorporated in a memory system, the modules may be arranged so that the determination of the power status, or the timing of refresh operations are autonomous of each other.


The required refresh interval for a DRAM memory circuit specified by the manufacturer may be at a maximum operating temperature, with larger refresh intervals being possible at lower operating temperatures. An appropriate refresh rate may be determined based on the temperature of a module of a group of modules, a maximum temperature of any module of a group of modules, or the like, depending on whether the refresh rate determination is made locally to a module or based on a more global temperature measurement. Where a more global determination of temperature is made, the temperature or other parameter controlling the refresh rate may be signaled to a module.


Commands initiated by the memory controller may be used to activate memory modules, either partially or fully by sending a precursor command to the memory module so as to minimize latency in responding to the command once it is received. However, the transition to a lower power state may be accomplished independently by each memory module as the considerations involved are local to the memory module.


In an aspect, a method of operating a memory system may include providing a plurality of memory modules, the memory modules connectable to a memory controller though a data bus. Each of the memory modules may have a bus interface, a local controller and local memory. The memory may be used to store, data and instructions for access by a processor through the memory controller, or may be used locally by the memory module. Each memory module may determine the nature of the data or commands received from the memory controller, directly or indirectly, or from other memory modules. The commands may be for a read or write operation to be performed on the memory of the memory module, and the associated data, or may be data or commands for use by other memory modules, and where the present memory module is used to relay the information to another module.


Where there is no data to be written or read from the present memory module, at least some of the electronic circuits of the memory module may be placed in a lower power state. Such a state may include an “off” state or a state where the circuit is in an idle more, either in whole or in part. After performing a read or a write operation, the memory module may enter a lower power state. One such state places the memory circuit in an “idle mode”. Periodically, during the idle mode, the clock circuit of the memory circuit may be enabled and a refresh command issued by the local controller. The number and timing of such commands may be controlled so as to meet a refresh timing requirement for the specific memory circuits being used. Where the commands are issued individually in a periodic manner, the clock circuit of the memory circuit may be again disabled so as to enter the idle state.


Where there is not data to be relayed, or scheduled to be relayed to another module, and there are no pending read or write operations on the present module, other aspects of the module circuits may be placed in a lower power state, which may include suspending or reducing the rate of certain clocks, disabling some or all of the bus interface or the like.


In another aspect, the erase of flash memory may be coordinated by the memory controller, such that a group of memory modules may be associated with a RAID group so that the data and parity may be stored on the modules. The controllers of the memory modules associated with a RAID group may be commanded by the memory controller to operate with respect to a common time base such that one of the memory modules is performing an erase operation, while the remaining memory modules are inhibited from performing an erase operation, so that sufficient data may be immediately read from the remaining modules so as to reconstruct the data stored in the RAID group. The erase operations of the memory modules in the RAID group are scheduled such that only one of the modules in an N+1 raid group performs an erase at any time.


Alternatively, when a first memory module in a RAID group completes performing an erase operation, status information may be sent to another module in the RAID group so that an erase operation may be initiated. This may be thought of as an erase enable token and be passed by members of the RAID group. Thus, when an erase operation on one of the memory modules of the RAID group is not needed at a current time, other memory modules may be enabled to perform erase operations.


Where the terms CPU (central processing unit), processor, controller, computer, or the like are used herein, they may generally be used interchangeably. These terms have come to mean a digital computing device capable of executing program instructions so as to configure the electrical circuits of the devices to perform functions dependent on the instructions, or data, and the size, speed, internal memory capacity (if any) are subject to a wide variety of configurations, depending on the manufacturer of the devices and the specific arrangement chosen by a designer.


Alternatively, some or all the operations might be performed by specific hardware components that contain hardwired logic or firmware instructions for performing the operations described, or by any combination of programmed computer components and custom hardware components, which may include analog circuits.


The methods described herein may be provided, at least in part, as a computer program product that may include a machine-readable medium having stored thereon instructions which may be used to program a computer (or other electronic devices) to perform the methods. For the purposes of this specification, the terms “machine-readable medium” shall be taken to include any medium that is capable of storing or encoding a sequence of instructions or data for execution by a computing machine or special-purpose hardware and that may cause the machine or special purpose hardware to perform any one of the methodologies or functions of the present invention. The term “machine-readable medium” shall accordingly be taken include, but not be limited to, solid-state memories, optical and magnetic disks, magnetic memories, optical memories, and carrier wave signals. The description of a method as being performed by a computer should not preclude the same method being performed by a person.


For example, but not by way of limitation, a machine readable medium may include read-only memory (ROM); random access memory (RAM) of all types (e.g., S-RAM, D-RAM. P-RAM); programmable read only memory (PROM); electronically alterable read only memory (EPROM); magnetic random access memory; magnetic disk storage media; flash memory; or electrical, optical, acoustical data storage medium, or the like.


While the methods disclosed herein are described and shown with reference to particular steps performed in a particular order, it will be understood that these steps may be combined, sub-divided, or reordered to from an equivalent method without departing from the teachings of the present invention. Accordingly, unless specifically indicated herein, the order and grouping of steps is not a limitation of the present invention.


Although only a few exemplary embodiments of this invention have been described in detail above, those skilled in the art will readily appreciate that many modifications are possible in the exemplary embodiments without materially departing from the novel teachings and advantages of the invention. Accordingly, all such modifications are intended to be included within the scope of this invention.

Claims
  • 1. A memory system, comprising: memory modules comprising a RAID group, the memory modules having a module controller, a bus interface and a FLASH memory circuit;wherein the memory modules are connectable to a memory controller, and erase operations of the memory modules are coordinated by the memory controller; andwherein only one of the memory modules of the RAID group is enabled to perform an erase operation during an interval, and each memory module of the RAID group is enabled to perform the erase operation prior to any one of the memory modules in the RAID group performing the erase operation another time.
  • 2. A memory system, comprising: memory modules comprising a RAID group, the memory modules having a module controller, a bus interface and a FLASH memory circuitwherein the memory modules are connectable to a memory controller, and erase operations of the memory modules are coordinated by the memory controller; andwherein the erase operations of the memory modules in the RAID group are scheduled to enable only one of the modules in an N+1 RAID group to perform erase operations during a time interval.
  • 3. The memory system of claim 1, wherein status information is sent to another memory module when a memory module in the RAID group completes performing erase operations, and the status information initiates or enables erase operations on the another module.
  • 4. A method of operating a memory system comprising a plurality of memory modules, each memory module having a module controller, a bus interface and a FLASH memory circuit; the memory modules connected to a memory controller using the bus interface; the method comprising: designating a group of memory modules of the plurality of memory modules as a RAID group; and,coordinating erase operations of memory modules of the RAID group using the memory controller to enable only one of the modules in an N+1 RAID group to perform erase operations during a time interval.
  • 5. The method of claim 4, further comprising: coordinating erase operations such that each memory module of the RAID group is enabled to perform erase operations prior to any one of the memory modules in the RAID group performing erase operations another time.
  • 6. A computer program product for operating a memory system, stored on a non-transient computer readable medium, comprising: a plurality of memory modules, each memory module having a module controller, a bus interface and a FLASH memory circuit; the memory modules connected to a memory controller using the bus interface; to perform steps of a method comprising:designating a group of memory modules of the plurality of memory modules as a RAID group; and,coordinating erase operations of memory modules of the RAID group using the memory controller to enable only one of the modules in an N+1 RAID group to perform erase operations during a time interval.
  • 7. A computer program product for operating a memory system, stored on a non-transient computer readable medium, comprising: a plurality of memory modules, each memory module having a module controller, a bus interface and a FLASH memory circuit the memory modules connected to a memory controller using the bus interface; to perform steps of a method comprising:designating a group of memory modules of the plurality of memory modules as a RAID group; andcoordinating erase operations such that each memory module of the RAID group is enabled to perform erase operations prior to any one of the memory modules in the RAID group performing erase operations another time.
  • 8. A memory system, comprising: a memory controller; anda plurality of memory modules in communication with the memory controller, a group of the memory modules configured as a RAID (Redundant Array of Independent Disks) group;wherein erase operations performed by the memory modules of the RAID group are synchronized or scheduled so an erase operation on one of the memory modules of the RAID group is completed prior to initiating an erase operation on another memory module of the RAID group.
  • 9. The memory system of claim 8, wherein the modules of the RAID group are operated with respect to a common time base.
  • 10. A method of operating a memory system, the memory system comprising a plurality of memory modules in communication with a memory controller and a plurality of memory modules are operated as a RAID group; the method comprising: storing data to the memory modules of the RAID group, wherein the stored data includes parity data for the data; initiating erase operations on a memory module of the memory modules of the RAID group;determining that erase operations on the memory module of the group have completed; initiating erase operations on another memory module of the RAID group when the erase operations of the memory module have completed;receiving a request for data stored on the RAID group; and reading data stored on the RAID group.
  • 11. The method of claim 10, wherein the step of initiating comprises enabling the memory module to perform erase operations.
  • 12. The method of claim 11, wherein a number of memory modules of the RAID group enabled to perform erase operations is limited so that data stored on the modules of the RAID group may be read without increased latency due to erase operations being performed when read operations are performed.
  • 13. The method of claim 10, wherein the step of reading data stored on the RAID group comprises: requesting data from the memory modules of the RAID group; using data received from the memory modules to respond to the read request; or using less than all of the data needed to respond to the read request and the parity data for the data to reconstruct the data needed to respond to the read request; and responding to the read request.
US Referenced Citations (320)
Number Name Date Kind
3728679 Mcintosh Apr 1973 A
3970798 Epenoy et al. Jul 1976 A
4128882 Dennis Dec 1978 A
4240143 Besemer et al. Dec 1980 A
4263651 Donath Apr 1981 A
4322849 Calabrese Mar 1982 A
4323849 Smith Apr 1982 A
4363094 Kaul et al. Dec 1982 A
4383314 Tam May 1983 A
4386323 Jansen May 1983 A
4543630 Neches Sep 1985 A
4558455 Epenoy et al. Dec 1985 A
4701756 Burr Oct 1987 A
4703451 Calabrese Oct 1987 A
4756011 Cordell Jul 1988 A
4805195 Keegan Feb 1989 A
4843288 Volz et al. Jun 1989 A
4845709 Matsumoto et al. Jul 1989 A
4860201 Stolfo et al. Aug 1989 A
4881165 Sager et al. Nov 1989 A
4910669 Gorin et al. Mar 1990 A
4922409 Schoelkopf et al. May 1990 A
5041964 Cole et al. Aug 1991 A
5053942 Srini Oct 1991 A
5128810 Halford Jul 1992 A
5144166 Camarota Sep 1992 A
5200746 Yoshifuji Apr 1993 A
5283877 Gastinel Feb 1994 A
5285441 Bansal Feb 1994 A
5313501 Thacker May 1994 A
5365487 Patel et al. Nov 1994 A
5379262 Okamoto et al. Jan 1995 A
5467040 Nelson et al. Nov 1995 A
5507029 Granato Apr 1996 A
5522031 Ellis et al. May 1996 A
5621774 Ishibashi Apr 1997 A
5623595 Bailey May 1997 A
5652530 Ashuri Jul 1997 A
5680579 Young et al. Oct 1997 A
5687183 Chesley Nov 1997 A
5752045 Chen May 1998 A
5828253 Murayama Oct 1998 A
5832286 Yoshida Nov 1998 A
5872959 Nguyen Feb 1999 A
5889714 Schumann et al. Mar 1999 A
5889795 Niijima et al. Mar 1999 A
5901101 Suzuki et al. May 1999 A
5920704 Oinowich Jul 1999 A
5923830 Fuch et al. Jul 1999 A
5960034 Lo Sep 1999 A
5974487 Hartmann Oct 1999 A
5974503 Venkatesh Oct 1999 A
6009547 Jaquette et al. Dec 1999 A
6015144 Yoshii Jan 2000 A
6031847 Collins Feb 2000 A
6038570 Hitz Mar 2000 A
6105144 Wu Aug 2000 A
6118612 Judd et al. Sep 2000 A
6134167 Atkinson Oct 2000 A
6138185 Nelson et al. Oct 2000 A
6151289 Rope et al. Nov 2000 A
6157229 Yoshikawa Dec 2000 A
6185134 Tanaka Feb 2001 B1
6185654 Van Doren Feb 2001 B1
6205571 Camporese et al. Mar 2001 B1
6208667 Caldara Mar 2001 B1
6226708 McGoldrick et al. May 2001 B1
6233650 Johnson et al. May 2001 B1
6237052 Stolowitz May 2001 B1
6238220 Hsu May 2001 B1
6260151 Omizo Jul 2001 B1
6295568 Kelley Sep 2001 B1
6297684 Uyehara et al. Oct 2001 B1
6301167 Lee Oct 2001 B1
6301244 Huang et al. Oct 2001 B1
6304497 Roohparvar Oct 2001 B1
6310814 Hampel et al. Oct 2001 B1
6317352 Halbert et al. Nov 2001 B1
6321345 Mann et al. Nov 2001 B1
6334167 Gerchman et al. Dec 2001 B1
6335647 Nagano Jan 2002 B1
6335930 Lee Jan 2002 B1
6345321 Litaize et al. Feb 2002 B1
6353895 Stephenson Mar 2002 B1
6356610 Ott Mar 2002 B1
6359815 Sato Mar 2002 B1
6369605 Bonella et al. Apr 2002 B1
6370200 Takahashi Apr 2002 B1
6374337 Estakhri Apr 2002 B1
6378018 Tsern Apr 2002 B1
6417713 DeRyckere Jul 2002 B1
6425052 Hashemi Jul 2002 B1
6425114 Chan Jul 2002 B1
6442644 Gustavson et al. Aug 2002 B1
6445719 Schneider et al. Sep 2002 B1
6446174 Dow Sep 2002 B1
6449667 Ganmukhi et al. Sep 2002 B1
6473439 Zerbe Oct 2002 B1
6473827 McMillen et al. Oct 2002 B2
6493205 Bauer Dec 2002 B2
6493250 Halbert et al. Dec 2002 B2
6502161 Perego et al. Dec 2002 B1
6539463 Kuwata Mar 2003 B1
6553450 Dodd et al. Apr 2003 B1
6557110 Sakamoto Apr 2003 B2
6567311 Ishii et al. May 2003 B2
6571333 Jain et al. May 2003 B1
6581185 Hughes Jun 2003 B1
6591339 Horst et al. Jul 2003 B1
6601178 Gulick Jul 2003 B1
6611518 Ngo et al. Aug 2003 B1
6618791 Dodd et al. Sep 2003 B1
6625687 Halbert et al. Sep 2003 B1
6636932 Regev Oct 2003 B1
6636993 Koyanagi Oct 2003 B1
6647027 Gasparik Nov 2003 B1
6658509 Bonella et al. Dec 2003 B1
6667927 Jones, Jr. Dec 2003 B2
6678783 Ozawa Jan 2004 B2
6681338 Kollipara Jan 2004 B1
6684314 Manter Jan 2004 B1
6697974 Craft Feb 2004 B2
6735397 Herrity May 2004 B2
6751155 Gorobets Jun 2004 B2
6799235 Borman et al. Sep 2004 B2
6803872 DeRyckere Oct 2004 B2
6807377 Watanabe Oct 2004 B1
6833618 Ono et al. Dec 2004 B2
6834326 Wang et al. Dec 2004 B1
6845461 Kim Jan 2005 B1
6871253 Greef et al. Mar 2005 B2
6874097 Aliahmad Mar 2005 B1
6882082 Greef et al. Apr 2005 B2
6904050 Chao Jun 2005 B2
6928512 Ayukawa et al. Aug 2005 B2
6928571 Bonella et al. Aug 2005 B1
6937681 Watanabe Aug 2005 B2
6961347 Bunton et al. Nov 2005 B1
6968419 Holman Nov 2005 B1
6983354 Jeddeloh Jan 2006 B2
6996686 Doblar Feb 2006 B2
7012811 Jiang et al. Mar 2006 B1
7013361 Liron Mar 2006 B2
7064992 Bell Jun 2006 B2
7065101 Ziegler Jun 2006 B2
7085950 Ehmann Aug 2006 B2
7111140 Estakhri et al. Sep 2006 B2
7113012 Amin Sep 2006 B2
7123660 Haq Oct 2006 B2
7130317 Annadurai Oct 2006 B2
7136964 Yamamoto Nov 2006 B2
7139347 Fujita Nov 2006 B2
7143305 Hajji et al. Nov 2006 B2
7149950 Spencer et al. Dec 2006 B2
7164615 Park et al. Jan 2007 B2
7167361 Lin Jan 2007 B2
7191304 Cameron et al. Mar 2007 B1
7193429 Okuyama Mar 2007 B2
7203889 Oza et al. Apr 2007 B2
7205803 Chung Apr 2007 B2
7206888 Byers Apr 2007 B2
7213103 Eng et al. May 2007 B2
7280538 Li Oct 2007 B2
7304520 Cho Dec 2007 B2
7310703 Frolund Dec 2007 B2
7328362 Chiang Feb 2008 B2
7356730 Ulrich et al. Apr 2008 B2
7363455 Shimada et al. Apr 2008 B2
7366852 Hung Apr 2008 B2
7430728 Rahut Sep 2008 B1
7433441 Jenkins Oct 2008 B2
7451265 Traister et al. Nov 2008 B2
7490189 Eberle et al. Feb 2009 B2
7512861 Taylor Mar 2009 B2
7516029 Kim Apr 2009 B2
7525356 Hui Apr 2009 B2
7539800 Dell May 2009 B2
7551640 Klecka Jun 2009 B1
RE40877 Singhal et al. Aug 2009 E
7609695 Zhu et al. Oct 2009 B2
7643517 Annadurai Jan 2010 B2
7653776 Cornelius et al. Jan 2010 B2
7668271 Kim Feb 2010 B2
7668272 Obeidat Feb 2010 B1
7734867 Keeton Jun 2010 B1
7751713 Perkins Jul 2010 B2
7818525 Frost Oct 2010 B1
7984084 Sinclair Jul 2011 B2
20010039601 Leung Nov 2001 A1
20010040827 Dosaka et al. Nov 2001 A1
20020007469 Taketa et al. Jan 2002 A1
20020009169 Watanabe Jan 2002 A1
20020026600 Jung et al. Feb 2002 A1
20020046322 Butterworth et al. Apr 2002 A1
20020072135 Adachi et al. Jun 2002 A1
20020073285 Butterworth Jun 2002 A1
20020083379 Nishikawa et al. Jun 2002 A1
20020084458 Halbert et al. Jul 2002 A1
20020099904 Conley Jul 2002 A1
20020103966 Wu et al. Aug 2002 A1
20020112119 Halbert et al. Aug 2002 A1
20020120901 Poirier et al. Aug 2002 A1
20020124153 Litaize et al. Sep 2002 A1
20020178314 Cho Nov 2002 A1
20020191467 Matsumoto et al. Dec 2002 A1
20030018880 Litaize et al. Jan 2003 A1
20030001880 Holtz et al. Feb 2003 A1
20030046489 Yagi Mar 2003 A1
20030056142 Hashemi Mar 2003 A1
20030058021 Lee et al. Mar 2003 A1
20030061447 Perego et al. Mar 2003 A1
20030084235 Mizuki May 2003 A1
20030084397 Peleg May 2003 A1
20030091039 Ziegler May 2003 A1
20030095575 Annadurai et al. May 2003 A1
20030097524 Brant May 2003 A1
20030105928 Ash Jun 2003 A1
20030110343 Hagiwara et al. Jun 2003 A1
20030117172 Wu et al. Jun 2003 A1
20030120895 Litaize et al. Jun 2003 A1
20030126485 Wilcox et al. Jul 2003 A1
20030163606 Fukaishi et al. Aug 2003 A1
20030193927 Hronik Oct 2003 A1
20030206164 Juenger Nov 2003 A1
20030208511 Earl et al. Nov 2003 A1
20030212858 Apperley et al. Nov 2003 A1
20030236939 Kleveland et al. Dec 2003 A1
20040004897 Kang Jan 2004 A1
20040062119 Stimak et al. Apr 2004 A1
20040073767 Johnson et al. Apr 2004 A1
20040117569 Kyung Jun 2004 A1
20040122985 Parra et al. Jun 2004 A1
20040139293 Barth et al. Jul 2004 A1
20040153817 Norman et al. Aug 2004 A1
20040153902 Machado et al. Aug 2004 A1
20040184336 Shore et al. Sep 2004 A1
20040230718 Polzin et al. Nov 2004 A1
20040243769 Frame et al. Dec 2004 A1
20040256638 Perego et al. Dec 2004 A1
20040260957 Jeddeloh et al. Dec 2004 A1
20050005184 Lindt Jan 2005 A1
20050007805 Ware et al. Jan 2005 A1
20050007864 Chung et al. Jan 2005 A1
20050010726 Rai et al. Jan 2005 A1
20050010737 Ware et al. Jan 2005 A1
20050015522 Elboim Jan 2005 A1
20050044313 Amemiya et al. Feb 2005 A1
20050060483 Azuma Mar 2005 A1
20050071554 Thayer et al. Mar 2005 A1
20050071693 Chun et al. Mar 2005 A1
20050086549 Solomon et al. Apr 2005 A1
20050089037 Kojima Apr 2005 A1
20050104653 Hoshi et al. May 2005 A1
20050111249 Yagisawa et al. May 2005 A1
20050140685 Garg Jun 2005 A1
20050146939 Conley et al. Jul 2005 A1
20050190622 Choi Sep 2005 A1
20050193166 Johnson et al. Sep 2005 A1
20050210216 Jobs et al. Sep 2005 A1
20050223269 Stolowitz Oct 2005 A1
20050240743 Eng et al. Oct 2005 A1
20050246362 Borland Nov 2005 A1
20050265104 Remaklus et al. Dec 2005 A1
20050279837 Hajji Dec 2005 A1
20060026450 Bounitch Feb 2006 A1
20060053308 Zimmerman Mar 2006 A1
20060064545 Wintergest Mar 2006 A1
20060089107 Domino Apr 2006 A1
20060161678 Bopardikar Jul 2006 A1
20060161807 Dawkins Jul 2006 A1
20060187715 Narvaez et al. Aug 2006 A1
20060195657 Tien et al. Aug 2006 A1
20060224560 Makita Oct 2006 A1
20060236027 Jain et al. Oct 2006 A1
20060253721 Johnson Nov 2006 A1
20060271725 Wong Nov 2006 A1
20060277310 Kalos et al. Dec 2006 A1
20070002663 Schaefer Jan 2007 A1
20070061513 Tsumagari et al. Mar 2007 A1
20070079219 Nagai et al. Apr 2007 A1
20070088754 Brannon et al. Apr 2007 A1
20070088976 Daikokuya et al. Apr 2007 A1
20070089045 Corbett et al. Apr 2007 A1
20070101075 Jeddeloh May 2007 A1
20070113029 Bennett et al. May 2007 A1
20070124532 Bennett May 2007 A1
20070162516 Thiel et al. Jul 2007 A1
20070279993 Hemink Dec 2007 A1
20080010398 Jiang Jan 2008 A1
20080052446 Lasser et al. Feb 2008 A1
20080059869 Brewer et al. Mar 2008 A1
20080089135 Ito Apr 2008 A1
20080098054 Carmody et al. Apr 2008 A1
20080109616 Taylor May 2008 A1
20080126673 Kaneda May 2008 A1
20080155160 McDaniel Jun 2008 A1
20080168304 Flynn et al. Jul 2008 A1
20080175586 Perkins Jul 2008 A1
20080175589 Perkins Jul 2008 A1
20080183953 Flynn et al. Jul 2008 A1
20080250270 Bennett Oct 2008 A1
20080282025 Biswas Nov 2008 A1
20080316822 Ahn et al. Dec 2008 A1
20080320366 Lin Dec 2008 A1
20090006886 O'Connor et al. Jan 2009 A1
20090010067 Lee Jan 2009 A1
20090052892 Perkins et al. Feb 2009 A1
20090089045 Lenat Apr 2009 A1
20090106491 Piszczek et al. Apr 2009 A1
20090147573 Hemink Jun 2009 A1
20090150599 Bennett Jun 2009 A1
20090172258 Olbrich Jul 2009 A1
20090172335 Kulkarni et al. Jul 2009 A1
20090198947 Khmelnitsky Aug 2009 A1
20090204872 Yu et al. Aug 2009 A1
20090319750 Jobs et al. Dec 2009 A1
20090324220 Perkins Dec 2009 A1
20100023672 Gorobets Jan 2010 A1
20100115189 Lin May 2010 A1
20110099320 Lucas Apr 2011 A1
Foreign Referenced Citations (12)
Number Date Country
0977121 Feb 2000 EP
1 369 767 Dec 2003 EP
1997265357 Oct 1997 JP
2004-272576 Sep 2004 JP
WO 9930240 Jun 1999 WO
WO 9941667 Aug 1999 WO
WO 0237293 May 2002 WO
WO 2004102403 Nov 2004 WO
WO 2004109500 Dec 2004 WO
WO 2004109525 Dec 2004 WO
WO 2004109526 Dec 2004 WO
WO 2010071655 Jun 2010 WO
Non-Patent Literature Citations (130)
Entry
Unknown author, Intel®, “Understanding the Flash Translation Layer (FTL) Specification”, Dec. 1998, Order No. 297816-002, © 1997, Intel Corporation, pp. 1-20.
Unknown author, NXP Corp “LPC122x”, datasheet, in U.S. Appl. No. 12/079,364, filed Mar. 26, 2008, undated, pp. 44 of 60.
Chang, L., et al., “Real-Time Garbage Collection for Flash-Memory Storage Systems of Real-Time embedded Systems”, ACM Transactions on Embedded Computing Systems, vol. V, No. N., Jun. 2004, pp. 1-26.
Chen, P.M. et al., “Maximizing Performance in a Striped Disk Array”, Computer Science Division, University of California, published prior to Jan. 1, 1990 (10 pgs).
Choudhuri, S. et al., “Real-Time Access Guarantees for NAND Flash Using Partial Block Cleaning”, SEUS 2008, LNCS 5287, IFIP International Federation for Information Processing, 2008, pp. 138-149.
Choudhuri, S. et al., “Deterministic Service Guarantees for NAND Flash using Partial Block Cleaning”, CODES+ISSS108, Oct. 19-24, 2008, Atlanta, Georgia, USA. Copyright 2008 ACM 978-1-60558-470-6/08/10, pp. 19-24.
“A High-Speed Channel Controller for the Chaos Router”, by Robert Will: Dec. 8, 1992 pp. 1-21.
AbouGhazeleh, N., et al., “Energy Conservation in Memory Hierarchies Using Power-Aware Cashed-DRAM”, Department of Computer Science, University of Pittsburgh, Technical Report: TR-05-123, pp. 1-23.
Fan, X., et al., “Modeling of DRAM Power Control Policies Using Deterministic and Stochastic Petri Nets”, Department of Computer Science, Duke University, Surham, NC 27708, USA, (11 pgs).
Park, J., et al., “Coarse-Grained DRAM Power Management”, Department of Computer Science, Department of Electrical Engineering and Computer Engineering, State University of New Your at New Paltz, New Paltz, NY 12561, USA (7 pgs).
Rajamani, K., et al., “Evaluating Power Management Strategies for High Performance Memory (DRAM): A Case Study for Achieving Effective Analysis by Combining Simulation Platforms and Real Hardware Performance Monitoring”, IBM Austin Research Lab (10 pgs).
Intel, “Intelligent RAID 6 Theory Overview and Implementation”, Intel Corporation, 2005 (5pgs). www.intel.com'design/storage/intelligent raid.htm.
NXP Corp “LPC122x”, data sheet, in U.S. Appl. No. 12/079,364, undated, pp. 44 of 60.
Unknown author, “Spike Free Low Latency”, obtained from Internet, www.vmen.com, © 2011, Violin Memory, Inc., (8 pgs).
Patterson, DA, et al., “A Case for Redundant Arrays of Inexpensive Disks (RAID)”, Reprint from Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 109-116, Jun. 1998, pp. 3-14.
Micron, “Calculating Memory System Power for DDR”, © 2001 Micron Technology, Inc., pp. 1-26.
Micron, “Mobile SDRAM Power-Saving Features”, © 2002 Micron Technology, Inc., pp. 1-3.
Micron, “DDR2 CKE Power-Down Requirement”, © 2003 Micron Technology, Inc., pp. 1-3.
Micron, “DDRW (Point-to-Point) Features and Functionality”, © 2003 Micron Technology, Inc., pp. 1-14.
Micron, “Designing for High-Density DDR2 Memory”, ©2005 Micron Technology, Inc., pp. 1-9.
Micron, “Mobile DRAM Power-Saving Features and Power Calculations”, © 2005 Micron Technology, Inc., pp. 1-9.
“Mainstream Computer Components”, Lec #10 Spring 2006 , May 8, 2006, pp. 1-31.
Bhalodia, V., “SCALE DRAM Subsystem Power Analysis”, Massachusetts Institute of Technology, Sep. 2005, pp. 1-51.
“Cycletrees: Flexible Interconnection Graphs for Parallel Computing”, Margus Veanes & Jonas Barklund, 36 p., UPMAIL Technical Report No. 97, Uppsala, Sweden, Feb. 21, 1995.
“X-Tree: A Tree Structured Multi-Proce3ssor Computer Architecture”, Alvin M. Despain and David A. Patterson; University of California/Computer Science Division, Berkeley, CA, p. 144-151.
“Communication in X-Tree, a Modular Multiprocessor System”, by C.H. Sequin, A.M. Despain, D.A. Patterson; University of California, Computer Science Division, Electrical Engineering & Computer Sciences; Berkeley, CA, p. 194-203; 1978.
“A Graph for Interconnecting Processors in Parallel Computing”, by Hong Xie; Murdock University, Murdoch, W.A., 6150 Australia; Proc. ICCI'94, p. 885-901; 1994 Int. Conf. on Computing and Information.
“A High-Speed Channel Controller for the Chaos Router”, by Robert Wille; p. 1-21; Dec. 8, 1992.
“The Alewife CMMU: Addressing the Multiprocessor Communications Gap”, by J. Kubiatowicz, D. Chaiken, A. Agarwal; Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, MA; p. 1-3.
“Performance Evaluation of Switch-Based Wormhole Networks”, by Lionel M. Ni, Yadong Gui, Sherry Moore; 1045-9219/97-1997 IEEE; p. 462-474.
Hans-Peter Messer: “PC-Hardwarebuch”, 1995, Addison-Wesley, Bonn XP002412835 p. 31-36 and 580-583.
International Search Report from PCT application No. PCT/US2006/014527 dated Apr. 10, 2007 (7 pgs).
Written Opinion of the International Searching Authority from the International Search Report from PCT application No. PCT/US2006/014527 dated Apr. 10, 2007 (9 pgs).
International Search Report for International Application No. PCT/US2007022316, dated Mar. 28, 2008 (3 pgs).
Notification of the First Office Action dated Dec. 26, 2008 from the Patent Office of People's Republic of China for Chinese Patent Application No. 2006800130653 (7 pgs).
Written Opinion of the International Searching Authority from the International Search Report from PCT application No. PCT/US2008/074628 dated Mar. 24, 2009 (5 pgs).
International Search Report for International Application No. PCT/US2008/074628, dated Mar. 24, 2009 (3 pgs).
Written Opinion of the International Searching Authority from the International Search Report from PCT application No. PCT/US2008/078752 dated Mar. 31, 2009 (5 pgs).
International Search Report for International Application No. PCT/US2008/078752, dated Mar. 31, 2009 (3 pgs).
Written Opinion of the International Searching Authority from the International Search Report from PCT application No. PCT/US2008/083969 dated Apr. 30, 2009 (5 pgs).
International Search Report for International Application No. PCT/US2008/083969, dated Apr. 30, 2009, (3 pgs).
European Patent Office Communication from EPO application No. 06/750 534.7-2212 dated Jun. 5, 2009 (6 pgs).
Nov. 13, 2009 Response to European Patent Office Communication from EPO application No. 06 750 534.7-2212 dated Jun. 5, 2009 (14 pgs).
Jul. 21, 2009 Non-Final Office Action, U.S. Appl. No. 11/405,083.
Response to Jul. 21, 2009 Non-Final Office Action, U.S. Appl. No. 11/405,083, filed Oct. 7, 2009.
Jan. 21, 2009 Non-Final Office Action, U.S. Appl. No. 11/405,083.
European Search Report from EPO application No. 08836238.9 2212/2201463 dated Sep. 14, 2010 (7 pgs).
May 19, 2010 Non-Final Office Action, U.S. Appl. No. 11/975,269, (19 pgs).
Response to May 19, 2010 Non-Final Office Action, U.S. Appl. No. 11/975,269, filed in the USPTO on Nov. 9, 2010 (7 pgs).
European Patent Office Communication from EPO application No. 08836238.9-2212/2201463 dated Oct. 1, 2010 (1 pg).
European Patent Office Communication from EPO application No. 08836238.9-2212/2201463 dated Sep. 14, 2010 (7 pgs).
European Patent Office Communication from EPO application No. 07 861 460.9-2212 dated Mar. 23, 2010 (3 pgs).
May 28, 2010, Response to European Patent Office Communication from EPO application No. 07 861 460.9-2212 dated Mar. 23, 2010 (17 pgs).
European Patent Office Communication from EPO application No. 07 861 460.9-2212 dated Oct. 15, 2010 (5 pgs).
Notice of Preliminary Rejection dated Jan. 24, 2011 from the Korean Intellectual Property Office (KIPO) for Korean Patent Application No. 10-2009-7008236.
Argument and Amendment filed on Mar. 21, 2011 in the Korean Intellectual Property Office (KIPO) for Korean Patent Application No. 10-2009-7008236, (9 pgs).
Written Opinion of the International Searching Authority from International Search Report for PCT application No. PCT/US2010/052074 (8 pgs).
Response to Nov. 7, 2011, Final Office Action, U.S. Appl. No. 12/796,836, filed in the USPTO on Dec. 20, 2011 (23 pgs).
Despaux, O., “DDR SDRAM Controller Using Virtex4 FPGA Devices”, 2004 Xilinx, Inc., XAPP709 (v1.0) Sep. 10, 2004, p. 1-9.
Elpida, “Low Power Function of Mobile RAMTM Deep Power Down (DPD)”, Elpida Memory, Inc. 2005-2006, Date Published May 2006 (K) Japan, URL: http//www.elpida.com, p. 1-4.
Fan, X., et al., “Memory Controller Policies for DRAM Power Management”, ISPLED '01, Aug. 6-7, 2001, Huntington Beach, California, USA, Copyrighe 2001 ACM 1-58113-371 May 1, 2008, (6 pgs).
Feb. 23, 2010 Non-Final Office Action, U.S. Appl. No. 11/405,083 (19 pgs).
Graefe, G. “Write-Optimized B-Trees”, Proceedings of the 30th VLDB Conference, Toronto, Canada, 2004, pp. 672-683.
Jan. 21, 2011 Non-Final Office Action, U.S. Appl. No. 12/245,349 (20 pgs).
Jul. 21, 2010 Final Office Action, U.S. Appl. No. 11/405,083 (20 pgs).
May 19, 2010 Non-Final Office Action, U.S. Appl. No. 11/975,269.
Notice of Preliminary Rejection dated Jan. 24, 2001 from the Korean Intellectual Property Office (KIPO) for Korean Patent Application No. 10-2009-7003236.
International Search Report and Written Opinion of the International Searching for International Application No. PCT/US2008/083969, Apr. 30, 2009 (8 pgs).
Response to Feb. 23, 2010 Non-Final Office Action, U.S. Appl. No. 11/405,083, filed May 12, 2010 (30 pgs).
Response to Office Action for U.S. Appl. No. 11/405,083, filed Nov. 17, 2010, (16 pgs).
Response to May 19, 2010 Non-Final Office Action, U.S. Appl. No. 11/975,269, filed Nov. 9, 2010 (7 pgs).
Samsung Electronics Flash Memory, “1G × 8 Bit 1 2G × 8 Bit 1 4G × Bit NAND Flash Memory”, K9XXG08UXA, Date Unknown, (50 pgs).
Sanders, DA, et al., “Terabyte IDE RAID-5 Disk Arrays”, 2003 Conference for Computing in High Energy and Nuclear Physics, LaJolla, California, Mar. 24-28, 2003, pp. 1-8.
International Search Report and Written Opinion of the International Searching Authority for International Application No. PCT/US2010/052074, dated Jun. 30, 2011 (9 pgs).
Response to Nov. 7, 2011 Final Office Action, U.S. Appl. No. 12/796,836 filed in the PTO on Dec. 20, 2011.
Extended European Search Report in Application 11168486.6-2212, dated Sep. 20, 2011 (4 pgs).
International Search Report for PCT/US2010/062061, dated Sep. 20, 2011, (9 pgs).
Jun. 22, 2011 Final Office Action, U.S. Appl. No. 11/975,269 (14 pgs).
International Search Report for International Application No. PCT/US2010/052074 (2 pgs).
Korean Intellectual Property Office (KIPO) Office action for Korean Patent Application for 10-2010-7009902, dated Aug. 3, 2011 (16 pgs. Including English translation).
Lee et al. Inter-Pin Skew Compensation Scheme for 3.2-Gb/s/pin Parallel Interface. Journal of Semiconductor Technology and Science. vol. 10. No. 1, Mar. 2010.
International Search Report and the Written Opinion of the International Searching Authority for International App. No. PCT/US2010/037987, dated Dec. 30, 2010 (9 pgs).
Response to May 3, 2011 Final Office Action from U.S. Appl. No. 12/079,964, filed May 3, 2011 dated Jun. 16, 2011 (40 pgs).
Response to Jun. 22, 2011 Final Office Action U.S. Appl. No. 11/975,269, filed Jun. 24, 2011 (7 pgs).
V Hu et al. Inter-Signal Timing Skew Compensation of Parallel Links with Voltage-Mode Incremental Signaling. IEEE, 2008.
W. Chakraborty et al. Dynamic Thermal Clock Skew Compensation Using Tunable Delay Buffers. ACM, 2006.
Notice of Preliminary Rejection for South Korean Application No. 10-2012-7000724, dated Jun. 20, 2012 (3 pgs).
Argument and Amendment in response to the Notice of Preliminary Rejection for South Korean Application No. 10-2012-7000724, dated Jul. 13, 2012 (10 pgs).
Office Action from counterpart Chinese Application No. 200880007937.4, dated Jun. 29, 2012 and Response dated Oct. 8, 2012 (30 pgs).
European Communication from European Application No. 11168499.9, dated Oct. 22, 2012 (4 pgs).
Extended European Search Report for European Application No. 10786789.7 dated Nov. 22, 2012 (6 pgs).
Extended European Search Report and response for European Application No. 11168486.6, dated Apr. 19, 2012 (10 pgs).
Extended European Search Report and response for European Application No. 11168489.0, dated May 1, 2012 (10 pgs).
Extended European Search Report and response for European Application No. 11168492.4, dated May 2, 2012 (13 pgs).
Extended European Search Report and response for European Application No. 11168494.0, dated Apr. 19, 2012 (21 pgs).
Extended European Search Report and response for European Application No. 111688499.9, dated Apr. 30, 2012 (11 pgs).
Extended European Search Report and response for European Application No. 11168502.0, dated May 1, 2012 (9 pgs).
Extended European Search Report for counterpart European Application No. 08829082.0, dated Mar. 22, 2012 (8 pgs).
Extended European Search Report and response for European Application No. 11168504.6, dated Apr. 19, 2012 (10 pgs).
European Patent Office Communication for European Application No. 08742320.8, dated Feb. 28, 2012 (5 pgs).
Response to Communication from the European Patent Office for European Application No. 08742320.8, Sep. 4, 2012 (14 pgs).
International Preliminary Report on Patentability for International Application No. PCT/US2010/052074, dated Apr. 11, 2012 (4 pgs).
Notification of Reasons for Rejection and Response for Japanese Application No. 2008-507797, dated Apr. 5, 2012 (5 pgs).
Notification of Reasons for Rejection and Response for Japanese Application No. 2009-124465, dated Jun. 6, 2012 (13 pgs).
Notice of Preliminary Rejection for Korean Application No. 10-2007-7025635, dated Jul. 31, 2012, (5 pgs. With translation).
Communication from the European Patent Office for European Application No. 11168499.9, dated Oct. 22, 2012 (4 pgs).
Notice of Preliminary Rejection for South Korean Application No. 10-2012-7009026, dated Nov. 9, 2012 (10 pgs).
Office Action from co-pending U.S. Appl. No. 12/901,224, dated Oct. 18, 2012 (23 pgs).
Response to European Communication dated Apr. 10, 2012 for European Application No. 08829082.0, dated Oct. 5, 2012 (12 pgs).
Response to Notice of Preliminary Rejection for Korean Application No. 10-2007-7025635, dated Oct. 31, 2012 (10 pgs).
Decision of Final Rejection for Japanese Application No. 2008-507797, dated Jan. 7, 2013 (2 pgs).
Decision of Final Rejection for Japanese Application No. 2009-124465, dated Jan. 7, 2013 (2 pgs).
Argument and Amendment from South Korean Application No. 10-2013-7015135, dated Sep. 2, 2013 (25 pgs).
Notice of Preliminary Rejection for South Korean Application No. 10-2012-7000724, dated Feb. 20, 2013 (12 pgs).
Amendment from counterpart Korean Application No. 10-2012-7009026, dated Aug. 9, 2013, (14 pgs. with partial translation).
Response to Examination Report for European Applicataion No. 1168499.9 dated Apr. 24, 2013 (10 pgs).
Extended European Search Report for European Application No. 10822795.0, dated Apr. 29, 2013, (8 pgs).
English translation of Argument and Amendment from counterpart South Korean Application No. 10-2012-7009026 dated Aug. 9, 2013 (8 pgs).
Argument and Amendment from counterpart South Korean Application No. 10-2013-7005934, dated Dec. 18, 2013, (24 pgs).
Argument and Amendment from South Korean Application No. 10-2013-7023247, dated Jan. 10, 2014 (16 pgs).
Intel®, “Understanding the Flash Translation Layer (FTL) Specification”, Dec. 1998, Order No. 297816-002, Copyright© Intel Corporation 1997, 1998, pp. 1-20.
Jeffery, C.A., “Performance Analysis of Dynamic Sparing and Error Correction Techniques for Fault Tolerance in Nanoscale Memory Structures”, Thesis Presentation to the University of Florida, 2004, (104 pgs).
Juonolainen, M.K., “Cand Scient Thesis”, University of Oslo, 1.2. 1999, (129 pgs).
Norvag, K., et al., “Log-Only Temporal Object Storage”, Copyright 1997 IEEE, published in the Proceedings of DEXA'97, Sep. 1-2, 1997, Toulouse, France (6 pgs).
Shirriff, K.W., “Sawmill: A Logging File System for a High-Performance RAID Disk Array”, Dissertation Presentation, University of California, 1995, pp. 164.
Violin Memory, Inc., “Spike Free Low Latency”, obtained from Internet address: www.vmem.com, © 2011 Violin Memory, Inc., (8 pgs).
Notice of Preliminary Rejection issued in related Korean Patent Application No. 10-2010-7004676 dated Oct. 13, 2014 (10 pgs).
Argument and Amendment from related Korean Application No. 10-2014-7034695 Receipt date Jul. 3, 2015.
Office Action for related U.S. Appl. No. 14/642,910 dated Apr. 28, 2015.
Response to Office Action for related U.S. Appl. No. 14/642,910, filed May 10, 2015.
Related Publications (1)
Number Date Country
20160085453 A1 Mar 2016 US
Provisional Applications (4)
Number Date Country
60674189 Apr 2005 US
60698626 Jul 2005 US
60920737 Mar 2007 US
60967101 Aug 2007 US
Continuations (1)
Number Date Country
Parent 12199386 Aug 2008 US
Child 14882000 US
Continuation in Parts (2)
Number Date Country
Parent 11405083 Apr 2006 US
Child 12199386 US
Parent 12079364 Mar 2008 US
Child 12199386 US