A Novel Performance Metric of Routing Algorithm

Ming Hua Tang

doi:10.4028/www.scientific.net/AMR.760-762.2177

Paper Titles

Three Conjectures about the Number Systems and their Conversion
p.2156

An Adaptive Level Damped Algorithm Based on PINS for Ship
p.2162

An Evaluation Model to Human Factors in Information Systems Based on Consistent Quantification of Index and Evaluation Equilibrating
p.2167

Methods for Determining Differences of Attribute Weight between Evidences in Bridge Assessment
p.2172

A Novel Performance Metric of Routing Algorithm
p.2177

Analysis on Local Congestion of Network-on-Chip
p.2183

Numerical Simulation of the Protection System of Explosive Reaction Armor
p.2188

Self-Adaptive Particle Swarm Optimization Algorithm with Mutation Operation Based on K-Means
p.2194

Graph Colorings Applied in Scale-Free Networks
p.2199

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 760-762A Novel Performance Metric of Routing Algorithm

A Novel Performance Metric of Routing Algorithm

Abstract:

The widely used routing algorithm performance metric of adaptiveness cannot precisely measure performance of routing algorithm. In this paper, we propose a new metric of routing pressure for measuring routing algorithm performance. It has higher precision of measuring routing algorithm performance than degree of adaptiveness. Performance of routing algorithm can be evaluated through routing pressure without simulation. It can explain why congestion takes place in network. In addition, where and when congestion takes place can be pointed out without simulation.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 760-762)

Pages:

2177-2182

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.760-762.2177

Citation:

Cite this paper

Online since:

September 2013

Authors:

Ming Hua Tang

Keywords:

Network-on-Chip (NoC), Routing Algorithm, Routing Pressure

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] W. J. Dally and B. Towles, Route Packets, Not Wires: On-Chip Interconnection Networks, Proc. ACM/IEEE Design Automation Conf., pp.684-689, (2001).

DOI: 10.1109/dac.2001.935594

Google Scholar

[2] L. Benini and G. D. Micheli, Networks on Chips: A New SoC Paradigm, IEEE Computer, vol. 35, no. 1, pp.70-78, Jan. (2002).

DOI: 10.1109/2.976921

Google Scholar

[3] C. J. Glass and L. M. Ni, The Turn Model for Adaptive Routing, J. Assoc. for Computing Machinery, vol. 41, pp.874-902, (1994).

Google Scholar

[4] G. -M. Chiu, The Odd-Even Turn Model for Adaptive Routing, IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 7, pp.729-738, July (2000).

DOI: 10.1109/71.877831

Google Scholar

[5] M. Palesi, R. Holsmark, S. Kumar and V. Catania, Application Specific Routing Algorithms for Networks on Chip, IEEE Trans. Parallel and Distributed Systems, vol. 20, pp.316-330, (2009).

DOI: 10.1109/tpds.2008.106

Google Scholar

[6] Sourceforge. net, Noxim: Network-on-chip simulator, 2008. [Online]. Available: http: /noxim. sourceforge. net.

Google Scholar

[7] M. H. Tang and C. H. Wu, A New Method of Designing NoC Routing Algorithm, 2nd International Conference on Consumer Electronics, Communications and Networks, pp.3044-3047, (2011).

DOI: 10.1109/cecnet.2012.6202077

Google Scholar