{"title":"多级多服务器任务分配与工作保护迁移","authors":"Malith Jayasinghe, Z. Tari, P. Zeephongsekul","doi":"10.1109/NCA.2010.31","DOIUrl":null,"url":null,"abstract":"Size-based task assignment policies have shown significant performance improvements over traditional task assignment policies under highly variable workload conditions. However, these policies are not suitable to assign tasks in time sharing systems. Moreover, these policies are not scalable and they also generate significant amount of wasted processing. This paper proposes a Multi-Level-Multi-Server Task Assignment Policy with Work-Conserving Migration (MLMS-WC-M) that addresses these issues. MLMS-WC-M has three important features. First, it gives preferential treatment to tasks with short processing requirements. Second, it utilises a 2-level variance reduction mechanism. Third, it supports work-conserving migration. We evaluate the performance of MLMS-WC-M against the performance of several well known task assignment policies. The proposed policy outperforms existing policies significantly under a wide range of workload conditions.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Multi-level Multi-server Task Assignment with Work-Conserving Migration\",\"authors\":\"Malith Jayasinghe, Z. Tari, P. Zeephongsekul\",\"doi\":\"10.1109/NCA.2010.31\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Size-based task assignment policies have shown significant performance improvements over traditional task assignment policies under highly variable workload conditions. However, these policies are not suitable to assign tasks in time sharing systems. Moreover, these policies are not scalable and they also generate significant amount of wasted processing. This paper proposes a Multi-Level-Multi-Server Task Assignment Policy with Work-Conserving Migration (MLMS-WC-M) that addresses these issues. MLMS-WC-M has three important features. First, it gives preferential treatment to tasks with short processing requirements. Second, it utilises a 2-level variance reduction mechanism. Third, it supports work-conserving migration. We evaluate the performance of MLMS-WC-M against the performance of several well known task assignment policies. The proposed policy outperforms existing policies significantly under a wide range of workload conditions.\",\"PeriodicalId\":276374,\"journal\":{\"name\":\"2010 Ninth IEEE International Symposium on Network Computing and Applications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Ninth IEEE International Symposium on Network Computing and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCA.2010.31\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Ninth IEEE International Symposium on Network Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA.2010.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multi-level Multi-server Task Assignment with Work-Conserving Migration
Size-based task assignment policies have shown significant performance improvements over traditional task assignment policies under highly variable workload conditions. However, these policies are not suitable to assign tasks in time sharing systems. Moreover, these policies are not scalable and they also generate significant amount of wasted processing. This paper proposes a Multi-Level-Multi-Server Task Assignment Policy with Work-Conserving Migration (MLMS-WC-M) that addresses these issues. MLMS-WC-M has three important features. First, it gives preferential treatment to tasks with short processing requirements. Second, it utilises a 2-level variance reduction mechanism. Third, it supports work-conserving migration. We evaluate the performance of MLMS-WC-M against the performance of several well known task assignment policies. The proposed policy outperforms existing policies significantly under a wide range of workload conditions.