DETAILED ACTION
Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Response to Amendment
This office action is in response to the amendment filed on 12/29/2025.
Claims 1-20 are presented for further examination.
Response to Argument
Remark 1: Applicant argues that claim 2 and claim 3 are not contradictory because a threshold can comprise a static value (claim 2) that is specific to a particular class of applications while simultaneously being adjusted dynamically (claim 3) based on operating conditions. Particularly, the static value represents the baseline or default threshold for a given application class, but this value can be dynamically adjusted based on current operating conditions … This interpretation is consistent with modern computing systems where default parameters are often adjusted in real-time based on system performance and conditions.
Examiner respectfully submits that Applicant's argument concerning the “threshold comprises a static value” has been fully considered but moot because the amended claims no longer recite “threshold comprises a static value”.
Remark 2: Applicant argues that Lin does not teach or reasonably suggest compressing a sequence of identical memory values because Lin in paragraph [0042] describes compression of repeated strings, such as compressing "(StringA, StringA, ..., StringA)" as "(StringA, n)," but this is not the same as compressing identical memory values as recited by claim 1.
Examiner respectfully submits that Lin not only teaches compressing a sequence of identical strings when having lengths exceeding a threshold as shown in [0042]) but also teaches compressing a sequence of identical memory values when having lengths exceeding a threshold ([0045], As shown in the example of FIG. 8, if the sample data is numeric instead… if the average run length is greater than Threshold4 or run length threshold, a RLE compression method will be used).
Specification
The lengthy specification has not been checked to the extent necessary to determine the presence of all possible minor errors. Applicant’s cooperation is requested in correcting any errors of which applicant may become aware in the specification.
Claim Rejections - 35 USC § 103
The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action:
A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made.
The factual inquiries set forth in Graham v. John Deere Co., 383 U.S. 1, 148 USPQ 459 (1966), that are applied for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows:
1. Determining the scope and contents of the prior art.
2. Ascertaining the differences between the prior art and the claims at issue.
3. Resolving the level of ordinary skill in the pertinent art.
4. Considering objective evidence present in the application indicating obviousness or nonobviousness.
Claim(s) 1-5, 8-12 and 15-19 is/are rejected under 35 U.S.C. 103 as being unpatentable over Lin et al. (US 2015/0227540; hereinafter Lin).
Regarding independent claims 1, 8 and 15, taking claim 1 as exemplary analysis, Lin teaches An apparatus comprising processing circuitry to:
receive a data compression instruction for a memory segment; and compress based on the data compression instruction ([0038], In Step 0420, the storage system sends a compression request to the data block compression program 0272. A compression request includes the memory address of the raw data block 0278, the memory address of a compressed data block 0279, a current compression method 0520, and a detection flag 0530 (see FIG. 5) to indicate whether or not a property detection is needed) a sequence of identical memory values associated with the memory segment wherein the sequence of identical memory values is compressed when having lengths exceeding a threshold (
[0045], As shown in the example of FIG. 8, if the sample data is numeric instead… if the average run length is greater than Threshold4 or run length threshold, a RLE compression method will be used;
[0042], As shown in FIG. 8, if the sample data consists of strings, and the average run length of a string (defined as the continuously repeated time of a string) is larger than 10 (a predefined threshold, referred to as Threshold2 or run length threshold), then a Run Length Encoding (RLE) compression method will be used. In a RLE compression, if a string “StringA” continuously repeats n times, such as (StringA, StringA, . . . , StringA), it can be compressed as (StringA, n)).
It would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention was made, to incorporate Lin’s RLE compression process that is applied when run length (i.e., continuously repeated time of an identical item) is greater than a threshold as described in [0042] and Lin’s compression rule on a sequence of numeric data as described in [0045] so that a RLE compression will be used when run length n is greater than a threshold to replaces a sequence of identical memory values, such as (0x41, 0x41, …., 0x41) that is to be compressed as (0x41, n)).
Regarding claims 2, 9 and 16, Lin further teaches wherein the threshold Fig. 8, run length of repeated String data is compared with Threshold2 whereas run length of repeated numeric data is compared with Threshold4) and capable of being adjusted in response to one or more changes associated with the operation condition ([0004], based on characteristics of data content and a compression rule, and then compresses data using the chosen compression method. The compression method can be changed, if the characteristics of data content change.
[0042], A compression rule 0274 can be defined by a system administrator, so that a compression goal 0273 (refer to FIG. 9) can be achieved by a storage system 0110 … that different compression rules 0274 can be defined for different compression goals 0273, based on the requirement on both compression ratio and performance;
[0062], The compression method can be changed, if the characteristics of data content changes and the compression ratio or performance is under a threshold value).
Regarding claims 3, 10 and 17, Lin further teaches wherein the threshold is adjustable dynamically in response to operating conditions associated with the apparatus ([0042], Based on the properties of the sample data, a compression method can be obtained by searching the compress rule 0274. A compression rule 0274 can be defined by a system administrator, so that a compression goal 0273 (refer to FIG. 9) can be achieved by a storage system 0110 … that different compression rules 0274 can be defined for different compression goals 0273, based on the requirement on both compression ratio and performance).
Regarding claims 4, 11 and 18, Lin further teaches wherein the processor circuitry is further to: replace the sequence of identical memory values with a single instance of a memory value and a metadata tag identifying the length of the sequence to generate a compressed data sequence ([0045], As shown in the example of FIG. 8, if the sample data is numeric instead… if the average run length is greater than Threshold4 or run length threshold, a RLE compression method will be used;
[0042], As shown in FIG. 8, if the sample data consists of strings, and the average run length of a string (defined as the continuously repeated time of a string) is larger than 10 (a predefined threshold, referred to as Threshold2 or run length threshold), then a Run Length Encoding (RLE) compression method will be used. In a RLE compression, if a string “StringA” continuously repeats n times, such as (StringA, StringA, . . . , StringA), it can be compressed as (StringA, n) {metadata tag}).
Note that, applying the RLE compression process described in [0042] to numeric data compression described in [0045], a RLE compression will be used when run length n is greater than a threshold to replaces a sequence of identical memory values, e.g., 0x41, that continuously repeats n times, such as (0x41, 0x41, …., 0x41) is compressed as (0x41, n))).
Regarding claims 5, 12 and 19, Lin further teaches wherein the processor circuitry is further to: store the metadata tag adjacent to the single instance of the memory value ([0048], In Step 0480, the storage system stores the compressed data block into HDD 0240, and inserts a new entry to a compression method lookup table 0277 in Step 0490).
Regarding claims 6 and 13, Lin further teaches wherein the processor circuitry is further to: receive a data decompression instruction directed to the memory segment; and in response to the data decompression instruction, replace the single instance of the memory value with a sequence of identical memory values having a length equal to the length specified in the metadata tag ([0052], Referring back to FIG. 6, for a decompression request, in Step 06B0, the storage system 0110 decompresses the data block 0279 using the compression method indicated in the request, and stores the uncompressed data in the raw data block. In Step 06C0, the data block compression program returns decompression success (in response to the decompression request from Step 1230 in FIG. 12);
[0059], In Step 1710, the storage system obtains the compression method 1030 and location 1040 for the requested data block (identified by the inode number 1010 and block ID 1020) from a compression method lookup table 0277. In Step 1720, the storage system sends a decompression request to a compression initiator program 137A
It would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention was made, to incorporate a RLE compression process described in [0042] to numeric data compression described in [0045] so that a RLE compression will be used when run length n is greater than a threshold to replaces a sequence of identical memory values, e.g., 0x41, that continuously repeats n times, such as (0x41, 0x41, …., 0x41) can be compressed as (0x41, n))). Note that, the compressed data block is inserted as a new entry to a compression method lookup table 0277 as shown in [0048],
It would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention was made, decompression process replaces (0x41, n) with (0x41, 0x41, …., 0x41), so that 0x41 continuously repeats n times.
Regarding claims 7 and 14, Lin further teaches wherein the processor circuitry is further to: receive, from a requestor, a read operation directed to the memory segment; and in response to the read operation, transmit the compressed data sequence to the requestor ([0051] & FIG. 12 is a flow diagram … to serve a read request from a client 0120, according to the first embodiment. In Step 1210, the storage system obtains the compression method 1030 and location 1040 for the requested data block (identified by the inode number 1010 and block ID 1020) from a compression method lookup table 0277. In Step 1220, the storage system retrieves the compressed data from the location 1040 and stores it into a compressed data block 0279 … sends raw data block to a client 0120 in Step 1250. Note that Step 1250 sends decompressed data to client. It is obvious to ordinary skill in the art to transmit the compressed data sequence to the requestor when the read request is for compressed data as shown in step 1220).
Regarding claim 20, Claim recites substantially the same limitations as in claims 6 and 7, and is therefore rejected for the same reasons set forth in the analysis of claims 6 and 7
Double Patenting
The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP §§ 706.02(l)(1) - 706.02(l)(3) for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b).
The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/process/file/efs/guidance/eTD-info-I.jsp.
Claims 1-20 rejected on the ground of nonstatutory double patenting as being anticipated by claims 1-20 of U.S. Patent No. 12,093,210 (hereinafter PAT). Although the claims at issue are not identical, they are not patentably distinct from each other because the instant claims are anticipated as shown below.
Current application
PAT
1,8,15
receive a data compression instruction for a memory segment; and compress based on the data compression instruction a sequence of identical memory values associated with the memory segment wherein the sequence of identical memory values is compressed when having lengths exceeding a threshold
1
receive a data compression instruction for a memory segment of the computer-readable memory; and
in response to the data compression instruction, compress a sequence of identical memory values in response to a determination that the sequence of identical memory values has a length which exceeds a threshold
2,9,16
wherein the threshold comprises a static value that is specific to a class of applications and capable of being adjusted in response to one or more changes associated with the operation conditions.
1
…wherein the threshold varies as a function of a size of a layer of neural networking model to which the data applies.
3,10,17
the threshold is adjustable dynamically in response to operating conditions of associated with the apparatus
2
the threshold is set dynamically in response to operating conditions of the apparatus
4,11,18
replace the sequence of identical memory values with a single instance of a memory value and a metadata tag identifying the length of the sequence to generate a compressed data sequence
3
replace the sequence of identical memory values with a single instance of a memory value and a metadata tag identifying the length of the sequence to generate a compressed data sequence
5,12,19
store the metadata tag adjacent to the single instance of the memory value.
4
store the metadata tag adjacent the single instance of the memory value.
6,13,20
receive a data decompression instruction directed to the memory segment; and in response to the data decompression instruction, replace the single instance of the memory value with a sequence of identical memory values having a length equal to the length specified in the metadata tag
5
receive a data decompression instruction directed to the memory segment; and
in response to the data decompression instruction, replace the single instance of the memory value with a sequence of identical memory values having a length equal to the length specified in the metadata tag.
7,14,20
receive, from a requestor, a read operation directed to the memory segment; and in response to the read operation, transmit the compressed data sequence to the requestor.
6
receive, from a requestor, a read operation directed to the memory segment; and
in response to the read operation, transmit the compressed data sequence to the requestor
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to TRACY C CHAN whose telephone number is (571)272-9992. The examiner can normally be reached on Monday - Friday 10 AM to 6 PM EST.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, TIM VO can be reached on (571)272-3642. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see https://ppair-my.uspto.gov/pair/PrivatePair. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/TRACY C CHAN/ Primary Examiner, Art Unit 2138