( ISSN 2277 - 9809 (online) ISSN 2348 - 9359 (Print) ) New DOI : 10.32804/IRJMSH

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

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

A HEURISTIC MODEL: FOR OPTIMIZE THE RESPONSE TIME IN COMPUTER COMMUNICATION NETWORK

    1 Author(s):  JUGMENDRA SINGH

Vol -  7, Issue- 3 ,         Page(s) : 171 - 184  (2016 ) DOI : https://doi.org/10.32804/IRJMSH

Abstract

In a Computer Communication Network (CCN) the single communication channel shares by all the processors for Inter-processor Communication. In a CCN, a task is allocated to a processor in such a way that extensive Inter Processor Communication [IPC] is avoided and the capabilities of the processor suit to the execution requirements of the task. In the present paper the problem of allocating "m" tasks to "n" processors (m>n) in a CCN is addressed. The Execution Time [ET] and Inter Task Communication Time [ITCT] of the tasks have been considered in the form of Execution Time Matrix ETM (,) and Inter Task Communication Time Matrix ITCTM (,) respectively while designing the algorithm considering the arrival rate of tasks is λ and service rate of the processors μ..

Chu  W.W., “Optimal File Allocation in a Multiple Computing System”, IEEE Trans. On Computer, Vol.C-18 pp.885-889, 1969.
1 Dessoukiu-EI O.I. and Huna W.H., “ Distributed Enumeration on Network Computers,” IEEE Trans. On Computer, Vol.C-29 pp.818-825, 1980.
2 J.B. Sinclayer, “ Optimal Assignment in Broadcast Network” IEEE Trans. On Computer, Vol.37 (5), pp.521-351, 1988.
3 Richard R.Y., Lee E.Y.S. and Tsuchiya M., “ A Task Allocation Model for Distributed Computer System”, IEEE Trans. On Computer, Vol.C-31 pp.41-47, 1982.
4 Peng, Dar-Tezen, Shin, K. G. and Abdel, Zoher T. F., “Assignment Scheduling Communication Periodic Tasks in Distributed real time System”, IEEE Transactions on software Engg. vol. SE-13, pp. 745-757,1997. 
7     A.V. Karzanov, “Determining the maximum flow in a network by method of pre-flows”, Soviet Math Doklady, Vol. 15, pp. 434-437, 1974.
       8  Bokhari, S.H., “Dual Processor Scheduling with Dynamic Re-Assignment”, IEEE Transactions on Software Engineering, vol. 5, pp. 341-349,1979.
9 Casavent, T.L. and Kuhl, J. G., “A Taxonomy of Scheduling in General Purpose Distributed Computing System”, IEEE Transactions on Software Engineering, vol. 14, pp. 141-154, 1988.
10 Kumar, V. Singh, M.P. and Yadav, P.K., “An Efficient Algorithm for Multi-processor Scheduling with Dynamic Reassignment”, Proc. of the 6th National seminar on theoretical Computer Science, held at Banasthally Vidyapeeth, India pp. 105-118, 1996
      11      H. S. Stone, “Multiprocessor scheduling with the aid of network flow algorithms”, IEEE Transactions on Software Engineering, Vol. SE-3, No. l,  pp. 85-93, January 1977.
12 Sagar, G., and Sarje, A.K., “Task Allocation Model for Distributed System”, Int. J. System Science, vol. 22, pp. 1671-1678,1991. 
13 Kumar, V. Singh, M. P. and Yadav, P.K., “An Efficient Algorithm for Allocating Tasks to Processors in a Distributed System”, Proc. of the 19th National system conference, SSI, held at Coimbatore, India pp. 82-87, 1995.

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






Bank Details