Table of Contents Author Guidelines Submit a Manuscript
Modelling and Simulation in Engineering
Volume 2014, Article ID 127359, 7 pages
http://dx.doi.org/10.1155/2014/127359
Research Article

Simulated Annealing Technique for Routing in a Rectangular Mesh Network

1Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia (UTM), 81310 Johor Bahru, Johor, Malaysia
2Centre for Industrial and Applied Mathematics, Universiti Teknologi Malaysia (UTM), 81310 Johor Bahru, Johor, Malaysia

Received 21 July 2014; Revised 8 December 2014; Accepted 9 December 2014; Published 22 December 2014

Academic Editor: Min-Chie Chiu

Copyright © 2014 Noraziah Adzhar and Shaharuddin Salleh. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. X. Duan and J. Wu, “Deadlock-free routing scheme for irregular mesh topology NoCs with oversized regions,” Journal of Computers, vol. 8, no. 1, pp. 27–32, 2013. View at Publisher · View at Google Scholar · View at Scopus
  2. J.-T. Yan and Z.-W. Chen, “Obstacle-aware length-matching bus routing,” in Proceedings of the International Symposium on Physical Design (ISPD '11), pp. 61–67, ACM, Santa Barbara, Calif, USA, March 2011. View at Publisher · View at Google Scholar · View at Scopus
  3. Y. Jin-Tai, J. Ming-Ching, and C. Zhi-Wei, “Obstacle-aware longest path using rectangular pattern detouring in routing grids,” in Proceedings of the 15th Asia and South Pacific Design Automation Conference (ASP-DAC '10), pp. 287–292, January 2010. View at Publisher · View at Google Scholar · View at Scopus
  4. C. Y. Lee, “An algorithm for path connections and its applications,” IRE Transactions on Electronic Computers, vol. 10, pp. 346–365, 1961. View at Google Scholar · View at MathSciNet
  5. N. Mani, “Heuristics in the routing algorithm for circuit layout design,” IEE Proceedings: Computers and Digital Techniques, vol. 147, no. 2, pp. 59–64, 2000. View at Publisher · View at Google Scholar · View at Scopus
  6. Y.-L. Lin, Y.-C. Hsu, and F.-S. Tsai, “Hybrid routing,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 9, no. 2, pp. 151–157, 1990. View at Publisher · View at Google Scholar · View at Scopus
  7. L. T. Wang, Y. W. Chang, and K. T. Cheng, Electronic Design Automation: Synthesis, Verification, and Test, Elsevier, Boston, Mass, USA, 2009.
  8. E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, pp. 269–271, 1959. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. R. Bellman, “On a routing problem,” Quarterly of Applied Mathematics, vol. 16, pp. 87–90, 1958. View at Google Scholar · View at MathSciNet
  10. L. R. Ford Jr., “Network flow theory,” Paper P-923, RAND Corporation, Santa Monica, Calif, USA, 1956. View at Google Scholar
  11. R. W. Floyd, “Algorithm 97: shortest path,” Communications of the ACM, vol. 5, no. 6, p. 345, 1962. View at Google Scholar
  12. S. Warshall, “A theorem on boolean matrices,” Journal of the Association for Computing Machinery, vol. 9, pp. 11–12, 1962. View at Publisher · View at Google Scholar · View at MathSciNet
  13. L. C. Abel, “On the ordering of connections for automatic wire routing,” IEEE Transactions on Computers, vol. 21, no. 11, pp. 1227–1233, 1972. View at Publisher · View at Google Scholar · View at Scopus
  14. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, “Equation of state calculations by fast computing machines,” The Journal of Chemical Physics, vol. 21, no. 6, pp. 1087–1092, 1953. View at Publisher · View at Google Scholar · View at Scopus
  15. S. Kirkpatrick, J. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at MathSciNet
  16. S. Salleh, A. Y. Zomaya, and S. A. Bakar, Computing for Numerical Methods Using Visual C++, Wiley-Interscience, Hoboken, NJ, USA, 2008. View at MathSciNet