Automatic job scheduling in hasp
| dc.contributor.author | Gujar, Uday, G. | |
| dc.contributor.author | Fellows, David, M. | |
| dc.date.accessioned | 2023-03-01T18:29:16Z | |
| dc.date.available | 2023-03-01T18:29:16Z | |
| dc.date.issued | 1977 | |
| dc.description.abstract | Multiprogramming systems require that a fair, equitable algorithm be used for the scheduling of jobs. This paper discusses some of the problems associated with this and proposes an automatic job scheduling algorithm. The major parts of the algorithm have been implemented and have been in use for over one year. The user interface is simplified and the operational complexities are minimized. The parameters used for the algorithm are the estimates of the central processor time and the memory required by the job. All types of jobs including those requiring operator attention during execution are covered under the scheme. Operational data and the reactions from the users indicate that the results have been as expected. | |
| dc.description.copyright | Copyright @ Uday G. Gujar and David M. Fellows, 1997. | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/14913 | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | Automatic job scheduling in hasp | |
| dc.type | technical report |
Files
Original bundle
1 - 1 of 1