Appeal No. 2001-2326
Application No. 08/752,909
BACKGROUND
The invention relates to time-share scheduling performed by computer operating
systems. Representative claim 1 is reproduced below.
1. A method of time-share scheduling a plurality of jobs in a computer
system operating across a plurality of time segments, the method comprising the
steps of:
apportioning, during each time segment, earnings to each of the jobs
based on time each job spent in a queue requesting execution on a processor in
the computer system during the time segment, wherein apportioning earnings
includes reducing earnings as a function of time each job ran on the processor
during the time segment;
adding a number to accumulated earnings for each job as a function of
earnings apportioned to each job during the time segment;
selecting a job for execution on the processor as a function of
accumulated earnings for each of the jobs.
The examiner relies on the following references:
Mueller 4,481,583 Nov. 6, 1984
Sherrod 4,642,756 Feb. 10, 1987
Hejna, Jr. et al. (Hejna) 5,287,508 Feb. 15, 1994
Anderson et al. (Anderson) 5,628,013 May 6, 1997
(filed Sep. 30, 1992)
Claims 1-4, 10-12, 18-21, 27-31, and 35 stand rejected under 35 U.S.C. § 103
as being unpatentable over Mueller.
Claims 5-9, 22, and 32-34 stand rejected under 35 U.S.C. § 103 as being
unpatentable over Mueller and Anderson.
-2-
Page: Previous 1 2 3 4 5 6 7 Next
Last modified: November 3, 2007