{"title":"具有重排序的分布式系统中程序的分配","authors":"H. Karatza","doi":"10.1109/SIMSYM.1998.668427","DOIUrl":null,"url":null,"abstract":"The assignment of independent applications in a distributed system in conjunction with resequencing is studied in this paper using simulation techniques. Three scheduling policies are studied and compared. A probabilistic policy, and two policies that use an estimation of job service time, one deterministic and one adaptive. Their performance is examined for a variety of workloads. The impact on performance of resequencing delay is also explored.","PeriodicalId":339060,"journal":{"name":"Proceedings 31st Annual Simulation Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Assignment of programs in a distributed system with resequencing\",\"authors\":\"H. Karatza\",\"doi\":\"10.1109/SIMSYM.1998.668427\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The assignment of independent applications in a distributed system in conjunction with resequencing is studied in this paper using simulation techniques. Three scheduling policies are studied and compared. A probabilistic policy, and two policies that use an estimation of job service time, one deterministic and one adaptive. Their performance is examined for a variety of workloads. The impact on performance of resequencing delay is also explored.\",\"PeriodicalId\":339060,\"journal\":{\"name\":\"Proceedings 31st Annual Simulation Symposium\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 31st Annual Simulation Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIMSYM.1998.668427\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 31st Annual Simulation Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIMSYM.1998.668427","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Assignment of programs in a distributed system with resequencing
The assignment of independent applications in a distributed system in conjunction with resequencing is studied in this paper using simulation techniques. Three scheduling policies are studied and compared. A probabilistic policy, and two policies that use an estimation of job service time, one deterministic and one adaptive. Their performance is examined for a variety of workloads. The impact on performance of resequencing delay is also explored.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
