A distributed storage system may include a plurality of storage devices (e.g., storage arrays) to provide data storage to a plurality of nodes. The plurality of storage devices and the plurality of nodes may be situated in the same physical location, or in one or more physically remote locations. The plurality of nodes may be coupled to the storage devices by a high-speed interconnect, such as a switch fabric.
In order to save space on the storage devices and/or to reduce data transferred by the interconnect, many storage systems may employ data compression. However, performing data compression can be computation-intensive, and reduce system performance by consuming system processing resources rather than increase system performance by reducing the size of stored and/or transferred data.
This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
One aspect may provide a method for receiving an input/output (I/O) request by a storage system having at least one storage volume. The I/O request has associated payload data. The I/O request is performed with early prediction compression by compressing a first portion of the payload data and determining whether one or more remaining portions of the I/O request should be processed in a compressed manner or an uncompressed manner based, at least in part, upon the results of compressing the first portion of the payload data.
Another aspect may provide a system including a processor and a memory storing computer program code that when executed on the processor causes the processor to execute an input/output (I/O) request received by a storage system having at least one storage volume. The I/O request has associated payload data. The program code is operable to perform the operations of performing the I/O request with early prediction compression by compressing a first portion of the payload data and determining whether one or more remaining portions of the I/O request should be processed in a compressed manner or an uncompressed manner based, at least in part, upon the results of compressing the first portion of the payload data.
Another aspect may provide a computer program product including a non-transitory computer readable storage medium having computer program code encoded thereon that when executed on a processor of a computer causes the computer to execute an input/output (I/O) request received by a storage system having at least one storage volume. The I/O request has associated payload data. The computer program product includes computer program code for performing the I/O request with early prediction compression by compressing a first portion of the payload data and determining whether one or more remaining portions of the I/O request should be processed in a compressed manner or an uncompressed manner based, at least in part, upon the results of compressing the first portion of the payload data.
Objects, aspects, features, and advantages of embodiments disclosed herein will become more fully apparent from the following detailed description, the appended claims, and the accompanying drawings in which like reference numerals identify similar or identical elements. Reference numerals that are introduced in the specification in association with a drawing figure may be repeated in one or more subsequent figures without additional description in the specification in order to provide context for other features. For clarity, not every element may be labeled in every figure. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating embodiments, principles, and concepts. The drawings are not meant to limit the scope of the claims included herewith.
Storage system 100 may include at least one source site 102 and at least one target site 112, which may be co-located or geographically separated. Source site 102 may include one or more processors 105, storage application 106, and storage 108. In some embodiments, storage 108 may include one or more storage volumes 1351-S, that operate as active or production volumes. Source site 102 and target site 112 may be in communication with one or more hosts 113 via communication links 111 and 115, respectively.
Hosts 113 may perform input/output (I/O) operations on source-side storage 108 (e.g., read data from and write data to storage 108). In some embodiments, the I/O operations may be intercepted by and controlled by storage application 106. As changes are made to data stored on storage 108 via the I/O operations from hosts 113, or over time as storage system 100 operates, storage application 106 may perform operations to replicate data from source site 102 to target site 112 over communication link 110. In some embodiments, communication link 110 may be a long distance communication link of a storage area network (SAN), such as an Ethernet or Internet (e.g., TCP/IP) link that may employ, for example, the iSCSI protocol. In some embodiments, one or both of source site 102 and/or target site 112 may include one or more internal (e.g., short distance) communication links (shown as communication links 109 and 119), such as an InfiniBand (IB) link or Fibre Channel (FC) link. Communication link 109 may be employed to transfer data between storage volumes 1351-S of storage 108 and one or both of storage application 106 and processor(s) 105. Communication link 119 may be employed to transfer data between storage volumes 1391-Z of storage 137 and one or both of replica manager 116 and processor(s) 133.
In illustrative embodiments, target site 112 may include replica manager 116 that manages a plurality of replicas 1181-N according to a policy 114 (e.g., a replication and/or retention policy). Replicas 118 may be stored in one or more volumes 1391-Z of storage 137 of target site 112. A replica (or snapshot) may be created from data within storage 108 and transferred to one or more target sites 112 during a data replication cycle that may be performed based on data replication policies (e.g., policy 114) that may define various settings for data recovery operations. A data replication cycle may be asynchronous data replication performed at time-based intervals during operation of storage system 100, or may alternatively be synchronous data replication performed when data is changed on source site 102.
In illustrative embodiments, storage system 100 may include one or more consistency groups. A consistency group 147 may include one or more volumes 135 of source site 102, each associated with a corresponding volume 139 of target site 112. Consistency group 147 may treat source volumes 135 and target volumes 139 as a single logical entity for data replication and migration. Each volume 139 may store one or more associated replicas 118 that reflect the data in the consistency group 147 at a point in time (e.g., when the replica 118 was created). For example, replicas (e.g., snapshots) 118 may be generated for each source volume 135 of consistency group 147 at the same time, and stored on associated ones of target volumes 139. As shown in
Referring to
Referring back to
In illustrative embodiments, source site 102 may send a replica (e.g., replica 155) to target site 112. Similarly to write request 151, replica 155 may include one or more data packets such as shown in
Referring to
Each physical block 306 may have a defined physical block size. For example, in solid state drives (SSDs), physical block sizes may be 16 KB, 8 KB, 4 KB, 2 KB, 512B, and 256B. In some embodiments, each volume 3041-304Q of storage array 302 may have an associated physical block size. For example, as shown in
In some embodiments, one or more of storage volumes 3041-304Q may employ the same block size, while, in some embodiments, each of storage volumes 3041-304Q may employ different block sizes. For example, in illustrative embodiments, storage volume 3041 may employ a first block size, storage volume 3042 may employ a second block size, and so forth. In some embodiments, each storage volume 3041-304Q may employ a unique block size, while in other embodiments, two or more of storage volumes 3041-304Q may employ a common block size. In an embodiment, storage volumes 3041-304Q may be implemented such that storage array 302 supports a plurality of granular block sizes.
For example, in an illustrative embodiment, one or more of storage volumes 3041-304Q may be implemented having a first block size (e.g., SIZE0), one or more of storage volumes 3041-304Q may be implemented having a second block size (e.g., SIZE1), one or more of storage volumes 3041-304Q may be implemented having a third block size (e.g., SIZE2), one or more of storage volumes 3041-304Q may be implemented having a fourth block size (e.g., SIZE3), and one or more of storage volumes 3041-304Q may be implemented having a fifth block size (e.g., SIZE4). In one embodiment, SIZE0>SIZE1>SIZE2>SIZE3>SIZE4. In other words, SIZE4 may be the smallest block size (e.g., SIZE4 may correspond to a sector or a page), and SIZE0 may be the largest block size (e.g., SIZE0 may correspond to the size of logical block 308).
Referring back to
For example, processor(s) 105 and/or storage application 106 may receive write request 151 as one or more packets, and each packet may include corresponding payload data (e.g., payload data 314 of
As described in regard to
In illustrative embodiments, if payload data 314 can be compressed to SIZE4 (or less, for example if payload data 314 is already smaller than SIZE4 or can be compressed to less than SIZE4), the payload data may be stored in a physical block having block size SIZE4. Otherwise, if payload data 314 can be compressed to SIZE3 (or less) but not SIZE4 or less, the payload data may be stored in a physical block having block size SIZE3, and so forth, for the various granular block sizes. If payload data 314 cannot be compressed to SIZE1 or less, the payload data may be stored, uncompressed, in a physical block having block size SIZE0. In some embodiments, block size SIZE0 (e.g., the largest block size) may be the same as the size of logical block 308.
In an illustrative embodiment, if payload data cannot be compressed to SIZE1 or less, the payload data may be stored, uncompressed, in a physical block of storage array 302 having a size of SIZE0. In general, it may not be easily determined whether, and by how much, a given set of data can be compressed without compressing the given set of data and determining results of the compression. Further, compression operations may consume system resources such as processor capacity (e.g., of processor(s) 105 and/or processor(s) 133 of
Illustrative embodiments may employ a compression operation with early compression prediction. In some embodiments, early compression prediction may determine whether a compression operation will reach one or more compression thresholds, and may stop performing compression if the compression operation will not successfully reach at least one of the compression thresholds (i.e., if the size of a given data set is unlikely to reach a compression threshold after performing the compression operation). Such embodiments will reduce system resource consumption (e.g., capacity of processor(s) 105 and/or processor(s) 133 of
Some embodiments may provide compression prediction that may predict whether a compression operation on a given set of payload data is unlikely to successfully compress the given set of payload data beyond a compression threshold. For example, if the input payload data is 8 KB and SIZE1 is 6 KB, some embodiments may perform compression on a first amount of payload data, such as 2 KB. After processing the first amount of payload data, a likelihood may be determined whether the compression operation will reach at least one of compression threshold. In some embodiments, the one or more compression thresholds may be set based upon the one or more physical block sizes (e.g., physical block sizes 382, 384, 386, as shown in
For example, if, after processing the first 2 KB of the 8 KB input payload data, the compression operation has only reduced the 2 KB payload data to 1.9 KB of compressed payload data, the achieved compression ratio is 1−(1.9/2)=5%. Based upon the achieved compression ratio, it may be determined that reaching one or more compression thresholds is unlikely. For example, achieving only a 5% compression ratio for the entire 8 KB payload data would reduce the payload data from 8 KB to 7.6 KB, which may not be small enough to fit within a next smaller block size of storage array 302 (e.g., physical block sizes 382, 384, 386, as shown in
Some illustrative embodiments may predict whether the compression operation will compress the data beyond a smallest data size. For example, if a smallest physical block size of storage array 302 is SIZE4, time spent compressing payload data to be smaller than SIZE4 wastes system resources (e.g., capacity of processor(s) 105 and/or processor(s) 133 of
In some embodiments, an aggressiveness of compression prediction may be adjusted, for example based upon one or more operating conditions of the storage system. For example, based on current system conditions and system (or user) requirements, described embodiments may determine which early compression thresholds to employ, and/or one or more settings to employ for the compression operation. For example, a current processor usage may be determined for one or more processors of the storage system (e.g., processor(s) 105 and/or processor(s) 133 of
Since there may be competing requirements for system performance, for example: (1) minimization of processor utilization, (2) minimization of communication link usage, (3) minimization of internal data transfers (e.g., within source 102 and/or target 112), (3) maximization of communication link throughput, among others, described embodiments may adjust the aggressiveness of compression prediction. For example, as shown in Table 1, when the processor use is low (e.g., lower than the processor utilization threshold) and/or the available storage capacity is low (e.g., lower than the free space threshold), illustrative embodiments may employ early compression thresholds that allow additional compression to be performed before stopping the compression operation. Alternatively, if the processor use is high (e.g., higher than the processor utilization threshold) and/or the available storage capacity is high (e.g., higher than the free space threshold), illustrative embodiments may employ early compression thresholds that reduce the amount of compression performed before stopping the compression operation.
Referring to
At block 406, one or more operating conditions of storage system 100 may be determined. For example, in an illustrative embodiment, a current processor utilization may be determined (e.g., of processor(s) 105 and/or processor(s) 133), a current available storage capacity may be determined (e.g., of storage 108 and/or storage 137), and/or other system operating conditions may be determined. At block 408, a size of payload data associated with the write operation may be determined (e.g., a size of payload data 314 of
Referring to
In embodiments that determine operating conditions of the storage system, if, at block 406, processor(s) 105 are not utilized beyond a threshold and/or storage 108 is filled beyond a threshold, the early compression threshold may be set more aggressively (e.g., to a relatively smaller size value) to attempt to use less storage space. For example, the early compression threshold may be set based upon SIZE3. However, if, at block 406, processor(s) 105 are utilized beyond a threshold and/or storage 108 is not filled beyond a threshold, the early compression threshold may be set less aggressively (e.g., to a relatively larger size value) to attempt to use less processor resources. For example, the early compression threshold may be set based upon SIZE1.
At block 506, if the payload data associated with the write operation is already smaller than a smallest block size of storage 108 and/or storage 137 (e.g., smaller than SIZE4), then at block 512, the uncompressed payload data may be written to the storage without consuming processor capacity (e.g., of processor(s) 105 and/or processor(s) 133) to compress the payload data. At block 524, process 410′ may complete.
If, at block 506, the payload data associated with the write operation is not smaller than the smallest block size, then at block 508, a first portion of the payload data may be compressed. For example, in an illustrative embodiment, at block 508 a first 25% of the payload data may be compressed. At block 510, it may be determined whether the first portion of the payload data was successfully compressed beyond at least one of the early compression thresholds set at block 504, for example based upon the compression ratio achieved for the first portion of payload data.
If, at block 510, the first portion of the payload data was not compressed beyond at least one of the early compression thresholds, then at block 512, the uncompressed payload data may be written to storage (e.g., storage 108 and/or storage 137). If, at block 510, the first portion of the payload data was compressed beyond at least one of the early compression thresholds, then at block 514, if the payload data associated with the write operation is smaller than the smallest block size of storage 108 and/or storage 137 (e.g., smaller than SIZE4), then at block 522, the payload data may be written to the storage without further compression. At block 524, process 410′ may complete. If, at block 514, payload data associated with the write operation is not smaller than the smallest block size of storage 108 and/or storage 137 (e.g., smaller than SIZE4), then at block 516, if there are one or more additional portions of the payload data to compress, at block 518, at least one next portion of the payload data may be compressed, and process 410′ may return to block 510. If, at block 516, there are no more additional portions of the payload data to compress, at block 520, the compressed payload data is written to the storage (e.g., storage 108 and/or storage 137), and at block 524, process 410′ may complete.
Referring to
Processes 400 and 410′ (
The processes described herein are not limited to the specific embodiments described. For example, processes 400 and 410′ are not limited to the specific processing order shown in
Processor 602 may be implemented by one or more programmable processors executing one or more computer programs to perform the functions of the system. As used herein, the term “processor” describes an electronic circuit that performs a function, an operation, or a sequence of operations. The function, operation, or sequence of operations may be hard coded into the electronic circuit or soft coded by way of instructions held in a memory device. A “processor” may perform the function, operation, or sequence of operations using digital values or using analog signals. In some embodiments, the “processor” can be embodied in an application specific integrated circuit (ASIC). In some embodiments, the “processor” may be embodied in a microprocessor with associated program memory. In some embodiments, the “processor” may be embodied in a discrete electronic circuit. The “processor” may be analog, digital or mixed-signal. In some embodiments, the “processor” may be one or more physical processors or one or more “virtual” (e.g., remotely located or “cloud”) processors.
While illustrative embodiments have been described with respect to processes of circuits, described embodiments may be implemented as a single integrated circuit, a multi-chip module, a single card, or a multi-card circuit pack. Further, as would be apparent to one skilled in the art, various functions of circuit elements may also be implemented as processing blocks in a software program. Such software may be employed in, for example, a digital signal processor, micro-controller, or general purpose computer. Thus, described embodiments may be implemented in hardware, a combination of hardware and software, software, or software in execution by one or more processors.
Some embodiments may be implemented in the form of methods and apparatuses for practicing those methods. Described embodiments may also be implemented in the form of program code, for example, stored in a storage medium, loaded into and/or executed by a machine, or transmitted over some transmission medium or carrier, such as over electrical wiring or cabling, through fiber optics, or via electromagnetic radiation. A non-transitory machine-readable medium may include but is not limited to tangible media, such as magnetic recording media including hard drives, floppy diskettes, and magnetic tape media, optical recording media including compact discs (CDs) and digital versatile discs (DVDs), solid state memory such as flash memory, hybrid magnetic and solid state memory, non-volatile memory, volatile memory, and so forth, but does not include a transitory signal per se. When embodied in a non-transitory machine-readable medium, and the program code is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the method.
When implemented on a processing device, the program code segments combine with the processor to provide a unique device that operates analogously to specific logic circuits. Such processing devices may include, for example, a general purpose microprocessor, a digital signal processor (DSP), a reduced instruction set computer (RISC), a complex instruction set computer (CISC), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a programmable logic array (PLA), a microcontroller, an embedded controller, a multi-core processor, and/or others, including combinations of the above. Described embodiments may also be implemented in the form of a bitstream or other sequence of signal values electrically or optically transmitted through a medium, stored magnetic-field variations in a magnetic recording medium, etc., generated using a method and/or an apparatus as recited in the claims.
Various elements, which are described in the context of a single embodiment, may also be provided separately or in any suitable subcombination. It will be further understood that various changes in the details, materials, and arrangements of the parts that have been described and illustrated herein may be made by those skilled in the art without departing from the scope of the following claims.
Number | Name | Date | Kind |
---|---|---|---|
4164763 | Briccetti et al. | Aug 1979 | A |
4608839 | Tibbals, Jr. | Sep 1986 | A |
4821178 | Levin et al. | Apr 1989 | A |
5319645 | Bassi et al. | Jun 1994 | A |
5537534 | Voigt et al. | Jul 1996 | A |
5539907 | Srivastava et al. | Jul 1996 | A |
5627995 | Miller | May 1997 | A |
5710724 | Burrows | Jan 1998 | A |
5732273 | Srivastava et al. | Mar 1998 | A |
5802553 | Robinson | Sep 1998 | A |
5805932 | Kawashima | Sep 1998 | A |
5860137 | Raz et al. | Jan 1999 | A |
5896538 | Blandy et al. | Apr 1999 | A |
5903730 | Asai et al. | May 1999 | A |
5940618 | Blandy et al. | Aug 1999 | A |
5987250 | Subrahmanyam | Nov 1999 | A |
5999842 | Harrison et al. | Dec 1999 | A |
6182086 | Lomet et al. | Jan 2001 | B1 |
6208273 | Dye | Mar 2001 | B1 |
6226787 | Serra et al. | May 2001 | B1 |
6327699 | Larus et al. | Dec 2001 | B1 |
6353805 | Zahir et al. | Mar 2002 | B1 |
6470478 | Bargh et al. | Oct 2002 | B1 |
6519766 | Barritz et al. | Feb 2003 | B1 |
6624761 | Fallon | Sep 2003 | B2 |
6643654 | Patel et al. | Nov 2003 | B1 |
6654948 | Konuru et al. | Nov 2003 | B1 |
6658471 | Berry et al. | Dec 2003 | B1 |
6658654 | Berry et al. | Dec 2003 | B1 |
6801914 | Barga et al. | Oct 2004 | B2 |
6820218 | Barga et al. | Nov 2004 | B1 |
6870929 | Greene | Mar 2005 | B1 |
7099797 | Richard | Aug 2006 | B1 |
7143410 | Coffman et al. | Nov 2006 | B1 |
7190284 | Dye | Mar 2007 | B1 |
7251663 | Smith | Jul 2007 | B1 |
7315795 | Homma | Jan 2008 | B2 |
7389497 | Edmark et al. | Jun 2008 | B1 |
7421681 | DeWitt, Jr. et al. | Sep 2008 | B2 |
7552125 | Evans | Jun 2009 | B1 |
7574587 | DeWitt, Jr. et al. | Aug 2009 | B2 |
7693999 | Park | Apr 2010 | B2 |
7714747 | Fallon | May 2010 | B2 |
7774556 | Karamcheti | Aug 2010 | B2 |
7814218 | Knee et al. | Oct 2010 | B1 |
7827136 | Wang et al. | Nov 2010 | B1 |
7898442 | Sovik | Mar 2011 | B1 |
7908436 | Srinivasan et al. | Mar 2011 | B1 |
7962664 | Gotch | Jun 2011 | B2 |
8200923 | Healey et al. | Jun 2012 | B1 |
8335899 | Meiri et al. | Dec 2012 | B1 |
8478951 | Healey et al. | Jul 2013 | B1 |
8560926 | Yeh | Oct 2013 | B2 |
9037822 | Meiri et al. | May 2015 | B1 |
9104326 | Frank et al. | Aug 2015 | B2 |
9128942 | Pfau et al. | Sep 2015 | B1 |
9208162 | Hallak et al. | Dec 2015 | B1 |
9304889 | Chen et al. | Apr 2016 | B1 |
9317362 | Khan | Apr 2016 | B2 |
9330048 | Bhatnagar et al. | May 2016 | B1 |
9733854 | Sharma | Aug 2017 | B2 |
9762460 | Pawlowski et al. | Sep 2017 | B2 |
9769254 | Gilbert et al. | Sep 2017 | B2 |
9785468 | Mitchell et al. | Oct 2017 | B2 |
20010054131 | Alvarez, II | Dec 2001 | A1 |
20020056031 | Skiba et al. | May 2002 | A1 |
20020133512 | Milillo et al. | Sep 2002 | A1 |
20030023656 | Hutchison et al. | Jan 2003 | A1 |
20030079041 | Parrella, Sr. et al. | Apr 2003 | A1 |
20030131184 | Kever | Jul 2003 | A1 |
20030145251 | Cantrill | Jul 2003 | A1 |
20040030721 | Kruger et al. | Feb 2004 | A1 |
20050039171 | Avakian et al. | Feb 2005 | A1 |
20050071579 | Luick | Mar 2005 | A1 |
20050102547 | Keeton et al. | May 2005 | A1 |
20050125626 | Todd | Jun 2005 | A1 |
20050144416 | Lin | Jun 2005 | A1 |
20050171937 | Hughes et al. | Aug 2005 | A1 |
20050177603 | Shavit | Aug 2005 | A1 |
20050193084 | Todd et al. | Sep 2005 | A1 |
20060031653 | Todd et al. | Feb 2006 | A1 |
20060031787 | Ananth et al. | Feb 2006 | A1 |
20060047776 | Chieng et al. | Mar 2006 | A1 |
20060070076 | Ma | Mar 2006 | A1 |
20060123212 | Yagawa | Jun 2006 | A1 |
20060242442 | Armstrong et al. | Oct 2006 | A1 |
20070078982 | Aidun et al. | Apr 2007 | A1 |
20070208788 | Chakravarty et al. | Sep 2007 | A1 |
20070297434 | Arndt et al. | Dec 2007 | A1 |
20080098183 | Morishita et al. | Apr 2008 | A1 |
20080163215 | Jiang et al. | Jul 2008 | A1 |
20080178050 | Kern et al. | Jul 2008 | A1 |
20080243952 | Webman et al. | Oct 2008 | A1 |
20080288739 | Bamba et al. | Nov 2008 | A1 |
20090006745 | Cavallo et al. | Jan 2009 | A1 |
20090030986 | Bates | Jan 2009 | A1 |
20090049450 | Dunshea et al. | Feb 2009 | A1 |
20090055613 | Maki et al. | Feb 2009 | A1 |
20090089483 | Tanaka et al. | Apr 2009 | A1 |
20090100108 | Chen et al. | Apr 2009 | A1 |
20090222596 | Flynn et al. | Sep 2009 | A1 |
20090319996 | Shafi et al. | Dec 2009 | A1 |
20100042790 | Mondal et al. | Feb 2010 | A1 |
20100088296 | Periyagaram et al. | Apr 2010 | A1 |
20100190145 | Chu | Jul 2010 | A1 |
20100199066 | Artan et al. | Aug 2010 | A1 |
20100205330 | Noborikawa et al. | Aug 2010 | A1 |
20100223619 | Jaquet et al. | Sep 2010 | A1 |
20100257149 | Cognigni et al. | Oct 2010 | A1 |
20110060722 | Li et al. | Mar 2011 | A1 |
20110078494 | Maki et al. | Mar 2011 | A1 |
20110083026 | Mikami et al. | Apr 2011 | A1 |
20110099342 | Ozdemir | Apr 2011 | A1 |
20110119679 | Muppirala et al. | May 2011 | A1 |
20110161297 | Parab | Jun 2011 | A1 |
20110225122 | Denuit et al. | Sep 2011 | A1 |
20110289291 | Agombar et al. | Nov 2011 | A1 |
20120054472 | Altman et al. | Mar 2012 | A1 |
20120059799 | Oliveira et al. | Mar 2012 | A1 |
20120078852 | Haselton et al. | Mar 2012 | A1 |
20120124282 | Frank et al. | May 2012 | A1 |
20120278793 | Jalan et al. | Nov 2012 | A1 |
20120290546 | Smith et al. | Nov 2012 | A1 |
20120290798 | Huang et al. | Nov 2012 | A1 |
20120304024 | Rohleder et al. | Nov 2012 | A1 |
20130031077 | Liu et al. | Jan 2013 | A1 |
20130073527 | Bromley | Mar 2013 | A1 |
20130111007 | Hoffmann et al. | May 2013 | A1 |
20130138607 | Bashyam et al. | May 2013 | A1 |
20130151683 | Jain et al. | Jun 2013 | A1 |
20130151759 | Shim et al. | Jun 2013 | A1 |
20130246354 | Clayton et al. | Sep 2013 | A1 |
20130246724 | Furuya | Sep 2013 | A1 |
20130265883 | Henry et al. | Oct 2013 | A1 |
20130282997 | Suzuki et al. | Oct 2013 | A1 |
20130332610 | Beveridge | Dec 2013 | A1 |
20130339533 | Neerincx et al. | Dec 2013 | A1 |
20140032964 | Neerincx et al. | Jan 2014 | A1 |
20140040199 | Golab et al. | Feb 2014 | A1 |
20140040343 | Nickolov et al. | Feb 2014 | A1 |
20140136759 | Sprouse et al. | May 2014 | A1 |
20140161348 | Sutherland et al. | Jun 2014 | A1 |
20140195484 | Wang et al. | Jul 2014 | A1 |
20140237201 | Swift | Aug 2014 | A1 |
20140297588 | Babashetty et al. | Oct 2014 | A1 |
20140359231 | Matthews | Dec 2014 | A1 |
20140380282 | Ravindranath Sivalingam et al. | Dec 2014 | A1 |
20150006910 | Shapiro | Jan 2015 | A1 |
20150088823 | Chen et al. | Mar 2015 | A1 |
20150088945 | Kruus | Mar 2015 | A1 |
20150112933 | Satapathy | Apr 2015 | A1 |
20150149739 | Seo et al. | May 2015 | A1 |
20150205816 | Periyagaram et al. | Jul 2015 | A1 |
20150249615 | Chen et al. | Sep 2015 | A1 |
20150324236 | Gopalan et al. | Nov 2015 | A1 |
20160042285 | Gilenson et al. | Feb 2016 | A1 |
20160062853 | Sugabrahmam et al. | Mar 2016 | A1 |
20160080482 | Gilbert et al. | Mar 2016 | A1 |
20160188419 | Dagar et al. | Jun 2016 | A1 |
20160350391 | Vijayan et al. | Dec 2016 | A1 |
20160359968 | Chitti et al. | Dec 2016 | A1 |
20160366206 | Shemer et al. | Dec 2016 | A1 |
20170123704 | Sharma et al. | May 2017 | A1 |
20170139786 | Simon et al. | May 2017 | A1 |
20170161348 | Araki et al. | Jun 2017 | A1 |
Number | Date | Country |
---|---|---|
1804157 | Jul 2007 | EP |
WO 2010019596 | Feb 2010 | WO |
WO 2010040078 | Apr 2010 | WO |
WO 2012066528 | May 2012 | WO |
Entry |
---|
Compression Speed Enhancements to LZO for Multi-core Systems; Kane et al; 24th International Symposium on Computer Architecture and High Performance Computing; Oct. 24-26, 2012; pp. 108-115 (8 pages) (Year: 2012). |
An HVS-based adaptive computational complexity reduction scheme for H.264/AVC video encoder using prognostic early mode exclusion; Shafique et al; Proceedings of the Conference on Design, Automation and Test in Europe; Mar. 8-12, 2010; pp. 1713-1718 (6 pages) (Year: 2010). |
HoPE: Hot-Cacheline Prediction for Dynamic Early Decompression in Compressed LLCs; Park et al; ACM Transactions on Design Automation of Electronic Systems, vol. 22, iss. 3, article No. 40; May 2017 (25 pages) (Year: 2017). |
U.S. Appl. No. 14/034,981, filed Sep. 24, 2013, Halevi et al. |
U.S. Appl. No. 14/037,577, filed Sep. 26, 2013, Ben-Moshe et al. |
U.S. Appl. No. 14/230,405, filed Mar. 31, 2014, Meiri et al. |
U.S. Appl. No. 14/230,414, filed Mar. 31, 2014, Meiri. |
U.S. Appl. No. 14/317,449, filed Jun. 27, 2014, Halevi et al. |
U.S. Appl. No. 14/494,895, filed Sep. 24, 2014, Meiri et al. |
U.S. Appl. No. 14/494,899, filed Sep. 24, 2014, Chen et al. |
U.S. Appl. No. 14/979,890, filed Dec. 28, 2015, Meiri et al. |
U.S. Appl. No. 15,001,784, filed Jan. 20, 2016, Meiri et al. |
U.S. Appl. No. 15/001,789, filed Jan. 20, 2016, Meiri et al. |
U.S. Appl. No. 15/085,168, filed Mar. 30, 2016, Meiri et al. |
U.S. Appl. No. 15/076,775, filed Mar. 22, 2016, Chen et al. |
U.S. Appl. No. 15/076,946, filed Mar. 22, 2016, Meiri. |
U.S. Appl. No. 15/085,172, filed Mar. 30, 2016, Meiri. |
U.S. Appl. No. 15/085,181, filed Mar. 30, 2016, Meiri et al. |
U.S. Appl. No. 15/085,188, filed Mar. 30, 2016, Meiri et al. |
U.S. Appl. No. 15/196,674, filed Jun. 29, 2016, Kleiner, et al. |
U.S. Appl. No. 15/196,427, filed Jun. 29, 2016, Shveidel. |
U.S. Appl. No. 15/196,447, filed Jun. 29, 2016, Shveidel, et al. |
U.S. Appl. No. 15/196,472, filed Jun. 29, 2016, Shveidel. |
PCT International Search Report and Written Opinion dated Dec. 1, 2011 for PCT Application No. PCT/IL2011/000692; 11 Pages. |
PCT International Preliminary Report dated May 30, 2013 for PCT Patent Application No. PCT/IL2011/000692; 7 Pages. |
U.S. Appl. No. 12/945,915. |
Nguyen et al., “B+ Hash Tree: Optimizing Query Execution Times for on-Disk Semantic Web Data Structures;” Proceedings of the 6th International Workshop on Scalable Semantic Web Knowledge Base Systems; Shanghai, China, Nov. 8, 2010; 16 Pages. |
Notice of Allowance dated Apr. 13, 2015 corresponding to U.S. Appl. No. 14/037,511; 11 Pages. |
Non-Final Office Action dated May 11, 2015 corresponding to U.S. Appl. No. 14/037,626; 13 Pages. |
Response to Office Action dated May 11, 2015 corresponding to U.S. Appl. No. 14/037,626; Response filed on Jul. 20, 2015; 10 Pages. |
Notice of Allowance dated Oct. 26, 2015 corresponding to U.S. Appl. No. 14/037,626; 12 Pages. |
Office Action dated Jul. 22, 2015 corresponding U.S. Appl. No. 14/034,981; 28 Pages. |
Response to Office Action dated Jul. 22, 2015 corresponding to U.S. Appl. No. 14/034,981; Response filed on Dec. 22, 2015; 14 Pages. |
Office Action dated Sep. 1, 2015 corresponding to U.S. Appl. No. 14/230,414; 13 Pages. |
Response to Office Action dated Sep. 1, 2015 corresponding to U.S. Appl. No. 14/230,414; Response filed on Jan. 14, 2016; 10 Pages. |
Restriction Requirement dated Sep. 24, 2015 corresponding to U.S. Appl. No. 14/230,405; 8 Pages. |
Response to Restriction Requirement dated Sep. 24, 2015 corresponding to U.S. Appl. No. 14/230,405;Response filed Oct. 6, 2015; 1 Page. |
Office Action dated Dec. 1, 2015 corresponding to U.S. Appl. No. 14/230,405, 17 Pages. |
Office Action dated Feb. 4, 2016 corresponding to U.S. Appl. No. 14/037,577; 26 Pages. |
Notice of Allowance dated Feb. 10, 2016 corresponding to U.S. Appl. No. 14/494,899; 19 Pages. |
Notice of Allowance dated Feb. 26, 2016 corresponding to U.S. Appl. No. 14/230,414; 8 Pages. |
Final Office Action dated Apr. 6, 2016 corresponding to U.S. Appl. No. 14/034,981; 38 Pages. |
Response filed on May 2, 2016 to the Non-Final Office Action of Dec. 2015; for U.S. Appl. No. 14/230,405; 8 pages. |
Response filed on May 2, 2016 to the Non-Final Office Action of Feb. 4, 2016; for U.S. Appl. No. 14/037,577; 10 pages. |
U.S. Non-Final Office Action dated Dec. 11, 2017 for U.S. Appl. No. 15/196,447; 54 Pages. |
U.S. Non-Final Office Action dated Dec. 14, 2017 for U.S. Appl. No. 15/076,946; 28 Pages. |
U.S. Notice of Allowance dated Feb. 21, 2018 for U.S. Appl. No. 15/196,427; 31 Pages. |
U.S. Non-Final Office Action dated Jan. 11, 2018 corresponding to U.S. Appl. No. 15/085,168; 14 Pages. |
U.S. Non-Final Office Action dated Dec. 29, 2017 corresponding to U.S. Appl. No. 15/196,674; 34 Pages. |
U.S. Non-Final Office Action dated Jan. 8, 2018 corresponding to U.S. Appl. No. 15/196,472; 16 Pages. |
U.S. Notice of Allowance dated Jan. 26, 2018 corresponding to U.S. Appl. No. 15/085,172; 8 Pages. |
U.S. Notice of Allowance dated Jan. 24, 2018 corresponding to U.S. Appl. No. 15/085,181; 8 Pages. |