Balancing Workloads of Servers Maintaining Scalable Distributed Data Structures

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.