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 .
Information Disclosure Statement
The information disclosure statement (IDS) submitted on 2/19/2025 was filed after the mailing date of the application on 11/27/2024. The submission is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner.
Claim Rejections - 35 USC § 112
The following is a quotation of 35 U.S.C. 112(d):
(d) REFERENCE IN DEPENDENT FORMS.—Subject to subsection (e), a claim in dependent form shall contain a reference to a claim previously set forth and then specify a further limitation of the subject matter claimed. A claim in dependent form shall be construed to incorporate by reference all the limitations of the claim to which it refers.
The following is a quotation of pre-AIA 35 U.S.C. 112, fourth paragraph:
Subject to the following paragraph [i.e., the fifth paragraph of pre-AIA 35 U.S.C. 112], a claim in dependent form shall contain a reference to a claim previously set forth and then specify a further limitation of the subject matter claimed. A claim in dependent form shall be construed to incorporate by reference all the limitations of the claim to which it refers.
Claims 8-9 are rejected under 35 U.S.C. 112(d) or pre-AIA 35 U.S.C. 112, 4th paragraph, as being of improper dependent form for failing to further limit the subject matter of the claim upon which it depends, or for failing to include all the limitations of the claim upon which it depends. Applicant may cancel the claim(s), amend the claim(s) to place the claim(s) in proper dependent form, rewrite the claim(s) in independent form, or present a sufficient showing that the dependent claim(s) complies with the statutory requirements.
Claim Rejections - 35 USC § 101
35 U.S.C. 101 reads as follows:
Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title.
Claims 1-9 are rejected under 35 U.S.C. 101 because the claimed invention is directed to non-statutory subject matter.
Claim 1 is rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more. The claim recites defining a process having a plurality of work steps, each work step requires one or more defined inputs.... The limitation of determining the amount of use of each icon over a predetermined period of time, as drafted, is a process that, under its broadest reasonable interpretation, covers performance of the limitation in the mind but for the recitation of generic computer components. That is, other than reciting “by a processor,” nothing in the claim element precludes the step from practically being performed in the mind. For example, but for the “by a processor” language, “defining” in the context of this claim encompasses the user manually defining a process. If a claim limitation, under its broadest reasonable interpretation, covers performance of the limitation in the mind but for the recitation of generic computer components, then it falls within the “Mental Processes” grouping of abstract ideas. Accordingly, the claim recites an abstract idea. This judicial exception is not integrated into a practical application. In particular, the claim only recites one additional element – using a processor to perform the defining step. The processor in the step is recited at a high-level of generality (i.e., as a generic processor performing a generic computer function of ranking information based on a determined amount of use) such that it amounts no more than mere instructions to apply the exception using a generic computer component. Accordingly, this additional element does not integrate the abstract idea into a practical application because it does not impose any meaningful limits on practicing the abstract idea. The claim is directed to an abstract idea. The claim does not include additional elements that are sufficient to amount to significantly more than the judicial exception. As discussed above with respect to integration of the abstract idea into a practical application, the additional element of using a processor to perform the defining step amounts to no more than mere instructions to apply the exception using a generic computer component. Mere instructions to apply an exception using a generic computer component cannot provide an inventive concept. The claim is not patent eligible.
Claim Rejections - 35 USC § 102
In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.
The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action:
A person shall be entitled to a patent unless –
(a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention.
Claim(s) 1-2 and 4-9 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Wein (US Patent 9,009,711).
As per claim 1 and 8-9: A computer-implemented method for performing a process having a plurality of work steps using a plurality of computing units, the method comprising (see abstract):
defining a process having a plurality of work steps, each work step requires one or more defined inputs, and each work step generates one or more defined outputs, the outputs of some of the work steps are used as inputs of other of the work steps (Col 6, lines 66-67, Col 7, lines 1-3; define inputs and outputs of an application module, but they do not define any implementation details. An example of an interface is sin x, which is a function having one (double precision) input and one (double precision) output);
checking whether all required inputs can be generated by the process (claim 8; scheduling, at the computing system level, the task groups together with other functions of the computing system not belonging to the application over the plurality of processors, such that only a single one of the task groups is assigned to an individual one of the plurality of processors);
ordering the work steps according to dependencies resulting from the inputs and the outputs, when the checking determines that all required inputs can be generated by the process (claim 1; groups a plurality of individual tasks belonging to one application into a plurality of task groups by taking into account application-specific functional dependencies between the individual tasks and a number of data communication processes between the individual tasks based on the functional dependencies);
instantiating the ordered work steps (Claim 1; schedule the task groups together with other functions of the computing system not belonging to the one application over the plurality of processors, such that only a single one of the task groups is assigned to an individual one of the plurality of processors); and
performing the instantiated work steps by one or more computing units, wherein the ordering of the work steps comprises parallelizing the work steps (Col 19-, line s30-35; the sender and receiver are tasks that are performed in parallel on different processing units of the computing system, or correspond to different processing units of the computing system, respectively), and wherein the work steps are performed simultaneously when the dependencies of inputs of the respective work step permit this (Col 2, lines 53-57; multiple CPU can be used reasonably efficiently for these tasks (apart from the fact that typically even a single modern CPU is completely sufficient for doing all these not so complex tasks simultaneously)).
As per claim 2: The computer-implemented method according to claim 1, wherein:
the process is pre-processing database data, and the database data originates from more than one source (Col 19, lines 34-36; The loading step may pre-fetch the data item already written to the communication FIFO into the local cache before the receiver needs the data item).
As per claim 4: The computer-implemented method according to claim 1, wherein performing the work steps uses environmental variables (Col 13, lines 40-50; According to an embodiment of the present invention, the state variable can essentially hold the following values).
As per claim 5: The computer-implemented method according to claim 1, wherein the ordering of the work steps comprises topological sorting (claim 1; grouping means for grouping a plurality of tasks belonging to one application into a plurality of task groups by taking into account application-specific functional dependencies between individual tasks and the resulting communication processes between the individual tasks).
As per claim 6: The computer-implemented method according to claim 1, wherein: the process is a process for processing logistics data, the inputs for one or more work steps determine a position of goods, information regarding a transport of goods, goods receipt information, or stock levels, and the outputs of at least one work step comprise an inventory and/or a list of positions of goods (claim 12; executing an application including a plurality of tasks on a computing system comprising plural processing units, by means of parallel processing of tasks belonging to the application is provided. The method comprises the step of grouping the plurality of tasks belonging to the application into a plurality of task groups by taking into account application-specific functional dependencies between individual tasks and the resulting communication processes between the individual tasks).
As per claim 7: The computer-implemented method according to claim 1, wherein a computer program comprises program code for performing at least portions of the method when the computer program is executed on a computer (Col 4, lines 9-14; Examples of a computing system according to the present invention include but are not limited to computers having multiple CPUs (Central Processing Units), multiple GPUs (Graphics Processing Units) or computers having both multiple CPUs and GPUs).
Claim Rejections - 35 USC § 103
In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.
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.
Claim(s) 3 is rejected under 35 U.S.C. 103 as being unpatentable over Wein (US Patent 9,009,711) in view of Mirsa (US Patent 11,782,760).
As per claim 3: The computer-implemented method according to claim 1, defining a process having a plurality of work steps, each work step requires one or more defined inputs, and each work step generates one or more defined outputs, the outputs of some of the work steps are used as inputs of other of the work steps (Col 6, lines 66-67, Col 7, lines 1-3; define inputs and outputs of an application module, but they do not define any implementation details. An example of an interface is sin x, which is a function having one (double precision) input and one (double precision) output).
Wein does not specifically disclose wherein the process is defined in a configuration file (See Misra; Col 4, lines 29-31; The reconfigurable data processor 110 is configured to process the configuration files and generate corresponding outputs).
Therefore, it 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, having the teachings of Wein and Mirsa in it’s entirety, to modify the technique of Wein for grouping a plurality of tasks belonging to one application into a plurality of task groups by taking into account application-specific functional dependencies between individual tasks by adopting Mirsa's teaching for process the configuration files and generate corresponding outputs. The motivation would have been to improve techniques for running complex computer processes made up of multiple work steps.
Relevant Prior Art References
The following prior art is cited as being of interest to the claimed invention but has not been applied in any of the current rejections.
Kuribayashi et al.- US Patent Publication 2006/0248218- the prior art teaches techniques for the multi-processor system has shared memory connected to several processors.
Cui et al.- US Patent Pub. 2023/016364 - the prior art teaches techniques for providing a process running method and a corresponding apparatus.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to ANTHONY D BROWN whose telephone number is (571)270-1472. The examiner can normally be reached 730-330pm.
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, Linglan Edwards can be reached at 5712705440. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/ANTHONY D BROWN/Primary Examiner, Art Unit 2408