Search for: runtimes
Total 35 records
Article Journal of Electronic Testing: Theory and Applications (JETTA) ; Volume 33, Issue 4 , 2017 , Pages 381-395 ; 09238174 (ISSN) ; Manzuri Shalmani, M. T ; Hemmatyar, A. M. A ; Sharif University of Technology
Springer New York LLC 2017
In recent years, hardware Trojans (HTs) have become one of the main challenging concerns within the chain of manufacturing digital integrated circuit chips. Because of their diversity in chips, HTs are difficult to detect and locate. This paper attempted to propose a new improved method for detection and localization of HTs based on the real-time logical values of nodes. The algorithm extracts the nodes with special attributes. At the next stage, the nodes with the greatest similarity in terms of logical value are selected as targets. Depending on the size of the circuit, the extraction continues until a sufficient number of similar nodes has been selected. The logical relationship between...
Article Proceedings - IEEE 7th International Conference on Self-Adaptation and Self-Organizing Systems Workshops, SASOW 2013 ; Sept , 2014 , p. 83-88 ; Heydarnoori, A ; Sharif University of Technology
In order to be adapted to changes in user requirements and/or the environment, many software systems need to run continuously while they evolve. Most current approaches for such dynamic reconfiguration assume that the evolved system will behave as expected and thus will be reliable if the reconfiguration is consistent. This assumption may not correspond to reality because the delivered quality estimated previously could vary due to parameter changes at runtime. To ensure that the system acts correctly in the field after the reconfiguration, reliability of changes has to be checked at runtime. Existing approaches, however, are not applicable in highly available systems due to the possibility...
Article Physical Review A - Atomic, Molecular, and Optical Physics ; Volume 82, Issue 5 , 2010 ; 10502947 (ISSN) ; Pimachev, A. K ; Lidar, D. A ; Sharif University of Technology
Adiabatic quantum algorithms are characterized by their run time and accuracy. The relation between the two is essential for quantifying adiabatic algorithmic performance yet is often poorly understood.We study the dynamics of a continuous time, adiabatic quantum search algorithm and find rigorous results relating the accuracy and the run time. Proceeding with estimates, we show that under fairly general circumstances the adiabatic algorithmic error exhibits a behavior with two discernible regimes: The error decreases exponentially for short times and then decreases polynomially for longer times.We show that the well-known quadratic speedup over classical search is associated only with the...
Article 16th International Conference on Microelectronics, ICM 2004, Tunis, 6 December 2004 through 8 December 2004 ; 2004 , Pages 232-235 ; Gharehbaghi, A. M ; Yaran, B. H ; Goudarzi, M ; Sharif University of Technology
In this paper we integrate a verification methodology with our object-oriented system-level synthesis methodology to address the problem of HW/SW co-verification after system synthesis. We have defined a set of system-level assertions. These assertions are automatically converted to monitor hardware or monitor software during the system-level synthesis process depending on their type and also synthesis style of their corresponding functions. The synthesized assertions are functionally equivalent to their original system-level assertion, and hence, can be used to verify the system after HW/SW synthesis. This way, not only system-level assertions are reused in lower-levels of abstraction, but...
Article Proceedings - 10th IEEE Pacific Rim International Symposium on Dependable Computing, Papeete Tahiti, 3 March 2004 through 5 March 2004 ; 2004 , Pages 49-54 ; 0769520766 (ISBN); 9780769520766 (ISBN) ; Mohandespour, M ; Miremadi, G ; Sharif University of Technology
Increasing use of commercial off-the-shelf (COTS) superscalar processors in industrial, embedded, and real-time systems necessitates the development of error detection mechanisms for such systems. This paper presents an error detection scheme called Committed Instructions Counting (CIC) to increase error detection in such systems. The scheme uses internal Performance Monitoring features and an external watchdog processor (WDP). The Performance Monitoring features enable counting the number of committed instructions in a program. The scheme is experimentally evaluated on a 32-bit Pentium® processor using software implemented fault injection (SWIFI). A total of 8181 errors were injected into...
Article Journal of software: Evolution and Process ; Volume 25, Issue 5 , 2013 , Pages 535-568 ; 20477481 (ISSN) ; Abolhassani, H ; Moshkenani, M. S ; Sharif University of Technology
Application update at run-time remains a challenging issue in software engineering. There are many techniques with different evaluation metrics, resulting in different behaviours in the application being updated. In this paper, we provide an extensive review of research work on dynamic software updating. A framework for the evaluation of dynamic updating features is developed, and the articles are categorized and discussed based on the provided framework. Areas of online software maintenance requiring further research are also identified and highlighted. This information is deemed to not only assist practitioners in selecting appropriate dynamic updating techniques for their systems, but...
Article NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC, 25 August 2009 through 27 August 2009, Seoul ; 2009 , Pages 393-396 ; 9780769537696 (ISBN) ; Kholghi, M. A. K ; Movaghar, A ; Sharif University of Technology
the failure in cluster at a high level can bring up great damages to the system in wireless sensor networks where clustering techniques are used. Certain methods have been reported in the literature in recovering the sensors from a failure cluster. One of the most important methods is to recover the sensors in run-time and without clustering. But it is so much ideal to suppose that all the sensors will be recovered. In this paper, we proposed a method that can operate on the remained sensors that are not recovered. © 2009 IEEE
Article Proceedings of 2016 IEEE East-West Design and Test Symposium, EWDTS 2016, 14 October 2016 through 17 October 2016 ; 2017 ; 9781509006939 (ISBN) ; Goudarzi, M ; Sharif University of Technology
Using an FPGA as a hardware accelerator has been prevalent, to speed up compute intensive workloads. However, employing an accelerator in virtualized environment enhances complexity, because accessing the accelerator from virtual machines has significant overhead and sharing it needs some considerations. We have implemented adequate infrastructure to share an FPGA-based accelerator between multiple virtual machines with negligible access overhead which dynamically implements virtual machines' accelerators. In our architecture each user process from a virtual machine can directly access the FPGA over PCIe link and reconfigure its accelerator in the specified part of FPGA at run-time. The...
Article International Journal on Hydropower and Dams ; Volume 13, Issue 3 , 2006 , Pages 121-125 ; 13522523 (ISSN) ; Karimi, A ; Sharif University of Technology
Coordinated operation of hydro-thermal power systems helps reduce generation costs. The Hydro-Thermal Coordinating Model (HTCOM) software package, as one of these models, determines long-term operational policies for a hydro-thermal power system with multipurpose reservoirs. The CLT was incorporated within this framework to ensure a logical time-based run-time, with no serious decrease in precision. HTCOM, based on both its theoretical background and its application in the KWPA system, has shown that it can handle real world problems successfully, with more reliable outcomes. Many models have also been developed to optimize the planning of hydro-thermal systems. HTCOM was developed and...
Article 9th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2005, Orlando, FL, 10 July 2005 through 13 July 2005 ; Volume 2 , 2005 , Pages 83-88 ; 980656054X (ISBN); 9789806560543 (ISBN) ; Niamanesh, M ; Jalili, R ; Sharif University of Technology
Reconfigurability in software has many advantages such as updating, bug fixing and adding new services. Dynamic reconfiguration is more useful for mission critical systems that need to change in run time. Reconfiguration of a system in network may result to reconfiguring its dependent systems, which we call reconfiguration propagation. In this paper, we present a model for reconfiguration propagation for systems in a network
Ph.D. Dissertation Sharif University of Technology ; Movaghar, Ali ; Sirjani, Marjan
Increasing the complexity of software systems, their ubiquitous presence in the human activities, and necessity to preserving the functional and nonfunctional requirements of the systems under an uncertain environment, increase the need for self-adaptive systems. A self-adaptive system changes its structure and behaviors in response to changes in its environment and the system itself. A key research challenge in the self-adaptive community is to guarantee that the system fulfills its requirements. This issue can be addressed by employing formal methods during the design of the software systems. However, the assurance techniques should be used during the execution of the system as well as the...
Article ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, 22 May 2011 through 27 May 2011, Prague ; 2011 , Pages 3672-3675 ; 15206149 (ISSN) ; 9781457705397 (ISBN) ; Malek-Mohammadi, M ; Babaie-Zadeh, M ; Jutten, C ; Sharif University of Technology
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA and OptSpace, there is no solution that can simultaneously cover wide range of easy and hard problems. This new algorithm provides accurate results in almost all scenarios with a reasonable run time. It especially has low execution time in hard problems where other methods need long time to converge. Furthermore, when the rank is known in advance and is high, our method is very faster than previous methods for the same accuracy. The main idea of the algorithm is based on a continuous and differentiable approximation...
A game theoretical thermal - aware run-time task synchronization method for multiprocessor systems-on-chip, Article Proceedings - 15th Euromicro Conference on Digital System Design, DSD 2012 ; Article number 6386970 , 5 -8 September , 2012 , pp. 759-765 ; ISBN: 9780769547985 ; Khabbazian, M. H ; Modarressi, M ; Sarbazi Azad, H ; Sharif University of Technology
This paper presents a distributed run-time task synchronization method for multicore processors aiming to reduce the average power consumption of the chip and satisfy a given thermal constraint, while imposing no performance overhead. Being built on the game theory concepts, this is achieved by dynamically changing the frequency of each individual core based on its current workload iteratively until converging to an optimal point. In this work we target two thermal constraints: keeping (1) the core peak temperature and, (2) thermal gradient across the cores below a predefined threshold. The results show that the proposed framework can find the appropriate frequency for each core based on the...
Article Proceedings - Design Automation Conference, 13 June 2010 through 18 June 2010 ; June , 2010 , Pages 166-169 ; 0738100X (ISSN) ; 9781450300025 (ISBN) ; Sarbazi Azad, H ; Tavakkol, A ; Sharif University of Technology
In this paper, we present a reconfigurable architecture for NoCs on which arbitrary application-specific topologies can be implemented. The proposed NoC can dynamically tailor its topology to the traffic pattern of different applications at run-time. The run-time topology construction mechanism involves monitoring the network traffic and changing the inter-node connections in order to reduce the number of intermediate routers between the source and destination nodes of heavy communication flows. This mechanism should also preserve the NoC connectivity. In this paper, we first introduce the proposed reconfigurable topology and then address the problem of run-time topology reconfiguration....
Article Journal of Systems and Software ; Volume 143 , 2018 , Pages 116-139 ; 01641212 (ISSN) ; Sirjani, M ; Khamespanah, E ; Khakpour, N ; Akkaya, I ; Movaghar, A ; Lee, E. A ; Sharif University of Technology
Elsevier Inc 2018
Self-adaptation is a well-known technique to handle growing complexities of software systems, where a system autonomously adapts itself in response to changes in a dynamic and unpredictable environment. With the increasing need for developing self-adaptive systems, providing a model and an implementation platform to facilitate integration of adaptation mechanisms into the systems and assuring their safety and quality is crucial. In this paper, we target Track-based Traffic Control Systems (TTCSs) in which the traffic flows through pre-specified sub-tracks and is coordinated by a traffic controller. We introduce a coordinated actor model to design self-adaptive TTCSs and provide a general...
ReCA: An efficient reconfigurable cache architecture for storage systems with online workload characterization, Article IEEE Transactions on Parallel and Distributed Systems ; Volume 29, Issue 7 , 2018 , Pages 1605-1620 ; 10459219 (ISSN) ; Ebrahimi, S ; Asadi, H ; Sharif University of Technology
IEEE Computer Society 2018
In recent years, Solid-State Drives (SSDs) have gained tremendous attention in computing and storage systems due to significant performance improvement over Hard Disk Drives (HDDs). The cost per capacity of SSDs, however, prevents them from entirely replacing HDDs in such systems. One approach to effectively take advantage of SSDs is to use them as a caching layer to store performance critical data blocks in order to reduce the number of accesses to HDD-based disk subsystem. Due to characteristics of Flash-based SSDs such as limited write endurance and long latency on write operations, employing caching algorithms at the Operating System (OS) level necessitates to take such characteristics...
Article Turkish Journal of Electrical Engineering and Computer Sciences ; Volume 26, Issue 3 , 2018 , Pages 1403-1416 ; 13000632 (ISSN) ; Manzuri Shalmani, M. T ; Hemmatyar, A. M. A ; Sharif University of Technology
Turkiye Klinikleri Journal of Medical Sciences 2018
Hardware Trojans are one of the serious threats with detrimental, irreparable effects on the functionality, security, and performance of digital integrated circuits. It is difficult to detect Trojans because of their diversity in size and performance. While the majority of current methods focus on Trojan detection during chip testing, run-time techniques can be employed to gain unique advantages. This paper proposes a method based on the online scalable detection technique, which eliminates the need for a reference chip. Involving local detectors, this technique assesses the variations in the logical values of each node to find out whether there are Trojans. This method excludes time and...
Article ACM Transactions on Architecture and Code Optimization ; Volume 16, Issue 3 , 2019 ; 15443566 (ISSN) ; Sarmadi, S. B ; Hessabi, S ; Sharif University of Technology
Association for Computing Machinery 2019
Many-cores execute a large number of diverse applications concurrently. Inter-Application interference can lead to a security threat as timing channel attack in the on-chip network. A non-interference communication in the shared on-chip network is a dominant necessity for secure many-core platforms to leverage the concepts of the cloud and embedded system-on-chip. The current non-interference techniques are limited to static scheduling and need router modification at micro-Architecture level. Mapping of applications can effectively determine the interference among applications in on-chip network. In this work, we explore non-interference approaches through run-Time mapping at software and...
Article IEEE Transactions on Circuits and Systems for Video Technology ; Volume 30, Issue 7 , 2020 , Pages 2046-2056 ; Amini, A ; Marvasti, F ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc 2020
The matrix decomposing into a sum of low-rank and sparse components has found extensive applications in many areas including video surveillance, computer vision, and medical imaging. In this paper, we propose a new algorithm for recovery of low rank and sparse components of a given matrix. We have also proved the convergence of the proposed algorithm. The simulation results with synthetic and real signals such as image and video signals indicate that the proposed algorithm has a better performance with lower run-time than the conventional methods. © 1991-2012 IEEE
Article IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ; Volume 31, Issue 3 , 2012 , Pages 329-342 ; 02780070 (ISSN) ; Al Hashimi, B. M ; Eles, P ; Sharif University of Technology
Time-redundancy techniques are commonly used in real-time systems to achieve fault tolerance without incurring high energy overhead. However, reliability requirements of hard real-time systems that are used in safety-critical applications are so stringent that time-redundancy techniques are sometimes unable to achieve them. Standby sparing as a hardware-redundancy technique can be used to meet high reliability requirements of safety-critical applications. However, conventional standby-sparing techniques are not suitable for low-energy hard real-time systems as they either impose considerable energy overheads or are not proper for hard timing constraints. In this paper we provide a technique...