Email this article 
Open Access
Subscription or Fee Access
Real-Time Task Scheduling for the Performance Evaluation of Distributed Systems
Abstract
A distributed system consists of a collection of autonomous computers, connected through a network and distribution middleware, which enables computers to coordinate their activities and to share the resources of the system, so that users perceive the system as a single, integrated computing facility. Distributed systems are implemented on hardware platforms that vary in size from a few workstations interconnected by a single local area network to thousands of computers connected via multiple wide area networks. This paper is an attempt to analyze the performance of the distributed system based on task clustering through an exhaustive search process. The Execution Reliability (ER), Communication Reliability (CR), Execution Time (ET) and Communication Time (CT) are considered in the study and represented in form of matrices namely ERM (,), CRM (,), ETM (,), CTM (,), respectively. These matrices are modified and manipulated according to the task combinations. The time and reliability for the distributed computing system is evaluated for each task combination. The optimal solution for distributed computing system is obtained from the calculated reliability and time values for all task combinations. Finally, the Index value, a measure of performance optimization, is obtained.
Keywords
References
Gylys V.B., & J.A. Edwards, “Optimal Partitioning of Workload for Distributed Systems,” DIG Compcon Fall, pp. 353-357, 1976.
Inderkhaya B., Stone, H.S. & L. X. Chang, “Optimal Partition of Redundancy Generated Distributed Programs,” IEEE Transaction on Computer Software Engineering, vol. SE-12, no.3, pp. 483-495, 1986.
Shatz S.M., Wang J.P., & M. Goto, “Task Allocation for Maximizing Reliability of Distributed Computer Systems,” IEEE Transactions on Computers, vol. 41, no. 9, pp. 156-168, 1992.
Bokhari S. H., “Partitioning Problems in Parallel, Pipeline and Distributed Computing,” IEEE Transactions on Computing, vol. 37, no. 1, 1998, pp. 48-57.
Nicol D.M., “Optical Partitioning of Random Program Access to Processors,” IEEE Transactions on Software Engineering, vol. 5, no. 2, 1998, pp. 134-141.
S., & A. K. Somani, “Efficient Utilization of Space Capacity for Fault Detection and Location in Multiprocessor Systems,” Proc. Int‟l Symp. Fault – Tolerant Computing, pp. 440-447, Montreal, July, 1992.
Gillett, Billy E. , “ Introduction to Operations Research-A Computer Oriented Algorithmic Approach”, Tata McGraw-Hill Publishing Company Limited, New Delhi, 2002.
Yadav P.K. , Kumar, Avinash & Gupta, “An Efficient Static Approach for Allocation through Reliability Optimization in Distributed Systems,” Int‟l. Conference on Operation Research for Development held at Chennai 2002.
Kumar, A., Pathak, R. M., Gupta, Y. P., & H. R. Parsaei, “A Genetic Algorithm for Distributed System Topology Design”, Computers and Industrial Engineering, Vol. 28, 1995, pp. 659-670.
Kumar, A., Pathak, R. M., & Y. P. Gupta, “Genetic Algorithm based Reliability Optimization for Computer Network Expansion”, IEEE Transactions on Reliability, Vol. 44, No. 1, 1995, pp. 63-72.
Sagar, G., & Sarje, A. K., “Task Allocation Model for Distributed System”, International Journal of Systems Sciences, Vol. 22, No. 9, 1991, pp. 1671-1678.
Zahedi, F., & N. Ashrafi, “Software Reliability Allocation Based on Structure, Utility, Price, and Time”, IEEE Transactions on Software Engineering, Vol. 17, No. 4, April 1991, pp. 345-356.
Baca, D. F., “Allocation Modules to Processor in a Distributed Systems”, IEEE Transactions on Software Engineering, Vol. SE-15, 1989, pp. 1427-1436.
Kumar, Vinod, Singh M.P., & P. K. Yadav, “An Efficient Algorithm for Multiprocessor Scheduling with Dynamic Reassignment,” Sixth National Seminar on Theoretical Computer Science held at Banasthali Vidyapeeth from 5-6 aug. 1996.
Casavant, T. L., & J. G. Kuhl, “ A Taxonomy of Scheduling in General Purpose Distributed Computing System”, IEEE Transactions on Software Engineering, Vol. SE-14, 1988, pp. 141-154.
Bokhari, S.H., “Dual Processor Scheduling with Dynamic Reassignment”, IEEE Transactions on Software Engineering, Vol. SE-5, 1979, pp. 341-349.
Vinod Kumar, P. K. Yadav & K. Bhatia, “Optimal Task Allocation in Distributed Computing Systems Owing to Inter Task Communication Effects”, Published in the Proceedings of CSI- 98 : the 33rd Annual Convention of the Computer Society of India held in Delhi during Sept., 1998, pp. 369- 378.
P.K. Yadav Avanish Kumar and Anju Rani Gupta, Optimization of Executing Time of Distributed Processing System through Task Allocation, Internation Conference on Operation Research with Eceomic and Industrial Application (ICOR-2004) orgnized by Indian Statistical Institute, Kolkata, 2004.
K. Bhatia, Yadav P. K., Sagar Gulati, “Performance Evaluation Distributed System through Reliability Analysis”, Proceedings of the International Conference on Challenges and Applications of Mathematics in Science and Technology (CAMIST) held in Department of Mathematics, National Institute of Technology, Rourkela, January, 2010.
Anju Khandelwal, Optimal Execution Cost of Distributed System: Through Clustering, International Journal of Engineering Science and Technology (IJEST) Vol. 3 No. 3 March 2011 pp. 2320-2328.
Kapil Govil, A Smart Algorithm for Dynamic Task Allocation for Distributed Processing Environment, International Journal of Computer Applications, Vol. 28, No.2, 2011, pp. 13-19.
Kumar, Avinash, Yadav P.K., & A. R. Gupta, (2006) “An exhaustive approach of distributed system based on cost assignment.”, south Asian journal of mathematics and mathematical science, Vol.5 No 1, pp 29-44.
H. Ellis, Sahni S., & S. Rajasekaram, (2005) “Fundamentals of Computers Algorithm”, Galgotia Publications Pvt Ltd.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.