Search for: network-architecture
0.007 seconds
Total 116 records

    Energy-optimized on-chip networks using reconfigurable shortcut paths

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 24 February 2011 through 25 February 2011 ; Volume 6566 LNCS , February , 2011 , Pages 231-242 ; 03029743 (ISSN) ; 9783642191367 (ISBN) Teimouri, N ; Modarressi, M ; Tavakkol, A ; Sarbazi Azad, H ; Sharif University of Technology
    Topology is an important network attribute that greatly affects the power, performance, cost, and design time/effort of NoCs. In this paper, we propose a novel NoC architecture that can exploit the benefits of both application-specific and regular NoC topologies. To this end, a subset of NoC links bypass the router pipeline stages and directly connect remotely located nodes. This results in an NoC which holds both fixed connections between adjacent nodes and long connections virtually connecting non-adjacent nodes. These shortcut paths are constructed at run-time by employing a simple and fast mechanism composed of two processes: on-chip traffic monitoring and path reconfiguration. The... 

    Theoretical analysis on multiple layer fast optical switch based data center network architecture

    , Article 24th OptoElectronics and Communications Conference/International Conference Photonics in Switching and Computing, OECC/PSC 2019, 7 July 2019 through 11 July 2019 ; 2019 ; 9784885523212 (ISBN) Khani, E ; Yan, F ; Guo, X ; Calabretta, N ; IEICE Communications Society; IEICE Electronics Society ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    We propose a novel multi-parallel layer DCN architecture based on low radix FOS. Results show cost and power consumption reduction of 4 parallel-layer architecture is 60% and 26.7% with respect to the FatTree. © 2019 The Institute of Electronics, Information and Communication Engineers (IEICE)  

    LTR: A low-overhead and reliable routing for network on chips

    , Article 2008 International SoC Design Conference, ISOCC 2008, Busan, 24 November 2008 through 25 November 2008 ; Volume 1 , Volume 1 , 2008 , Pages 129-133 ; 9781424425990 (ISBN) Patooghy, A ; Miremadi, S. G ; Sharif University of Technology
    IEEE Computer Society  2008
    A fault tolerant routing algorithm is presented in this paper. proposed routing algorithm is based on making a redundant of each packet as well as sending the redundant packets the paths with low traffic loads. Since two copies of each reach the destination node, the erroneous packets are and replaced with the correct ones. To effectively use paths with lower traffic loads, the redundant packets are according to YX routing while the original packets are according to Duato's routing algorithm. Minimizing the of sent redundant packets and exploiting different paths sending the original and redundant packets enable the algorithm to improve the reliability of NoCs with power and performance... 

    Hybrid meta-heuristic algorithms for solving network design problem

    , Article European Journal of Operational Research ; Volume 182, Issue 2 , 2007 , Pages 578-596 ; 03772217 (ISSN) Poorzahedy, H ; Rouhani, O. M ; Sharif University of Technology
    Network design problem has been, and is, an important problem in transportation. Following an earlier effort in designing a meta-heuristic search technique by an ant system, this paper attempts to hybridize this concept with other meta-heuristic concepts such as genetic algorithm, simulated annealing, and tabu search. Seven hybrids have been devised and tested on the network of Sioux Falls. It has been observed that the hybrids are more effective to solve the network design problem than the base ant system. Application of the hybrid containing all four concepts on a real network of a city with over 2 million population has also proved to be more effective than the base network, in the sense... 

    A New Hierarchal and Scalable Architecture for Performance Enhancement of Large Scale Underwater Sensor Networks

    , M.Sc. Thesis Sharif University of Technology Hamidzadeh, Majid (Author) ; Movaghar, Ali (Supervisor)
    Underwater Sensor Network (UWSN) is new branch of Wireless Sensor Network (WSN). UWSNs are considerably different from ground base or terrestrial sensor networks in many aspects. These new features bring many challenges to the network architecture or protocol design of UWSNs. This kind of sensor networks has been proposed to detection, monitoring, protecting the oceans as oceanographic data collector, pollution monitoring, offshore exploration, disaster prevention, assisted navigation and tactical surveillance applications. The different characteristics of UWSN and trade off between UWSN and WSN have been discussed in many researches. Here we aim to propose a new architecture for very large... 

    Power-efficient deterministic and adaptive routing in torus networks-on-chip

    , Article Microprocessors and Microsystems ; Vol. 36, issue. 7 , October , 2012 , pp. 571-585 ; ISSN: 01419331 Rahmati, D ; Sarbazi-Azad, H ; Hessabi, S ; Kiasari, A. E ; Sharif University of Technology
    Modern SoC architectures use NoCs for high-speed inter-IP communication. For NoC architectures, high-performance efficient routing algorithms with low power consumption are essential for real-time applications. NoCs with mesh and torus interconnection topologies are now popular due to their simple structures. A torus NoC is very similar to the mesh NoC, but has rather smaller diameter. For a routing algorithm to be deadlock-free in a torus, at least two virtual channels per physical channel must be used to avoid cyclic channel dependencies due to the warp-around links; however, in a mesh network deadlock freedom can be insured using only one virtual channel. The employed number of virtual... 

    Beyond the cut-set bound: Uncertainty computations in network coding with correlated sources

    , Article IEEE Transactions on Information Theory ; Volume 59, Issue 9 , 2013 , Pages 5708-5722 ; 00189448 (ISSN) Gohari, A. A ; Yang, S ; Jaggi, S ; Sharif University of Technology
    Cut-set bounds are not, in general, tight for all classes of network communication problems. In this paper, we introduce a new technique for proving converses for the problem of transmission of correlated sources in networks, which results in bounds that are tighter than the corresponding cut-set bounds. We also define the concept of 'uncertainty region' which might be of independent interest. We provide a full characterization of this region for the case of two correlated random variables. The bounding technique works as follows: on one hand, we show that if the communication problem is solvable, the uncertainty of certain random variables in the network with respect to imaginary parties... 

    Beyond the cut-set bound: Uncertainty computations in network coding with correlated sources

    , Article IEEE International Symposium on Information Theory - Proceedings, 31 July 2011 through 5 August 2011 ; July , 2011 , Pages 598-602 ; 21578104 (ISSN) ; 9781457705953 (ISBN) Gohari, A. A ; Yang, S ; Jaggi, S ; Sharif University of Technology
    Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper we introduce a new technique for proving converses for the problem of transmission of correlated sources in networks, that results in bounds that are tighter than the corresponding cut-set bounds. We also define the concept of "uncertainty region" which might be of independent interest. We provide a full characterization of this region for the case of two correlated random variables. The bounding technique works as follows: on one hand we show that if the communication problem is solvable, the uncertainty of certain random variables in the network with respect to imaginary parties... 

    Content delivery via multi-server coded caching in linear networks

    , Article ITW 2015 - 2015 IEEE Information Theory Workshop, 11 October 2015 through 15 October 2015 ; 2015 , Pages 267-271 ; 9781467378529 (ISBN) Shariatpanahi, S. P ; Motahari, S. A ; Khalaj, B. H ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    We consider a content delivery network where multiple servers are connected to multiple cache-enabled clients. Clients request their corresponding contents from the servers and servers collaboratively transmit packets to fulfill all the requests. It is assumed that some contents are stored in the caches in off-peak time of the network without knowing the actual requests, the so called cache content placement phase. The goal is to minimize the worst case delay in the content delivery phase. Considering a random linear network, we propose a coding strategy which exploits servers' multiplexing gains as well as caches' global and local coding gains. The main idea in our coding scheme is to... 

    A reconfigurable network-on-chip architecture for heterogeneous CMPs in the dark-silicon era

    , Article Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors ; 18-20 June , 2014 , pp. 76-77 ; ISSN: 10636862 ; ISBN: 9781479936090 Modarressi, M ; Sarbazi Azad, H ; Sharif University of Technology
    Core specialization is a promising solution to the dark silicon challenge. This approach trades off the cheaper silicon area with energy-efficiency by integrating a selection of many diverse application-specific cores into a single billion-transistor multicore chip. Each application then activates the subset of cores that best matches its processing requirements. These cores act as a customized application-specific CMP for the application. Such an arrangement of cores requires some special on-chip inter-core communication treatment to efficiently connect active cores. In this paper, we propose a reconfigurable network-on-chip that leverages the routers of the dark portion of the chip to... 

    Deep relative attributes

    , Article 13th Asian Conference on Computer Vision, ACCV 2016, 20 November 2016 through 24 November 2016 ; Volume 10115 LNCS , 2017 , Pages 118-133 ; 03029743 (ISSN); 9783319541921 (ISBN) Souri, Y ; Noury, E ; Adeli, E ; Sharif University of Technology
    Springer Verlag  2017
    Visual attributes are great means of describing images or scenes, in a way both humans and computers understand. In order to establish a correspondence between images and to be able to compare the strength of each property between images, relative attributes were introduced. However, since their introduction, hand-crafted and engineered features were used to learn increasingly complex models for the problem of relative attributes. This limits the applicability of those methods for more realistic cases. We introduce a deep neural network architecture for the task of relative attribute prediction. A convolutional neural network (ConvNet) is adopted to learn the features by including an... 

    SPONGE: a scalable pivot-based on/off gating engine for reducing static power in NoC routers

    , Article Proceedings of the International Symposium on Low Power Electronics and Design23 July 2018 ; 23-25 July , 2018 ; 15334678 (ISSN) ; 9781450357043 (ISBN) Farrokhbakht, H ; Mardani Kamali, H ; Jerger, N. E ; Hessabi, S ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2018
    Due to high aggregate idle time of Networks-on-Chip (NoCs) routers in practical applications, power-gating techniques have been proposed to combat the ever-increasing ratio of static power. Nevertheless, the sporadic packet arrivals compromise the effectiveness of power-gating by incurring significant latency and energy overhead. In this paper, we propose a Scalable Pivot-based On/Off Gating Engine (SPONGE) which efficiently manages power-gating decisions and routing mechanism by adaptively selecting a small set of powered-on columns of routers and keeping the others in power-gated state. To this end, a router architecture augmented with a novel routing algorithm is proposed in which a... 

    Sorting on OTIS-networks

    , Article 13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008, Kish Island, 9 March 2008 through 11 March 2008 ; Volume 6 CCIS , 2008 , Pages 871-875 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN) Akhgari, E ; Ziaie, A. R ; Ghodsi, M ; Sharif University of Technology
    Because of their various desirable properties, OTIS networks are subject to active research in the field of parallel processing. In this paper, the OTIS network architecture is presented, emphasizing two important varieties, the OTIS-mesh and the OTIS-hypercube. Next, a randomized sorting algorithm presented in the literature for OTIS-mesh structures will be reviewed. Finally, a discussion of sorting on OTIS-hypercubes will be offered, and a suggested algorithm for sorting on these networks, with an MPI implementation will be introduced. © 2008 Springer-Verlag  

    Performance modelling of necklace hypercubes

    , Article 21st International Parallel and Distributed Processing Symposium, IPDPS 2007, Long Beach, CA, 26 March 2007 through 30 March 2007 ; 2007 ; 1424409101 (ISBN); 9781424409105 (ISBN) Meraji, S ; Sarbazi Azad, H ; Patooghy, A ; Sharif University of Technology
    The necklace hypercube has recently been introduced as an attractive alternative to the well-known hypercube. Previous research on this network topology has mainly focused on topological properties, VLSI and algorithmic aspects of this network Several analytical models have been proposed in the literature for different interconnection networks, as the most cost-effective tools to evaluate the performance merits of such systems. This paper proposes an analytical performance model to predict message latency in wormhole-switched necklace hypercube interconnection networks with fully adaptive routing. The analysis focuses on a fully adaptive routing algorithm which has been shown to be the most... 

    A new method in prediction of TCP phases formation in superalloys

    , Article Materials Science and Engineering A ; Volume 396, Issue 1-2 , 2005 , Pages 138-142 ; 09215093 (ISSN) Mousavi Anijdan, S. H ; Bahrami, A ; Sharif University of Technology
    The purpose of this investigation is to develop a model for prediction of topologically closed-packed (TCP) phases formation in superalloys. In this study, artificial neural networks (ANN), using several different network architectures, were used to investigate the complex relationships between TCP phases and chemical composition of superalloys. In order to develop an optimum ANN structure, more than 200 experimental data were used to train and test the neural network. The results of this investigation shows that a multilayer perceptron (MLP) form of the neural networks with one hidden layer and 10 nodes in the hidden layer has the lowest mean absolute error (MAE) and can be accurately used... 

    All-optical wavelength-routed architecture for a power-efficient network on chip

    , Article IEEE Transactions on Computers ; Vol. 63, issue. 3 , 2014 , p. 777-792 Koohi, S ; Hessabi, S ; Sharif University of Technology
    In this paper, we propose a new architecture for nanophotonic Networks on Chip (NoC), named 2D-HERT, which consists of optical data and control planes. The proposed data plane is built upon a new topology and all-optical switches that passively route optical data streams based on their wavelengths. Utilizing wavelength routing method, the proposed deterministic routing algorithm, and Wavelength Division Multiplexing (WDM) technique, the proposed data plane eliminates the need for optical resource reservation at the intermediate nodes. For resolving end-point contention, we propose an all-optical request-grant arbitration architecture which reduces optical losses compared to the alternative... 

    Identification of the appropriate architecture of multilayer feed-forward neural network for estimation of NPPs parameters using the GA in combination with the LM and the BR learning algorithms

    , Article Annals of Nuclear Energy ; Volume 156 , 2021 ; 03064549 (ISSN) Moshkbar Bakhshayesh, K ; Sharif University of Technology
    Elsevier Ltd  2021
    In this study, accurate estimation of nuclear power plant (NPP) parameters is done using the new and simple technique. The proposed technique using the genetic algorithm (GA) in combination with the Bayesian regularization (BR) and Levenberg- Marquardt (LM) learning algorithms identifies the appropriate architecture for estimation of the target parameters. In the first step, the input patterns features are selected using the features selection (FS) technique. In the second step, the appropriate number of hidden neurons and hidden layers are investigated to provide a more efficient initial population of the architectures. In the third step, the estimation of the target parameter is done using... 

    Prcdicting the Stock Total Index and Case Study of Stock Price of "Teractor Sazi" Company with Neural Networks

    , M.Sc. Thesis Sharif University of Technology Abdili, Shiva (Author) ; Eshraghniaye Jahromi, Abdolhamid (Supervisor)
    In this era, competition in economic fields is undeniable. According to huge amount of foreign trades between countries, economic prosperity of each country causes persuasion of foreign investors to come into that country for investment. Stock Exchanges is one sign of economic prosperity in each country, So prediction of the stock exchanges situation is very important. It is noteworthy that according to the importance of prediction in partial level, the necessity of predicting companies stock price is realized. According to the complicated term in this field, linear methods do not have appropriate efficiency for predicting, so nonlinear methods and especially Artificial Neural Networks are... 

    Primary Visual Pathway Simulation in Mouse Using NetPyNE

    , M.Sc. Thesis Sharif University of Technology Waheed Al-Kaabi, Anwer Fadhil (Author) ; Peyvandi, Hossein (Supervisor)
    Simulation of biophysical neural networks enables the interpretation and integration of fast-growing and different experimental datasets. The widely used NEURON simulator allows molecular-to-network simulation. However, it is still a very hard challenge to create large-scale models and operate parallel simulations applying NEURON. SUNY Downstate developed the NetPyNE means networks using Python and NEURON, which was funded by the New York State Department of Health and some other institutions. NetPyNE is a Python-based tool that enables the development of data-driven multi-scale network models in NEURON through both programmatic and graphical interfaces. It is a powerful tool for parallel... 

    Design for scalability in enterprise SSDs

    , Article Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT ; 24-27 August , 2014 , p. 417-429 ; ISSN: 1089795X ; ISBN: 9781450328098 Tavakkol, A ; Arjomand, M ; Sarbazi-Azad, H ; Sharif University of Technology
    Solid State Drives (SSDs) have recently emerged as a high speed random access alternative to classical magnetic disks. To date, SSD designs have been largely based on multi-channel bus architecture that confronts serious scalability problems in high-end enterprise SSDs with dozens of flash memory chips and a gigabyte host interface. This forces the community to rapidly change the bus-based inter-flash standards to respond to ever increasing application demands. In this paper, we first give a deep look at how different flash parameters and SSD internal designs affect the actual performance and scalability of the conventional architecture. Our experiments show that SSD performance improvement...