On the Minimization of Crosstalk Conflicts in a Destination Based Modified Omega Network
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In a parallel processing system, Multi-stage Interconnection Networks (MINs) play a vital role in making the network reliable and cost effective. The MIN is an important piece of architecture for a multiprocessor system, and it has a good impact in the field of communication. Optical Multi-stage Interconnection Networks (OMINs) are the advanced version of MINs. The main problem with OMINs is crosstalk. This paper, presents the (1) Destination Based Modified Omega Network (DBMON) and the (2) Destination Based Scheduling Algorithm (DBSA). DBSA does the scheduling for a source and their corresponding destination address for messages transmission and these scheduled addresses are passed through DBMON. Furthermore, the performance of DBMON is compared with the Crosstalk-Free Modified Omega Network (CFMON). CFMON also minimizes the crosstalk in a minimum number of passes. Results show that DBMON is better than CFMON in terms of the average number of passes and execution time. DBSA can transmit all the messages in only two passes from any source to any destination, through DBMON and without crosstalk. This network is the modified form of the original omega network. Crosstalk minimization is the main objective of the proposed algorithm and proposed network
Abstract
In a parallel processing system, Multi-stage Interconnection Networks (MINs) play a vital role in making the network reliable and cost effective. The MIN is an important piece of architecture for a multiprocessor system, and it has a good impact in the field of communication. Optical Multi-stage Interconnection Networks (OMINs) are the advanced version of MINs. The main problem with OMINs is crosstalk. This paper, presents the (1) Destination Based Modified Omega Network (DBMON) and the (2) Destination Based Scheduling Algorithm (DBSA). DBSA does the scheduling for a source and their corresponding destination address for messages transmission and these scheduled addresses are passed through DBMON. Furthermore, the performance of DBMON is compared with the Crosstalk-Free Modified Omega Network (CFMON). CFMON also minimizes the crosstalk in a minimum number of passes. Results show that DBMON is better than CFMON in terms of the average number of passes and execution time. DBSA can transmit all the messages in only two passes from any source to any destination, through DBMON and without crosstalk. This network is the modified form of the original omega network. Crosstalk minimization is the main objective of the proposed algorithm and proposed network
참고문헌 (18)
- Nitin, RajanVaish, "On a Deadlock and Performance Analysis of ALBR and DAR Algorithm on X-Torus Topology by Optimal Utilization of Cross Links and Minimal Lookups", Journal of Supercomputing, 59(3), pp.1252~1288 (2010)[DOI]
- Nitin, "Stochastic Communication for Application Specific Networks-on-Chip", Journal of Supercomputing, 59(2), pp.779~810 (2010)[DOI]
- Nitin, S. Garhwal, "Designing a Fault-tolerant Fully-chained Combining Switches Multi-stage Interconnection Network with Disjoint Paths", Journal of Supercomputing, 55(3), pp.400~431 (2009)[DOI]
- Nitin, "Comparative Analysis of Traffic Patterns on k-ary n-tree using Adaptive Algorithms based on Burton Normal Form", Journal of Supercomputing, 59(2), pp.569~588 (2010)[DOI]
- Ved Prakash Bhardwaj, "A New Fault Tolerant Routing Algorithm for Advance Irregular Augmented Shuffle Exchange Network", Proceedings of the 14th IEEE International conference on Computer Modeling and Simulation, 28(30), pp.505~509 (2012)
- Ved Prakash Bhardwaj, "A New Fault Tolerant Routing Algorithm for Advance Irregular Alpha Multistage Interconnection Network, In Advances in Intelligent and Soft Computing", pp.979~987 (2012), Springer-Verlag
- Ved Prakash Bhardwaj, "A New Fault Tolerant Routing Algorithm for IASEN-2", Proceed-ings of the 2nd IEEE International Conference on Advances in Computing and Communications, pp.199~202 (2012)
- C.W. Chen, "Design Schemes of Dynamic Rerouting Networks with Destination tag Routing for Tolerating Faults and Preventing Collisions", Journal of Supercomputing, 38, pp.307~326 (2006)
- S. Kaur, Anantdeep, "Effect of Crosstalk on Permutation in Optical Multistage Interconnection Networks", Journal of Computing, 2(4), pp.100~104 (2010)
- F. Abed, "Fast Method to Find Conflicts in Optical Multistage Interconnection Net-works", International Journal of The Computer, The Internet and Management, 16(1), pp.18~25 (2008)
- Ved Prakash Bhardwaj, "An Algorithmic Approach to Minimize the Conflicts in an Optical Multistage Interconnection Network", Communications in Computer and Information Science Series, 191, pp.568~576 (2011), Springer-Verlag
- Ved Prakash Bhardwaj, "Minimizing the Switch and Link Conflicts in an Optical Multi-stage Interconnection Network", International Journal of Computer Science Issues, 8(4), pp.206~214 (2011)
- Ved Prakash Bhardwaj, "Applying Address Selection Algorithm on Nonblocking Optical Multistage Interconnection Network", Proceeding of IEEE World congress on Information and Communication Technologies, pp.694~698 (2011)
- T.D. Shahida, "Fast Zerox Algorithm for Routing in Optical Multi-stage Interconnection Networks", IIUM Engineering Journal, 11(1), pp.28~39 (2010)
- M.A. Al-Shabi, "A New Algorithm for Routing and Scheduling in Optical Omega Network", International Journal of The Computer, the Internet and Managemen, 16(1), pp.26~31 (2008)
- M. Abdullah, "An Efficient Approach for Message Routing in Optical Omega Network", International Journal of The Computer, the Internet and Management, 14(1), pp.50~60 (2006)
- Farzaneh Abed, "Efficient Window Method in Optical Multistage Intercon-nection Networks", Proceedings of the 2007 IEEE International Conference on Telecommunication and Malaysia International Conference on Communications (2007)
- Sonia Kaur, "Reducing Crosstalk in an Optical Multistage Interconnection Net-work", International Journal of Computer Applications, 46(14), pp.8~13 (2012)