Loading...
Search for:
parallel-architectures
0.007 seconds
Total 33 records
Optimized fuzzy control strategy for a spa hybrid truck
, Article International Journal of Automotive Technology ; Volume 13, Issue 5 , August , 2012 , Pages 817-824 ; 12299138 (ISSN) ; Foumani, M. S ; Sharif University of Technology
2012
Abstract
In this paper, an optimized control strategy is proposed for a split parallel hydraulic hybrid truck. The model of the vehicle was simulated in Simulink. According to a global optimization technique, a fuzzy control strategy is developed for the vehicle. This strategy shows flexibility for different drive cycles and a desirable fuel consumption reduction, especially for a low speed drive cycle, which is extracted according to an urban utility vehicle mission
Unleashing the potentials of dynamism for page allocation strategies in SSDs
, Article SIGMETRICS 2014 - Proceedings of the 2014 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems ; 16-20 June , 2014 , pp. 551-552 ; ISBN: 9781450327893 ; Arjomand, M ; Sarbazi-Azad, H ; Sharif University of Technology
Abstract
In Solid-State Drives (SSDs) with tens of ash chips and highly parallel architecture, we can speed up I/O operations by well-utilizing resources during page allocation. Propos- als already exist for using static page allocation which does not balance the IO load and its efficiency depends on access address patterns. To our best knowledge, there have been no research thus far to show what happens if one or more internal resources can be freely allocated regardless of the request address. This paper explores the possibility of using different degrees of dynamism in page allocation and iden- tifies key design opportunities that they present to improve SSD's characteristics
Analysis of true fully adaptive routing with software-based deadlock recovery
, Article Journal of Systems and Software ; Volume 71, Issue 3 , 2004 , Pages 259-270 ; 01641212 (ISSN) ; Sarbazi Azad, H ; Ould Khaoua, M ; Sharif University of Technology
2004
Abstract
Several analytical models of fully adaptive routing (AR) in wormhole-routed networks have recently been reported in the literature. All these models, however, have been discussed for routing algorithms with deadlock avoidance. Recent studies have revealed that deadlocks are quite rare in the network, especially when enough routing freedom is provided. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated researchers to introduce fully adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model of a true fully AR algorithm with software-based deadlock...
Mechanical Design and Fabrication of a Parallel Hybrid Vehicle Powertrain Simulator
, M.Sc. Thesis Sharif University of Technology ; Saadat Foumani, Mahmoud (Supervisor)
Abstract
In this research, the mechanical section of a reduced-scale hybrid vehicle simulator was designed and fabricated. In order to scale down the vehicle dynamics, a method based on dimensional analysis was proposed. An internal combustion engine and an electric motor were selected as power sources and then, scaling was performed, according to the specifications of the combustion engine. Afterwards, the power transmission system was designed first in concept and then in more detail. Finally, the design was manufactured and assembled. The study was made in conjunction with another study responsible for the controlling section of the work, conducted by Safabakhsh The sponsor of these two researches...
Unleashing the potentials of dynamism for page allocation strategies in SSDs
, Article SIGMETRICS 2014 - Proceedings of the 2014 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems ; 2014 , pp. 551-552 ; ISBN: 9781450327893 ; Arjomand, M ; Sarbazi-Azad, H ; Sharif University of Technology
Abstract
In Solid-State Drives (SSDs) with tens of ash chips and highly parallel architecture, we can speed up I/O operations by well-utilizing resources during page allocation. Propos- als already exist for using static page allocation which does not balance the IO load and its efficiency depends on access address patterns. To our best knowledge, there have been no research thus far to show what happens if one or more internal resources can be freely allocated regardless of the request address. This paper explores the possibility of using different degrees of dynamism in page allocation and iden- tifies key design opportunities that they present to improve SSD's characteristics
Recommendations on performance of parallel DSMC algorithm in solving subsonic nanoflows
, Article Applied Mathematical Modelling ; Volume 36, Issue 5 , May , 2012 , Pages 2314-2321 ; 0307904X (ISSN) ; Darbandi, M ; Sharif University of Technology
2012
Abstract
We investigate the efficiency of a parallel direct simulation Monte Carlo (PDSMC) algorithm in solving the rarefied subsonic flow through a nanochannel. We use MPI library to transfer data between the processors. It is observed that PDSMC solver shows ideal speed up if sufficient workload is provided for each of processors. Additionally, this study shows that the computational time and speed up of the extended PDSMC solver do not depend (or slightly depend) on the number of cells. In contrary, increasing the total number of particles would result in a better efficiency of the PDSMC
GPU-based parallel algorithm for computing point visibility inside simple polygons
, Article Computers and Graphics (Pergamon) ; Volume 49 , 2015 , Pages 1-9 ; 00978493 (ISSN) ; Ghodsi, M ; Sharif University of Technology
Elsevier Ltd
2015
Abstract
Given a simple polygon P in the plane, we present a parallel algorithm for computing the visibility polygon of an observer point q inside P. We use chain visibility concept and a bottom-up merge method for constructing the visibility polygon of point q. The algorithm is simple and mainly designed for GPU architectures, where it runs in O(logn) time using O(n) processors. This is the first work on designing a GPU-based parallel algorithm for the visibility problem. To the best of our knowledge, the presented algorithm is also the first suboptimal parallel algorithm for the visibility problem that can be implemented on existing parallel architectures. We evaluated a sample implementation of...
A parallel clustering algorithm on the star graph and its performance
, Article Mathematical and Computer Modelling ; Volume 58, Issue 3-4 , 2013 , Pages 880-891 ; 08957177 (ISSN) ; Zarandi, H. R ; Fazeli, M ; Sharif University of Technology
Abstract
In this paper, a parallel algorithm is presented for data clustering on a multicomputer with star topology. This algorithm is fast and requires a small amount of memory per processing element, which makes it even suitable for SIMD implementation. The proposed parallel algorithm completes in O(K+S2-T2) steps for a clustering problem of N data patterns with M features per pattern and K clusters where S and T are the minimum numbers such that NM≤S! and KM≤T!, on the S-dimensional star graph
Design and performance of a pixel-level pipelined-parallel architecture for high speed wavelet-based image compression
, Article Computers and Electrical Engineering ; Volume 31, Issue 8 , 2005 , Pages 572-588 ; 00457906 (ISSN) ; Sarbazi Azad, H ; Boussakta, S ; Sharif University of Technology
2005
Abstract
Wavelets have widely been used in many signal and image processing applications. In this paper, a new serial-parallel architecture for wavelet-based image compression is introduced. It is based on a 4-tap wavelet transform, which is realised using some FIFO memory modules implementing a pixel-level pipeline architecture to compress and decompress images. The real filter calculation over 4 × 4 window blocks is done using a tree of carry save adders to ensure the high speed processing required for many applications. The details of implementing both compressor and decompressor sub-systems are given. The primarily analysis reveals that the proposed architecture, implemented using current VLSI...
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 ; Arjomand, M ; Sarbazi-Azad, H ; Sharif University of Technology
Abstract
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...
A localization algorithm for large scale mobile wireless sensor networks: A learning approach
, Article Journal of Supercomputing ; Vol. 69, issue. 1 , July , 2014 , p. 98-120 ; Beigy, H ; Sharif University of Technology
Abstract
Localization is a crucial problem in wireless sensor networks and most of the localization algorithms given in the literature are non-adaptive and designed for fixed sensor networks. In this paper, we propose a learning based localization algorithm for mobile wireless sensor networks. By this technique, mobility in the network will be discovered by two crucial methods in the beacons: position and distance checks methods. These two methods help to have accurate localization and constrain communication just when it is necessary. The proposed method localizes the nodes based on connectivity information (hop count), which doesn't need extra hardware and is cost efficient. The experimental...
Blade shape optimization of marine propeller via genetic algorithm for efficiency improvement
, Article Proceedings of the ASME Turbo Expo ; Volume 5 , 2012 , Pages 235-242 ; 9780791844717 (ISBN) ; Mazaheri, K ; Sharif University of Technology
2012
Abstract
In this paper, a numerical optimization method has been carried out to optimize the shape and efficiency of a propeller. For analysis of the hydrodynamic performance parameters, an extended vortex lattice method was used by implementing an open-source code which is called OpenProp. The method of optimization is a non-gradient based algorithm. After a trade-off between a few gradient-based and non-gradient based algorithms, it is found that the problem of being trapped in local optimum solutions can be easily solved by choosing nongradient based ones. Hence, modified Genetic algorithm is used to implement the so-called hydrodynamic performance analyzer code. The objective function is to...
Kinetic Euclidean minimum spanning tree in the plane
, Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Volume 7056 LNCS , 2011 , Pages 261-274 ; 03029743 (ISSN) ; 9783642250101 (ISBN) ; Zarei, A ; Sharif University of Technololgy
2011
Abstract
This paper presents the first kinetic data structure (KDS) for maintenance of the Euclidean minimum spanning tree (EMST) on a set of n moving points in 2-dimensional space. We build a KDS of size O(n) in O(nlogn) preprocessing time by which their EMST is maintained efficiently during the motion. In terms of the KDS performance parameters, our KDS is responsive, local, and compact
A fast enhanced algorithm of PRI transform
, Article Proceedings - 6th International Symposium on Parallel Computing in Electrical Engineering, PARELEC 2011, 4 April 2011 through 5 April 2011 ; April , 2011 , Pages 179-184 ; 9780769543970 (ISBN) ; Pezeshk, A. M ; Sharif University of Technology
2011
Abstract
The problem of estimating pulse repetition interval (PRI) of an interleaved pulse train which consist of several independent radar signals, is the main issue of signal processing in electronic support systems. PRI Transform algorithm is one of the well known and effective methods of PRI detection which is capable of detecting several close jittered signals and surpassing subharmonics, but have some drawbacks especially because of small PRI dynamic range and heavy computations. In this paper a modified PRI transform is introduced which manage wide range of PRIs simultaneously, and speed up the algorithm by significantly reducing the computations. Moreover an efficient threshold is set for...
Finite-time consensus in directed switching network topologies and time-delayed communications
, Article Scientia Iranica ; Volume 18, Issue 1 B , February , 2011 , Pages 21-34 ; 10263098 (ISSN) ; Doostmohammadian, M. R ; Sharif University of Technology
2011
Abstract
There are many practical situations where it is desirable or even required to achieve stable convergence in the finite-time domain. In this paper, a simple distributed continuous-time protocol is introduced that guarantees finite-time consensus in networks of autonomous agents. Protocol convergence in weighted directed/undirected and fixed/switching networks is explored based on a Lyapunov analysis. The stability of the system and the solvability of the consensus algorithm are proved for network topologies that contain a spanning tree frequently enough over contiguous time intervals. The decision value for different topologies and for multi-rate integrator agents is investigated, and a novel...
Optimal gas distribution network using minimum spanning tree
, Article Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010, 29 October 2010 through 31 October 2010 ; October , 2010 , Pages 1374-1377 ; 9781424464814 (ISBN) ; Mahdavi Amiri, N ; Makui, A ; Mohajeri, A ; Tafazzoli, R ; Sharif University of Technology
2010
Abstract
Here, a case study of natural gas network is conducted. We design an optimal distribution network of natural gas. Our proposed network is composed of stations reducing gas pressure to desirable pressure using consumer's viewpoint. By using minimum spanning tree (MST) technique, an optimal distribution network among stations and consumers is constructed. Our aim is to determine both locations and types of stations minimizing location-allocation costs in the network. A case study in Mazandaran Gas Company in Iran is made to assess the validity and effectiveness of the proposed model
An optimal natural-gas network using minimum spanning tree
, Article 40th International Conference on Computers and Industrial Engineering: Soft Computing Techniques for Advanced Manufacturing and Service Systems, CIE40 2010, 25 July 2010 through 28 July 2010 ; July , 2010 ; 9781424472956 (ISBN) ; Mohajeri, A ; Arabmaghsudi, M ; Yahyanejad, M. H ; Taghipourian, F ; Mahdavi Amiri, N ; Sharif University of Technology
2010
Abstract
We consider the design of an optimal natural-gas network. Our proposed network contains two echelons, Town Broad Stations (TBSs), and consumers (demand zones). Here, our aim is a two-stage cost minimization. We first determine locations of the TBS so that the location-allocation cost is minimized. Then, we show how to distribute the flow of gas among the TBS minimizing the flow cost by using Minimum Spanning Tree (MST). A case study in Mazandaran Gas Company in Iran is made to assess the validity and effectiveness of our proposed model
A fault tolerant parallelism approach for implementing High-throughput pipelined advanced encryption standard
, Article Journal of Circuits, Systems and Computers ; Volume 25, Issue 9 , 2016 ; 02181266 (ISSN) ; Hessabi, S ; Sharif University of Technology
World Scientific Publishing Co. Pte Ltd
2016
Abstract
Advanced Encryption Standard (AES) is the most popular symmetric encryption method, which encrypts streams of data by using symmetric keys. The current preferable AES architectures employ effective methods to achieve two important goals: protection against power analysis attacks and high-throughput. Based on a different architectural point of view, we implement a particular parallel architecture for the latter goal, which is capable of implementing a more efficient pipelining in field-programmable gate array (FPGA). In this regard, all intermediate registers which have a role for unrolling the main loop will be removed. Also, instead of unrolling the main loop of AES algorithm, we implement...
A general methodology for routing in irregular networks
, Article 17th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP 2009, Weimar, 18 February 2009 through 20 February 2009 ; 2009 , Pages 155-160 ; 9780769535449 (ISBN) ; Sarbazi Azad, H ; Zomaya, A. Y ; Sharif University of Technology
2009
Abstract
Irregular networks provide more scalability and better cost-performance for network-based parallel computing systems. There has been much work done on developing routing algorithms for this class of networks. In this paper, a general methodology for generating deadlock-free routing algorithms for irregular networks is proposed. It not only introduces three novel efficient routing algorithms, but also covers the three best-known routing algorithms already proposed for irregular networks in the literature, namely Up/Down, Left/Right, and L-turn routing algorithms. As revealed by simulation results, the performance of the six routing algorithms mainly depends on network topology and different...
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) ; Yan, F ; Guo, X ; Calabretta, N ; IEICE Communications Society; IEICE Electronics Society ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2019
Abstract
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)