The Community for Technology Leaders
2008 IEEE International Conference on Data Mining Workshops (2008)
Dec. 15, 2008 to Dec. 19, 2008
ISBN: 978-0-7695-3503-6
pp: 543-552
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.
Distributed Linear Programming, Simplex Algorithm, Distributed Resource Management Via Linear Programming

H. Kargupta and H. Dutta, "Distributed Linear Programming and Resource Management for Data Mining in Distributed Environments," 2008 IEEE International Conference on Data Mining Workshops(ICDMW), vol. 00, no. , pp. 543-552, 2008.
87 ms
(Ver 3.3 (11022016))