18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 13
Cluster-Based Multiple Task Allocation in Distributed Computing System
Santa Fe, New Mexico
April 26-April 30
ISBN: 0-7695-2132-0
Most of the task allocation models & algorithms in Distributed Computing System (DCS) require a priori knowledge of its execution time on the processing nodes. Since the task assignment is not known in advance, this time is quite difficult to estimate. We propose a cluster-based dynamic allocation scheme, in a distributed computing system, which eliminate this time requirement. Further, as opposed to a single task allocation, generally proposed in most of the models, we consider multiple tasks. A fuzzy function is used for both the module clustering and processor clustering. Dynamic invocation of clustering and assignment is considered. Experimental results show the efficacy of the proposed model.
Index Terms:
Load, InterProcessor Distance, Task partitioning, Heterogeneous DCS, Inter-Module communication
Citation:
Deo Prakash Vidyarthi, Anil Kumar Tripathi, Biplab Kumer Sarker, Abhishek Dhawan, Laurence Tianruo Yang, "Cluster-Based Multiple Task Allocation in Distributed Computing System," ipdps, vol. 14, pp.239, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 13, 2004