{"title":"Scheduling parallel jobs with CPU and I/O resource requirements in cluster computing systems","authors":"J. Abawajy, S. Dandamudi","doi":"10.1109/MASCOT.2003.1240678","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of an on-line coordinated allocation of processor and I/O resources in large-scale shared heterogeneous cluster computing systems. Most research in job scheduling study has focused solely on the allocation of processors to jobs. However, since I/O is also a critical resource for many jobs, the allocation of processor and I/O resources must be coordinated to allow the system to operate most effectively. To this end, we present an efficient job scheduling policy and study its performance under various system and workload parameters. We also compared the performance of the proposed policy with static space time sharing policy. The results show that the proposed policy performs substantially better than the static space time sharing policy.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.2003.1240678","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
This paper addresses the problem of an on-line coordinated allocation of processor and I/O resources in large-scale shared heterogeneous cluster computing systems. Most research in job scheduling study has focused solely on the allocation of processors to jobs. However, since I/O is also a critical resource for many jobs, the allocation of processor and I/O resources must be coordinated to allow the system to operate most effectively. To this end, we present an efficient job scheduling policy and study its performance under various system and workload parameters. We also compared the performance of the proposed policy with static space time sharing policy. The results show that the proposed policy performs substantially better than the static space time sharing policy.