TY - GEN
T1 - Distributed linear programming and resource management for data mining in distributed environments
AU - Dutta, Haimonti
AU - Kargupta, Hillol
PY - 2008
Y1 - 2008
N2 - Advances in computing and communication has resulted in very large scale distributed environments in recent years. They are capable of storing large volumes of data and often have multiple compute nodes. However, the inherent heterogeneity of data components, the dynamic nature of distributed systems, the need for information synchronization and data fusion over a network and security and access control issues makes the problem of resource management and monitoring a tremendous challenge. In particular, centralized algorithms for management of resources and data may not be sufficient to manage complex distributed systems. In this paper, we present a distributed algorithm for resource and data management which builds on the traditional simplex algorithm used for solving linear optimization problems. Our distributed algorithm is an exact one meaning its results are identical if run in a centralized setting. We provide extensive analytical results and experiments on simulated data to demonstrate the performance of our algorithm.
AB - Advances in computing and communication has resulted in very large scale distributed environments in recent years. They are capable of storing large volumes of data and often have multiple compute nodes. However, the inherent heterogeneity of data components, the dynamic nature of distributed systems, the need for information synchronization and data fusion over a network and security and access control issues makes the problem of resource management and monitoring a tremendous challenge. In particular, centralized algorithms for management of resources and data may not be sufficient to manage complex distributed systems. In this paper, we present a distributed algorithm for resource and data management which builds on the traditional simplex algorithm used for solving linear optimization problems. Our distributed algorithm is an exact one meaning its results are identical if run in a centralized setting. We provide extensive analytical results and experiments on simulated data to demonstrate the performance of our algorithm.
UR - https://www.scopus.com/pages/publications/62449142600
U2 - 10.1109/ICDMW.2008.137
DO - 10.1109/ICDMW.2008.137
M3 - Conference contribution
SN - 9780769535036
T3 - Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008
SP - 543
EP - 552
BT - Proceedings - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008
T2 - IEEE International Conference on Data Mining Workshops, ICDM Workshops 2008
Y2 - 15 December 2008 through 19 December 2008
ER -