Indian Journal of Science and Technology
Year: 2017, Volume: 10, Issue: 25, Pages: 1-5
Zaki Ahmad Khan1*, Jamshed Siddiqui2 and Mahfooz Alam3
1College of Life Science Nanjing Agricultural University Nanjing, Jiangsu, China; [email protected] 2Department of Computer Science, Aligarh Muslim University, Aligarh – 202001, Uttar Pradesh, India; [email protected] 3Department of Computer Science, Al- Barkaat College of Graduate Studies, Aligarh – 202002, Uttar Pradesh, India; [email protected]
*Author for correspondence
Zaki Ahmad Khan
College of Life Science Nanjing Agricultural University Nanjing, Jiangsu, China; [email protected]
Objectives: Topropose analgorithm for better performance interms of scheduling and the network usage is economical. Method/Statistical Analysis: The dynamic task scheduling algorithm has been proposed for scheduling the load on numerous cube based multiprocessor interconnection networks. Especially the efficiency of the proposed algorithm is examined in terms of performance parameters for instance Load Imbalance Factor’s as well as Execution Time for cube based multiprocessor networks; Nevertheless, a comparison is created with other standard scheduling algorithm. Findings:The comparative simulation study shows that the proposed algorithm gives better performance in terms of task scheduling on various cube based multiprocessor networks. Application: The study in such a direction implies that the variety of processors in folded hypercube has been decreased thus minimizing the cost as well as intricacy of the network without reducing the efficiency of the network. Therefore, a combination of scalable folded hypercube architecture and efficient proposed algorithm is a better organization model that supports variety of informatics applications.
Keywords: Dynamic Scheduling Algorithm, Hypercube Networks, Interconnection Networks, Minimum Distance Property, Scheduling Performance Parameter
Subscribe now for latest articles and news.