{"title":"TAGS和扩展的TAGS算法","authors":"Zhang Jun-yan, Min Fan, Yang Guo-wei","doi":"10.1109/PDCAT.2003.1236395","DOIUrl":null,"url":null,"abstract":"In a distributed Web server system where tasks are not preemptible, the most important issue for improving quality of service (QoS) is how to realize fairness and reduce average slow down. We analyze TAGS (task assignment by guessing size) algorithm and put forward an algorithm named extended TAGS by integrating central queue algorithm and TAGS, together with its performance analysis, system parameter setting algorithm subject to fairness requirement, and optimal grouping method.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"TAGS and extended TAGS algorithm\",\"authors\":\"Zhang Jun-yan, Min Fan, Yang Guo-wei\",\"doi\":\"10.1109/PDCAT.2003.1236395\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a distributed Web server system where tasks are not preemptible, the most important issue for improving quality of service (QoS) is how to realize fairness and reduce average slow down. We analyze TAGS (task assignment by guessing size) algorithm and put forward an algorithm named extended TAGS by integrating central queue algorithm and TAGS, together with its performance analysis, system parameter setting algorithm subject to fairness requirement, and optimal grouping method.\",\"PeriodicalId\":145111,\"journal\":{\"name\":\"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDCAT.2003.1236395\",\"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 Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2003.1236395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
在任务不可抢占的分布式Web服务器系统中,如何实现公平性和降低平均慢速是提高服务质量的关键问题。对TAGS (task assignment by guess size)算法进行了分析,将中央队列算法与TAGS相结合,提出了一种扩展的TAGS算法,并对其性能进行了分析,提出了符合公平性要求的系统参数设置算法和最优分组方法。
In a distributed Web server system where tasks are not preemptible, the most important issue for improving quality of service (QoS) is how to realize fairness and reduce average slow down. We analyze TAGS (task assignment by guessing size) algorithm and put forward an algorithm named extended TAGS by integrating central queue algorithm and TAGS, together with its performance analysis, system parameter setting algorithm subject to fairness requirement, and optimal grouping method.