Search for: network-sizes
0.008 seconds

    Numerical versus analytic synchronization in small-world networks of hindmarsh-rose neurons

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1 December 2009 through 1 December 2009, Melbourne, VIC ; Volume 5866 LNAI , 2009 , Pages 627-635 ; 03029743 (ISSN) ; 364210438X (ISBN) Jalili, M ; Sharif University of Technology
    Neuronal temporal synchronization is one of the key issues in studying binding phenomenon in neural systems. In this paper we consider identical Hindmarsh-Rose neurons coupled over Newman-Watts small-world networks and investigate to what extent the numerical and analytic synchronizing coupling strengths are different. We use the master-stability-function approach to determine the unified coupling strength necessary for analytic synchronization. We also solve the network's differential equations numerically and track the synchronization error and consequently determine the numerical synchronizing coupling parameters. Then, we compare these two values and investigate the influence of various... 

    A general methodology for direction-based irregular routing algorithms

    , Article Journal of Parallel and Distributed Computing ; Volume 70, Issue 4 , 2010 , Pages 363-370 ; 07437315 (ISSN) Moraveji, R ; Sarbazi Azad, H ; Zomaya, A. Y ; Sharif University of Technology
    This paper presents a general methodology for generating deadlock-free routing algorithms for irregular networks. Constructing a spanning tree on the given network, assigning directions to the network channels, creating deadlock-free zones, and specifying a logical sequence of the produced deadlock-free zones are the four fundamental steps that the proposed methodology takes to generate deadlock-free and connected routing algorithms. By applying the proposed methodology with two known labeling methods we have generated six irregular routing algorithms: three of them are novel routing algorithms and three of them (the Up/Down, Left/Right, and L-turn routing algorithms) have already been... 

    Hierarchical opto-electrical on-chip network for future multiprocessor architectures

    , Article Journal of Systems Architecture ; Volume 57, Issue 1 , 2011 , Pages 4-23 ; 13837621 (ISSN) Koohi, S ; Hessabi, S ; Sharif University of Technology
    Importance of power dissipation in NoCs, along with power reduction capability of on-chip optical interconnects, offers optical network-on-chip as a new technology solution for on-chip interconnects. In this paper, we extract analytical models for data transmission delay, power consumption, and energy dissipation of optical and traditional NoCs. Utilizing extracted models, we compare optical NoC with electrical one and calculate lower bound limit on the optical link length below which optical on-chip network loses its efficiency. Based on this constraint, we propose a novel hierarchical on-chip network architecture, named as H2NoC, which benefits from optical transmissions in large scale... 

    Semantic partitioning of peer-to-peer search space

    , Article Computer Communications ; Volume 32, Issue 4 , 2009 , Pages 619-633 ; 01403664 (ISSN) Rostami, H ; Habibi, J ; Livani, E ; Sharif University of Technology
    Peer-to-peer (P2P) networks are beginning to form the infrastructure of future applications. Computers are organized in P2P overlay networks to facilitate search queries with reasonable cost. So, scalability is a major aim in design of P2P networks. In this paper, to obtain a high factor of scalability, we partition network search space using a consistent static shared upper ontology. We name our approach semantic partition tree (SPT). All resources and queries are annotated using the upper ontology and queries are semantically routed in the overlay network. Also, each node indexes addresses of other nodes that possess contents expressible by the concept it maintains. So, our approach can be...