Appeal No. 2001-0048
Application No. 08/497,481
queue and are executed in a particular order such that the
affinity threads that have a high degree of shared resource
utilization are assigned to the same local queue (specification,
page 1). The queue order is determined by selecting a most
favored runnable thread from among either a current thread, a
most favored thread, or an affinity thread (specification, page
4). Alternatively, the current thread is dispatched for
execution if it is runnable and has the same priority as the
highest priority thread (specification, page 12). Otherwise, the
system selects the affinity thread if it has the same priority as
the thread with the highest priority (id.).
Representative independent claims 1 and 3 are reproduced
below:
1. A method, within a multiprocessor data processing
system including a plurality of processors, and a single
execution queue of multiple threads from which threads are
dispatched for execution by any of said plurality of
processors in a priority order, for establishing said
priority order, said method comprising:
(a) determining whether a current executing thread may
still be run on a selected one of said plurality of
processors;
(b) in response to said current executing thread being
runnable, placing said current executing thread on said
single execution queue;
2
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 13 Next
Last modified: November 3, 2007