Ant Colony Scheduling for Network On Chip
محورهای موضوعی : Network Management
Neda Dousttalab
1
,
Mohammad Ali Jabraeil Jamali
2
,
Ali Ghaffari
3
1 - Department of Engineering, Tabriz Branch, Islamic Azad University, Tabriz ,Iran
2 - Department of Engineering, Shabestar Branch, Islamic Azad University, Shabestar, Iran
3 - Department of Engineering, Tabriz Branch, Islamic Azad University, Tabriz ,Iran
کلید واژه: On-chip interconnection networks, switch allocator, ant colony, scheduling, , , , ,
چکیده مقاله :
The operation scheduling problem in network on chip is NP-hard; therefore effective heuristic methods are needful to provide modal solutions. This paper introduces ant colony scheduling, a simple and effective method to increase allocator matching efficiency and hence network performance, particularly suited to networks with complex topology and asymmetric traffic patterns. Proposed algorithm has been studied in torus and flattened-butterfly topologies with multiple types of traffic pattern. Evaluation results show that this algorithm in many causes has showed positive effects on reducing network delays and increased chip performance in comparison with other algorithms.
The operation scheduling problem in network on chip is NP-hard; therefore effective heuristic methods are needful to provide modal solutions. This paper introduces ant colony scheduling, a simple and effective method to increase allocator matching efficiency and hence network performance, particularly suited to networks with complex topology and asymmetric traffic patterns. Proposed algorithm has been studied in torus and flattened-butterfly topologies with multiple types of traffic pattern. Evaluation results show that this algorithm in many causes has showed positive effects on reducing network delays and increased chip performance in comparison with other algorithms.
