Loading...
Search for: multicore-processors
0.01 seconds

    Dark silicon and the history of computing

    , Article Advances in Computers ; Volume 110 , 2018 , Pages 1-33 ; 00652458 (ISSN); 9780128153581 (ISBN) Lotfi Kamran, P ; Sarbazi Azad, H ; Sharif University of Technology
    Academic Press Inc  2018
    Abstract
    For many years, computer designers benefitted from Moore's law and Dennard scaling to significantly improve the speed of single-core processors. The failure of Dennard scaling pushed the computer industry toward homogenous multicore processors for the performance improvement to continue without significant increase in power consumption. Unfortunately, even homogeneous multicore processors cannot offer the level of energy efficiency required to operate all the cores at the same time in today's and especially tomorrow's technologies. As a result of lack of energy efficiency, not all the cores in a multicore processor can be functional at the same time. This phenomenon is referred to as dark... 

    Hypervisor-based Dependability in Multi-core Processors

    , M.Sc. Thesis Sharif University of Technology Ahmadisakha, Sahar (Author) ; Miremadi, Ghasem (Supervisor)
    Abstract
    When multicore processors entered in industry and parallel processing became popular, most challenges have started. Some of the challenges include binding and time sharing of an application with deadline meating constraint. Another important challenge is that, these kinds of processors become more susceptible to transient faults. Among solutions to the mentioned challenges, virtualization which was one of the well known ones becomes applicable again because of some of its advantages such as flexibility, high abstraction and low cost implementation. But this technology has some drawbacks too. It can make system complex and leads to memory and performance overhead. Constructing a reliable... 

    Computing the Shortest Path on Weighted Triangulated Irregular Networks by Multicore Algorithms

    , M.Sc. Thesis Sharif University of Technology Ghayour Baghbani, Farzaneh (Author) ; Ghodsi, Mohammad (Supervisor)
    Abstract
    Shortest path computation is one the fundamental problems in computer science. Triangulated Irregular Networks (TINs) are used in computational geometry to represent terrians and geometric surfaces. One of the most efficient mothods to solve the shortest path problem on a TIN is reducing it to shortest path problem on a graph. This reduction from continuous space to discrete space results in approximate solutions, but acceptable in real applications. In real applications we still encounter a large graph and using the simple Dijkstra algorithm consumes a lot of times. Memory shortage is another issue. Parallel processing could be a solution in this case. Multicore industry caused a... 

    A Multio Bjective Work Flow Scheduling Algorithmin Cloud Computing Environment

    , M.Sc. Thesis Sharif University of Technology Safavi, Soroush (Author) ; Qasemi Tari, Farhad (Supervisor) ; Hajji, Alireza (Supervisor)
    Abstract
    Multi core processors are becoming mainstream in the computation area, wide application of multi core processors in Engineering, Industrial purposes and scientific applications made them popular among users and Manufacturers, cloud computing is a very well known Concept which technically is a Multicore processing environment, most of Businesses, enterprises and engineering works nowadays are getting done by the help of cloud services, hence, to get the best of these multi core cloud computing systems, scheduling of the tasks on the cores and virtual machines(VMs) is necessary, which is the answer to two questions: each task must be assigned to which core(VM)? And What is the order of... 

    Evaluating Data Prefetching Methods and Proposing an Energy-aware First Level Cache for Cloud Workloads

    , Ph.D. Dissertation Sharif University of Technology Naderan Tahan, Mahmood (Author) ; Sarbazi Azad, Hamid (Supervisor)
    Abstract
    Data generation rate is far more than the technology scaling rate in a way that there will be a 40x gap between the data generation rate and the technology scaling rate in 2020. On one hand, unlike traditional HPC clusters, processors in data centers are not fully utilized and on the other hand, unlike traditional embedded processors, they are not idle most of the time. Therefore, energy consumption of such processors is an important issue; otherwise dealing with a huge volume of data will be problematic in the near future. In this dissertation, we will show that while first level data cache encounters high miss rate, traditional approaches such as data prefetching, which were efficient for... 

    A Task Assignment Method to Reduce Aging in Multi-core Processors

    , M.Sc. Thesis Sharif University of Technology Saadatmand, Faezeh Sadat (Author) ; Miremadi, Ghassem (Supervisor)
    Abstract
    Reducing the size of transistors has dramatically increased the impacts of NBTI, HCI, and EM phenomena in comparison with decade ago. These phenomena are able to have influence on properties of different parts of a chip to make it changed gradually; including threshold voltage of a transistor and electrical conductivity of interconnections. These changes are known as the aging of a transistors that diminish the performance and reliability of a chip. A common reason that plays a significant role in all these phenomena is temperature. The temperature becomes more important when the power density increases per unit area due to decreased size of transistors, which is a trend in multi-core... 

    Biological Network Alignment using Multi-Core Processors

    , M.Sc. Thesis Sharif University of Technology Tavakoli Neyshabur, Behnam (Author) ; Ghodsi, Mohammad (Supervisor)
    Abstract
    Interactions among proteins and resulted networks of such interactions have a central role in biology. Aligning these networks leads effective information such as finding conserved complexes and evolutionary relationships. The inofrmation provided by global alignment of these networks is more meaningful in comparison to local alignment. In the problem of global alignment, time complexity is one of the most important challenges. Today, multi-core processors are used to solve many time-consuming bioinformatics problems. In this thesis, after reviewing pervious approaches on global alignment of biological networks, we present two novel algorithm for this problem. The first one is designed for... 

    Adaptive prefetching using global history buffer in multicore processors

    , Article Journal of Supercomputing ; Vol. 68, issue. 3 , June , 2014 , p. 1302-1320 ; ISSN: 9208542 Naderan Tahan, M ; Sarbazi Azad, H ; Sharif University of Technology
    Abstract
    Data prefetching is a well-known technique to hide the memory latency in the last-level cache (LCC). Among many prefetching methods in recent years, the Global History Buffer (GHB) proves to be efficient in terms of cost and speedup. In this paper, we show that a fixed value for detecting patterns and prefetch degree makes GHB to (1) be conservative while there are more opportunities to create new addresses and (2) generate wrong addresses in the presence of constant strides. To resolve these problems, we separate the pattern length from the prefetching degree. The result is an aggressive prefetcher that can generate more addresses with a given pattern length. Furthermore with a variable... 

    LEXACT: low energy n-modular redundancy using approximate computing for real-time multicore processors

    , Article IEEE Transactions on Emerging Topics in Computing ; 2017 ; 21686750 (ISSN) Baharvand, F ; Ghassem Miremadi, S ; Sharif University of Technology
    Abstract
    Multicore processors are becoming popular in safety-critical applications. A series of these applications comprises of kernels where inexact computations may produce results within the boundary of sufficient quality though, for which the reliability should stay at the maximum possible level. Intrinsic core-level redundancy in multicore processors can be leveraged to achieve the desired reliability level in form of N-modular redundancy (NMR). While NMR provides a proactive means of reliability for critical systems, it has two main drawbacks: Increase in the area and energy consumption that are both limiting factors in the embedded systems. This paper presents a software-based method to... 

    A new Temporal Locality Method for Multi-Core Processor data Cache

    , M.Sc. Thesis Sharif University of Technology Banihashemi, Borzoo (Author) ; Jahangir, AmirHossein (Supervisor)
    Abstract
    By increasing speed gap between microprocessors and off-chip Last Level Cache, Optimization in Last Level Cache makes improvement in system performance. With development of new generation of multi-core processors and sharing LLC between these cores, the so called issue of Memory Wall has caused an incremental effect of LLC on system performance. There are three approaches to use this memory more efficiently:
    1. Increasing cache capacity
    2. Making cache hierarchical and adding different layers to hierarchy
    3. Improvement of replacement algorithms in cache memory
    The first approach has not been used in regard with limitation of technology and growth of access time due to... 

    Speculative Path Setup for Fast Data Delivery in Server Processors

    , M.Sc. Thesis Sharif University of Technology Bakhshalipour, Mohammad (Author) ; Sarbazi-Azad, Hamid (Supervisor) ; Lotfi-Kamran, Pejman (Co-Advisor)
    Abstract
    Server workloads operate on large volumes of data. As a result, processors executing these workloads encounter frequent L1-D misses. An L1-D miss causes a request packet to be sent to an LLC slice and a response packet to be sent back to the L1-D, which results in high overhead. While prior work targeted response packets, this work focuses on accelerating the request packets through a simple-yet-effective predictor. Upon the occurrence of an L1-D miss, the predictor identifies the LLC slice that will serve the next L1-D miss and a circuit will be set up for the upcoming miss request to accelerate its transmission. When the upcoming miss occurs, the resulting request can use the already... 

    A Control Theoretic Technique for Energy Management in Multi-core Embedded Systems

    , M.Sc. Thesis Sharif University of Technology Abbasnia Tehrani, Mojtaba (Author) ; Ejlali, Alireza (Supervisor)
    Abstract
    Since multi-core processors have become a primary trend in processor development, new scheduling algorithms are needed to minimize power consumption while achieving the desired timeliness guarantees for multi-core real-time embedded systems. Although various power/energy efficient scheduling algorithms have recently been proposed, existing studies may have degraded run-time performance in terms of power/energy efficiency and real-time guarantees when applied to real-time embedded systems with uncertain execution time. Moreover, these algorithms are only provided for a specific set of tasks, while many industrial applications with real-time demands are composed of mixed sets of tasks with a... 

    Improving Tasks Response Time in Hard Real-time Systems

    , Ph.D. Dissertation Sharif University of Technology Mohajjel Kafshdooz, Morteza (Author) ; Ejlali, Alireza (Supervisor)
    Abstract
    Time constraints are one of the most important concerns in embedded systems. In these systems, to ensure that the system operates correctly in all cases, the worst-case execution time of the system must be less than the deadline. Therefore, reducing worst-case execution time is one of the main design objectives in embedded systems. In addition to time constraints, many embedded systems have energy consumption constraints and hence reducing energy consumption is another main design objective in embedded systems. In this thesis we present two approaches to reduce worst-case execution time as well as an approach to reduce energy consumption while observing time constraints. Our first proposed... 

    Improving System-Level Thermal Management for Multi-Core Embedded Processors

    , M.Sc. Thesis Sharif University of Technology Valikhani, Hadi (Author) ; Ejlali, Alireza (Supervisor)
    Abstract
    Due to the technological improvement, decreasing transistor’s size and increasing demand for more processing abilities, designing and implementing multi core processors becomes a hot topic. One of the direct effects of decreasing the size is increasing the rate of power consumption in a unit area. Thus, the generated heat by the processor will be increased. Increasing the temperature could has undesired effects on the other features of the processor such as reliability, efciency, and failure rate. The problems that caused due to the high temperature in the multicore processors is not limited to the maximum temperature, but temperature fluctuations and variation between different parts of the... 

    A Dynamic Slack Management Technique for Low Energy Consumption in Real-time Multi-core Embedded Systems

    , M.Sc. Thesis Sharif University of Technology Fathi, Mohammad Hossein (Author) ; Ejlali, Alireza (Supervisor)
    Abstract
    Due to the increasing development of digital systems based on limited energy sources (i.e. battery), energy efficiency has become one of the most important concerns in the design of these systems. The use of multi-core architecture is an effective solution for the problem of reducing energy consumption. Hence using it in digital systems has become more common. In addition, enabling methods for reducing energy consumption on processor, helps in making energy more efficient. DVFS and DPM are the two major methods used for reducing dynamic and static energy consumption of processors. The using of multi-core architecture due to the higher chip density, results the static and dynamic energy... 

    Processor Allocation for Future Multi-Core Chip-Multiprocessor

    , M.Sc. Thesis Sharif University of Technology Agha Ali Akbari, Fatemeh (Author) ; Sarbazi Azad, Hamid (Supervisor)
    Abstract
    Since 2005, processor designers have increased core counts to exploit Moore’s Law scaling, rather than focusing on single-core performance. For decades, this approach provides desired performance for parallel and multithreaded workloads. On the other hand, rising of utilization wall limits the number of transistors that can be powered on in chip and result in a large region to be dark. So, same as before trend for performance scaling in future multi processor, an appropriate architecture is essential. There are some structures for this era which used specialization approach to cope with the limited power budget. Therefore, in this thesis, we propose a general-purpose platform that provides... 

    Dynamic shared SPM reuse for real-time multicore embedded systems

    , Article ACM Transactions on Architecture and Code Optimization ; Volume 12, Issue 2 , 2015 ; 15443566 (ISSN) Mohajjel Kafshdooz, M ; Ejlali, A ; Sharif University of Technology
    Association for Computing Machinery  2015
    Abstract
    Allocating the scratchpad memory (SPM) space to tasks is a challenging problem in real-time multicore embedded systems that use shared SPM. Proper SPM space allocation is important, as it considerably influences the application worst-case execution time (WCET), which is of great importance in real-time applications. To address this problem, in this article we present a dynamic SPM reuse scheme, where SPM space can be reused by other tasks during runtime without requiring any static SPM partitioning. Although the proposed scheme is applied dynamically at runtime, the required decision making is fairly complex and hence cannot be performed at runtime. We have developed techniques to perform... 

    ANMR: aging-aware adaptive N-modular redundancy for homogeneous multicore embedded processors

    , Article Journal of Parallel and Distributed Computing ; Volume 109 , 2017 , Pages 29-41 ; 07437315 (ISSN) Baharvand, F ; Miremadi, S. G ; Sharif University of Technology
    Abstract
    Advances in semiconductor technology have made integration of multiple processing cores into one single die a promising trend towards increasing processing performance, lowering power consumption, and increasing reliability for embedded systems. Multicore processors, due to their intrinsic redundancies, are good choices for critical embedded systems for which the reliability is a crucial component. In this paper, an aging-aware adaptive fault tolerance method for DVFS-enabled multicore processors is presented. The analytical results show 3 to 6 order of magnitude increase in reliability of the system without addition of cores or redundant software. By using an aging-aware approach, the... 

    LEXACT: low energy n-modular redundancy using approximate computing for real-time multicore processors

    , Article IEEE Transactions on Emerging Topics in Computing ; Volume 8, Issue 2 , 2020 , Pages 431-441 Baharvand, F ; Miremadi, S. G ; Sharif University of Technology
    IEEE Computer Society  2020
    Abstract
    Multicore processors are becoming popular in safety-critical applications. A series of these applications comprises of kernels where inexact computations may produce results within the boundary of sufficient quality though, for which the reliability should stay at the maximum possible level. Intrinsic core-level redundancy in multicore processors can be leveraged to achieve the desired reliability level in form of N-modular redundancy (NMR). While NMR provides a proactive means of reliability for critical systems, it has two main drawbacks: Increase in the area and energy consumption that are both limiting factors in the embedded systems. This paper presents a software-based method to...