Mark Sagi

Mark Sagi

Auto-generated profile, based on publicly available information

Mark Sagi

Technical University of Munich, Munich, Germany

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 August 2019 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
MRMartin Rapp
Martin Rapp
MSMark Sagi
Mark Sagi
APAnuj Pathania
Anuj Pathania
AHAndreas Herkersdorf
Andreas Herkersdorf
JHJorg Henkel
Jorg Henkel
Two factors primarily affect the performance of multi-threaded tasks on many-core processors with logically-shared and physically-distributed Last-Level Cache (LLC): the LLC latencies of threads running on different cores and the per-core power budgets that aim to guarantee thermally safe operation. Two knobs affect these factors: First, the mapping of threads to cores affects both the LLC latencies and the power budgets. Second, dynamic power budgeting refines the power budgets during task execution. A mapping that spatially distributes threads across the many-core increases the power budgets, but unfortunately also increases the LLC latencies. Contrarily, mapping all threads near the center of the many-core minimizes the LLC latencies, but unfortunately also decreases the power budgets. Consequently, both metrics cannot be simultaneously optimal, which leads to a Pareto-optimization for task mapping that has formerly not been exploited. Dynamic power budgeting reallocates the power budgets according to the tasks' execution phases. This results in a dynamically changing non-uniform power budget, which further increases the performance. We are the first to present a run-time algorithm PCGov combining task-agnostic task mapping and task-aware dynamic power budgeting for many-cores with shared distributed LLC. PCGov yields up to 21 percent lower response time and 13 percent lower energy consumption compared to the state-of-the-art, with a low overhead of less than 0.5 percent.

1 November 2020 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
MSMark Sagi
Mark Sagi
NDNguyen Anh Vu Doan
Nguyen Anh Vu Doan
MRMartin Rapp
Martin Rapp
TWThomas Wild
Thomas Wild
JHJorg Henkel
Jorg Henkel
AHAndreas Herkersdorf
Andreas Herkersdorf

29 March 2022 in International Journal of Parallel Programming
Verified
Journal Article
Open access
PDF file
MSMark Sagi
Mark Sagi
NDNguyen Anh Vu Doan
Nguyen Anh Vu Doan
NFNael Fasfous
Nael Fasfous
TWThomas Wild
Thomas Wild
AHAndreas Herkersdorf
Andreas Herkersdorf
To minimize power consumption while maximizing performance, today’s multicore processors rely on fine-grained run-time dynamic power information—both in the time domain, e.g. $$\mu $$ μ s to ms, and space domain, e.g. core-level. The state-of-the-art for deriving such power information is mainly based on predetermined power models which use linear modeling techniques to determine the core-performance/core-power relationship. However, with multicore processors becoming ever more complex, linear modeling techniques cannot capture all possible core-performance related power states anymore. Although artificial neural networks (ANN) have been proposed for coarse-grained power modeling of servers with time resolutions in the range of seconds, few works have yet investigated fine-grained ANN-based power modeling. In this paper, we explore feed-forward neural networks (FFNNs) for core-level power modeling with estimation rates in the range of 10 kHz. To achieve a high estimation accuracy while minimizing run-time overhead, we propose a multi-objective-optimization of the neural architecture using NSGA-II with the FFNNs being trained on performance counter and power data from a complex-out-of-order processor architecture. We show that relative power estimation error for the highest accuracy FFNN decreases on average by 7.5% compared to a state-of-the-art linear power modeling approach and decreases by 5.5% compared to a multivariate polynomial regression model. For the FFNNs optimized for both accuracy and overhead, the average error decreases between 4.1% and 6.7% compared to linear modeling while offering significantly lower overhead compared to the highest accuracy FFNN. Furthermore, we propose a micro-controller-based and an accelerator-based implementation for run-time inference of the power modeling FFNN and show that the area overhead is negligible.

7 October 2020
Verified
Book Chapter
Closed access
PDF file
MSMark Sagi
Mark Sagi
NDNguyen Anh Vu Doan
Nguyen Anh Vu Doan
NFNael Fasfous
Nael Fasfous
TWThomas Wild
Thomas Wild
AHAndreas Herkersdorf
Andreas Herkersdorf

16 September 2016 in it - Information Technology
Verified
Journal Article
Closed access
PDF file
SPSantiago Pagani
Santiago Pagani
LBLars Bauer
Lars Bauer
QCQingqing Chen
Qingqing Chen
EGElisabeth Glocker
Elisabeth Glocker
FHFrank Hannig
Frank Hannig
JHJörg Henkel
Jörg Henkel
This paper presents an integrated and coordinated cross-layer sensing and optimization flow for distributed dark silicon management for tiled heterogeneous manycores under a critical temperature constraint. We target some of the key challenges in dark silicon for manycores, such as: directly focusing on power density/temperature instead of considering simple per-chip power constraints, considering tiled heterogeneous architectures with different types of cores and accelerators, handling the large volumes of raw sensor information, and maintaining scalability. Our solution is separated into three abstraction layers: a sensing layer (involving hardware monitors and pre-processing), a dark silicon layer (that derives thermally-safe mappings and voltage/frequency settings), and an agent layer (used for selecting the parallelism of applications and thread-to-core mapping based on alternatives/constraints from the dark silicon layer).