research-article

Free access

Dynamic dispatching in job class scheduled systems

Author:

Jon C. StraussAuthors Info & Claims

AFIPS '75: Proceedings of the May 19-22, 1975, national computer conference and exposition

Pages 343 - 350

https://doi.org/10.1145/1499949.1500016

Published: 19 May 1975 Publication History

PDF eReader

Abstract

Many different approaches have been attempted to the problem of controlling the processing of a multiprogramming computer system so as to improve performance. In Reference 1, Bowdon, et al. simulate an IBM 360/75 under OS with HASP and adjust job initiation priority based on estimates of processing time to effect a shortest-processing-time discipline. Their simulation demonstrates a dramatic increase in thruput and decrease in turnaround as a result of this job scheduling modification.

References

[1]

Bowdon, E. K. Sr., S. K. Mamrak, and R. R. Salz, "Performance Evaluation in Network Computer," Proceedings of the Symposium on the Simulation of Computer System, June 1973.

Digital Library

Google Scholar

[2]

Wulf, W. A., "Performance Monitors for Multiprogrammed Systems," Proceedings of the Second Symposium on Operating Systems Principles, ACM, New York, pp. 175--181, 1969.

Digital Library

Google Scholar

[3]

Northouse, R. A., and K. S. Fu, "Dynamic Scheduling of Large Digital Computer Systems Using Adaptive Control and Clustering Techniques," IEEE Transactions on Systems, Man and Cybernetics, Vol. SMC-3, No. 3, pp. 225--234, May 1973.

Crossref

Google Scholar

[4]

Brinch Hansen, P., "An Analysis of Response Ratio Scheduling," Proceedings of IFIP Congress 71, Ljubljana, Yugoslavia, August 1971.

Google Scholar

[5]

Chiang, A. T., and J. C. Strauss, "Priority Control For Maximum Thruput With Equal Job Class Turnaround," Proceedings of Computer Science and Statistics Symp., Iowa State University, October 1973.

Google Scholar

[6]

The HASP System Documentation for IBM Type 3 Program, HASP II, Version 3.0, No. 360-D-05.104., IBM Corporation, February 26, 1971.

Google Scholar

[7]

Strauss, J. C., "An Analytic Model of the HASP Execution Task Monitor," Communications of the ACM, Vol. 17, No. 12, December 1974.

Digital Library

Google Scholar

[8]

Wong, K., and J. C. Strauss, "Use of a Software Monitor in the Validation of an Analytic Computer System Model," Software, Practice and Experience, Vol. 4, No. 3, (1974).

Google Scholar

[9]

Chiang, A. T., A Simulation Study of Dynamic Dispatching, Masters Thesis, Computer Science Dept., Washington University, St. Louis, Mo., May 1974.

Google Scholar

Dynamic dispatching in job class scheduled systems
1. General and reference
  1. Cross-computing tools and techniques
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Machine scheduling with job class setup and delivery considerations

We study machine scheduling problems in which the jobs belong to different job classes and they need to be delivered to customers after processing. A setup time is required for a job if it is the first job to be processed on a machine or its processing ...
Intelligent dispatching in dynamic stochastic job shops
WSC '13: Proceedings of the 2013 Winter Simulation Conference: Simulation: Making Decisions in a Complex World

Dispatching rules are common method to schedule jobs in practice. However, they consider only limited factors which influence the priority of jobs. This limited consideration narrows the rules' scope of application. We develop a new hierarchical ...
A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates

Flexible job shop scheduling problem (FJSSP) is generalization of job shop scheduling problem (JSSP), in which an operation may be processed on more than one machine each of which has the same function. Most previous researches on FJSSP assumed that all ...

Comments

Information & Contributors

Information

Published In

AFIPS '75: Proceedings of the May 19-22, 1975, national computer conference and exposition

May 1975

1019 pages

ISBN:9781450379199

DOI:10.1145/1499949

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 May 1975

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
66
Total Downloads

Downloads (Last 12 months)14
Downloads (Last 6 weeks)3

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Recommendations

Machine scheduling with job class setup and delivery considerations

Intelligent dispatching in dynamic stochastic job shops

A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Other Metrics

Article Metrics

Other Metrics

PDF

eReader

Login options

Full Access

Abstract

References

Recommendations

Machine scheduling with job class setup and delivery considerations

Intelligent dispatching in dynamic stochastic job shops

A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations