GreedyZero Algorithms for Conflict-free Scheduling in Low Stage Interconnection Network

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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 consid- erable 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.

Cite

CITATION STYLE

APA

Moudi, M., & Othman, M. (2015). GreedyZero Algorithms for Conflict-free Scheduling in Low Stage Interconnection Network. In Procedia Computer Science (Vol. 59, pp. 106–114). Elsevier. https://doi.org/10.1016/j.procs.2015.07.343

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free