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

Reliable Clustering Model for Enhancing Processors Throughput 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 38 - Number 8
Year of Publication: 2012
Authors: Anurag Raii, Vikram Kapoor
10.5120/4712-6883

Anurag Raii, Vikram Kapoor . Reliable Clustering Model for Enhancing Processors Throughput in Distributed Computing System. International Journal of Computer Applications. 38, 8 ( January 2012), 47-50. DOI=10.5120/4712-6883

@article{ 10.5120/4712-6883,
author = { Anurag Raii, Vikram Kapoor },
title = { Reliable Clustering Model for Enhancing Processors Throughput in Distributed Computing System },
journal = { International Journal of Computer Applications },
issue_date = { January 2012 },
volume = { 38 },
number = { 8 },
month = { January },
year = { 2012 },
issn = { 0975-8887 },
pages = { 47-50 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume38/number8/4712-6883/ },
doi = { 10.5120/4712-6883 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:24:55.351867+05:30
%A Anurag Raii
%A Vikram Kapoor
%T Reliable Clustering Model for Enhancing Processors Throughput in Distributed Computing System
%J International Journal of Computer Applications
%@ 0975-8887
%V 38
%N 8
%P 47-50
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A distributed computing system is the system architecture that makes a collection of heterogeneous computers, workstations, or servers act and behave as a single computing system. In such a computing environment, users can uniformly access and name local or remote resources, and run processes from anywhere in the system, without being aware of which computers their processes are running on. Distributed computing systems have been studied extensively by researchers, and a great many claims and benefits have been made for using such systems. In fact, it is hard to rule out any desirable feature of a computing system that has not been claimed to be offered by a distributed system. However, the current advances in processing and networking technology and software tools make it feasible to achieve the diverse advantages like increased performance, Cost-effectiveness, Sharing of resources, increased extendibility. To meet such challenging computing requirements reliability plays an important role. In this paper authors are proposing a model for enhancing processors throughput in distributed computing system.

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.
Index Terms

Computer Science
Information Sciences

Keywords

Distributed System Task Communication Cost Clustering

Powered by PhDFocusTM