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

ALGORITHM FOR OPTIMIZATION OF THE COMPLETION TIME OF TASKS ALLOCATING ON A TREE GRAPH

    1 Author(s):  JUGMENDRA SINGH

Vol -  7, Issue- 2 ,         Page(s) : 195 - 203  (2016 ) DOI : https://doi.org/10.32804/IRJMSH

Abstract

An efficient task scheduling problem is a long-studied and difficult problem that continues to be a topic of considerable research in field of computer communication system (CCS). Approximation solutions to this NP complete problem typically combine search techniques and heuristics. Traditional solutions require a deterministic search of the solution space, which is computationally and temporally exhaustive. The some static and dynamic algorithms are known to provide robust, stochastic solutions for numerous optimization problems.

  1. [Aror79] R.K. Arora and S.P. Rana, “On module assignment in two processors distributed systems”, Information Processing Letters, Vol. 9, No. 3, pp. 113-117, 1979.
  2. [Aror80] R.K. Arora and S.P. Rana, “Heuristic algorithms for process assignment in distributed computing systems”, Information Processing Letters, Vol. 11, No. 45, pp. 199-203, 1980.
  3. [Bokh81] S.H. Bokhari, “A shortest tree algorithm for optimal assignment across space and time in distributed processor system”, IEEE Transactions on Software Engineering, Vol. SE-7, No. 6, pp. 583-589, 1981.
  4. [Bokh88] S.H. Bokhari, “Partitioning problems in parallel, pipeline and distributed computing”, IEEE Transactions on Computers, Vol. C-37, No. 1, pp. 48-57, 1988.
  5. [Chu80] W.W. Chu, L.J. Holloway, M.T.L. Lan and K. Efe, “Task allocation in distributed data processing”, IEEE Transactions on Computers, Vol. 13, No.11, pp. 57-69 November 1980.
  6. [Hous87] C.E. Houstics, “Allocation of real time application to distributed system”, Proceedings of the International Conference on Parallel Processing, pp. 863-866, 1987.
  7. [Inde86] B. Inderkhya, H.S. Stone and L.X. Cheng, “Optimal partitioning of randomly generated distributed programs”, IEEE Transactions on Software Engineering, Vol. SE-12, No. 3, pp. 483-495, 1986.
  8. [Lint81] B. Lint and T. Agarwal, “Communication issues in the design and analysis of parallel algorithm”, IEEE Transactions on Software Engineering, Vol. SE-7, No. 2, pp. 174-188, 1981.
  9. [Lo83] V.M. Lo, “Task assignment in distributed systems”, Ph.D Thesis, University of Illinois at Urbana-Champaign, 1983.
  10. [Lo84] V.M. Lo, “Heuristic algorithms for task assignment in distributed systems”, Proceedings of the 4th International Conference on Distributed Computing Systems, pp. 30-39, 1984.
  11. [Lo88] V.M. Lo, “Heuristic algorithms for task assignment in distributed systems”, IEEE Transactions on Computers, Vol. 37, No. 11,             pp. 1384-1397, November 1988.
  12. [Pric82] C.C. Price and U.W. Pooch, “Search techniques for non-linear multiprocessor scheduling problem”, Naval Research Logistics Quarterly, Vol. 29, No. 2, pp. 213-233, 1982.
  13. [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.
  14. [Ston77] 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.
  15. [Ston78(a)] H.S. Stone and S.H. Bokhari, “Control of distributed processor”, IEEE Transactions on Computers, Vol. 11, pp. 97-106, 1978.
  16. [Tows86] D.F. Towsley, “Allocating programs containing branches and loops within a multiple processor system”, IEEE Transactions on Software Engineering, Vol. SE-12, No. 10, pp. 1018-1024, October 1986.
  17. [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.
  18. [Yang94] T. Yang and A. Gerasoulis, “DSC: Scheduling parallel tasks on an unbounded number of processors”, IEEE Transactions on Parallel &  Distributed Systems, Vol. 5, No. 9, pp. 951-967, 1994.

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






Bank Details