Embodiments of the present invention generally relate to system cloning and, in particular, to a fast apparatus and method to clone a system for backup or replication.
Computer systems of varying scopes or deployment are used throughout a typical large enterprise. Enterprise-level computer systems are systems that may be used throughout an enterprise or to support enterprise-critical functions. For example, for an airline company, a reservation and booking system or a flight scheduling system may be an enterprise-level system. At a lower level of deployment, other systems (e.g., a department-level or functional-level system) may support a departmental-level organization or support a limited function. For example, department-level systems for an airline company may support one of accounting, sales and marketing, engineering, maintenance support, and so forth. At an even lower level, a computer system (either a real system or a virtual system such as a cloud-based system) may support individual employees.
A computer system may be characterized by its hardware and software assets, status, system state, and the like. Hardware characterization may include a list of servers used, memory and memory storage space available, communication links available, router connectivity, and so forth. Characterization of software assets may include a list of operating systems and application programs available on each server. Characterization of system state may include a list of what software is presently executing on each server, the state of each software (e.g., as indicated by a finite state machine model), data in volatile and non-volatile memory accessible to and/or used by each software, and so forth.
At times, it is necessary or desirable to clone a computer system, e.g., for backup or capacity purposes. For example, a backup of a computer system may be made by cloning all or part of the computer system, e.g., cloning at least the system state but not necessarily the hardware characterization. On the other hand, cloning by way of replication may be made when it is necessary to quickly ramp up processing capacity or capabilities. For example, an online retail merchant may want to replicate temporarily its computer systems devoted to sales and marketing during the period from Thanksgiving to Christmas, and release those assets later. However, the online retail merchant may want to replicate temporarily its computer systems devoted to accounting at the end of its fiscal year.
At times, it is necessary or desirable to restore a computer system from backups. For example, if a sales system or web site of an online merchant crashes, the merchant may not have any sales until the sales system or web site is restored. Therefore, there would be a need to restore such systems from backups as soon as possible.
Existing methods for cloning systems suffer from a variety of drawbacks. For example, a hot standby (e.g., a system that is constantly active and mirroring the state of a primary system) may be expensive in terms of hardware required, software licenses needed and maintenance cost (e.g., for utilities and staff), particularly for larger systems. Multiple virtual machines and hypervisors are also potentially expensive in terms of hardware and software if they are constantly kept hot. Cold standby backup systems (e.g., a backup brought online only when needed, such as upon primary system failure) may take an undesirably long time to take over for a failed system, and may not reflect the most recent state of the primary system prior to failure.
Therefore, a need exists to provide a system and method to clone computer systems quickly yet at low cost.
In one embodiment, a system clone is made by copying all or part of the present memory contents of an application server system, using fast methods and architecture described herein. The system clone then may be used as a backup, to increase enterprise capacity, to repurpose computing assets, and so forth.
A method to clone a source computing system in accordance with an embodiment of the present disclosure may include the steps of selecting a memory space coupled to the source computing system, retrieving uncoded data from the selected memory space, encoding the uncoded data by use of a bit-marker-based encoding process executing on a backup server, storing encoded data in a protected memory coupled to the backup server, wherein the protected memory is protected from a power interruption, retrieving the encoded data from the protected memory, and decoding the encoded data onto a target computing system, wherein the target computing system is separate from the source computing system.
A system to clone a source computing system in accordance with an embodiment of the present disclosure may include a processor coupled to a memory, the memory providing a memory space for the source computing system, a communication interface to support retrieval of uncoded data from the memory space, an encoder to encode the uncoded data by use of a bit-marker-based encoding process executing on a backup server, a storage module to store encoded data in a protected memory coupled to the backup server, wherein the protected memory is protected from a power interruption, a communication interface to support retrieval of the encoded data from the protected memory, and a decoder to decode the encoded data onto a target computing system, wherein the target computing system is separate from the source computing system.
The preceding is a simplified summary of embodiments of the disclosure to provide an understanding of some aspects of the disclosure. This summary is neither an extensive nor exhaustive overview of the disclosure and its various embodiments. It is intended neither to identify key or critical elements of the disclosure nor to delineate the scope of the disclosure but to present selected concepts of the disclosure in a simplified form as an introduction to the more detailed description presented below. As will be appreciated, other embodiments of the disclosure are possible utilizing, alone or in combination, one or more of the features set forth above or described in detail below.
The above and still further features and advantages of the present invention will become apparent upon consideration of the following detailed description of embodiments thereof, especially when taken in conjunction with the accompanying drawings wherein like reference numerals in the various figures are utilized to designate like components, and wherein:
The headings used herein are for organizational purposes only and are not meant to be used to limit the scope of the description or the claims. As used throughout this application, the word “may” is used in a permissive sense (i.e., meaning having the potential to), rather than the mandatory sense (i.e., meaning must). Similarly, the words “include”, “including”, and “includes” mean including but not limited to. To facilitate understanding, like reference numerals have been used, where possible, to designate like elements common to the figures. Optional portions of the figures may be illustrated using dashed or dotted lines, unless the context of usage indicates otherwise.
The disclosure will be illustrated below in conjunction with exemplary use cases, method embodiments, and system embodiments. Although well suited for use with, e.g., a system using servers, networking equipment and/or specialized instrumentation, the disclosure is not limited to use with any particular type of electronic system or configuration of system elements. Those skilled in the art will recognize that the disclosed techniques may be used in any electronic system in which it is desirable to replicate, clone, backup or restore a computer system.
Embodiments in accordance with the present disclosure will be described in relation to associated hardware. However, to avoid unnecessarily obscuring the present disclosure, the following description omits well-known structures, components and devices that may be shown in block diagram form, are well known, or are otherwise summarized. It should also be noted the examples presented herein should not be construed as limiting of the scope of embodiments of the present invention, as other equally effective examples are possible and likely.
As used herein, the term “module” refers generally to a logical sequence or association of steps, processes or components. For example, a software module may comprise a set of associated routines or subroutines within a computer program. Alternatively, a module may comprise a substantially self-contained hardware device. A module may also comprise a logical set of processes irrespective of any software or hardware implementation.
A module that performs a function also may be referred to as being configured to perform the function, e.g., a data module that receives data also may be described as being configured to receive data. Configuration to perform a function may include, for example: providing and executing computer code that performs the function; providing provisionable configuration parameters that control, limit, enable or disable capabilities of the module (e.g., setting a flag, setting permissions, setting threshold levels used at decision points, etc.); providing a physical connection, such as a jumper to select an option, or to enable/disable an option; attaching a physical communication link; enabling a wireless communication link; providing electrical circuitry that is designed to perform the function without use of a processor, such as by use of discrete components and/or non-CPU integrated circuits; energizing a circuit that performs the function (e.g., providing power to a transceiver circuit in order to receive data); and so forth.
The parent of the present patent application (U.S. patent application Ser. No. 14/804,175, “the '175 application”) discloses a system for a high-capacity and fast transfer rate digital storage. Bit marker technology used in the '175 application and herein is described in CIP parent application U.S. patent application Ser. No. 13/908,239 (“the '239 application). When a computer system can be characterized at least in part by a digital state of its software assets, status and system state, then embodiments in accordance with the present disclosure may use the system of the parent disclosure in order to clone a digital state very quickly. System restoral may be performed commensurately quickly.
The methods, components and systems disclosed in the '175 application and used in the present embodiments include a hypervisor, a server processor, a customized operating system and/or a guest operating systems (OSs) in the hypervisor, data or drives associated with the guest OSs. Embodiments are able to integrate into substantially any network via networking components (e.g., Ethernet adapters). Embodiments may further include conventional RAM volatile memory, and a non-volatile DIMM memory (NV-DIMM) that is protected from data loss as disclosed in the '175 application. Systems may further include PCIe, peripheral devices and structuring.
The data being imaged and represented may include substantially any data stored in the volatile RAM, e.g., databases, application programs, logs, proprietary data, and so forth. Application programs may include: various services executing at an operating system level such as a firewall service, a document service, etc.; various software executing at a user level such as a spreadsheet, word processor, graphics editing, CAD/CAM software, accounting software, etc.; and various servers, such as a web server, a mail server, a database server, and so forth.
System 100 includes a processor 102, which may be a general-purpose processor such as Xeon®, Intel Core i7®, i5®, i3®, or processors from Advanced Micro Devices® (AMD) such as Athlon64®, and the like. In other embodiments, processor 102 may be a graphics processing unit (GPU). In the functional block diagram of
Processor 102 may use several internal and external buses to interface with a variety of functional components. System 100 includes communication bus 105 that links processor 102 to memory controller 106. Memory controller 106 may also be referred to as a northbridge. Communication bus 105 may be implemented as one of a front side bus (FSB), a Non-Uniform Memory Access (NUMA) bus, an EV6 bus, a Peripheral Component Interconnect (PCI) bus, and so forth.
System 100 further includes a nonvolatile memory 122 (e.g., a CMOS memory) coupled to processor 102. CMOS memory 122 may include a basic input/output system (BIOS) 124, which helps manage low-level communication among computer components, and may include storage of computer code to perform a power-on self-test. Conventionally, a power-on self-test may include a test of the data integrity of installed RAM.
Memory controller hub 106 typically handles communications between processor 102 and various high-speed functional components such as external RAM memory installed in dual in-line memory module (DIMM) slots 108a, 108b via communication bus 107, and video graphics card 110 via communication bus 109. Communication buses 107 and 109 may be high-speed interfaces, such as Peripheral Component Interconnect Express (PCIe) or Accelerated Graphics Port (AGP). Memory controller hub 106 may also handle communications between processor 102 and controller hub 114, via communication bus 112. Controller hub 114 may also be known by other names such as a southbridge, an I/O Controller Hub (ICH), a Fusion Controller Hub (FCH), a Platform Controller Hub (PCH), and so forth. Controller hub 114 in turn manages further communication with additional and/or slower I/O devices or interfaces such as USB ports 131, storage media 132 with standard interfaces (e.g., ATA/SATA, mSATA, SAS, etc.), Ethernet transceivers 133, audio ports 134, other PCI devices 135, and so forth.
In some configurations of system 100 (not illustrated), processor 102 is designed to bypass memory controller 106 and communicate directly with controller hub 114 via a Direct Media Interface (DMI). Such configurations also may integrate the functions of processor 102 and memory controller 106 into a single IC 116. In such configurations, controller hub 114 is typically a Platform Controller Hub (PCH).
Although the memory chips that make up RAM memory installed in DIMM slots 108a, 108b may have a very high maximum access speed (e.g., about 57 GBytes/sec), communication bus 109 normally cannot support such fast speeds. For example, the speed of PCIe 4.0 in a 16-lane slot is limited to 31.508 GBytes/sec. AGP is slower still than PCIe. Therefore, communication bus 107 is a bottleneck that prevents faster memory access.
The bottleneck of memory access is one drawback of the conventional art. Other drawbacks described above of a conventional computer include the mismatch in storage size between the size of RAM memory (typically on the order of a few Gbytes) and the storage size of a conventional hard disk (typically on the order of a few Tbytes), and the relatively small storage size of RAM memory to the storage size of a conventional hard disk. Another drawback of the conventional art is the volatile nature of the RAM memory.
Embodiments in accordance with the present disclosure break the density issue that RAM has today. Embodiments in accordance with the present disclosure address these drawbacks of the conventional art by providing a novel hardware interface for storage units, and a novel driver interface for the hardware interface.
Outside of the CPU, RAM is the fastest element in x86 and x64 computing systems, so embodiments allows for the alignment of today's high speed RAM performance with a new method of achieving high storage density. As this effect is applied, it completely changes the cost paradigm and allows low cost memory modules to replace the need for high-density, high cost memory modules.
A remaining issue is the volatility of standard memory modules. Since all RAM is volatile, it does not lend itself to becoming a long-term storage medium. Embodiments are similar to but differ from non-volatile RAM (NVRAM) technology, which circumvents the volatility issue found in standard DIMM devices.
Embodiments in accordance with the present disclosure use a basic inexpensive x64 motherboard that can be powered by Intel® or AMD® CPU processors. The motherboard has a modified CME and BIOS that gives it the intelligence required to be Non-Volatile Memory aware. In addition, the motherboard provides to each memory module a DC supply voltage (e.g., 1.2 v, 1.35 v, 1.5 v, etc.) that may be used to charge environmentally-safe low-load, slow-drain capacitors. This design allows for shutdown state (e.g., loss of power or safe shutdown) to maintain data persistence within the memory module, thus making the memory module a viable long-term storage device.
System 200 further includes a nonvolatile memory 222 (e.g., a CMOS memory) coupled to processor 202. CMOS memory 222 may include a basic input/output system (BIOS) 224, which helps manage low-level communication among computer components, and may include storage of computer code to perform a power-on self-test. Conventionally, a power-on self-test may include a test of the data integrity of installed RAM. Embodiments in accordance with the present disclosure may include a modified power-on self-test (as compared to the power-on self-test of BIOS 124), such that the power-on self-test may skip the test for at least some predetermined memory modules, e.g., if the test would be incompatible with the nature of data stored in the predetermined memory module.
Embodiments in accordance with the present disclosure also address the RAM volatility shortcoming of the known art by coupling an energy source 219 with RAM storage unit 220. Energy source 219 may be incorporated with memory interface 218. Energy source 219 is a source of backup power, such that if an external power supply to RAM storage unit 220 is lost (e.g., by way of an AC power failure affecting the entire computing system 200, removal of a battery powering a mobile system 200, motherboard failure, etc.), energy source 219 may provide sufficient power in order to maintain integrity of data stored in RAM storage unit 220.
Embodiments in accordance with the present disclosure include random access memory (RAM) organized as a combination of traditional volatile memory and non-volatile RAM module memory (NV-DIMM). The NV-DIMM memory is disclosed in the parent U.S. patent application Ser. No. 14/804,175 (“the '175 application”), e.g., as the RAM storage unit 220. The proportion of each type of memory of the whole that is installed in a system may vary from system to system. For example, the total memory size may be selected at installation to be within a range of 8 GB to 160 GB or more, organized in eight banks, with two of the banks configured as conventional RAM memory and six banks configured as NV-DIMM.
Embodiments in accordance with the present disclosure may provide a system that operates in two modes. In a first mode, the entire content or address range of a conventional volatile memory of a source system (either of the present system or of an external system) may be selected to be imaged and represented by use of the methods disclosed in the '175 application, and the representation stored in the NV-DIMM memory. This image or representation may also be known as a reference image. Embodiments may be communicatively coupled to an external system by use of a high-speed communication link such as 100 Gigabit Ethernet conforming to the IEEE 802.3ba-2010 standard.
In a second mode in accordance with an embodiment of the present disclosure, a subset of the entire conventional volatile memory address range of a source system may be selected to be imaged and represented, e.g., only a portion of the conventional volatile memory that is actively being utilized by processing running on the system being imaged and represented. In another variation of this embodiment, a fixed range subset of the entire conventional volatile memory address range may be imaged and represented. The fixed range subset does not necessarily need to be contiguous. In another variation of this embodiment, the subset of the address range being imaged and represented may represent a virtual server. For example, if a single physical server (e.g., used by a business enterprise) hosts more than one virtual server (e.g., one each for several departments in the business enterprise), embodiments may image and represent some but not all of the virtual servers. Such a capability may be useful if, e.g., the functions performed by the different servers have different backup needs (e.g., a virtual server for the finance department vs. a virtual server for the customer support department).
In some embodiments, the NV-DIMM may act as a repository to store a plurality of reference images representing, e.g., a single system over time, or multiple external systems, or a combination thereof. An NV-DIMM repository of multiple reference images may be used to support disaster recovery, e.g., an off-site location securely storing reference images for multiple enterprises.
After the data has been imaged, represented and stored in NV-DIMM memory, embodiments in accordance with the present disclosure may provide an “infrastructure in a box” capability. For example, once all the databases, applications, logs, proprietary data, and so forth that had been imaged and represented is replicated on a target hardware environment that mimics the original hardware environment, the system that had been imaged and represented may be replicated along with the system state of the original system at the time it had been imaged and represented.
A replicated copy may be useful for backup purposes with fast restoration, or to be able to provide expanded capacity on short notice. Whether a restoration is deemed fast may vary from one field of use to another, or one content to another. For example, a fast restoration for a CAD/CAM system may not be deemed to be a fast restoration for a computing system supporting financial market trading. A fast restoration for a computing system providing video distribution of movies on demand may not be deemed to be a fast restoration for a computing system providing video distribution of a live event like the Super Bowl. Similarly, what notice is deemed to be short notice may vary from one field of use to another or one content to another, and may be as short as a few seconds or less for a computing system that supports financial market trading. In some embodiments, short notice is less than about five seconds notice. In some embodiments, a fast restoration can be completed within about ten minutes of the detection of a need for restoration or receipt of a command to perform a restoration. In other embodiments, a fast restoration can be completed within about three minutes. In other embodiments, a fast restoration can be completed within ten seconds or less.
Traditional backups are a relatively infrequent occurrence (e.g., once per day, once per week, etc.) in which a system state must be frozen or at least changes to system state should be minimized during a traditional backup process (e.g., by users saving their work, exiting out of applications, etc., all of which cause disruption). In contrast, when replicated copies may be made more quickly, backups can be made more quickly, more timely, and more frequently, resulting in a more recent (i.e., less stale) copy of a system state in case a restoration is necessary. Frequent backups begin to resemble a snapshot of a system state. Frequent backups may be referred to herein as “blink” backups.
Changes to system state may be reduced during a blink backup, as described below in greater detail with respect to
Analogizing to photography, a traditional backup is like a formal holiday family portrait that requires preparation (e.g., interrupting other activities in order to have the portrait taken, and staging—i.e., special poses, lighting, props, etc.). In contrast, embodiments are more like a video recording of a family, with each individual frame of the video representing a separate blink backup (albeit at a relatively slow frame rate compared to a video recording). The blink backup occurs quickly without necessarily requiring undue preparation, and therefore can be made frequently without disrupting operation of the system being blinked.
A blink backup may proceed first by identifying memory resources to be backed-up. For example, suppose an application-specific server is to be backed up. For example, the application-specific server to be backed up may be a virtual server dedicated to accounting functions, the virtual server being hosted on a physical server along with other virtual servers dedicated to other functions respectively such as sales and marketing, engineering department, etc. The server to be backed up customarily will keep a list of application programs executing on itself, along with their respective system resource usage. Embodiments may identify all system resources used by the application-specific server, as indicated by RAM memory ranges allocated to or used by all application programs currently running on the application-specific server being backed-up, address ranges of program code stored in a nonvolatile memory (e.g., storage media such as hard disk, solid-state drive (SSD), flash drive, NAND memory, non-volatile RAM, etc.), operating system configuration, and so forth. Embodiments may perform this collection as a high-priority data collection task, in order to minimize state or data changes to other application programs running on the application-specific server while the collection is taking place. The data collection task does not need to report its own memory usage.
Next, embodiments may retrieve the memory contents indicated by the identification task. Embodiments may then encode and store the memory contents in accordance with process 500 of
In some embodiments, a replicated copy may be generated by request from a source external to the system being replicated (e.g., a “pull” basis). In other embodiments, a replicated copy may be generated at a time determined by the system being replicated (e.g., a “push” basis). A push basis is similar to a scheduled backup.
Embodiments in accordance with the present disclosure also provide an ability to repurpose a computer hardware architecture upon short notice. For example, suppose that a web hosting company hosts several disparate web sites of interest, e.g., an e-commerce web site like Amazon™ using an average of 200 servers, an online trading web site like E-Trade™ using an average of 100 servers, and so forth. Further suppose that they use the same or similar computer hardware architecture constructed from standard components. The software components may be different, e.g., the e-commerce web site may be based upon an open-source operating system like Linux™, and the online trading web site may be based upon a commercial operating system like Microsoft Windows™. Utilization may vary over time, such that when one system is highly utilized the other system may be lightly utilized, and vice versa. In such a scenario, embodiments may quickly repurpose some servers from one web site to another. For example, if in the middle of a weekday the e-commerce web site is not busy but the online trading web site is busy, some number of servers (e.g., 40 servers) could be repurposed from e-commerce to online trading. Conversely, on a weekday evening when the e-commerce web site is busy but the online trading web site is not busy, some number of servers (e.g., 50 servers) could be repurposed from the online trading web site to the e-commerce web site. The repurposing may also be referred to as personality swapping.
For a server being repurposed from purpose “A” to purpose “B”, repurposing may involve first copying or cloning a system state of a server currently devoted to purpose “B”. The system state may include all memory currently being used, the operating system and all software currently executing, and so forth. Optionally, the current system state of the server currently devoted to purpose “A” but which will be repurposed may be saved for later restoration. Next, the system state cloned from purpose “B” will be restored on the server that was formerly devoted to purpose “A”, thereby substantially instantaneously repurposing that server to purpose “B”.
When repurposing, purpose “A” and purpose “B” may be substantially any server-based application, for either the same enterprise or different enterprises. For example, for a single enterprise such as a major toy retailer, purpose “A” may be sales systems that are in most demand before Christmas, and purpose “B” may be accounting systems that are in most demand at the end of the fiscal year.
Similarly, embodiments in accordance with the present disclosure may increase system capacity by repurposing servers from a spare status to an active status for a particular purpose. A spare status may be, e.g., a blank system that is populated with hardware but does not have usable software or data installed.
Embodiments in accordance with the present disclosure may facilitate combinations of system images. For example, a base system image may represent the operating system and/or certain computing infrastructure for the operating system, e.g., uncustomized servers such as a web server, a mail server, and so forth. The base system image may then be merged (i.e., combined) with a custom image, which may represent system-specific customizations of the uncustomized servers, e.g., user accounts, histories, preferences, macros, specialized application programs, and so forth. Conversely, system blinks may be able to blink the customizations separately from the base system image, allowing the customizations to be backed up on a different schedule or with less latency compared to a backup of the base system image.
Each enterprise 301-n may include one or more servers, e.g., servers 303-A-1 through 303-A-n for enterprise A 301-A, servers 303-B-1 through 303-B-n for enterprise B 301-B, and servers 303-C-1 through 303-C-n for enterprise C 301-C. Individual servers within an enterprise may be utilized by the enterprise for different functions. For example, if enterprise A 301-A is an online merchant, then server 303-A-1 may be a web server, server 303-A-2 may be devoted to database and inventory management, server 303-A-3 may be devoted to billing and accounting, etc.
Each enterprise 301-n may be communicatively coupled to cloning server 305 through communication network 308. Cloning server 305 may be, e.g., computer system 200 as illustrated in
In some embodiments, an optional separate blink repository 306 may store blink backups from one or more servers 303. Without a separate blink repository 306, blink backups may be stored within NV-DIMM memory of cloning server 305.
However, application server 351 may have further embedded within it the functionality of cloning server 355, supported by conventional volatile RAM memory 307 and NV-DIMM 309. Cloning server 355 may be, e.g., computer system 200 as illustrated in
Alternatively, application server 351 may be implemented using computer system 200 as a starting point, then executing by operating system 204 additional software modules that provide the functionality of application server 351.
In some embodiments, upon the occurrence of a blink backup, a virtual server 378, its respective GOS, memory resources and any application programs running on the GOS may temporarily enter a locked or suspended state for the duration of time it takes to perform the blink backup. The locked or suspended state reduces changes to system state or system configuration while the blink backup is taking place. At conclusion of the blink backup, elements that entered a locked or suspended state may automatically return to their normal state.
In some embodiments, a virtual server 378, its respective GOS, memory resources and any application programs running on the GOS may temporarily enter a quiescent state during a blink backup. A quiescent state may continue to execute transactions, but results may be held in resident memory rather than being committed to storage media. In contrast, a server in a hibernation mode may save a memory image to storage media and shut down without executing transactions while in hibernation mode. At conclusion of the blink backup, elements that entered a quiescent state may automatically return to their normal state.
In some embodiments, blink backups may be stored in an external blink repository, similar to blink repository 306, accessible via communication interface 355.
Process 500 begins at step 501, at which a block of raw data to be stored is received from an application program that intends to store the raw data. The raw data may be in the form of a file, a streaming media, a fixed-size or variable-size block of data, and so forth.
Next, process 500 transitions to step 503, at which portions of the raw data received in step 501 may be mapped or matched to candidate vectors of raw data. Matching the raw data to longer candidate vectors of raw data should produce greater data storage efficiency than matching the raw data to shorter candidate vectors of raw data. The candidate vectors may be stored as a table of (marker, vector) pairs in conventional memory. The goal is to represent each bit or byte in the raw data by at least one vector. Certain raw data bytes such as 0x00 or 0xFF may be deemed to be a default value, and for any raw data bytes equal to the default value, it is optional to represent bytes equal to the default value with a vector.
In step 503, a minimum threshold length limit may exist on the length of a portion of the raw data that will be mapped to candidate vectors of raw data. For example, raw data consisting of only a single byte would be too short to attempt to match to a candidate vector of raw data, because a pointer to the vector of raw data would be longer than the raw data itself. For raw data whose length exceeds the minimum threshold, if the raw data does not match an existing candidate vector of raw data, the raw data may be added as a new vector of raw data.
Next, process 500 transitions to step 505, at which vectors determined in step 503 may be mapped to a respective bit marker from the table of (marker, vector) pairs. The bit marker is a short way to refer to the associated vector.
Next, process 500 transitions to step 507, at which the bit marker from the table of (marker, vector) pairs is stored in memory, such as RAM storage unit 220.
Process 550 begins at step 551, at which a block of encoded data to be decoded is read from a memory, such as RAM storage unit 220. Addresses may be managed by virtual address adjustment methods and tables, as known to persons of skill in the art.
Next, process 550 transitions to step 553, at which bit markers are extracted from the encoded data.
Next, process 550 transitions to step 555, at which the extracted bit markers from step 553 are searched for in the table of (marker, vector) pairs.
Next, process 550 transitions to step 557, at which a raw data vector is extracted from an entry in the table of (marker, vector) pairs, corresponding to the extracted bit marker from step 553.
Next, process 550 transitions to step 559, at which the extracted raw data vectors from step 557 are combined to form reconstructed decoded data. If the combined raw data vectors do not cover all addresses within an entire expected address range of the reconstructed decoded data, the uncovered addresses may be deemed to take on a default value in the decoded data, e.g., 0x00 or 0xFF bytes.
Process 600 begins at step 601, at which memory resources to be backed up from the source system are identified. For example, the memory resources may correspond to an entire server, or a virtual server dedicated to a particular function or group (e.g., accounting functions), or correspond to another similar computing system. More particularly, the memory resources may correspond to one or more processes executing on a source system (i.e., a system to be backed-up). A virtual server may be hosted on a physical server along with other virtual servers dedicated to other functions respectively such as sales and marketing, engineering department, etc.
Next, process 600 transitions to step 603, at which the memory contents identified in step 601 are retrieved from the source system (i.e., the system to be backed up). Control of process 600 may then transfer to encoding process 500 for further processing. The memory contents identified in step 601 may be used as the blocks of raw data input to be encoded by process 500. The blocks of raw data may be divided in substantially any convenient way prior to transfer to encoding process 500. For example, blocks of raw data may have substantially uniform block size (e.g., 1 Mbyte per block of raw data), or a block of raw data may correspond to a memory space used by a respective process of the server being backed up, and so forth. In some embodiments, a marker table as described in the '175 application may be referenced by more than one blink backup.
Process 650 begins at step 651, at which embodiments identify a system to restore.
Next, process 650 transitions to step 653, at which encoded contents corresponding to the server to be restored are retrieved from an encoded memory such as NV-DIMM 309.
Next, process 650 transitions to step 655, at which a decoding process such as decoding process 550 is invoked in order to decode the retrieved encoded contents from step 653.
Next, process 650 transitions to step 657, at which the decoded data is saved into the memory space of a target system. The decoded data may be stored at the same memory addresses as it occupied on the source system.
While the foregoing is directed to embodiments of the present invention, other and further embodiments of the present invention may be devised without departing from the basic scope thereof. It is understood that various embodiments described herein may be utilized in combination with any other embodiment described, without departing from the scope contained herein. Further, the foregoing description is not intended to be exhaustive or to limit the invention to the precise form disclosed. Modifications and variations are possible in light of the above teachings or may be acquired from practice of the invention. Certain exemplary embodiments may be identified by use of an open-ended list that includes wording to indicate that the list items are representative of the embodiments and that the list is not intended to represent a closed list exclusive of further embodiments. Such wording may include “e.g.,” “etc.,” “such as,” “for example,” “and so forth,” “and the like,” etc., and other wording as will be apparent from the surrounding context.
No element, act, or instruction used in the description of the present application should be construed as critical or essential to the invention unless explicitly described as such. Also, as used herein, the article “a” is intended to include one or more items. Where only one item is intended, the term “one” or similar language is used. Further, the terms “any of” followed by a listing of a plurality of items and/or a plurality of categories of items, as used herein, are intended to include “any of,” “any combination of,” “any multiple of,” and/or “any combination of multiples of” the items and/or the categories of items, individually or in conjunction with other items and/or other categories of items.
Moreover, the claims should not be read as limited to the described order or elements unless stated to that effect. In addition, use of the term “means” in any claim is intended to invoke 35 U.S.C. § 112, ¶6, and any claim without the word “means” is not so intended.
This application is a continuation of U.S. patent application Ser. No. 15/089,837, filed Apr. 4, 2016, now U.S. Pat. No. 9,817,728, which is a continuation in part of U.S. patent application Ser. No. 14/804,175, filed on Jul. 20, 2015, now U.S. Pat. No. 9,304,703, which in turn claims the benefit of U.S. Provisional Patent Application Ser. No. 62/148,160, filed on Apr. 15, 2015. U.S. patent application Ser. No. 15/089,837 is also a continuation in part of U.S. patent application Ser. No. 13/908,239, filed Jun. 3, 2013, now U.S. Pat. No. 9,467,294, which in turn is a continuation in-part both of application Ser. No. 13/797,093, filed on Mar. 12, 2013, and of application Ser. No. 13/756,921, filed on Feb. 1, 2013. U.S. patent application Ser. No. 15/089,837 also claims the benefit of U.S. Provisional Patent Application Ser. No. 62/202,983, filed on Aug. 10, 2015. The entire disclosure of each of the afore-referenced priority applications is incorporated by reference into the instant specification.
Number | Name | Date | Kind |
---|---|---|---|
3016527 | Gilbert et al. | Jan 1962 | A |
3739410 | Fortin | Jun 1973 | A |
3926346 | Dub et al. | Dec 1975 | A |
4183464 | Babb | Jan 1980 | A |
4286256 | Langdon, Jr. et al. | Aug 1981 | A |
D264844 | Tuck | Jun 1982 | S |
4420767 | Hodge et al. | Dec 1983 | A |
4560977 | Murakami et al. | Dec 1985 | A |
4625710 | Harada et al. | Dec 1986 | A |
4635141 | Coulter | Jan 1987 | A |
D304193 | Lotz | Oct 1989 | S |
D308671 | Aderman et al. | Jun 1990 | S |
4931340 | Baba et al. | Jun 1990 | A |
D319765 | McCord | Sep 1991 | S |
5168171 | Tracewell | Dec 1992 | A |
D341866 | Ross | Nov 1993 | S |
5300930 | Burger et al. | Apr 1994 | A |
D353182 | Rubin | Dec 1994 | S |
D357461 | Zaplatynsky et al. | Apr 1995 | S |
D362243 | Spechts et al. | Sep 1995 | S |
D366246 | Simek et al. | Jan 1996 | S |
D372909 | Naufel | Aug 1996 | S |
D377482 | Geck | Jan 1997 | S |
D382880 | Cienkus et al. | Aug 1997 | S |
D391938 | D'Agaro | Mar 1998 | S |
D393455 | D'Agaro et al. | Apr 1998 | S |
5748921 | Lambrecht et al. | May 1998 | A |
5751549 | Eberhardt et al. | May 1998 | A |
5784611 | Thantrakul | Jul 1998 | A |
5785799 | Culnane et al. | Jul 1998 | A |
D396690 | Fryers | Aug 1998 | S |
D397097 | McNally | Aug 1998 | S |
5797143 | Buxton | Aug 1998 | A |
5818877 | Tsai et al. | Oct 1998 | A |
5867180 | Katayama et al. | Feb 1999 | A |
5872530 | Domyo et al. | Feb 1999 | A |
D407079 | Wu | Mar 1999 | S |
5878240 | Tomko | Mar 1999 | A |
5890794 | Abtahi et al. | Apr 1999 | A |
D409171 | Wu | May 1999 | S |
5923860 | Olarig | Jul 1999 | A |
D415747 | Wu | Oct 1999 | S |
D421428 | Wu | Mar 2000 | S |
D422993 | Storti et al. | Apr 2000 | S |
D423479 | Alo et al. | Apr 2000 | S |
6052785 | Lin et al. | Apr 2000 | A |
6067227 | Katsui et al. | May 2000 | A |
D431241 | Armstrong et al. | Sep 2000 | S |
6182601 | Baatz | Feb 2001 | B1 |
D439566 | Ohanian | Mar 2001 | S |
6243831 | Mustafa et al. | Jun 2001 | B1 |
6275173 | Wu | Aug 2001 | B1 |
D447484 | Reznikov et al. | Sep 2001 | S |
6297742 | Canada et al. | Oct 2001 | B1 |
6297753 | Hayami | Oct 2001 | B1 |
6310564 | Fujimoto | Oct 2001 | B1 |
6326781 | Kunde et al. | Dec 2001 | B1 |
6373695 | Cheng | Apr 2002 | B1 |
6396027 | Wu | May 2002 | B1 |
6401807 | Wyler et al. | Jun 2002 | B1 |
D462075 | Hillyard et al. | Aug 2002 | S |
6430351 | Takahashi et al. | Aug 2002 | B1 |
6442031 | Liu | Aug 2002 | B1 |
6465969 | Murasko et al. | Oct 2002 | B1 |
6483439 | Vukosic | Nov 2002 | B1 |
6494780 | Norbury, Jr. | Dec 2002 | B1 |
D471912 | Camarota et al. | Mar 2003 | S |
6541921 | Luciano, Jr. et al. | Apr 2003 | B1 |
D475061 | Huang | May 2003 | S |
6560599 | Boa | May 2003 | B1 |
6605778 | Dorfler et al. | Aug 2003 | B2 |
6614369 | Widmer | Sep 2003 | B1 |
6621935 | Xin et al. | Sep 2003 | B1 |
6626557 | Taylor | Sep 2003 | B1 |
6644481 | Dean et al. | Nov 2003 | B2 |
D483374 | Hung | Dec 2003 | S |
D483378 | Mundt | Dec 2003 | S |
6658435 | McCall | Dec 2003 | B1 |
6674908 | Aronov | Jan 2004 | B1 |
6683545 | Strasser | Jan 2004 | B2 |
D490083 | Wu | May 2004 | S |
6737299 | Jiang | May 2004 | B1 |
6785133 | Barringer et al. | Aug 2004 | B2 |
6785815 | Serret-Avila | Aug 2004 | B1 |
6829695 | Ross | Dec 2004 | B1 |
6844824 | Vukosic | Jan 2005 | B2 |
D503717 | Kawamura | Apr 2005 | S |
6904484 | Nelson | Jun 2005 | B1 |
6905228 | Takeyasu et al. | Jun 2005 | B1 |
6926972 | Jakobi et al. | Aug 2005 | B2 |
6956745 | Kerrigan et al. | Oct 2005 | B2 |
D513751 | Alo et al. | Jan 2006 | S |
6999319 | Wu et al. | Feb 2006 | B2 |
7030837 | Vong et al. | Apr 2006 | B1 |
7064265 | Cochrane | Jun 2006 | B2 |
7111961 | Trenchard et al. | Sep 2006 | B2 |
D529915 | Scicluna et al. | Oct 2006 | S |
D530052 | Berti | Oct 2006 | S |
D530343 | Maruyama et al. | Oct 2006 | S |
D530704 | Cortes | Oct 2006 | S |
7145776 | King, Jr. et al. | Dec 2006 | B2 |
D535298 | Cochrane | Jan 2007 | S |
7174436 | Langendorf et al. | Feb 2007 | B1 |
7231560 | Lai et al. | Jun 2007 | B2 |
7246037 | Evans | Jul 2007 | B2 |
7290116 | Grohoski et al. | Oct 2007 | B1 |
D555159 | Cox et al. | Nov 2007 | S |
D556204 | Tosh et al. | Nov 2007 | S |
7298535 | Kuutti | Nov 2007 | B2 |
D565573 | Alo | Apr 2008 | S |
7356679 | Le et al. | Apr 2008 | B1 |
7357530 | Wang et al. | Apr 2008 | B2 |
7363331 | Karasudani | Apr 2008 | B2 |
D570851 | Gundogan et al. | Jun 2008 | S |
7371975 | Oettinger et al. | Jun 2008 | B2 |
D579455 | Chu | Oct 2008 | S |
7463163 | Wu | Dec 2008 | B2 |
7464581 | Moriya et al. | Dec 2008 | B2 |
7485510 | Zhu et al. | Feb 2009 | B2 |
7492607 | Nguyen et al. | Feb 2009 | B2 |
D590831 | Evans | Apr 2009 | S |
7515413 | Curtis | Apr 2009 | B1 |
7516272 | Felton et al. | Apr 2009 | B2 |
7539026 | Finnerty et al. | May 2009 | B2 |
D593565 | Dearborn et al. | Jun 2009 | S |
7587408 | Snapp et al. | Sep 2009 | B2 |
7620784 | Panabaker | Nov 2009 | B2 |
D609236 | Matsumoto et al. | Feb 2010 | S |
7726837 | Ewert | Jun 2010 | B2 |
7731180 | Ohnishi | Jun 2010 | B2 |
D619108 | Lin | Jul 2010 | S |
7794124 | Hulsey et al. | Sep 2010 | B2 |
7822946 | Sharma | Oct 2010 | B2 |
D631480 | Vaughan | Jan 2011 | S |
D631630 | Berti | Jan 2011 | S |
7921088 | Mittal | Apr 2011 | B1 |
7925389 | Bradicich et al. | Apr 2011 | B2 |
7930473 | Rajan | Apr 2011 | B2 |
D643434 | Grady, IV et al. | Aug 2011 | S |
7991941 | Fortin | Aug 2011 | B2 |
7996361 | Shah et al. | Aug 2011 | B1 |
8001079 | Lu et al. | Aug 2011 | B2 |
8006108 | Brey et al. | Aug 2011 | B2 |
8009069 | Chen et al. | Aug 2011 | B2 |
D646954 | Azelton et al. | Oct 2011 | S |
8078789 | Hinrichs | Dec 2011 | B2 |
8117028 | Murashima | Feb 2012 | B2 |
D656250 | Forster et al. | Mar 2012 | S |
D656502 | Cacioppo et al. | Mar 2012 | S |
8129742 | Lin et al. | Mar 2012 | B2 |
8139945 | Amir et al. | Mar 2012 | B1 |
8164490 | Itani | Apr 2012 | B2 |
D659136 | Matsumoto | May 2012 | S |
D659137 | Matsumoto | May 2012 | S |
D659653 | Lin | May 2012 | S |
D661696 | Takada | Jun 2012 | S |
D662501 | Lohman | Jun 2012 | S |
D662504 | Lohman | Jun 2012 | S |
8200923 | Healey et al. | Jun 2012 | B1 |
D663299 | Corke et al. | Jul 2012 | S |
8214425 | Provencal | Jul 2012 | B2 |
8229898 | Pype | Jul 2012 | B1 |
8237594 | Suzuki et al. | Aug 2012 | B2 |
8238091 | Chang et al. | Aug 2012 | B2 |
8238840 | Lio et al. | Aug 2012 | B2 |
8265323 | Stiehl et al. | Sep 2012 | B2 |
8290160 | Steeger | Oct 2012 | B1 |
8310830 | Zheng et al. | Nov 2012 | B2 |
8314555 | Huang et al. | Nov 2012 | B2 |
8322040 | Jimenez | Dec 2012 | B2 |
8334838 | Sadahiro et al. | Dec 2012 | B2 |
D676039 | Wallace et al. | Feb 2013 | S |
D676852 | Lohman | Feb 2013 | S |
8366464 | Figuerado et al. | Feb 2013 | B1 |
D678273 | Kuehn et al. | Mar 2013 | S |
D681635 | Wang | May 2013 | S |
D682267 | Mase | May 2013 | S |
8470388 | Zsinko et al. | Jun 2013 | B1 |
D685373 | Santos et al. | Jul 2013 | S |
8474994 | Campman | Jul 2013 | B2 |
8508928 | Killen et al. | Aug 2013 | B2 |
8547825 | Armstrong et al. | Oct 2013 | B2 |
8560501 | Deetz | Oct 2013 | B2 |
8566288 | Deetz | Oct 2013 | B1 |
8570738 | Fan et al. | Oct 2013 | B2 |
D694240 | Cho | Nov 2013 | S |
8583194 | Lio et al. | Nov 2013 | B2 |
8589643 | Meyer et al. | Nov 2013 | B2 |
D694758 | Muller | Dec 2013 | S |
8601201 | Scannell et al. | Dec 2013 | B2 |
8639849 | Achler | Jan 2014 | B2 |
D699212 | Tanaka | Feb 2014 | S |
D702650 | Reed et al. | Apr 2014 | S |
8704771 | Shigeta | Apr 2014 | B2 |
D705836 | Huschka | May 2014 | S |
8715127 | Beutler et al. | May 2014 | B2 |
8717764 | Sun | May 2014 | B2 |
D706780 | Abdollahi et al. | Jun 2014 | S |
8782463 | Singh | Jul 2014 | B1 |
8793684 | Breitgand et al. | Jul 2014 | B2 |
D711382 | Eriksen | Aug 2014 | S |
8832352 | Tsirkin et al. | Sep 2014 | B2 |
8839112 | Neerudu et al. | Sep 2014 | B2 |
8868860 | Beeken | Oct 2014 | B2 |
D719128 | Teulie | Dec 2014 | S |
D719571 | Sugilhara et al. | Dec 2014 | S |
D720353 | Nakamura | Dec 2014 | S |
D720357 | Kwon et al. | Dec 2014 | S |
8930647 | Smith | Jan 2015 | B1 |
8938643 | Karmarkar et al. | Jan 2015 | B1 |
D722060 | Kwon et al. | Feb 2015 | S |
D722995 | Moreau | Feb 2015 | S |
8954645 | North et al. | Feb 2015 | B2 |
8964385 | Lam et al. | Feb 2015 | B2 |
D723554 | Choo et al. | Mar 2015 | S |
D723555 | Choo et al. | Mar 2015 | S |
8988821 | Li | Mar 2015 | B2 |
D726180 | Roat et al. | Apr 2015 | S |
9003144 | Hayes et al. | Apr 2015 | B1 |
D729242 | Kim et al. | May 2015 | S |
D729809 | Akana et al. | May 2015 | S |
D730307 | Tang et al. | May 2015 | S |
9035786 | Clifford et al. | May 2015 | B2 |
D731010 | Levitt et al. | Jun 2015 | S |
D731484 | Olsson et al. | Jun 2015 | S |
D733137 | Kawai | Jun 2015 | S |
D734754 | Ficacci | Jul 2015 | S |
D735726 | Chen | Aug 2015 | S |
9106020 | Cohen et al. | Aug 2015 | B2 |
D740817 | Ignomirello | Oct 2015 | S |
D740818 | Ignomirello | Oct 2015 | S |
D741333 | Aoyagi et al. | Oct 2015 | S |
9170831 | Robinson et al. | Oct 2015 | B2 |
D742876 | Ignomirello | Nov 2015 | S |
D742883 | Akana et al. | Nov 2015 | S |
D742887 | Ignomirello | Nov 2015 | S |
D743404 | Ignomirello | Nov 2015 | S |
9183158 | O'Loughlin et al. | Nov 2015 | B2 |
9304703 | Ignomirello | Apr 2016 | B1 |
9389937 | Ackaret et al. | Jul 2016 | B2 |
D768135 | Ignomirello | Oct 2016 | S |
D768136 | Ignomirello | Oct 2016 | S |
9467294 | Ignomirello | Oct 2016 | B2 |
9584312 | Ignomirello | Feb 2017 | B2 |
9603251 | Ignomirello | Mar 2017 | B1 |
9628108 | Ignomirello | Apr 2017 | B2 |
D786258 | Ignomirello | May 2017 | S |
20020122597 | Kikuchi et al. | Sep 2002 | A1 |
20020172203 | Ji et al. | Nov 2002 | A1 |
20030018759 | Baumann | Jan 2003 | A1 |
20030115447 | Pham et al. | Jun 2003 | A1 |
20030122694 | Green | Jul 2003 | A1 |
20040017651 | Gan et al. | Jan 2004 | A1 |
20040143733 | Ophir et al. | Jul 2004 | A1 |
20040262409 | Crippen et al. | Dec 2004 | A1 |
20050091440 | Isa et al. | Apr 2005 | A1 |
20050099319 | Hutchison et al. | May 2005 | A1 |
20050191520 | Guntermann et al. | Sep 2005 | A1 |
20050198076 | Stata et al. | Sep 2005 | A1 |
20050210314 | Iguchi | Sep 2005 | A1 |
20050288800 | Smith et al. | Dec 2005 | A1 |
20060006517 | Lee et al. | Jan 2006 | A1 |
20060049956 | Taylor et al. | Mar 2006 | A1 |
20060171050 | Hanson et al. | Aug 2006 | A1 |
20060174140 | Harris et al. | Aug 2006 | A1 |
20060212644 | Acton et al. | Sep 2006 | A1 |
20060248273 | Jernigan, IV | Nov 2006 | A1 |
20060256866 | Ziauddin et al. | Nov 2006 | A1 |
20060285287 | Chen et al. | Dec 2006 | A1 |
20070081320 | Gilbert | Apr 2007 | A1 |
20070087586 | Karamooz | Apr 2007 | A1 |
20070101074 | Patterson | May 2007 | A1 |
20070164875 | Fredericks et al. | Jul 2007 | A1 |
20070180207 | Garfinkle | Aug 2007 | A1 |
20070206375 | Piepgras et al. | Sep 2007 | A1 |
20070236334 | Borovoy et al. | Oct 2007 | A1 |
20070291934 | Volkovs et al. | Dec 2007 | A1 |
20080005380 | Kawasaki et al. | Jan 2008 | A1 |
20080054845 | Wang | Mar 2008 | A1 |
20080059702 | Lu et al. | Mar 2008 | A1 |
20080062020 | Lakus-Becker | Mar 2008 | A1 |
20080077586 | Lam | Mar 2008 | A1 |
20080133835 | Zhu et al. | Jun 2008 | A1 |
20080291664 | Pesenti | Nov 2008 | A1 |
20080307128 | Amron | Dec 2008 | A1 |
20080310628 | Fujioka | Dec 2008 | A1 |
20090006640 | Brouwer | Jan 2009 | A1 |
20090040032 | Gerber | Feb 2009 | A1 |
20090055593 | Satoyama | Feb 2009 | A1 |
20090061756 | Germagian | Mar 2009 | A1 |
20090100236 | Puig | Apr 2009 | A1 |
20090112880 | Oliveira et al. | Apr 2009 | A1 |
20090115646 | Duxbury | May 2009 | A1 |
20090119468 | Taylor et al. | May 2009 | A1 |
20090129691 | Luttmer et al. | May 2009 | A1 |
20090141435 | Kreiner et al. | Jun 2009 | A1 |
20090169001 | Tighe et al. | Jul 2009 | A1 |
20090193161 | Yoshida | Jul 2009 | A1 |
20090208221 | Sasai | Aug 2009 | A1 |
20090231153 | Hauenstein et al. | Sep 2009 | A1 |
20090300301 | Vaghani | Dec 2009 | A1 |
20090303709 | Weatherley | Dec 2009 | A1 |
20090307251 | Heller et al. | Dec 2009 | A1 |
20100076527 | Hammond et al. | Mar 2010 | A1 |
20100162039 | Goroff et al. | Jun 2010 | A1 |
20100169287 | Klose | Jul 2010 | A1 |
20100211737 | Flynn et al. | Aug 2010 | A1 |
20100245665 | Chrnega et al. | Sep 2010 | A1 |
20100250501 | Mandagere et al. | Sep 2010 | A1 |
20100253617 | Lio et al. | Oct 2010 | A1 |
20100306294 | Schneider | Dec 2010 | A1 |
20110035361 | Soga | Feb 2011 | A1 |
20110107112 | Resch | May 2011 | A1 |
20110137519 | Christie | Jun 2011 | A1 |
20110170872 | Shin et al. | Jul 2011 | A1 |
20110276771 | Tajinna | Nov 2011 | A1 |
20110289294 | Maeda et al. | Nov 2011 | A1 |
20120076298 | Bolotov et al. | Mar 2012 | A1 |
20120124282 | Frank et al. | May 2012 | A1 |
20120131293 | Benhase et al. | May 2012 | A1 |
20120159282 | Ito | Jun 2012 | A1 |
20120166448 | Li et al. | Jun 2012 | A1 |
20120166757 | Volvovski | Jun 2012 | A1 |
20120191982 | Levin | Jul 2012 | A1 |
20120209448 | Brower | Aug 2012 | A1 |
20120209559 | Brower | Aug 2012 | A1 |
20120239860 | Atkisson et al. | Sep 2012 | A1 |
20120246472 | Berengoltz | Sep 2012 | A1 |
20120278382 | Faith | Nov 2012 | A1 |
20120278553 | Mudhiganti et al. | Nov 2012 | A1 |
20120285738 | Cochrane et al. | Nov 2012 | A1 |
20120303359 | Mizuguchi et al. | Nov 2012 | A1 |
20120330894 | Slik | Dec 2012 | A1 |
20130013618 | Heller et al. | Jan 2013 | A1 |
20130019076 | Amidi et al. | Jan 2013 | A1 |
20130106297 | Yeh | May 2013 | A1 |
20130111166 | Resch et al. | May 2013 | A1 |
20130211608 | Farrell et al. | Aug 2013 | A1 |
20130212161 | Ben-Shaul et al. | Aug 2013 | A1 |
20130268812 | Liu et al. | Oct 2013 | A1 |
20130283038 | Kulkarni et al. | Oct 2013 | A1 |
20140062307 | Spencer et al. | Mar 2014 | A1 |
20140082324 | Elhamias et al. | Mar 2014 | A1 |
20140119028 | Sato et al. | May 2014 | A1 |
20140146514 | Yahata | May 2014 | A1 |
20140211423 | Nguyen et al. | Jul 2014 | A1 |
20140223118 | Ignormirello | Aug 2014 | A1 |
20140223196 | Ignormirello | Aug 2014 | A1 |
20140258533 | Antony | Sep 2014 | A1 |
20140259014 | Watanabe et al. | Sep 2014 | A1 |
20140279911 | Ignormirello | Sep 2014 | A1 |
20140281257 | Hochberg et al. | Sep 2014 | A1 |
20140297938 | Puthiyedath et al. | Oct 2014 | A1 |
20140313043 | Heydron | Oct 2014 | A1 |
20140313700 | Connell et al. | Oct 2014 | A1 |
20140333449 | Thiesfeld et al. | Nov 2014 | A1 |
20150015405 | Bark et al. | Jan 2015 | A1 |
20150058543 | Chan et al. | Feb 2015 | A1 |
20150084270 | Lo et al. | Mar 2015 | A1 |
20150098205 | Keranen et al. | Apr 2015 | A1 |
20150117019 | Kuenzler et al. | Apr 2015 | A1 |
20150131965 | Yoshioka | May 2015 | A1 |
20150211916 | McGinn et al. | Jul 2015 | A1 |
20150212263 | Tzeng | Jul 2015 | A1 |
20150324388 | Benke et al. | Nov 2015 | A1 |
20160011802 | Berke | Jan 2016 | A1 |
20160043484 | Brodsky et al. | Feb 2016 | A1 |
20160085022 | Yang et al. | Mar 2016 | A1 |
20160092203 | Filali-Adib et al. | Mar 2016 | A1 |
20160217047 | Ignormirello et al. | Jul 2016 | A1 |
20160218737 | Ignomirello | Jul 2016 | A1 |
20160232839 | Ignomirello | Aug 2016 | A1 |
20170026172 | Ignomirello | Jan 2017 | A1 |
20170220498 | Ignomirello | Aug 2017 | A1 |
20170221322 | Ignomirello | Aug 2017 | A1 |
Number | Date | Country |
---|---|---|
H07-504541 | May 1995 | JP |
2000-31831 | Jan 2000 | JP |
2007-281763 | Oct 2007 | JP |
2008-107615 | May 2008 | JP |
2010-512057 | Apr 2010 | JP |
2012-80470 | Apr 2012 | JP |
2012-129785 | Jul 2012 | JP |
WO 2006042019 | Apr 2006 | WO |
WO 2014121102 | Aug 2014 | WO |
WO 2014170617 | Oct 2014 | WO |
WO 2015039181 | Mar 2015 | WO |
Entry |
---|
“Disk Cloning and Mass System Deployment” retrieved from http://www.drive-image.com/Disk_Cloning_and_Mass_System_Deployment.shtml, 21 pages. |
“Ntfsclone-Efficiently clone, image, restore or rescue an NTFS”, Ubuntu, retrieved from http://manpages.ubuntu.com/manpages/gutsy/man8/ntfsclone.8.html, 4 pages. |
Anonymous: “Find Seed from Random Numbers”, Blitz Research Programming Forums, Dec. 4, 2011 (Dec. 4, 2011), XP055297586, retrieved from the Internet: http://web.archive.org/web/20111204053405/http://blitzbasic.com/Community/posts.php?topic=61025 (5 pages total). |
Anonymous: “Huffman Coding”, Wikipedia, the free encyclopedia, Jan. 18, 2013 (Jan. 18, 2013), pp. 1-10, XP055303125, Retrieved from the Internet: http://en.wikipedia.org/w/index.phptitle=Huffmancoding&oldid=533661878 [retrieved on Sep. 15, 2016] (10 pages total). |
Dictionary Techniques, C.M. Liu, National Chiao-Tung University Website, Dec. 31, 2010, website: http://people.cs.nctu.edu.tw/˜cmliu/Courses/Compression/chap5.pdf, 137 pages. |
European Search Report dated Sep. 5, 2016 in connection with corresponding EP Patent Application No. 16165443.9 (9 pages total). |
Extended European Search Report dated Aug. 19, 2016 issued in connection with corresponding EP Application No. 14745861.6 (9 pages total). |
Extended European Search Report dated Sep. 26, 2016 issued in connection with corresponding EP Application No. 14745756.8 (9 pages total). |
Gilbert, “The Bus (PCI and PCI-Express)”, retrieved from hppt://www.yale.edu/pclt/PCHW/BUS.HTM on Apr. 28, 2015 dated Jan. 4, 2008, 5 pages. |
Hardware Secrets, “Everything You Need to Know About the PCI Express”, retrieved from http://www.hardwaresecrets.com/article/EverythingYouNeedtoKnowAboutthePCIExpress/190 on Jul. 12, 2012, 3 pages. |
Intel, “Intel 64 and IA-32 Architectures Optimization Reference Manual”, Manual, Sep. 2014, 642. |
International Computer Concepts Inc, “PCI & PCIe Overview/Comparision”, retrieved from http://www.iccusa.com/comparepci/ on Apr. 28, 2015, 5 pages. |
International Preliminary Report on Patentability dated Aug. 13, 2015 issued in connection with International Application No. PCT/US2014/014209, 8 pages. |
International Preliminary Report on Patentability dated Aug. 13, 2015 issued in connection with International Application No. PCT/US2014/014225, 7 pages. |
International Search Report and Written Opinion dated Aug. 20, 2014 issued in connection with International Application No. PCT/US2014/014209, 5 pages. |
International Search Report and Written Opinion dated Jan. 16, 2015 issued in connection with International Application No. PCT/US2014/014225, 2 pages. |
Lillibridge, M., Eshghi, K., Bhagwat, D., Deolalikar, V., Trezise, G., and Camble, P. 2009. Sparse indexing: Large scale, inline deduplication using sampling and locality. In Proceedings of the 7th USENIX Conference on File and Storage Technologies (FAST). USENIX Association, Berkely, CA, 111-123. |
Makatos, Thano, et al., ZBD: Using Transparent Compression at the Block Level to Increase Storage Space Efficiency, IEEE Computer Society pp. 61-70 (2010). |
Oracle Corp, “I/O Domains and PCI Express Buses”, retrieved from docs.oracle.com/cd/E1960401/8210406/configurepciexpressbusesacrossmultipledoms/index.html on Apr. 28, 2015, 3 pages. |
Saduqulla et al., “Threshold Proxy Re-Encryption in Cloud Storage System”, International Journal of Advanced Research in Computer Science and Software Engineering, vol. 3, Issue 11, retrieved from http://www.ijarcsse.com/docs/papers/Volume_3/11_November2013/V3/11-0332.pdf, dated Nov. 2013, 5 pages. |
Seagate, SCSI Commands Reference Manual (Feb. 14, 2006). |
Smith, Steven W. Data Compression Tutorial: Part 1,: EE Times, Jun. 14, 2007. |
Sun Microsystems, Best Practices for Sun StorEdge 6920 System (Nov. 2004). |
Symbolic IO Corporation, International Search Report and Written Opinion dated May 3, 2016, for PCT/US16/25988, 8 pages. |
Tate, Jon, et al., Real-time Compression in SAN Volume Controller and the Storwize V 7000, IBM (Aug. 17, 2012). |
Wylie et al., “Selecting the right data distribution scheme for a survivable storage system”, CMU-CS-01-120, Carnegie Mellon University, retrieved from http://www.pdl.cmu.edu/PDL-FTP/Storage/CMU-CS-01-120.pdf, dated May 2001, 23 pages. |
Xilinx, Inc., Virtex-5 Family Overview, Feb. 6, 2009, 13 pages. |
Number | Date | Country | |
---|---|---|---|
62202983 | Aug 2015 | US | |
62148160 | Apr 2015 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15089837 | Apr 2016 | US |
Child | 15728347 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14804175 | Jul 2015 | US |
Child | 15089837 | US | |
Parent | 13908239 | Jun 2013 | US |
Child | 14804175 | US | |
Parent | 13797093 | Mar 2013 | US |
Child | 13908239 | US | |
Parent | 13756921 | Feb 2013 | US |
Child | 13797093 | US |