A Distributed Drafting Algorithm for Load Balancing
IEEE Transactions on Software Engineering
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
An effective hash-based algorithm for mining association rules
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
V_THR: an adaptive load balancing algorithm
Journal of Parallel and Distributed Computing
Discrete Mathematics and Its Applications
Discrete Mathematics and Its Applications
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
In this paper, we present a new methodology for managing read-write filesets across multiple file servers of a Distributed File System, thus balancing the load of file access requests across servers. The proposed methodology is based on a rule-based data mining technique and graph theory algorithms. The rule-based technique generates rules from access request data to identify present file access patterns in the system. We then use the rules, graph analysis and statistical information (usage and size of the filesets) to relocate the filesets between different file servers. The algorithm for fileset relocation is based on the graph coloring problem. We tested our algorithms on data collected for five months on DFS file servers in a production environment. Experiments with the data show that our methodology can make intelligent decisions about file system transfers in order to balance the access request load across DFS servers.