A Simulation Model for the Performance Evaluation of Hybrid Interconnection Architectures

abdus samad

Abstract


Efficient scheduling of tasks in multiprocessor interconnection networks is of primary importance for parallel execution. In this paper a new scheduling algorithm that schedules the tasks on different networks of processors is proposed and evaluated. The objective is the effective utilization of resource (processors) to execute tasks of an application. Processor networks have been used in the form of different topologies. We consider a new class of architecture known as linearly extensible multiprocessor networks which are best suited with lesser number of processors. Performance of different multiprocessor networks with the proposed algorithm as well as with other standard scheduling algorithms is evaluated in terms of performance parameters namely load balance error and execution time. Simulation results show that the linear architectures achieve better performance with the proposed scheduling scheme as compared to other considered scheduling algorithms.

Keywords


Linear architecture; scheduling algorithm; load imbalance; execution time; level wise scheduling; tasks

Full Text:

PDF

References


A. Samad, J. Siddiqui and Z.A. Khan, “Properties and Performance of Cube-based Multi-processor Architectures”, Int. journal of applied evolutionary computation. (IJAEC), vol. 7, no.1, 2016, pp. 67-82.

Z. A. Khan, J. Siddiqui, A. Samad, “Performance Analysis of Massively Parallel Architectures,” BVICAM’s International Journal of Information technology (BIJIT), ISSN/ISBN NO: 0973-5658, New Delhi, vol. 5. no.1, 2013, pp. 563-568.

B. Parhami, “Challenges in interconnection network design in the era of multiprocessor and massively parallel Microchips,” Proc. Int’l Conf. .in Computing, pp. 241-246, June 2000.

B. A. Mahafzah and B. A. Jaradat, “The hybrid dynamic parallel scheduling algorithm for load balancing on Chained-Cubic Tree,” Jornal of Supercomputer, vol. 52, 2010, pp. 224-252.

J. Jia, B. Veeravalli and J. Weissman, “Scheduling multisource divisible loads an Arbitray Networks,” IEEE Trans. on Parallel and Distributed Systems, vol. 21, no. 4, 2010, pp. 520-530.

Samad A, Rafiq M. Q. and Farooq O. “Dynamic Scheduling Scheme for Linearly Extensible Multiprocessor Systems” presentation in the 2013 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’13), July 22nd – 25th, 2013, Las Vegas, USA.

A. Samad, M. Q. Rafiq, O. Farooq, “Two Round Scheduling (TRS) Scheme for Linearly Extensible Multiprocessor Systems,” Int. J. of Computer Applications, vol. 38, no. 10, 2012, pp. 34-40.

F. A. Omara and M. M. Arafa, “Genetic algorithm for task scheduling problem,” Int. Journal of Parallel and Distributed Computing, vol. 9, 2011, pp. 241-257.

S. K. Nayak, S. K. Padhy and S. P. Panigrahi, “A novel algorithm for dynamic task scheduling,” Future generation Computer System, vol. 28, 2012, pp. 709-717.

D. M. Abdelkader and F. Omara, “Dynamic task scheduling algorithm with load balancing,” Egyptian Informatics Journal, vol. 13, 2012, pp. 135-145.

J. Garofalakis and E. Stergiou, “ An analytical model for the performance evaluation of multistage interconnection networks with two class priorities,” Future Generation Computer Systems, vol. 29, 2013, pp. 114-129.

P. S. Magnusson, M. Christensson, J. Eskilson, D. Forsgren, G. Hallberg, J. Hogberg, F. Larsson, A. Moestedt, B. Werner and Simics, “A full system simulation platform,” IEEE Computer vol. 35, no. 2, 2002, pp. 50–58.

J. Navaridas, J. M. Alonso, J. A. Pascual and J. Ridruejo, “Simulating and evaluating interconnection networks with INSEE,” Simulation Modelling Practice and Theory, vol. 9, 2011, pp. 494-515.

J. Miguel-Alonso, J. Navaridas and F.J. Ridruejo, “Interconnection network simulation using traces of MPI applications,” International Journal of Parallel Programming, vol. 37, no. 2, 2009), pp.153–174.

M. Mirza-Aghatabar, S. Koohi, S. Hessabi and M. Pedram, “An empirical investigation of mesh and torus NoC topologies under different routing algorithms and traffic models,” in: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools, Lübeck, Germany, August 29–31, 2007, pp. 19–26.

Manullah, “A Δ-Based Linearly Extensible Multiprocessor Network,” Int. Journal of Computer Science and Information Technologies, vol. 4, no. 5, 2013, pp. 700-707.

A. Samad, J. Siddiqui and Z.A. Khan, “Properties and Performance of Cube-based Multi-processor Architectures”, Int. journal of applied evolutionary computation. (IJAEC), vol. 7, no.1, 2016, pp. 67-82.

Z. A. Khan, J. Siddiqui, A. Samad, “Linear Crossed Cube (LCQ): A new Interconnection Network Topology for Massively Parallel Architectures,” Int. Journal of Computer Network and Information Science (IJCNIS), vol. 7, no. 3, 2015, pp. 18-25.




DOI: https://doi.org/10.26483/ijarcs.v9i2.5831

Refbacks

  • There are currently no refbacks.




Copyright (c) 2018 International Journal of Advanced Research in Computer Science