发明授权
- 专利标题: Method and apparatus for reducing the processing time required to solve square root problems
- 专利标题(中): 减少解决平方根问题所需处理时间的方法和装置
-
申请号: US465992申请日: 1995-06-06
-
公开(公告)号: US5602768A公开(公告)日: 1997-02-11
- 发明人: Walter B. Cunto , Jorge H. Goncalves
- 申请人: Walter B. Cunto , Jorge H. Goncalves
- 申请人地址: NY Armonk
- 专利权人: International Business Machines Corporation
- 当前专利权人: International Business Machines Corporation
- 当前专利权人地址: NY Armonk
- 主分类号: G06F17/16
- IPC分类号: G06F17/16 ; G06F7/552 ; G06F17/10
摘要:
The invention discloses a method and apparatus for solving a wide range of numerical problems that use N processing elements operating in parallel.To find the solution for a given problem relating to a given function function N points are selected in a determined interval wherein resides the solution. Such interval is known as the initial search interval and it is determined according to said given problem. Once the N points are selected the search interval is divided into smaller sub-intervals. The N processing elements are used to perform evaluations of the function at each of the N selected points, whereby the criteria for said evaluations are also determined according to said given problem. The results of the evaluations are used to determine the next search interval that is smaller than the previous one. The new search interval is divided into smaller parts in the same fashion as described above and further function evaluations are performed at given selected points. The aforementioned steps are repeated until the search interval is reduced to a predetermined size which is also defined according to said given problem. At this point the solution for said given problem can be selected from this last search interval known as the final interval.The apparatus for the present invention uses N processing elements operating in parallel to perform evaluations of the given function at selected points. When the invention is applied in digital computers for solving numerical problems involving a floating point domain, where points are represented by binary numbers according to a given pattern, selection of the N points in the search interval is implemented by a series of assemblers that build binary numbers.
信息查询