- 1 BERNNSEIN, A.J.Synthesizing a response function wlth a feedback scheduling algorithm. SIAM J. Comput. 5, 2 (June 1976), 309-317.Google Scholar
- 2 BERNSTEIN, A.J., AND SHARP, J.C, A policy-drwen scheduler for a time-sharing system. Commun, ACM 14, 2 (Feb. 1971), 74-78. Google Scholar
- 3 COFFMAN, E G. JR., AND MITRANI, 1A characterization of waiting time performance realizable by single-server queues. Oper. Res. 28, 3 (May-June 1980), 810-821.Google Scholar
- 4 FELLER, W. An Introduction to Probabihty Theory and Its ApplicaOons, Vol. H, 2nd ed Wdey, Ne~w York, 1971.Google Scholar
- 5 KLEINROCK, L. Queueing Systems, VoL H: Computer Applications. Wiley, New York, 1976.Google Scholar
- 6 MICHEL, J.A, AND COFFMAN, E G. JR.Synthesis of a feedback queuemg dlsc~phne for computer operation. J ACM 21, 2 (April 1974), 329-339. Google Scholar
- 7 RUSCHITZKA, M. An analyUcal treatment of poficy funcUon schedulers. Oper. Res 26, 5 (Sept.-Oct. 1978), 845-863.Google Scholar
- 8 RUSCHITZKA, M. Policy functton scheduling. Perf EvaL 1, 1 (Jan. 1981), 31-47Google Scholar
- 9 RUSCHITZKA, M., AND FAsRY, R.S A unifying approach to scheduling. Commun. A CM 20, 7 (luly 1977), 469-477. Google Scholar
- 10 WOLFF, R.W. Work-conserving pnortties J Appl. Prob. 7, 2 (Aug. 1970), 327-337Google Scholar
Index Terms
The Performance of Job Classes with Distinct Policy Functions
Recommendations
The response of job classes with distinct policy functions(Extended Abstract)
Policy function schedulers provide a flexible framework for implementing a wide range of different scheduling schemes. In such schedulers, the priority of a job at any instant in time is defined by the difference between the time it spent in the system ...
The response of job classes with distinct policy functions(Extended Abstract)
PERFORMANCE '80: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluationPolicy function schedulers provide a flexible framework for implementing a wide range of different scheduling schemes. In such schedulers, the priority of a job at any instant in time is defined by the difference between the time it spent in the system ...
Scheduling job classes on uniform machines
We study a scheduling problem with job classes on parallel uniform machines. All the jobs of a given class share a common due-date. General, non-decreasing and class-dependent earliness and tardiness cost functions are assumed. Two objectives are ...
Comments