Boots – shoes – and leggings
Patent
1994-12-23
1997-12-09
Kriess, Kevin A.
Boots, shoes, and leggings
395700, 364DIG1, 3642621, G06F 945
Patent
active
056969716
ABSTRACT:
RFO is a method for preprocessors of compilers of high-level programming languages which have built-in recursive function support. Given the source code, RFO identifies the recursive function and uses a formula to determine the maximum size of the results table which is used to store the intermediate results. When the table is filled, it wraps around, discards the old values, and replaces them with the new ones. An index is used to indicate the position of the latest entries, which are used for the backward search of the table This method results in efficient memory usage as well as shorter time of calculations compared with the standard mechanism provided by the compilers. RFO is independent of the computing machine power or its supporting compiler. This method is advantageous for cases requiring huge processing resources.
REFERENCES:
patent: 4295218 (1981-10-01), Tanner
"On the Complexity of Table Look up for Iterahire Division", Parhami. B., IEEE Trans. on Computers, vol. C-36 No. 10, Oct. 1987, pp. 1233-1236.
"A Minimum Table Size Result for Higher Radix Nonrestoring Division", Bushard L.B., IEEE Trans. on Computers, vol. C-32 No. 6, Jun. 1983, pp. 521-526.
Chaki Kakali
Kriess Kevin A.
Recursive Technologies Associates
LandOfFree
Recursive functions optimizier (RFO) for compliers of high-level does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Recursive functions optimizier (RFO) for compliers of high-level, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recursive functions optimizier (RFO) for compliers of high-level will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1616429