MJMagnus Jahre

Magnus Jahre

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Magnus Jahre has a total of 102 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Accounting for Workload Churn in Design Space Exploration

    by Joseph Rogers, Lieven Eeckhout, Taha Soliman, Magnus Jahre

    Hundreds of billions may be spent on computing infrastructure in the coming decades. At such scale, it is critical that hardware maintains acceptable performance over its lifetime. Attainable performance depends on the degree of workload churn, i.e., how much the workload changes over time, and the hardware’s ability to adapt. Overly specialized hardware may experience performance degradation when used on a workload with high churn. Conversely, overly general hardware may represent a missed opportunity when used on a workload with little to no churn. Hence, specialization should be tailored to churn expectations. This requires being able to clearly reason about the specifics of workload churn. Our work furnishes developers with an abstract yet powerful framework for reasoning about workload churn in both qualitative and quantitative contexts. Additionally, we present the Neoscope design space exploration tool, which provides insight into how various forms of churn affect the optimal design of System-on-Chip (SoC) architectures.

  • Open Access

    Chips Need DIP: Time-Proportional Per-Instruction Cycle Stacks at Dispatch

    by Silvio Campelo de Santana, Joseph Rogers, Lieven Eeckhout, Magnus Jahre


  • Open Access

    EStacker: Explaining Battery-Less IoT System Performance with Energy Stacks

    by Lukas Liedtke, Per Gunnar Kjeldsberg, Frank Alexander Kraemer, Magnus Jahre

    The number of Internet of Things (IoT) devices is increasing exponentially, and it is environmentally and economically unsustainable to power all these devices with batteries. The key alternative is energy harvesting, but battery-less IoT systems require extensive evaluation to demonstrate that they are sufficiently performant across the full range of expected operating conditions. IoT developers thus need an evaluation platform that (i) ensures that each evaluated application and configuration is exposed to exactly the same energy environment and events, and (ii) provides a detailed account of what the application spends the harvested energy on. We therefore developed the EStacker evaluation platform which (i) enables fair and repeatable evaluation, and (ii) generates energy stacks. Energy stacks break down the total energy consumption of an application across hardware components and application activities, thereby explaining what the application specifically uses energy on. We augment EStacker with the ST-SP optimization which, in our experiments, reduces evaluation time by 6.3× on average while retaining the temporal behavior of the battery-less IoT system (average throughput error of 7.7%) by proportionally scaling time and power. We demonstrate the utility of EStacker through two case studies. In the first case study, we use energy stack profiles to identify a performance problem that, once addressed, improves performance by 3.3×. The second case study focuses on ST-SP, and we use it to explore the design space required to dimension the harvester and energy storage sizes of a smart parking application in roughly one week (7.7 days). Without ST-SP, sweeping this design space would have taken well over one month (41.7 days).


  • Open Access

    Neoscope: How Resilient Is My SoC to Workload Churn?

    by Joseph Rogers, Lieven Eeckhout, Taha Soliman, Magnus Jahre


  • Open Access

    EStacker: Explaining Battery-Less IoT System Performance with Energy Stacks

    by Lukas Liedtke, Per Gunnar Kjeldsberg, Frank Alexander Kraemer, Magnus Jahre

    The number of Internet of Things (IoT) devices is increasing exponentially, and it is environmentally and economically unsustainable to power all these devices with batteries. The key alternative is energy harvesting, but battery-less IoT systems require extensive evaluation to demonstrate that they are sufficiently performant across the full range of expected operating conditions. IoT developers thus need an evaluation platform that (i) ensures that each evaluated application and configuration is exposed to exactly the same energy environment and events, and (ii) provides a detailed account of what the application spends the harvested energy on. We therefore developed the EStacker evaluation platform which (i) provides fair and repeatable evaluation, and (ii) generates energy stacks. Energy stacks break down the total energy consumption of an application across hardware components and application activities, thereby explaining what the application specifically uses energy on. We augment EStacker with the ST-SP optimization which, in our experiments, reduces evaluation time by 6.3x on average while retaining the temporal behavior of the battery-less IoT system (average throughput error of 7.7%) by proportionally scaling time and power. We demonstrate the utility of EStacker through two case studies. In the first case study, we use energy stack profiles to identify a performance problem that, once addressed, improves performance by 3.3x. The second case study focuses on ST-SP, and we use it to explore the design space required to dimension the harvester and energy storage sizes of a smart parking application in roughly one week (7.7 days). Without ST-SP, sweeping this design space would have taken well over one month (41.7 days).

  • Memory-Centric MCM-GPU Architecture

    by Hossein SeyyedAghaei, Mahmood Naderan-Tahan, Magnus Jahre, Lieven Eeckhout

    The demand for powerful GPUs continues to grow, driven by modern-day applications that require ever increasing computational power and memory bandwidth. Multi-Chip Module (MCM) GPUs provide the scalability potential by integrating GPU chiplets on an interposer substrate, however, they are hindered by their GPU-centric design, i.e., off-chip GPU bandwidth is statically (at design time) allocated to local versus remote memory accesses. This paper presents the memory-centric MCM-GPU architecture. By connecting the HBM stacks on the interposer, rather than the GPUs, and by connecting the GPUs to bridges on the interposer network, the full off-chip GPU bandwidth can be dynamically allocated to local and remote memory accesses. Preliminary results demonstrate the potential of the memory-centric architecture offering an average 1.36× (and up to 1.90×) performance improvement over a GPU-centric architecture.


  • Open Access

    FOMOsim: An open-source simulator for rigorous analysis of micromobility planning problems

    by Steffen J.S. Bakker, Mohamed Ben Ahmed, Asbjørn Djupdal, Lasse Natvig, Henrik Andersson, Magnus Jahre, Kjetil Fagerholt


  • Per-Instruction Cycle Stacks Through Time-Proportional Event Analysis

    by Björn Gottschall, Lieven Eeckhout, Magnus Jahre

    Understanding what applications spend time on and why is critical for effective performance optimization. Unfortunately, current state-of-the-art performance analysis tools are generally unable to provide this information. The fundamental reason is that they lack time-proportionality, i.e., in many cases, they do not attribute execution time to the instructions and performance events that the architecture is exposing the latency of. Time-proportional Event Analysis (TEA) creates Per-Instruction Cycle Stacks (PICS), which clearly and accurately explain what the application spends time on and why at the level of individual static instructions. TEA requires executing the application only once, is accurate (average error of 2.1%), and its hardware implementation incurs negligible runtime, power, and area overheads of 1.1%, 0.1%, and 249 bits per core, respectively.


  • Open Access

    CoFaaS: Automatic Transformation-based Consolidation of Serverless Functions

    by Truls Asheim, Magnus Jahre, Rakesh Kumar

    The attractive property of decoupling deployment decisions from application development has led to fast adoption of the Function-as-a-Service (FaaS) cloud computing model. FaaS applications are typically highly modular with each function having a specific purpose and well-defined interface as this enables code reuse, simplifies maintenance, improves testability, and provides language independence. To enable these attractive features, FaaS applications often use Remote Procedure Call (RPC) interfaces for inter-function communication --- which comes at the cost of orders of magnitude higher latency than native function calls. Prior works that alleviate this overhead are unattractive because they either require non-standard APIs, only support a single language, or rely on specialized languages or runtimes. Our key insight is that we can exploit the well-defined RPC interfaces to perform code transformations that alleviate inter-function communication overhead. We hence propose CoFaaS which leverages this insight to consolidate FaaS functions on top of a WebAssembly runtime and thereby avoid accessing the network layer when functions are deployed on the same compute node. Our evaluation shows that this strategy is highly effective and reports that CoFaaS reduces inter-function communication latency by up to 100× and application-level request round-trip time by up to 6×.


  • Open Access

    Characterizing Multi-Chip GPU Data Sharing

    by Shiqing Zhang, Mahmood Naderan-Tahan, Magnus Jahre, Lieven Eeckhout

    Multi-chip Graphics Processing Unit (GPU) systems are critical to scale performance beyond a single GPU chip for a wide variety of important emerging applications. A key challenge for multi-chip GPUs, though, is how to overcome the bandwidth gap between inter-chip and intra-chip communication. Accesses to shared data, i.e., data accessed by multiple chips, pose a major performance challenge as they incur remote memory accesses possibly congesting the inter-chip links and degrading overall system performance. This article characterizes the shared dataset in multi-chip GPUs in terms of (1) truly versus falsely shared data, (2) how the shared dataset scales with input size, (3) along which dimensions the shared dataset scales, and (4) how sensitive the shared dataset is with respect to the input’s characteristics, i.e., node degree and connectivity in graph workloads. We observe significant variety in scaling behavior across workloads: some workloads feature a shared dataset that scales linearly with input size, whereas others feature sublinear scaling (following a \(\sqrt {2}\) or \(\sqrt [3]{2}\) relationship). We further demonstrate how the shared dataset affects the optimum last-level cache organization (memory-side versus SM-side) in multi-chip GPUs, as well as optimum memory page allocation and thread scheduling policy. Sensitivity analyses demonstrate the insights across the broad design space.