Appeal No. 2001,0712
Application 08/148,887
sequence, each cost representing a number of execution clock
cycles required by execution of the corresponding extracted
instruction sequence;
cost detection means for detecting, from the cost
table, the cost of each extracted instruction sequence;
total cost computation means for computing a total
cost of each allocation pattern by adding the costs of the
number of extracted instruction sequences for the allocation
pattern; and
best pattern determining means for determining an
allocation pattern with a lowest cost by referring to the
total cost of each allocation pattern, the resource allocation
thereby being performed in accordance with the determined
allocation pattern.
The Examiner relies on the following references:
Charles Y. Hitchcock III et al. (Hitchcock), “A Method of
Automatic Data Path Synthesis,” pp. 484-89, IEEE (1983).
Chi-Hung Chi et al. (Chi), “Register Allocation for GaAs
Computer Systems,” System Sciences, Vol. I, pp. 266-274,
IEEE/IEE (1988).
Claims 11-21 stand rejected under 35 U.S.C. § 103 as
being unpatentable over Hitchcock in view of Chi.
Rather than reiterate the arguments of Appellants
and the Examiner, reference is made to the Brief , the Reply 2
2The Brief was received March 6, 1996.
7
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Next
Last modified: November 3, 2007