Appeal 2007-1959
Application 10/039,789
Appellants have invented a method and an apparatus for efficiently
and cost effectively implementing reduction operations over multiple
computer platforms (Specification 3).
Claim 1, which is representative of the claims on appeal, reads as
follows:
1. A method comprising:
receiving a first program unit in a parallel computing environment, the
first program unit including a reduction operation associated with a set of
variables;
translating the first program unit into a second program unit, the
second program unit including a set of one or more instructions to partition
the reduction operation between a plurality of threads including at least two
threads and to reference a third program unit; and
translating the first program unit into the third program unit, the third
program unit including a set of one or more instructions that encapsulate the
reduction operation to perform an algebraic operation on the variables.
The prior art relied upon by the Examiner in rejecting the claims on
appeal is:
Poulsen US 5,812,852 Sep. 22, 1998
Sundaresan US 5,937,194 Aug. 10, 1999
Hardwick US 6,212,617 B1 Apr. 3, 2001
The Examiner rejected claims 1, 3, 6-8, 10-15, 18, 20, 21, 23, and 26
under 35 U.S.C. § 103(a) as being unpatentable over the teachings of
Poulsen and Sundaresan, and claims 22, 24, and 25 over the teachings of
Poulsen, Sundaresan, and Hardwick.
2
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 Next
Last modified: September 9, 2013