The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hamid Sarbazi-Azad: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Navid Imani, Hamid Sarbazi-Azad
    The Star-Pyramid Graph: An Attractive Alternative to the Pyramid. [Citation Graph (0, 0)][DBLP]
    Asia-Pacific Computer Systems Architecture Conference, 2005, pp:509-519 [Conf]
  2. Hashem Hashemi Najaf-abadi, Hamid Sarbazi-Azad
    Comparative Evaluation of Adaptive and Deterministic Routing in the OTIS-Hypercube. [Citation Graph (0, 0)][DBLP]
    Asia-Pacific Computer Systems Architecture Conference, 2004, pp:349-362 [Conf]
  3. Hamid Sarbazi-Azad, Lewis M. Mackenzie, Mohamed Ould-Khaoua
    A Parallel Algorithm for Lagrange Interpolation on k-ary n-Cubes. [Citation Graph (0, 0)][DBLP]
    ACPC, 1999, pp:85-95 [Conf]
  4. Ahmad Patooghy, Hamid Sarbazi-Azad
    Performance Comparison of Partially Adaptive Routing Algorithms. [Citation Graph (0, 0)][DBLP]
    AINA (2), 2006, pp:763-767 [Conf]
  5. S. M. Rezazad, Hamid Sarbazi-Azad
    Fault-Tolerant Routing in the Star Graph. [Citation Graph (0, 0)][DBLP]
    AINA (2), 2004, pp:503-506 [Conf]
  6. S. M. Rezazad, Hamid Sarbazi-Azad
    A Constraint-Based Performance Comparison of Hypercube and Star Multicomputers with Failures. [Citation Graph (0, 0)][DBLP]
    AINA, 2005, pp:841-846 [Conf]
  7. Hamid Sarbazi-Azad, Hamid Mahini, Ahmad Patooghy
    Analytic Modeling of Channel Traffic in n-Cubes. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:567-579 [Conf]
  8. Pooya Shareghi, Navid Imani, Hamid Sarbazi-Azad
    Capturing an Intruder in the Pyramid. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:580-590 [Conf]
  9. Navid Imani, Hamid Sarbazi-Azad, Albert Y. Zomaya
    Capturing an Intruder in Product Networks. [Citation Graph (0, 0)][DBLP]
    HiPC, 2006, pp:193-204 [Conf]
  10. Hossein Ahmadi, Maryam Moslemi Naeini, Hamid Sarbazi-Azad
    Efficient SIMD Numerical Interpolation. [Citation Graph (0, 0)][DBLP]
    HPCC, 2005, pp:156-165 [Conf]
  11. Mahdi Fazeli, Hamid Sarbazi-Azad, Reza Farivar
    Parallel Clustering on the Star Graph. [Citation Graph (0, 0)][DBLP]
    ICA3PP, 2005, pp:287-292 [Conf]
  12. Hashem Hashemi Najaf-abadi, Hamid Sarbazi-Azad
    An Accurate Combinatorial Model for Performance Prediction of Deterministic Wormhole Routing in Torus Multicomputer Systems. [Citation Graph (0, 0)][DBLP]
    ICCD, 2004, pp:548-553 [Conf]
  13. M. Moslemi, Hossein Ahmadi, Hamid Sarbazi-Azad
    Efficient Polynomial Root Finding Using SIMD Extensions. [Citation Graph (0, 0)][DBLP]
    ICPADS (2), 2005, pp:529-533 [Conf]
  14. Ahmad Patooghy, Hamid Sarbazi-Azad
    Analytical Performance Comparison of Deterministic, Partially- and Fully-Adaptive Routing Algorithms in Binary n-Cubes. [Citation Graph (0, 0)][DBLP]
    ICPADS (2), 2006, pp:21-28 [Conf]
  15. Mostafa Rezazad, Hamid Sarbazi-Azad
    Performance Evaluation of Fully Adaptive Routing Under Different Workloads and Constant Node Buffer Size. [Citation Graph (0, 0)][DBLP]
    ICPADS (2), 2005, pp:510-514 [Conf]
  16. Hamid Sarbazi-Azad, Ahmad Khonsari, Mohamed Ould-Khaoua
    Analysis of Deterministic Routing in k-Ary n-Cubes with Virtual Channels. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2001, pp:509-516 [Conf]
  17. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie
    Performance Analysis of k-Ary n-Cubes with Fully Adaptive Routing. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2000, pp:249-255 [Conf]
  18. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie, Selim G. Akl
    On Some Properties of k-Ary n-Cubes. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2001, pp:517-524 [Conf]
  19. Ahmad Khonsari, Hamid Sarbazi-Azad, Mohamed Ould-Khaoua
    Analysis of True Fully Adaptive Routing with Software-Based Deadlock Recovery. [Citation Graph (0, 0)][DBLP]
    ICPP, 2001, pp:393-400 [Conf]
  20. Hamid Sarbazi-Azad, Lewis M. Mackenzie, Mohamed Ould-Khaoua
    A Performance Model of Adaptive Routing in k-Ary n-Cubes with Matrix-Transpose Traffic. [Citation Graph (0, 0)][DBLP]
    ICPP, 2000, pp:345-352 [Conf]
  21. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Albert Y. Zomaya
    Message from the Chairs. [Citation Graph (0, 0)][DBLP]
    ICPP Workshops, 2005, pp:468- [Conf]
  22. Hamid R. Zarandi, Seyed Ghassem Miremadi, Hamid Sarbazi-Azad
    Fault Detection Enhancement in Cache Memories Using a High Performance Placement Algorithm. [Citation Graph (0, 0)][DBLP]
    IOLTS, 2004, pp:101-108 [Conf]
  23. Reza Farivar, Mahdi Fazeli, Hamid Sarbazi-Azad
    A Cordic-Based Processor Extension for Scalar and Vector Processing. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  24. Hashem Hashemi Najaf-abadi, Hamid Sarbazi-Azad
    An Empirical Comparison of OTIS-Mesh and OTIS-Hypercube Multicomputer Systems under Deterministic Routing. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  25. Mostafa Rezazad, Hamid Sarbazi-Azad
    The Effect of Virtual Channel Organization on the Performance of Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  26. Hamid Sarbazi-Azad
    Parallel Polynomial Root Extraction on A Ring of Processors. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  27. Hamid Sarbazi-Azad, Lewis M. Mackenzie, Mohamed Ould-Khaoua
    An Analytical Model of Fully-Adaptive Wormhole-Routed k-Ary n-Cubes in the Presence of Hot Spot Traffic. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2000, pp:605-610 [Conf]
  28. Hamid Sarbazi-Azad, Lewis M. Mackenzie, Mohamed Ould-Khaoua, Selim G. Akl
    Parallel Lagrange Interpolation on the Star Graph. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2000, pp:777-782 [Conf]
  29. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie
    Comparative Analysis of Adaptive Wormhole Routing in Tori and Hypercubes in the Presence of Hotspot Traffic. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  30. Navid Imani, Hamid Sarbazi-Azad
    A physical particle and plane framework for load balancing in multiprocessors. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  31. A. E. Kiasari, Hamid Sarbazi-Azad
    A comparative performance analysis of n-cubes and star graphs. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  32. A. E. Kiasari, Hamid Sarbazi-Azad, Mohamed Ould-Khaoua
    Analytical performance modelling of adaptive wormhole routing in the star interconnection network. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  33. Ahmad Patooghy, Hamid Sarbazi-Azad
    Analytical performance modelling of partially adaptive routing in wormhole hypercubes. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  34. Hamid Sarbazi-Azad, Lewis M. Mackenzie, Mohamed Ould-Khaoua
    An Analytic Model for Communication Latency in Wormhole-Switched k-ary n-Cube Interconnection Networks with Digit-Reversal Traffic. [Citation Graph (0, 0)][DBLP]
    ISHPC, 2000, pp:218-229 [Conf]
  35. Mostafa Rezazad, Hamid Sarbazi-Azad
    Analytic Performance Modeling of a Fully Adaptive Routing Algorithm in the Torus. [Citation Graph (0, 0)][DBLP]
    ISPA, 2005, pp:984-989 [Conf]
  36. Hamid Reza Tajozzakerin, Hamid Sarbazi-Azad
    Enhanced-Star: A New Topology Based on the Star Graph. [Citation Graph (0, 0)][DBLP]
    ISPA, 2004, pp:1030-1038 [Conf]
  37. Hamid Sarbazi-Azad
    On Some Combinatorial Properties of Meshes. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:117-122 [Conf]
  38. Abbas Nayebi, M. R. Rahimi, Hamid Sarbazi-Azad
    Analysis of Time-Based Random Waypoint Mobility Model for Wireless Mobile Networks. [Citation Graph (0, 0)][DBLP]
    ITNG, 2007, pp:42-47 [Conf]
  39. Ahmad Khonsari, Hamid Sarbazi-Azad, Mohamed Ould-Khaoua
    Analysis of Timeout-Based Adaptive Wormhole Routing. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2001, pp:275-0 [Conf]
  40. Geyong Min, Mohamed Ould-Khaoua, Hamid Sarbazi-Azad
    Modeling of Pipelined Circuit Switching in Multicomputer Networks. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2000, pp:299-306 [Conf]
  41. Hashem Hashemi Najaf-abadi, Hamid Sarbazi-Azad, P. Rajabzadeh
    Performance Modeling of Fully Adaptive Wormhole Routing in 2-D Mesh-Connected Multiprocessors. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2004, pp:528-534 [Conf]
  42. Hashem Hashemi Najaf-abadi, Hamid Sarbazi-Azad
    The Effect of Adaptivity on the Performance of the OTIS-Hypercube Under Different Traffic Patterns. [Citation Graph (0, 0)][DBLP]
    NPC, 2004, pp:390-398 [Conf]
  43. M. Hoseiny Farahabady, Hamid Sarbazi-Azad
    The recursive transpose-connected cycles (RTCC) interconnection network for multiprocessors. [Citation Graph (0, 0)][DBLP]
    SAC, 2005, pp:734-738 [Conf]
  44. M. Monemizadeh, Hamid Sarbazi-Azad
    The necklace-hypercube: a well scalable hypercube-based interconnection network for multiprocessors. [Citation Graph (0, 0)][DBLP]
    SAC, 2005, pp:729-733 [Conf]
  45. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua
    A simple mathematical model of adaptive routing in wormhole k-ary n-cubes. [Citation Graph (0, 0)][DBLP]
    SAC, 2002, pp:835-839 [Conf]
  46. Abbas Nayebi, S. Meraji, Arash Shamaei, Hamid Sarbazi-Azad
    XMulator: A Listener-Based Integrated Simulation Platform for Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Asia International Conference on Modelling and Simulation, 2007, pp:128-132 [Conf]
  47. S. Meraji, Hamid Sarbazi-Azad
    Parallel Numerical Interpolation on Necklace Hypercubes. [Citation Graph (0, 0)][DBLP]
    Asia International Conference on Modelling and Simulation, 2007, pp:123-127 [Conf]
  48. S. Meraji, Abbas Nayebi, Hamid Sarbazi-Azad
    Empirical Performance Evaluation of Adaptive Routing in Necklace Hypercubes: A Comparative Study. [Citation Graph (0, 0)][DBLP]
    ICCTA, 2007, pp:193-197 [Conf]
  49. Abbas Nayebi, A. Khosravi, Hamid Sarbazi-Azad
    On the Link Excess Life in Mobile Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ICCTA, 2007, pp:72-76 [Conf]
  50. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie
    Message Latency in Hypercubes in the Presence of Matrix-Transpose Traffic. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2000, v:43, n:5, pp:411-419 [Journal]
  51. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie
    Towards a more realistic comparative analysis of multicomputer networks. [Citation Graph (0, 0)][DBLP]
    Concurrency - Practice and Experience, 2004, v:16, n:13, pp:1271-1289 [Journal]
  52. Ahmad Khonsari, Hamid Sarbazi-Azad, Mohamed Ould-Khaoua
    An analytical model of adaptive wormhole routing with time-out. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 2003, v:19, n:1, pp:1-12 [Journal]
  53. Hamid Sarbazi-Azad, Ahmad Khonsari, Mohamed Ould-Khaoua
    Analysis of k-ary n-cubes with dimension-ordered routing. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 2003, v:19, n:4, pp:493-502 [Journal]
  54. Geyong Min, Hamid Sarbazi-Azad, Mohamed Ould-Khaoua
    Performance Analysis of k-ary n-Cube Networks with Pipelined Circuit Switching. [Citation Graph (0, 0)][DBLP]
    International Journal of High Speed Computing, 2000, v:11, n:2, pp:111-127 [Journal]
  55. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie
    Algorithmic construction of Hamiltonians in pyramids. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:80, n:2, pp:75-79 [Journal]
  56. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Khaled Day, Lewis M. Mackenzie
    Algorithmic Construction of Hamiltonian Cycles in k-Ary n-Cubes. [Citation Graph (0, 0)][DBLP]
    I. J. Comput. Appl., 2004, v:11, n:1, pp:8-17 [Journal]
  57. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie, Selim G. Akl
    On The Combinatorial Properties Of k-Ary n-Cubes. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2004, v:5, n:1, pp:79-91 [Journal]
  58. Hamid Sarbazi-Azad, Ahmad Khonsari, Mohamed Ould-Khaoua
    Performance Analysis of Deterministic Routing in Workhole k-Ary n-Cubes with Virtual Channels. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2002, v:3, n:1-2, pp:67-83 [Journal]
  59. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie
    Analytical modelling of wormhole-routed k-ary n-cubes in the presence of matrix-transpose traffic. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2003, v:63, n:4, pp:396-409 [Journal]
  60. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie, Selim G. Akl
    A Parallel Algorithm for Lagrange Interpolation on the Star Graph. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2002, v:62, n:4, pp:605-621 [Journal]
  61. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Albert Y. Zomaya
    Design and performance of networks for super-, cluster-, and grid-computing: Part I. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2005, v:65, n:10, pp:1119-1122 [Journal]
  62. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Albert Y. Zomaya
    Design and performance of networks for super-, cluster-, and grid-computing: Part II. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2005, v:65, n:11, pp:1301-1304 [Journal]
  63. Ahmad Khonsari, Hamid Sarbazi-Azad, Mohamed Ould-Khaoua
    Analysis of true fully adaptive routing with software-based deadlock recovery. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 2004, v:71, n:3, pp:259-270 [Journal]
  64. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie
    Employing k-ary n-cubes for parallel Lagrange interpolation. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms Appl., 2001, v:16, n:4, pp:283-299 [Journal]
  65. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie
    Communication delay in hypercubes in the presence of bit-reversal traffic. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2001, v:27, n:13, pp:1801-1816 [Journal]
  66. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Albert Y. Zomaya
    Performance evaluation of communication networks for parallel and distributed systems. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2006, v:32, n:11-12, pp:775-776 [Journal]
  67. Mohamed Ould-Khaoua, Hamid Sarbazi-Azad, Mohammad S. Obaidat
    Performance modeling and evaluation of high-performance parallel and distributed systems. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2005, v:60, n:1-4, pp:1-4 [Journal]
  68. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie
    An accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2001, v:43, n:2-3, pp:165-179 [Journal]
  69. Ahmad Khonsari, Hamid Sarbazi-Azad, Mohamed Ould-Khaoua
    A Performance Model of Software-based Deadlock Recovery Routing Algorithm in Hypercubes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2005, v:15, n:1-2, pp:153-168 [Journal]
  70. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua
    Modelling and evaluation of adaptive routing in high-performance n-D tori networks. [Citation Graph (0, 0)][DBLP]
    Simulation Modelling Practice and Theory, 2006, v:14, n:6, pp:740-751 [Journal]
  71. Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie
    Analytical Modeling of Wormhole-Routed k-Ary n-Cubes in the Presence of Hot-Spot Traffic. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2001, v:50, n:7, pp:623-634 [Journal]
  72. M. Hoseiny Farahabady, Hamid Sarbazi-Azad
    The Grid-Pyramid: A Generalized Pyramid Network. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2006, v:37, n:1, pp:23-45 [Journal]
  73. Mohamed Ould-Khaoua, Hamid Sarbazi-Azad
    An Analytical Model of Adaptive Wormhole Routing in Hypercubes in the Presence of Hot Spot Traffic. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2001, v:12, n:3, pp:283-292 [Journal]
  74. Reza Moraveji, Hamid Sarbazi-Azad, Maghsoud Abbaspour
    Optimal Placement of Frequently Accessed IPs in Mesh NoCs. [Citation Graph (0, 0)][DBLP]
    Asia-Pacific Computer Systems Architecture Conference, 2007, pp:126-138 [Conf]
  75. Akbar Sharifi, Hamid Sarbazi-Azad
    Power Consumption and Performance Analysis of 3D NoCs. [Citation Graph (0, 0)][DBLP]
    Asia-Pacific Computer Systems Architecture Conference, 2007, pp:209-219 [Conf]
  76. S. Meraji, Abbas Nayebi, Hamid Sarbazi-Azad
    Simulation-Based Performance Evaluation of Deterministic Routing in Necklace Hypercubes. [Citation Graph (0, 0)][DBLP]
    AICCSA, 2007, pp:343-350 [Conf]
  77. Reza Moraveji, Hamid Sarbazi-Azad, Abbas Nayebi, Keyvan Navi
    Performance Modeling of Wormhole Hypermeshes Under Hotspot Traffic. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:290-302 [Conf]
  78. Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl
    Resource Placement in Networks Using Chromatic Sets of Power Graphs. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:158-167 [Conf]
  79. Mohammad R. Hoseinyfarahabady, Hamid Sarbazi-Azad
    On Pancyclicity Properties of OTIS Networks. [Citation Graph (0, 0)][DBLP]
    HPCC, 2007, pp:545-553 [Conf]
  80. Abbas Nayebi, Arash Shamaei, Hamid Sarbazi-Azad
    Improving a Fault-Tolerant Routing Algorithm Using Detailed Traffic Analysis. [Citation Graph (0, 0)][DBLP]
    HPCC, 2007, pp:766-775 [Conf]
  81. S. Meraji, Hamid Sarbazi-Azad, Ahmad Patooghy
    Performance Modelling of Necklace Hypercubes. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-8 [Conf]
  82. Navid Imani, Hamid Sarbazi-Azad, Albert Y. Zomaya
    Some Properties of WK-Recursive and Swapped Networks. [Citation Graph (0, 0)][DBLP]
    ISPA, 2007, pp:856-867 [Conf]
  83. Hamid Sarbazi-Azad
    The performance of synchronous parallel polynomial root extraction on a ring multicomputer. [Citation Graph (0, 0)][DBLP]
    Cluster Computing, 2007, v:10, n:2, pp:167-174 [Journal]
  84. Mohsen Ravanbakhsh, Yasin Abbasi-Yadkori, Maghsoud Abbaspour, Hamid Sarbazi-Azad
    A Heuristic Routing Mechanism Using a New Addressing Scheme [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  85. Hamid Hashemi-Najafabadi, Hamid Sarbazi-Azad
    Mathematical performance modelling of adaptive wormhole routing in optoelectronic hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:9, pp:967-980 [Journal]
  86. Navid Imani, Hamid Sarbazi-Azad, Albert Y. Zomaya
    Capturing an intruder in product networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:9, pp:1018-1028 [Journal]
  87. Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl
    Perfect load balancing on the star interconnection network. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2007, v:41, n:3, pp:269-286 [Journal]
  88. Hamid Hashemi-Najafabadi, Hamid Sarbazi-Azad, P. Rajabzadeh
    An accurate performance model of fully adaptive routing in wormhole-switched two-dimensional mesh multicomputers. [Citation Graph (0, 0)][DBLP]
    Microprocessors and Microsystems, 2007, v:31, n:7, pp:445-455 [Journal]
  89. A. Masoudnia, Hamid Sarbazi-Azad, Said Boussakta
    Design and performance of a pixel-level pipelined-parallel architecture for high speed wavelet-based image compression. [Citation Graph (0, 0)][DBLP]
    Computers & Electrical Engineering, 2005, v:31, n:8, pp:572-588 [Journal]
  90. Hamid Sarbazi-Azad
    Constraint-based performance comparison of multi-dimensional interconnection networks with deterministic and adaptive routing strategies. [Citation Graph (0, 0)][DBLP]
    Computers & Electrical Engineering, 2004, v:30, n:3, pp:167-182 [Journal]

  91. Topological Properties of Stretched Graphs. [Citation Graph (, )][DBLP]


  92. A Probability-Based Instruction Combining Method for Scheduling in VLIW Processors. [Citation Graph (, )][DBLP]


  93. Resource Placement in the Edge Product of Graphs. [Citation Graph (, )][DBLP]


  94. An Adaptive Software-Based Deadlock Recovery Technique. [Citation Graph (, )][DBLP]


  95. Empirical Performance Evaluation of Stretched Hypercubes. [Citation Graph (, )][DBLP]


  96. Analysis of k-Neigh Topology Control Protocol for Wireless Networks. [Citation Graph (, )][DBLP]


  97. PERMAP: A performance-aware mapping for application-specific SoCs. [Citation Graph (, )][DBLP]


  98. An efficient dynamically reconfigurable on-chip network architecture. [Citation Graph (, )][DBLP]


  99. A hybrid packet-circuit switched on-chip network based on SDM. [Citation Graph (, )][DBLP]


  100. Efficient VLSI Layout of Edge Product Networks. [Citation Graph (, )][DBLP]


  101. Caspian: A Tunable Performance Model for Multi-core Systems. [Citation Graph (, )][DBLP]


  102. A Simple and Efficient Fault-Tolerant Adaptive Routing Algorithm for Meshes. [Citation Graph (, )][DBLP]


  103. The Effect of Network Topology and Channel Labels on the Performance of Label-Based Routing Algorithms. [Citation Graph (, )][DBLP]


  104. A method for calculating hard QoS guarantees for Networks-on-Chip. [Citation Graph (, )][DBLP]


  105. A performance and power analysis of WK-Recursive and Mesh Networks for Network-on-Chips. [Citation Graph (, )][DBLP]


  106. Power-aware mapping for reconfigurable NoC architectures. [Citation Graph (, )][DBLP]


  107. The 2D DBM: An attractive alternative to the simple 2D mesh topology for on-chip networks. [Citation Graph (, )][DBLP]


  108. An Adaptive and Fault-Tolerant Routing Algorithm for Meshes. [Citation Graph (, )][DBLP]


  109. Accelerating 3-D capacitance extraction in deep sub-micron VLSI design using vector/parallel computing. [Citation Graph (, )][DBLP]


  110. Lifetime analysis of the logical topology constructed by homogeneous topology control in wireless mobile networks. [Citation Graph (, )][DBLP]


  111. Mathematical performance analysis of product networks. [Citation Graph (, )][DBLP]


  112. A comprehensive power-performance model for NoCs with multi-flit channel buffers. [Citation Graph (, )][DBLP]


  113. A novel high-performance and low-power mesh-based NoC. [Citation Graph (, )][DBLP]


  114. Routing, data gathering, and neighbor discovery in delay-tolerant wireless sensor networks. [Citation Graph (, )][DBLP]


  115. A General Approach for Analytical Modeling of Irregular NoCs. [Citation Graph (, )][DBLP]


  116. Broadcast Algorithms on OTIS-Cubes. [Citation Graph (, )][DBLP]


  117. Mesh Connected Crossbars: A Novel NoC Topology with Scalable Communication Bandwidth. [Citation Graph (, )][DBLP]


  118. Performance Evaluation of Broadcast Algorithms in All-Port 2D Mesh Networks. [Citation Graph (, )][DBLP]


  119. Resource Placement in Cube-Connected Cycles. [Citation Graph (, )][DBLP]


  120. One-to-one and One-to-many node-disjoint Routing Algorithms for WK-Recursive networks. [Citation Graph (, )][DBLP]


  121. The Shuffle-Exchange Mesh Topology for 3D NoCs. [Citation Graph (, )][DBLP]


  122. Topological Properties of Necklace Networks. [Citation Graph (, )][DBLP]


  123. The WK-Recursive Pyramid: An Efficient Network Topology. [Citation Graph (, )][DBLP]


  124. The Stretched-Hypercube: A VLSI Efficient Network Topology. [Citation Graph (, )][DBLP]


  125. On Some Combinatorial Properties of the Star Graph. [Citation Graph (, )][DBLP]


  126. Virtual Point-to-Point Links in Packet-Switched NoCs. [Citation Graph (, )][DBLP]


  127. Distant-Based Resource Placement in Product Networks. [Citation Graph (, )][DBLP]


  128. The Edge Product of Networks. [Citation Graph (, )][DBLP]


  129. A Markovian Performance Model for Networks-on-Chip. [Citation Graph (, )][DBLP]


  130. A General Methodology for Routing in Irregular Networks. [Citation Graph (, )][DBLP]


  131. Voltage-Frequency Planning for Thermal-Aware, Low-Power Design of Regular 3-D NoCs. [Citation Graph (, )][DBLP]


  132. A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes. [Citation Graph (, )][DBLP]


  133. Mathematical Performance Modelling of Stretched Hypercubes. [Citation Graph (, )][DBLP]


  134. The impacts of timing constraints on virtual channels multiplexing in interconnect networks. [Citation Graph (, )][DBLP]


  135. Performance and power efficient on-chip communication using adaptive virtual point-to-point connections. [Citation Graph (, )][DBLP]


  136. A general mathematical performance model for wormhole-switched irregular networks. [Citation Graph (, )][DBLP]


  137. Analysis of k-Neigh topology control protocol for mobile wireless networks. [Citation Graph (, )][DBLP]


  138. Some topological properties of star graphs: The surface area and volume. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002