GreedyZero algorithms for conflict-free scheduling in low stage interconnection network
Low Stage Interconnection Networks are a class of Interconnection Networks. They have been generated from Multistage Interconnection Networks (MINs). Although the conflict in the optical switches, there is the considerable interest to use the optical technology in interconnection networks implementa...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2015
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/48077/1/48077.pdf |
| Summary: | Low Stage Interconnection Networks are a class of Interconnection Networks. They have been generated from Multistage Interconnection Networks (MINs). Although the conflict in the optical switches, there is the considerable interest to use the optical technology in interconnection networks implementation. To avoid this problem, GreedyZero algorithms has been assigned to the Low Stage Interconnection Networks for improving the network performance by reducing the number of passes. The results marked nearly 50% reduction in the number of passes and proved improvement of scheduling in the Low Stage Interconnection Networks by GreedyZero algorithms. |
|---|