Appeal No. 2001-0048
Application No. 08/497,481
(c) in response to an availability of said selected one
of said plurality of processors selecting a thread having
the highest priority on said single execution queue;
(d) determining whether said current executing thread
has the same priority as said thread having highest priority
selected from said single execution queue;
(e) upon determining said current executing thread and
said highest priority thread are equal, running said current
executing thread;
(f) otherwise, if said highest priority thread is
greater in priority than said current executing thread,
determining whether a thread having affinity has the same
priority as said highest priority thread; and
(g) running said affinity thread if equal to said
thread having highest priority.
3. A method for establishing a priority order of threads
within a single execution queue of a multiprocessor data
processing system, comprising:
selecting for execution within a selected
processor a most favored runnable thread from either a
current thread executing within said selected processor
having the same priority as a most favored thread or an
affinity thread having the same priority as said most
favored thread.
The Examiner relies on the following references in rejecting
the claims:
Raj Vaswani et al. (Vaswani), “The Implications of Cache
Affinity on Processor Scheduling for Multiprogrammed, Shared
Memory Multiprocessors,” ACM, 1991, pp. 26-40.
Cochcroft, Jr. et al. (Cochcroft) 5,317,738 May. 31, 1994
3
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 13 Next
Last modified: November 3, 2007