Towards provision of Quality of Service guarantees in job scheduling

Proceedings - IEEE International Conference on Cluster Computing, ICCC

Volumn , Issue , 2004, Pages 245-254

  Islam, Mohammad ^a   Balaji, Pavan ^a   Sadayappan, P ^a   Panda, D K ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTING CENTER; JOB SCHEDULING; RESPONSE-TIME GUARANTEES; USER TOLERANCE;

ALGORITHMS; COMPUTER SIMULATION; FITS AND TOLERANCES; HEURISTIC METHODS; JOB ANALYSIS; MATHEMATICAL MODELS; SCHEDULING; USER INTERFACES;

QUALITY OF SERVICE;

EID: 20444435493     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2004.1392622     Document Type: Conference Paper

References (15)

1. NERSC. http://hpcf.nersc.gov/accounts/priority_charging.html.
2. S. H. Chiang and M. K. Vernon. Production Job Scheduling for Parallel Shared Memory Systems. In IPDPS, 2001.
3. W. Cirne and F. Berman. Adaptive Selection of Partition Size of Supercomputer Requests. In JSSPP, 2000.
4. D. G. Feitelson. Logs of Real Parallel Workloads from Production Systems.
5. D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, K. C. Sevcik, and P. Wong. Theory and Practice in Parallel Job Scheduling. In JSSPP, 1997.
6. P. Holenarsipur, V. Yarmolenko, J. Duato, D. K. Panda, and P. Sadayappan. Characterization and Enhancement of Static Mapping Heuristics for Heterogeneous Systems. In HiPC, 2000.
7. M. Islam, P. Balaji, P. Sadayappan, and D. K. Panda. QoPS: A QoS based scheme for Parallel Job Scheduling. In JSSPP, 2003.
8. M. Islam, P. Balaji, P. Sadayappan, and D. K. Panda. Towards Provision of Quality of Service Guarantees in Job Scheduling. Technical Report OSU-CISRC-5/04-TR24, The Ohio State University, 2004.
9. B. Jackson, Brian Haymore, Julio Facelli, and Quinn O. Snell. Improving Cluster Utilization Through Set Based Allocation Policies. In IEEE Workshop on Scheduling and Resource Management for Cluster Computing, 2001.
10. P. Keleher, D. Zotkin, and D. Perkovic. Attacking the Bottlenecks in Backfi Hing Schedulers. In Cluster Computing: The Journal of Networks, Software Tools and Applications, March 2000.
11. A. K. Mok. Fundamental design problems of distributed systems for the hard real-time environment. PhD thesis, Massachussetts Institute of Technology, 1983.
12. A. K. Mok. The design of real-time programming systems based on process models. In Real Time Systems Symposium, 1984.
13. A. K. Mok and M. L. Dertouzos. Multi-Processor Scheduling in a Hard Real-Time Environment. In Texas Conference on Computing Systems, 1978.
14. A. W. Mualem and D. G. Feitelson. Utilization, Predictability, Workloads and User Estimated Runtime Esti mates in Scheduling the IBM SP2 with Backfi lling. In TPDS, 2001.
15. D. Perkovic and P. J. Keleher. Randomization, Speculation and Adaptation in Batch Schedulers. In SC, 2000.