{"title":"A simulation-based performance analysis of gang scheduling in a distributed system","authors":"H. Karatza","doi":"10.1109/SIMSYM.1999.766450","DOIUrl":null,"url":null,"abstract":"In distributed systems job scheduling is a difficult problem. In this work we study a special type of scheduling called gang scheduling under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors. The performance of various gang scheduling schemes is studied and compared for a variety of workloads. The main objective of the processor schedulers is to achieve high overall system throughput while at the same time providing some guarantee for the performance of individual jobs in the system.","PeriodicalId":104054,"journal":{"name":"Proceedings 32nd Annual Simulation Symposium","volume":"358 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 32nd Annual Simulation Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIMSYM.1999.766450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 30
Abstract
In distributed systems job scheduling is a difficult problem. In this work we study a special type of scheduling called gang scheduling under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors. The performance of various gang scheduling schemes is studied and compared for a variety of workloads. The main objective of the processor schedulers is to achieve high overall system throughput while at the same time providing some guarantee for the performance of individual jobs in the system.