loading...
Cluster-Based Multiple Task Allocation in Distributed Computing System
Santa Fe, New Mexico April 26-April 30
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.130329118th International Parallel and Distr ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Deo Prakash Vidyarthi, Banaras Hindu University
Anil Kumar Tripathi, Banaras Hindu University
Biplab Kumer Sarker, Kobe University
Abhishek Dhawan, Cochin University
Laurence Tianruo Yang, St. Francise Xavier University
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
Usage of this product signifies your acceptance of the Terms of Use.