Computer system and method for parallel computations using table approximation methods
First Claim
Patent Images
1. A computer method for compiling function evaluation on a parallel computing system comprising the steps of:
- providing an execution unit having a plurality of function units, each function unit capable of performing one or more arithmetic-logic operations;
dividing up the range of function arguments into n values, determining the center x0 for each interval;
determining the value of the function at x0, the m-th power of x0 and the first m coefficients a(i) of the Taylor series expansion of the function and storing said values in a memory, where m is a number selected on the basis of the desired accuracy of the computation;
for a given argument x positioned at a distance dx from x0, evaluating a polynomial of the type
using the function units of said execution unit to compute summands-of said polynomial in parallel; and
combining the values stored in the memory and the evaluation of said polynomial as to provide an evaluation of the function at the x argument value.
1 Assignment
0 Petitions
Accused Products
Abstract
A method optimizes function evaluations performed by of a VLIW processor through enhanced parallelism by evaluating the function by table approximation using decomposition into a Taylor series.
-
Citations
2 Claims
-
1. A computer method for compiling function evaluation on a parallel computing system comprising the steps of:
-
providing an execution unit having a plurality of function units, each function unit capable of performing one or more arithmetic-logic operations;
dividing up the range of function arguments into n values, determining the center x0 for each interval;
determining the value of the function at x0, the m-th power of x0 and the first m coefficients a(i) of the Taylor series expansion of the function and storing said values in a memory, where m is a number selected on the basis of the desired accuracy of the computation;
for a given argument x positioned at a distance dx from x0, evaluating a polynomial of the type
using the function units of said execution unit to compute summands-of said polynomial in parallel; and
combining the values stored in the memory and the evaluation of said polynomial as to provide an evaluation of the function at the x argument value. - View Dependent Claims (2)
dividing up the evaluation of a polynomial into two of more independent tasks;
determining the longest independent task, defined as a critical path for the polynomial evaluation;
minimizing the processing time for the critical path by replacing multiplication operations with addition operations; and
scheduling a sequence of tasks among said plurality of function units, wherein completion of all tasks results in the polynomial evaluation.
-
Specification
-
- Resources
Litigation Campaign Assessment
Thank you for your request. You will receive a custom alert email when the Litigation Campaign Assessment is available.
×
-
Current AssigneeElbrus International Limited
-
Original AssigneeElbrus International Limited
-
InventorsLoginov, Vadim E.
-
Primary Examiner(s)Mai, Tan V.
-
Application NumberUS09/220,506Time in Patent Office1,188 DaysField of Search708/270, 708/274-277, 708/440, 708/605US Class Current708/270CPC Class CodesG06F 1/0356 by using two or more smalle...
