Cited By
View all- Gonzalez CTavakoli K(1988)A model for an adaptive schedulerProceedings of the 1988 ACM sixteenth annual conference on Computer science10.1145/322609.322788(424-428)Online publication date: 1-Feb-1988
Scheduling with deadline requirements
Pages 471 - 475
References
[1]
J. W. Boyse, D. R. Warn, "A Straight Forward Model for Computer Performance Prediction,': Computer Surveys, 7, 2, 1975.
[2]
R. M. Brownm, J. C. Browne, K. M. Chandy, "Memory Management and Response Time," CACM, 20, 3, pp 153-165, March 1977.
[3]
E. G. Coffman, L. Kleinrock, "Computer Scheduling Methods and their Countermeasures," SJCC, 1968.
[4]
R. W. Conway, W. L. Maxwell, and L. W. Miller, "Theory of Scheduling," Addison- Wesley, 1967.
[5]
P. J. Denning, "The Working-set Model for Program Behavior," CACM, ii, 5, May 1968.
[6]
C. M. Gonzalez, "Performance Measurements of the Scheduler in the PDP-10 Tenex Operating System," Case Western Reserve University, Technical report #1181, January 1975.
[7]
H. Kameda, "Optimality of Central Processor Scheduling Policy for Processing a Job Stream," ACM Trans Comp Syst, 2, I, pp 78-90, Feb. 1984.
[8]
J. R. Jackson, "Scheduling a Production Line to Minimize Maximum Tardiness," Research Report 43, Management Sciences Research Project, UCLA, 1955.
[9]
L. Kleinrock, "A Delay Dependent Queue Discipline," Naval Res. Log. Quart. II, 329 -341, 1964.
[10]
C. H. Sauer, K. M. Chandy, "Computer Systems Performance Modeling," Prentice- Hall, 1981.
[11]
S. W. Sherman, F. Baskett, J. C. Browne, "Trace Driven Modeling and Analysis of CPU Scheduling in Multiprogramming Systems'$ CACM, 15, 1972.
Recommendations
Preemptive Hadoop Jobs Scheduling under a Deadline
SKG '12: Proceedings of the 2012 Eighth International Conference on Semantics, Knowledge and GridsMapReduce has become the dominant programming model in a cloud-based data processing environment, such as Hadoop. First In First Out (FIFO) is the default job scheduling policy of Hadoop, but it cannot guarantee that the job will be completed by a ...
Deadline Fair Scheduling: Bridging the Theory and Practice of Proportionate Fair Scheduling in Multiprocessor Systems
RTAS '01: Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)Abstract: In this paper, we present Deadline Fair Scheduling (DFS), a proportionate-fair CPU scheduling algorithm for multiprocessor servers. A particular focus of our work is to investigate practical issues in instantiating proportionate-fair (P-fair) ...
On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
We consider the problem of scheduling n unit-time jobs with multiple release time/deadline intervals, which are intervals of time in which the job can be scheduled. A feasible schedule is one in which each job is run in its entirety within one of its ...
Comments
Information & Contributors
Information
Published In
Copyright © 1985 ACM.
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]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 October 1985
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 244Total Downloads
- Downloads (Last 12 months)40
- Downloads (Last 6 weeks)21
Reflects downloads up to 23 Dec 2024
Other Metrics
Citations
Cited By
View all- Gonzalez CTavakoli K(1988)A model for an adaptive schedulerProceedings of the 1988 ACM sixteenth annual conference on Computer science10.1145/322609.322788(424-428)Online publication date: 1-Feb-1988
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in