Sadia Moriam

dblp:176/1190 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 6 · 3 first-authorComputer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Hardware accelerators and domain-specific architectures · 77% Interconnection networks and networks-on-chip · 16% Memory systems · 7%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 4 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures
database accelerator
0.212016
An MPSoC for energy-efficient database query processing · DAC 2016
Hardware accelerators and domain-specific architectures › query processing
energy-efficient query processing
0.212016
An MPSoC for energy-efficient database query processing · DAC 2016
Physical-layer communications
MIMO
0.112017
A Heterogeneous SDR MPSoC in 28 nm CMOS for Low-Latency Wireless Applications · DAC 2017
Memory systems
processing-in-memory
0.112016
An MPSoC for energy-efficient database query processing · DAC 2016

Methods — techniques the papers use, named apart from their topics

heterogeneous MPSoC design · 0.6dynamic data flow mapping · 0.6runtime task scheduling · 0.2instruction set extension · 0.2dynamic voltage and frequency scaling · 0.2
YearPublicationVenuePosition
2019 Lightweight Authenticated Encryption for Network-on-Chip Communications
abstract
In recent years, Network-on-Chip (NoC) has gained increasing popularity as a promising solution for the challenging interconnection problem in multi-processor systems-on-chip (MPSoCs). However, the interest of adversaries to compromise such systems grew accordingly, mandating the integration of security measures into NoC designs.
Julian Harttung, Elke Franz 0001, Sadia Moriam, Paul Walther
ACM Great Lakes Symposium on VLSI3
2018 Protecting Communication in Many-Core Systems against Active Attackers
abstract
The advent of hardware Trojans is posing an increasing threat on complex integrated circuits. Network-on-Chip, the established communication infrastructure for many core systems-on-chip, are growing in complexity. Integration of third-party components, which are increasingly becoming valuable targets, exposes the surface for attacks through the injection of hardware Trojans. In this paper, we address active attacks on NoCs, and focus on the integrity of transmitted data. Basically, we use network coding for the transmission of data in order to increase efficiency and robustness.
Sadia Moriam, Elke Franz 0001, Paul Walther, Akash Kumar 0001, Thorsten Strufe, Gerhard P. Fettweis
ACM Great Lakes Symposium on VLSI1
2017 A Heterogeneous SDR MPSoC in 28 nm CMOS for Low-Latency Wireless Applications
abstract
Current and future applications impose high demands on software-defined radio (SDR) platforms in terms of latency, reliability, and flexibility. This paper presents a heterogeneous SDR MPSoC with a hexagonal network-on-chip to address these issues. It features four data processing modules and a baseband processing engine for iterative multiple-input multiple-output (MIMO) receiving. Integrated memory controllers enable dynamic data flow mapping and application isolation. In a 4 x 4 MIMO application scenario, the MPSoC achieves a throughput of 232 Mbit/s with a latency of 20 μs while consuming 414 mW. It outperforms state-of-the-art platforms in terms of throughput by a factor of 4.
Sebastian Haas, Tobias Seifert, Benedikt Noethen, Stefan Scholze, Sebastian Höppner, Andreas Dixius, Esther P. Adeva, Thomas R. Augustin, Friedrich Pauls, Sadia Moriam, Mattis Hasler, Erik Fischer, Yong Chen 0014, Emil Matús, Georg Ellguth, Stephan Hartmann 0002, Stefan Schiefer, Love Cederstroem, Dennis Walter, Stephan Henker, Stefan Hänzsche, Johannes Uhlig, Holger Eisenreich, Stefan Weithoffer, Norbert Wehn, René Schüffny, Christian Mayr 0001, Gerhard P. Fettweis
DAC10
2017 Reliability assessment of fault tolerant routing algorithms in networks-on-chip: An analytic approach
abstract
Rapid scaling of transistor gate sizes has significantly increased the density of on-chip integrations and paved the way for many-core systems-on-chip with highly improved performances. The design of the interconnection network of these complex systems is a critical one and the network-on-chip is now the accepted efficient interconnect for such large core arrays. An unfortunate adverse effect of technology scaling is the increased susceptibility to failures resulting in failing links and routers in the network-on-chip. To keep the network connected, efficient fault adaptive routing algorithms are necessary to route around faults. To design and evaluate the fault resiliency of such adaptive routing algorithms, fast, accurate and flexible analytic models are required, especially in large networks for which simulations are extremely time costly. In this paper, we present an analytic approach to evaluate the reliability of adaptive routing algorithms based on algebraic manipulations of the channel dependency matrix. It allows also to evaluate the number of alternate paths between source-destination pairs, in the presence of any number of permanent faults in the network. The analytic model is general and can be adapted to evaluate network reliability for any network topology and with any adaptive routing algorithm based on the turn model. We present cycle-accurate simulations to compare the accuracy of the model for the 2-D mesh and the hexagonal networks. The model is able to estimate the network fault resilience with an accuracy of about 1% and more than 70 times faster than the cycle accurate simulation.
Sadia Moriam, Gerhard P. Fettweis
DATE1
2016 An MPSoC for energy-efficient database query processing
abstract
This paper presents a heterogeneous database hardware accelerator MPSoC manufactured in 28 nm SLP CMOS. The 18 mm2 chip integrates a runtime task scheduling unit for energy-efficient query processing and hierarchical power management supported by an ultra-fast dynamic voltage and frequency scaling. Four processing elements, connected by a star-mesh network-on-chip, are accelerated by an instruction set extension tailored to fundamental data-intensive applications. We evaluate the MPSoC with typical database benchmarks focusing on scans and bitmap operations. When the processing elements operate on data stored in local memories, the chip consumes 250 mW and shows a 96x energy efficiency improvement compared to state-of-the-art platforms.
Sebastian Haas, Oliver Arnold, Benedikt Noethen, Stefan Scholze, Georg Ellguth, Andreas Dixius, Sebastian Höppner, Stefan Schiefer, Stephan Hartmann 0002, Stephan Henker, Thomas Hocker, Jörg Schreiter, Holger Eisenreich, Jens-Uwe Schluessler, Dennis Walter, Tobias Seifert, Friedrich Pauls, Mattis Hasler, Yong Chen 0014, Hermann Hensel, Sadia Moriam, Emil Matús, Christian Mayr 0001, René Schüffny, Gerhard P. Fettweis
DAC21
2016 Fault Tolerant Deadlock-Free Adaptive Routing Algorithms for Hexagonal Networks-on-Chip
abstract
Technology scaling has allowed the integration of a large number of cores on a single chip, which significantly improves the speed of on-chip processing. Network-on-chip is the interconnection network which provides efficient and flexible communication between cores in such multi-processor systems-on-chip. However, the performance enhancements of technology scaling come at the cost of reliability as on-chip components particularly the network-on-chip become increasingly prone to faults. Redundancy is the basic approach to fault tolerance and in this paper we investigate the hexagonal on-chip network topology with redundant diagonal inter-router links, having approximately 1.5 times the number of links as the mesh topology. To evaluate the fault tolerance of the hexagonal network with wormhole-switched routing, we present deadlock-free fault tolerant routing algorithms obtained by applying the turn model and without the use of costly virtual channels. To circumvent the problem of finding the right selection of turns to prevent deadlock, we propose an approach based on the transitive closure of the channel dependency matrix. The results indicate that the hexagonal NoC with the proposed adaptive routing algorithms significantly improves NoC resilience by being able to tolerate two router faults, while the mesh NoC can tolerate only one router fault. Moreover, the proposed approach is general and can be adopted for developing adaptive routing algorithms for any regular network topology.
Sadia Moriam, Gerhard P. Fettweis
DSD1
2015 Resilient and efficient communication in many-core systems using network coding
abstract
Due to technology scaling, the number of processor cores on a chip constantly increases. Already today, we reach the domain of so called many-core systems-on-chip. However, this advance comes at the cost of reliability, which especially affects the communication performance of the underlying network-on-chip. Today's resiliency concepts for network-on-chip like automatic repeat request with retransmission are not feasible anymore and lead to long latencies and high network load. In this paper, we propose an on-chip transmission concept based on random linear network coding to provide high resiliency and an efficient communication in many-core processors at the same time. The concept offers a flexible and efficient computable coding scheme, which is well suited for on-chip communication and allows to exploit the path diversity of large networks. First, we use a flit-level cycle-accurate simulation model to investigate the performance potential of the proposed transmission scheme on a network-on-chip with 64 cores. Second, we propose an analytic model for random linear network coding in network-on-chip with retransmission, which is able to provide a very accurate performance estimation close to the cycle-accurate simulation. Finally, we apply the analytic model to investigate the performance potential on the large-scale, assuming a processor with 1024 cores.
Sadia Moriam, Yexin Yan, Erik Fischer, Elke Franz 0001, Gerhard P. Fettweis
IPCCC1