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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Efficient Clustering Model for Utilization of Processor’s Capacity in Distributed Computing System

by Anurag Raii, Vikram Kapoor
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 44 - Number 23
Year of Publication: 2012
Authors: Anurag Raii, Vikram Kapoor
10.5120/6428-8915

Anurag Raii, Vikram Kapoor . Efficient Clustering Model for Utilization of Processor’s Capacity in Distributed Computing System. International Journal of Computer Applications. 44, 23 ( April 2012), 21-25. DOI=10.5120/6428-8915

@article{ 10.5120/6428-8915,
author = { Anurag Raii, Vikram Kapoor },
title = { Efficient Clustering Model for Utilization of Processor’s Capacity in Distributed Computing System },
journal = { International Journal of Computer Applications },
issue_date = { April 2012 },
volume = { 44 },
number = { 23 },
month = { April },
year = { 2012 },
issn = { 0975-8887 },
pages = { 21-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume44/number23/6428-8915/ },
doi = { 10.5120/6428-8915 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:36:19.869338+05:30
%A Anurag Raii
%A Vikram Kapoor
%T Efficient Clustering Model for Utilization of Processor’s Capacity in Distributed Computing System
%J International Journal of Computer Applications
%@ 0975-8887
%V 44
%N 23
%P 21-25
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Distributed Computing System (DCS) computing plays an important role in computing world where processing load is distributed for computational efficiencies. DCS are designed to facilitate the sharing of resources as well as to reduce communication costs, increase throughput, and decrease delay of services. DCS are motivated by the need for cost reduction in tasks execution. In such applications the quality of the output is proportional to the amount of real-time computations. To meet such challenging computing requirements at electrifying speeds efficient clustering strategies are required for proper utilization of Distributed System. In this paper, we proposed a model for efficient utilization of the processing units in distributed environment and calculated the through of individual processor as 0. 339789, 0. 371609 and 0. 529287 which is far better in comparison to the non clustering model of Sig05.

References
  1. A. Tom P. and Ram Murthy, C. S. 1997. An improved algorithm for module allocation in distributed computing Systems. Journal of Parallel and Distributed Computing Systems, Vol. 42, pp. 82-90.
  2. Kafil, M. and Ahmad, I. 1997. Optimal task assignment in heterogeneous computing systems, In Proceeding of Sixth Heterogeneous Computing Workshop, pp. 135-146.
  3. Peng, D. T. , Shin, K. G. and Abdel, Zoher, T. F. 1997. Assignment scheduling communication periodic tasks in distributed real time system. IEEE Transactions on Software Engineering, SE-13, pp. 745- 757.
  4. Chu, W. W. Holloway, L. J. , Lan, M. T. , and Kfe, K. 1980. Task allocation in distributed data processing. IEEE Concurrency, pp. 57-69.
  5. Richard, P. Y. , Edward, M. , Lee, Y. S. , and Tsuchiya, M. 1982. A task allocation model for distributed computing systems. IEEE Transactions on Computers, Vol. C-31, pp. 41- 46.
  6. Shen, C. C. , and Tasi, W. H. 1985. A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion. IEEE Transactions on Computers, Vol. C- 34, pp. 197-203.
  7. Stone, H. S. 1978. Critical load factors in two- processor distributed system. IEEE Transactions on Software Engrg. Vol. 4, pp. 254- 258.
  8. Muhammad, I. A. , Dhodhi, K. , and Ghafoor, A. 1995. Task assignment in distributed computing systems. IEEE Concurrency, pp. 49-53.
  9. Lee, C. H. , Lee, D. and Kim, M. 1997. Optimal task assignment in linear array networks. IEEE Transactions on Computers, Vol. 41, No. 7, pp. 877-880.
  10. Shatz, S. L. , Wang, J. P. , and Goto, M. 1992. Task allocation for maximizing reliability of distributed computer systems. IEEE Transactions on Computers, Vol. 41, 9, pp.
  11. Kartik, S. , and Ram Murthy, C. S. 1997. Task allocation algorithms for maximizing reliability of distributed computing system. IEEE Transactions on computers, Vol. 46, No. 6, pp. 719-724.
  12. Chen, D. J. , Chen, R. S. , Hol, W. C. , Ku, K. L. 1995. A heuristic algorithm for the reliability- oriented file assignment in a distributed computing system. Computers Math. Applic. , Vol. 29, No. 10, pp. 85- 104.
  13. Yin, P. Y. , Yu, S. S. , Wang, P. P. , Wang, Y. T. 2007. Task allocation for maximizing reliability of a distributed system using hybrid particle swarm optimization. The Journal of Systems and Software, Vol. 80, pp. 724-735.
  14. Srinivasan, S. , and Jha, N. K. 1999. Safety and reliability driven task allocation in distributed systems. IEEE transactions on Parallel and Distributed Systems, Vol. 10. No. 3, pp. 238-251.
  15. Vidayarthi, D. P. , and Tripathi, A. K. 2001. Maximizing reliability of distributed computing system with task allocation using simple genetic algorithm. Journal of System Architecture, Vol. 47. pp. 549-559.
  16. Kng, Q. M. , He, H. , Song, H. M. , Deng, R. 2010. Task allocation for maximizing reliability of distributed computing system using honeybee mating optimization. The Journal of Systems and software, Vol. 83, No. 2. pp.
  17. Woo, S. H. , Yang, S. B. , Kim, S. D. , and Han, T. D. 1997. Task scheduling in distributed computing systems with a genetic algorithm. Doi. 0- 8186- 7901- 8/97 10. 000, IEEE p. p. 301-305.
  18. Lu, H. 1996. Load balanced task allocation in locally distributed computer sciences. Technical report# 633.
  19. Elsadek, A. A. , and Wells, B. E. 1999. A heuristic model for task allocation in heterogeneous distributed computing systems. International journal of computers and there applications, Vol. 6, No. 1, March 1999. pp. 1-35.
  20. Lo, V. M. 1988. Heuristic algorithms for task assignment in distributed systems. IEEE Transactions on computers, Vol. 37. No. 11, pp. 1384- 1397.
  21. Kfe, K. 1982. Heuristic models of task assignment scheduling in distributed systems. Computer, Vol. 15, pp. 50- 56.
  22. Ellis, H. , Sahni, S. and Rajsekaram, S. 2005. Fundamentals of computers algorithm. Galgotiya publication Pvt Ltd.
  23. Tushar Deepak Chandra, Vassos Hadzilacos , Sam Toueg 1996. The weakest failure detector for solving consensus. In the Journal of ACM (JACM), Volume 43 Issue 4
  24. Florina M. Ciorba, Timothy Hansen, Srishti Srivastava, Ioana Banicescu, Anthony A. Maciejewski, and Howard Jay Siegel, "A Combined Dual-stage Framework for Robust Scheduling of Scientific Applications in Heterogeneous Environments with Uncertain Availability," 21st Heterogeneity in Computing Workshop (HCW 2012).
  25. Mourad Elhadef and Amiya Nayak, Comparison-Based System-Level Fault Diagnosis: A Neural Network Approach IEEE transactions on parallel and distributed systems, vol. 23, no. 6, june 2012
  26. Jay Smith, Edwin K. P. Chong, Anthony A. Maciejewski, and Howard Jay Siegel, "Overlay Network Resource Allocation Using a Decentralized Market-Based Approach," Future Generation Computer Systems, Vol. 28, No. 1,pp. 24-35, Jan. 2012.
Index Terms

Computer Science
Information Sciences

Keywords

Distributed System Communication Cost Clustering

Powered by PhDFocusTM