{"title":"同一机器上临时任务的在线负载平衡","authors":"Y. Azar, L. Epstein","doi":"10.1109/ISTCS.1997.595163","DOIUrl":null,"url":null,"abstract":"We prove an exact lower bound of 2-1/m on the competitive ratio of any deterministic algorithm for load balancing of temporary tasks on m identical machines. We also show a lower bound of 2-1/m for randomized algorithms for small m and 2-2/m+1 for general m. If in addition, we restrict the sequence to polynomial length, then the lower bound for randomized algorithms becomes 2-O(log log m/log m) for general m.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"On-line load balancing of temporary tasks on identical machines\",\"authors\":\"Y. Azar, L. Epstein\",\"doi\":\"10.1109/ISTCS.1997.595163\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prove an exact lower bound of 2-1/m on the competitive ratio of any deterministic algorithm for load balancing of temporary tasks on m identical machines. We also show a lower bound of 2-1/m for randomized algorithms for small m and 2-2/m+1 for general m. If in addition, we restrict the sequence to polynomial length, then the lower bound for randomized algorithms becomes 2-O(log log m/log m) for general m.\",\"PeriodicalId\":367160,\"journal\":{\"name\":\"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISTCS.1997.595163\",\"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 of the Fifth Israeli Symposium on Theory of Computing and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTCS.1997.595163","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On-line load balancing of temporary tasks on identical machines
We prove an exact lower bound of 2-1/m on the competitive ratio of any deterministic algorithm for load balancing of temporary tasks on m identical machines. We also show a lower bound of 2-1/m for randomized algorithms for small m and 2-2/m+1 for general m. If in addition, we restrict the sequence to polynomial length, then the lower bound for randomized algorithms becomes 2-O(log log m/log m) for general m.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
