SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Better approximation algorithms for bin covering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SETI@home: an experiment in public-resource computing
Communications of the ACM
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Skip Lists: A Probabilistic Alternative to Balanced Trees
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Practical, distributed network coordinates
ACM SIGCOMM Computer Communication Review
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
A Distributed Algorithm for Resource Clustering in Large Scale Platforms
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm
INFORMS Journal on Computing
| Hi-index | 0.00 |
In this paper, we consider the clustering of resources on large scale platforms. More precisely, we target parallel applications consisting of independant tasks, where each task is to be processed on a different cluster. In this context, each cluster should be large enough so as to hold and process a task, and the maximal distance between two hosts belonging to the same cluster should be small in order to minimize latencies of intra-cluster communications. This corresponds to maximum bin covering with an extra distance constraint. We describe a distributed approximation algorithm that computes resource clustering with coordinates in 茂戮驴 in O(log2n) steps and O(nlogn) messages, where nis the overall number of hosts. We prove that this algorithm provides an approximation ratio of $\frac{1}{3}$.