Complete Parameterized Families of Job Scheduling Strategies
- Lookup NU author(s)
- Emeritus Professor Isi Mitrani
|
|
|
|
| Author(s) | | Mitrani I, Hine JH |
| Publication type | | Report |
| Series Title | | Computing Laboratory Technical Report Series |
| Year | | 1975 |
| Date | | 1975 |
| Report Number | | 81 |
| Pages | | 21 |
|
|
|
| Full text is not currently available for this publication. |
|
|
|
|
| The concept of a family of scheduling strategies in which a few parameters may be varied to acheive different performance levels is itroduced. The use of such families in satisfying performance requirements stated in terms of average response times for jobs of different classes is studied. A performance requirement is said to be acheivable if, given the loading conditions on the system, there exists a scheduling strategy which satisfies it. A family of scheduling strategies is said to be complete if every acheivable perfrmance requirement can be satisfied by a strategy from the family. Sufficient conditions for a parameterized family to be complete are proven. Three parameterized families are discussed, one in detail. Completeness of the three families is demonstrated and simulation results illustrating some properties of implementation are presented. |
|
|
|
| Institution | | Computing Laboratory, University of Newcastle upon Tyne |
| Place Published | | Newcastle upon Tyne |
| URL | | http://www.cs.ncl.ac.uk/publications/trs/papers/81.pdf |
| Actions | |  |
