International Research Journal of Commerce , Arts and Science

 ( Online- ISSN 2319 - 9202 )     New DOI : 10.32804/CASIRJ

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 30    Submit Your Rating     Cite This   Download        Certificate

A MATHEMATICAL APPROACH FOR IMPROVING THE RELIABILITY IN COMPUTING SYSTEM

    1 Author(s):  JUGMENDRA SINGH

Vol -  6, Issue- 9 ,         Page(s) : 77 - 86  (2015 ) DOI : https://doi.org/10.32804/CASIRJ

Abstract

Reliability is the extent to which a measurement procedure yields the same results on repeated trials. Without reliable measures, scientists cannot build or test theory, and therefore cannot develop productive and efficient procedures for improving the quality of life. Reliability analysis for any distributed computing system is the current necessity and most important area of research. There are number of ways to improve the reliability of the distributed computing system. Optimizing the reliability through task allocation is one of the problems in this category.

  1. K.K. Bhutani, “Distributed Computing”, The Indian Journal of Telecommunication,  pp. 41-44, 1994.
  2. B.R. Sitaram, “Distributed Computing-A User’s View Point”, CSI Communications, Vol.-18 No. 10, pp.26-28, 1965.
  3. D.F. Baca, “Allocation Tasks to Processor in a Distributed System,” IEEE Trans. On Software Engineering, Vol.15 pp.1427-1436, 1989. 
  4. W.W. Chu, “Optimal File Allocation in a Multiple Comp. Sys.”, IEEE Trans. on Comp., Vol.C-18 pp.885-889, 1969.
  5. R.Y. Richard, E.Y.S. Lee and M. Tsuchiya, “ A Task Allocation Model for Distributed Computer System”, IEEE Trans. On Computer, Vol.C-31 pp.41-47, 1982.
  6. Vinod Kumar, M.P. Singh, P.K. Yadav, “A fast algorithm for allocation task in distributed processing system,” proceedings of the 30th Annual convention of computer society of India, Hyderabad, pp.347-358, 1995.
  7. Vinod Kumar, M.P. Singh, P.K. Yadav, “An efficient Algorithm for allocating tasks to processors in a distributed system,” Proceedings of the Nineteenth National system conference (NSC-95), PSC College of technology, Coimbatore, organized by system society of India, New Delhi, pp. 82-87, 1995.
  8. S.H. Bokhari, “Dual Processor Scheduling with Dynamic Re-Assignment”, IEEE Trans. On Software Engineering, Vol.SE-5 pp. 341-349, 1979.  
  9. T.L. Casavent, and J.G. Kuhl, “A Taxonomy of Scheduling in General Purpose Distributed Computing System”, IEEE Trans. On Software Engineering, Vol.14 pp.141-154, 1988.
  10. Vinod Kumar, M.P. Singh, P.K. Yadav, “An efficient Algorithm for Multi-Processor scheduling with Dynamic Re-Assignment,” Proceedings of the Sixth National Seminar on Theoretical Computer Science, Banasthali Vidya Pith, pp. 105-118, 1996.
  11. H.G. Rotithor, “Taxonomy of Dynamic Task Scheduling in Distributed Computing Systems”. IEEE Proc. Comput. Digit Tech., vol.14, No.1, pp. 1-10, 1994.
  12. O.I. Dessoukiu-EI and W.H. Huna, “ Distributed Enumeration on Network Computers,” IEEE Trans. On Computer, Vol.C-29 pp.818-825, 1980.
  13. J.B. Sinclair, “Efficient computation of optimal assignments for distributed tasks,” J. parallel Dist. Comput., vol.4, pp.342-362, 1987.
  14. G. Sagar, and A.K. Sarje, “Task allocation model for distributed system,” Int. J. system science, vol. & no. 22, 9, pp. 1671-1678, 1991.
  15. Peng, Dar-Tezen; K.G. Shin, Abdel, T.F. Zoher, “Assignment Scheduling Communicating Periodic Tasks in Distributed Real-Time System,” IEEE Trans. On software Engg., vol.13, no.12, pp.745-757, 1997.
  16. Vinod Kumar, P.K. Yadav, and K. Bhatia, “Optimal Task Allocation in Distributed Computing Systems Owing to Inter Task Communication Effects.” Proc. Of CSI-98 : IT for the New Generation, pp.369-378, 1998.
  17. S. Nog and D. Kotz, “ A performance Comparison of TCP/IP and MPI on FDDI, Fast Ethernet, “ PCS-TR95-273, Dept. of Computer Science, Dartmouth College, 1995
  18. C.A. Thekkath and H.M. levy, “ Limits to Low-latency Communication on High-speed Networks,” ACM Trans. Computer systems, pp. 179-203, May 1993.
  19. C. Hung, E.P. Kasten, P.K. Mckinley, “Design and Implementation of Multicast Operation for ATM-Based High Performance Computing”, Proc. Supercomputing ’94, pp. 164-173 Aug. 1994.
  20. A. Wolman, G. Voelker, and C.A. Thekkath, “Latency analysis of TCP on an ATM Network,” Proc. USENIX. pp. 167-179, 1994.
  21. D. Tolmine and J. Renwiek, “HiPPl. Simplicity yield success,” IEEE network, pp. 28-32, Jan. 1993.
  22. S.J. Kim and J.C. Browne, “A General Approach to Mapping of parallel computations upon multiprocessor Architectures,” Proc. Int’l Conf. Parallel processing, vol. 3, pp. 1-8 University park, Penn., Aug. 1998.
  23. W.H. Kohler, “A Perliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiple Processor Systems,” IEEE Trans. Computer, vol. 24, no. 12, pp. 1,235-1,238, Dec. 1975.
  24. G.C. Sih and E.A. Lee, “ Declustering: A new multiprocessor scheduling technique,” IEEE Trans. Parallel and Distributed systems, vol. 4, no. 6, pp. 625-637, June 1993.
  25. G.C. Sih and E.A. Lee, “A compile-time scheduling Heuristic for Interconnection-Constrained Heterogeneous processor Architectures,” IEEE Trans. Parallel and Distributed systems, vol. 4. No. 2, pp. 175-186, Feb. 1993
  26. S. Tridanadapani and A.K. Somani, “Efficient utilization of spare capacity for fault detection and location in multiprocessor systems,” Proc.Int.  Symp. Fault-Tolerant computing, pp. 44

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details