Cluster-based multiple task allocation in distributed computing system
Deo Prakash Vidyarthi, Anil Kumar Tripathi, Biplab Kumer Sarker, Anil Kumar Dhawan, Laurence Tianruo Yang · 2004
Summary form only given. 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.