This work proposes a load balance algorithm to parallel processing based on a variation of the classical knapsack problem. The problem considers the distribution of a set of partitions, defined by the number of clusters, over a set of processors attempting to achieve a minimal overall processing cost. The work is an optimization for the parallel fuzzy c-means (FCM) clustering analysis algorithm proposed in a previous work composed by two distinct parts: the cluster analysis, properly said, using the FCM algorithm to calculate of clusters centers and the PBM index to evaluate partitions, and the load balance, which is modeled by the multiple knapsack problem and implemented through a heuristic that incorporates the restrictions related to cluster analysis in order to gives more efficiency to the parallel process. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Modenesi, M. V., Evsukoff, A. G., & Costa, M. C. A. (2008). A load balancing knapsack algorithm for parallel fuzzy c-means cluster analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5336 LNCS, pp. 269–279). https://doi.org/10.1007/978-3-540-92859-1_24
Mendeley helps you to discover research relevant for your work.