{"title":"平衡服务器负载,维护可扩展的分布式数据结构","authors":"Grzegorz Lukawski, K. Sapiecha","doi":"10.1109/PDP.2011.13","DOIUrl":null,"url":null,"abstract":"A new architecture of Scalable Distributed Data Structures (SDDS) is presented and evaluated. It applies forSDDS ?les with overactive servers. Every bucket of the ?leis supplemented with a reference counter. The number of references to a bucket is counted up. It re?ects activity of the bucket and is used for selecting the most active and most often used buckets (overactive servers). Workloads of the servers are then balanced with the help of so called scalability of throughput. It is proven that this gives very good results for read-mostly databases, where extensive pattern matching takes place.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"217 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Balancing Workloads of Servers Maintaining Scalable Distributed Data Structures\",\"authors\":\"Grzegorz Lukawski, K. Sapiecha\",\"doi\":\"10.1109/PDP.2011.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new architecture of Scalable Distributed Data Structures (SDDS) is presented and evaluated. It applies forSDDS ?les with overactive servers. Every bucket of the ?leis supplemented with a reference counter. The number of references to a bucket is counted up. It re?ects activity of the bucket and is used for selecting the most active and most often used buckets (overactive servers). Workloads of the servers are then balanced with the help of so called scalability of throughput. It is proven that this gives very good results for read-mostly databases, where extensive pattern matching takes place.\",\"PeriodicalId\":341803,\"journal\":{\"name\":\"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing\",\"volume\":\"217 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-02-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDP.2011.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDP.2011.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Balancing Workloads of Servers Maintaining Scalable Distributed Data Structures
A new architecture of Scalable Distributed Data Structures (SDDS) is presented and evaluated. It applies forSDDS ?les with overactive servers. Every bucket of the ?leis supplemented with a reference counter. The number of references to a bucket is counted up. It re?ects activity of the bucket and is used for selecting the most active and most often used buckets (overactive servers). Workloads of the servers are then balanced with the help of so called scalability of throughput. It is proven that this gives very good results for read-mostly databases, where extensive pattern matching takes place.