CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
Reseach Article

Cost Optimization of Distributed Computing System with Dynamic Re-Allocation

by Faizul Navi Khan, Kapil Govil, R.k. Dwivedi
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 122 - Number 22
Year of Publication: 2015
Authors: Faizul Navi Khan, Kapil Govil, R.k. Dwivedi
10.5120/21859-5186

Faizul Navi Khan, Kapil Govil, R.k. Dwivedi . Cost Optimization of Distributed Computing System with Dynamic Re-Allocation. International Journal of Computer Applications. 122, 22 ( July 2015), 30-35. DOI=10.5120/21859-5186

@article{ 10.5120/21859-5186,
author = { Faizul Navi Khan, Kapil Govil, R.k. Dwivedi },
title = { Cost Optimization of Distributed Computing System with Dynamic Re-Allocation },
journal = { International Journal of Computer Applications },
issue_date = { July 2015 },
volume = { 122 },
number = { 22 },
month = { July },
year = { 2015 },
issn = { 0975-8887 },
pages = { 30-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume122/number22/21859-5186/ },
doi = { 10.5120/21859-5186 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:11:15.534743+05:30
%A Faizul Navi Khan
%A Kapil Govil
%A R.k. Dwivedi
%T Cost Optimization of Distributed Computing System with Dynamic Re-Allocation
%J International Journal of Computer Applications
%@ 0975-8887
%V 122
%N 22
%P 30-35
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A Distributed Computing System (DCS) is a combination of application and system programs that exchanges data across a number of independent terminals connected by a communication network. Cost optimization in DCS can be achieve by optimize the performance of DCS. In task allocation two types of approaches are available and these are dynamic and static. Dynamic approach of task allocation is much better as compare to static, since it makes the best use of available computational resources in DCS. Task allocation problem can be describe as 'm' number tasks are required to execute on 'n' number of processors where number tasks (m) is always greater than number of processors (n) (m>n). This research offers a cost optimization algorithm with dynamic re-allocation of tasks to allocate the 'm' number of tasks on 'n' number of processors in DCS and their execution completes in k number of phases. Proposed algorithm is tested in MATLAB environment and it is noticed that obtained results are better as compared to past algorithms. Cost optimization dynamic model present in this research is helpful in performance optimization of DCS and also reduce the cost of task allocation in DCS.

References
  1. A. Farinelli, L. Iocchi, D. Nardi, V. A. Ziparo. 2005. Task Assignment with dynamic perception and constrained tasks in a Multi-Robot System, Proc. of Intern. Conf. on Robotics and Automation (ICRA'05)
  2. Faizul Navi Khan, KapilGovil. 2014. A TRICKY TASK SCHEDULING TECHNIQUE TO OPTIMIZE TIME COST AND RELIABILITY IN MOBILE COMPUTING ENVIRONMENT, International Journal of Research in Engineering and Technology, Vol. 3 Issue 5, 823-829
  3. Faizul Navi Khan, KapilGovil. 2014. AN EFFICIENT TASK SCHEDULING ALGORITHM TO OPTIMIZE RELIABILITY IN MOBILE COMPUTING, International Journal of Advances in Engineering & Technology, Vol. 7 Issue 2, 635-641
  4. Faizul Navi Khan, KapilGovil. 2014. A Static approach to optimize time cost and reliability in Distributed Processing Environment. International Journal of Scientific & Engineering Research, Vol. 05, Issue 5, 1016-1021
  5. Faizul Navi Khan, KapilGovil. 2013. Cost Optimization Technique of Task Allocation in Heterogeneous Distributed Computing System, Int. J. Advanced Networking and Applications, Vol. 5 Issue 3, 1913-1916
  6. Faizul Navi Khan, Kapil Govil. 2014. Cluster based optimization routing strategy for data communication in Mobile Computing, International Journal of Computer Applications, Volume 99, Issue 2, 19-24
  7. Faizul Navi Khan, Kapil Govil. 2013. Distributed Task Allocation Scheme for Performance Improvement in Mobile Computing Network, International Journal of Trends in Computer Science, Vol. 2 Issue 3. 809-817
  8. Faizul Navi Khan, Kapil Govil, AlokAgarwal. 2014 Performance enhancement of distributed network system by Phase-wise dynamic task allocation, 2014, International Conference on Parallel, Distributed and Grid Computing (PGDC 2014), IEEE Proceedings, ISBN. 978-1-4799-7681-2
  9. Faizul Navi Khan, KapilGovil. 2013. Static Approach for Efficient Task Allocation in Distributed Environment, International Journal of Computer Applications, Vol. 81 Issue 15, 19-22
  10. Harendra Kumar, M. P. Singh, P. K. Yadav. 2013. Optimal Tasks Assignment for Multiple Heterogeneous Processors with Dynamic Re-assignment, International Journal of Computers & Technology, Vol. 4, No. 2, 528-535
  11. Kapil Govil. 2011. A Smart Algorithm for Dynamic Task Allocation for Distributed Processing Environment, International Journal of Computer Applications, Vol. 28, No. 2, 13-19
  12. M. P, Singh, P. K. Yadav, H. Kumar, B. Agarwal. 2012. Dynamic Tasks Scheduling Model for Performance Evaluation of a Distributed Computing System through Artificial Neural Network, Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) (Advances in Intelligent and Soft Computing: Published by Springer ) Vol. 130, 321-331
  13. Manisha Sharma, Harendra Kumar, Deepak Garg. 2012. An Optimal Task Allocation Model through Clustering with Inter-Processor Distances in Heterogeneous Distributed Computing Systems, International Journal of Soft Computing and Engineering, Vol. 2 No. 1, 50-55
  14. Monika Choudhary, Sateesh Kumar Peddoju. 2012. A Dynamic Optimization Algorithm for Task Scheduling in Cloud Environment, International Journal of Engineering Research and Applications (IJERA), Vol. 2, Issue 3, 2564-2568
  15. N. Beaumont. 2009. Using dynamic programming to determine an optimal strategy in a contract bridge tournament, Journal of the Operational Research Society, Vol 61, Issue 5, 732-739
  16. P Visalakshi, S N Sivanandam. 2009. Dynamic Task Scheduling with Load Balancing using Hybrid Particle Swarm Optimization, Int. J. Open Problems Compt. Math. , Vol 2, No. 3, 475-488
  17. Pradeep Kumar Yadav, M. P. Singh and Harendra Kumar. 2008. Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment, Journal of Computer Systems, Networks, and Communications, Vol 2008, doi:10. 1155/2008/578180, 1-9
  18. SagarDhakal, Majeed M. Hayat, Jorge E. Pezoa, Cundong Yang, David A. Bader. 2007. Dynamic Load Balancing in Distributed Systems in the Presence of Delays:A Regeneration-Theory Approach, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, Vol. 18, No. 4, 485-497
  19. ShenChenglin, Zhang Xinxin. 2009. Dynamic Mechanisms of Task-assignment for Virtual Enterprises Based on Multi-agent Theory, Proceedings of the 2009 International Symposium on Web Information Systems and Applications (WISA'09), 525-528
  20. SunitaBansal, Bhavik Kothari, ChittaranjanHota. 2011. Dynamic Task-Scheduling in Grid Computing using Prioritized Round Robin Algorithm, IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 2,472-477
  21. V. Pilloni, P. Navaratnam, S. Vural, L. Atzori, R. Tafazolli. 2014. TAN: A Distributed Algorithm for Dynamic Task Assignment in WSNs, Sensors Journal, IEEE, Vol. 14, Issue 4, 1266 - 1279
  22. XiangzhenKonga, Chuang Lina, YixinJianga, Wei Yana, Xiaowen Chub. 2011. Efficient dynamic task scheduling in virtualized data centers with fuzzy prediction, Journal of Network and Computer Applications, Vol. 34, Issue 4, 1068–1077
Index Terms

Computer Science
Information Sciences

Keywords

Distributed Network Dynamic Allocation Performance Residing cost Reallocation cost