DocumentCode
2806106
Title
Balancing Workloads of Servers Maintaining Scalable Distributed Data Structures
Author
Lukawski, Grzegorz ; Sapiecha, Krzysztof
Author_Institution
Dept. of Comput. Sci., Kielce Univ. of Technol., Kielce, Poland
fYear
2011
fDate
9-11 Feb. 2011
Firstpage
80
Lastpage
84
Abstract
A new architecture of Scalable Distributed Data Structures (SDDS) is presented and evaluated. It applies for SDDS files with overactive servers. Every bucket of the file is supplemented with a reference counter. The number of references to a bucket is counted up. It reflects 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.
Keywords
data structures; distributed processing; file servers; SDDS file; pattern matching; scalable distributed data structure; server workload balancing; Data processing; Data structures; Merging; Scalability; Servers; Throughput; SDDS; databases; multicomputers; workload balancing;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel, Distributed and Network-Based Processing (PDP), 2011 19th Euromicro International Conference on
Conference_Location
Ayia Napa
ISSN
1066-6192
Print_ISBN
978-1-4244-9682-2
Type
conf
DOI
10.1109/PDP.2011.13
Filename
5738974
Link To Document