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 : 26    Submit Your Rating     Cite This   Download        Certificate

PERFORMANCE EFFECTIVE TASK ASSIGNMENT ALGORITHM IN A MULTIPROCESSOR COMMUNICATION SYSTEM

    1 Author(s):  JUGMENDRA SINGH

Vol -  6, Issue- 12 ,         Page(s) : 217 - 230  (2015 ) DOI : https://doi.org/10.32804/CASIRJ

Abstract

One of the key problems in the design of any incompletely connected multiprocessor system is to appropriately assign the set of tasks in a program to the Processing Elements (PEs) in the system. The task assignment problem has proven difficult both in theory and in practice. This paper presents a simple and efficient heuristic algorithm for assigning program tasks with execution and communication constraints to the PEs in a Message-based Multiple-bus Multiprocessor System, so that the total execution time for the program is minimized. The algorithm uses a cost function:

  1. [Baca89]
  2. D.F. Baca, “Allocating modules to processors in a distributed system”, IEEE Transactions on Software Engineering. Vol. SE-15, No. 11, pp. 1427-1436, Nov. 1989.
  3. [Bhut94] K.K. Bhutani, “Distributed computing”, Indian Journal of Telecommunication, pp. 41-44, 1994.
  4. [Bier02] R.L. Bierbaum, D.B. Thomas and J.K. Thomas, “Model-based reliability analysis”, IEEE Transactions on Reliability, Vol. 51,        pp. 133-140, 2002.
  5. [Bokh79] S.H. Bokhari, “Dual processors scheduling with dynamic re-assignment”, IEEE Transactions on Software Engineering, Vol. SE-5 pp. 341-349, 1979.
  6. [Casa88] T.L. Casavent and J.G. Kuhl, “A taxonomy of scheduling in general purpose distributed computing system”, IEEE Transactions on Software Engineering, Vol. 14, pp. 141-154, 1988.
  7. [Chu69] W.W. Chu, “Optimal file allocation in a multiple computing system”, IEEE Transactions on Computers, Vol. 18, pp. 885-889, 1969.
  8. [Dess80] EI.O.I. Dessoukiu and W.H. Huna, “Distributed enumeration on network computers,” IEEE Transactions on Computers, Vol. C-29 pp. 818-825, 1980.
  9. [Kuma95(a)] V. Kumar, M.P. Singh and P.K. Yadav, “An efficient algorithm for allocating tasks to processors in a distributed system”, Proceedings of the 19th National System Conference, SSI, held at Coimbatore, India pp. 82-87, 1995.
  10. [Kuma95(b)] V. Kumar, M.P. Singh and P.K. Yadav, “A fast algorithm for allocating tasks in distributed processing system”, Proceeding of the 30th  Annual Convention of CSI, held at Hyderabad, India pp. 347-358, 1995.
  11. [Kuma99] A. Kumar, “Optimizing for the dynamic task allocation”, published to the proceedings of the III Conference of the International Academy of Physical Sciences held at Allahabad, pp. 281-294, 1999.
  12. [Peng97] D-T Peng, Shin, K.G. Abdel and T.F. Zoher, “Assignment scheduling communication periodic tasks in distributed real time system”, IEEE Transactions on Software Engineering, Vol. SE-13, pp. 745-757, 1997.
  13. [Rich82] R.Y. Richard, E.Y.S. Lee and M. Tsuchiya, “A task allocation model for distributed computer system”, IEEE Transactions on Computers, Vol. C-31, pp. 41-47, 1982.
  14. [Roti92] H.G. Rotithor, “Embedded instrumentation for evaluating task sharing performance in a distributed computing system”, IEEE Transactions on Instrumentation and Measurement, Vol. 41, No. 2, pp. 316-321, 1992.
  15. [Saga91] G. Sagar and A.K Sarje, “Task allocation model for distributed system”, International Journal of System Science, Vol. 22, pp. 1671-1678, 1991.
  16. [Saga91] G. Sagar and A.K Sarje, “Task allocation model for distributed system”, International Journal of System Science, Vol. 22, pp. 1671-1678, 1991.
  17. [Sinc88] J.B. Sinclair, “Optimal assignment in broadcast network”, IEEE Transactions on Computers, Vol. 37, No. 5, pp. 321-351, 1988.
  18. [Sing05] M.P. Singh and Harendra Kumar, “Task allocation: an algorithm for systematic allocation of tasks in distributed computing environment”, in National Seminar on Current Trends in Mathematics and Computation held at Birla Institute of Technology, Ext. Center, Noida, on December 1, 2005.
  19. [Sing07] M.P. Singh, P.K. Yadav and H. Kumar, “A tasks allocation model for efficient utilization of processor’s capacity in heterogeneous  distributed  systems”, Presented in 9th  Conference  of  International  Academy  of Physical Sciences, held at Agra University Agra, during February 03-05, 2007.
  20. [Sing99] M.P. Singh, V. Kumar and A. Kumar, “An efficient algorithm for optimizing reliability index in tasks-allocation”, Acta Ciencia Indica, Vol. xxv m, pp. 437-444, 1999.
  21. [Sita65] B. R. Sitaram, “Distributed computing – a user’s view point”, CSI Communications, Vol. 18, No. 10, pp. 26-28, 1965.
  22. [Srin99] S. Srinivasan and N.K. Jha, “Safety and reliability driven task allocation in distributed system”, IEEE Transactions on Parallel & Distributed systems, Vol. 10, pp. 238-250, 1999.
  23. [Yada02] P.K. Yadav and A. Kumar, “An efficient static approach for allocation through reliability optimization in distributed systems”, Presented at the International Conference on Operations Research for Development (ICORD 2002) held at Chennai, 2002.
  24. [Yada07] P.K. Yadav, M.P. Singh and H. Kumar, “Scheduling algorithm: tasks scheduling algorithm for multiple processors with dynamic re-assignment”, International Conference on Stochastic Process and Applications held from July 16-21, 2007 at IISC Bangalore.
  25. [Zahe91] E. Zahedi and N. Ashrafi, “Software reliability allocation based on structure, utility, price and cost”, IEEE Transactions on Software Engineering, Vol. 17, pp. 345-356, 1991.

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






Bank Details