The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
On the construction of a representative synthetic workload
Communications of the ACM
Synthetically generated performance test loads for operating systems
SIGME '73 Proceedings of the 1973 ACM SIGME symposium
A load leveling support methodology for networking
WSC '76 Proceedings of the 76 Bicentennial conference on Winter simulation
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
| Hi-index | 0.00 |
Efficient scheduling of jobs for computer systems is a problem of continuing concern. The applicability of scheduling methodology described in the operations research literature is severely restricted by the dimensionality of job characteristics, the number of distinct resource types comprising a computer system, the non-deterministic nature of the system due to both interprocess interaction and contention, and the existence of a multitude of constraints effecting job initiation times, job completion times, and job interactions. In view of the large number of issues which must be considered in job scheduling, a heuristic approach seems appropriate. This paper describes an initial implementation of such an approach based upon a fast, analytically driven, performance prediction tool.