Hoang Anh Du Nguyen

Hoang Anh Du Nguyen

Auto-generated profile, based on publicly available information

Hoang Anh Du Nguyen

Delft University of Technology, Delft, The Netherlands

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
30 January 2020 in ACM Journal on Emerging Technologies in Computing Systems
Verified
Journal Article
Open access
HNHoang Anh Du Nguyen
Hoang Anh Du Nguyen
JYJintao Yu
Jintao Yu
MLMuath Abu Lebdeh
Muath Abu Lebdeh
MTMottaqiallah Taouil
Mottaqiallah Taouil
SHSaid Hamdioui
Said Hamdioui
FCFrancky Catthoor
Francky Catthoor
Technological and architectural improvements have been constantly required to sustain the demand of faster and cheaper computers. However, CMOS down-scaling is suffering from three technology walls: leakage wall, reliability wall, and cost wall. On top of that, a performance increase due to architectural improvements is also gradually saturating due to three well-known architecture walls: memory wall, power wall, and instruction-level parallelism (ILP) wall. Hence, a lot of research is focusing on proposing and developing new technologies and architectures. In this article, we present a comprehensive classification of memory-centric computing architectures; it is based on three metrics: computation location, level of parallelism, and used memory technology. The classification not only provides an overview of existing architectures with their pros and cons but also unifies the terminology that uniquely identifies these architectures and highlights the potential future architectures that can be further explored. Hence, it sets up a direction for future research in the field.

25 October 2022 in ACM Journal on Emerging Technologies in Computing Systems
Verified
Journal Article
Open access
AGAnteneh Gebregiorgis
Anteneh Gebregiorgis
HNHoang Anh Du Nguyen
Hoang Anh Du Nguyen
JYJintao Yu
Jintao Yu
RBRajendra Bishnoi
Rajendra Bishnoi
MTMottaqiallah Taouil
Mottaqiallah Taouil
SHSaid Hamdioui
Said Hamdioui
Faster and cheaper computers have been constantly demanding technological and architectural improvements. However, current technology is suffering from three technology walls: leakage wall, reliability wall, and cost wall. Meanwhile, existing architecture performance is also saturating due to three well-known architecture walls: memory wall, power wall, and instruction-level parallelism (ILP) wall. Hence, a lot of novel technologies and architectures have been introduced and developed intensively. Our previous work has presented a comprehensive classification and broad overview of memory-centric computer architectures. In this article, we aim to discuss the most important classes of memory-centric architectures thoroughly and evaluate their advantages and disadvantages. Moreover, for each class, the article provides a comprehensive survey on memory-centric architectures available in the literature.

3 May 2017 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
HNHoang Anh Du Nguyen
Hoang Anh Du Nguyen
LXLei Xie
Lei Xie
MTMottaqiallah Taouil
Mottaqiallah Taouil
RNRazvan Nane
Razvan Nane
SHSaid Hamdioui
Said Hamdioui
KBKoen Bertels
Koen Bertels
Today's computer architectures suffer from many challenges, such as the near end of CMOS downscaling, the memory/communication bottleneck, the power wall, and the programming complexity. As a consequence, these architectures become inefficient in solving big data problems or general data intensive applications. Computation-in-memory (CIM) is a novel architecture that tries to solve/alleviate the impact of these challenges using the same device (i.e., the memristor) to implement the processor and memory in the same physical crossbar. In order to analyze its feasibility in depth, this paper proposes two memristor implementations of a data intensive arithmetic application (i.e., parallel addition). To the best of our knowledge, this is the first paper that considers the cost of the entire architecture including both crossbar and its CMOS controller. The results show that CIM architecture in general and the CIM parallel adder in particular have a high scalability. CIM parallel adder achieves at least two orders of magnitude improvement in energy and area in comparison with a multicore-based parallel adder. Moreover, due to a wide variety of memristor design methods (such as Boolean logic), tradeoffs can be made between the area, delay, and energy consumption.

1 December 2016
Verified
Conference Paper
Closed access
LXLei Xie
Lei Xie
HNHoang Anh Du Nguyen
Hoang Anh Du Nguyen
MTMottaqiallah Taouil
Mottaqiallah Taouil
SHSaid Hamdioui
Said Hamdioui
KBKoen Bertels
Koen Bertels
MAMohammad Alfailakawi
Mohammad Alfailakawi
Many emerging technologies are under investigation to realize alternatives for future scalable electronics. Memristor is one of the most promising candidates due to memrsitor's non-volatility, high integration density, near-zero standby power consumption, etc. Memristors have been recently utilized in non-volatile memory, neuromorphic system, resistive computing architecture, and FPGA to name but a few. An FPGA typically consists of configurable logic blocks (CLBs), programmable interconnects, configuration, and block memories. Most of the recent work done was focused on using memristor to build FPGA interconnects and memories. This paper proposes two novel FPGA implementations that utilize memristor-based CLBs and their corresponding automatic design flow. To illustrate the potential of the proposed implementations, they are benchmarked using Toronto 20, and compared with the state-of-the-art in terms of area and delay. The experimental results show that both the area (up to 4.24×) and delay (up to 1.46×) of the novel FPGAs are very promising.

17 August 2023
Verified
Book Chapter
Closed access
PDF file
AGAnteneh Gebregiorgis
Anteneh Gebregiorgis
HNHoang Anh Du Nguyen
Hoang Anh Du Nguyen
MTMottaqiallah Taouil
Mottaqiallah Taouil
RBRajendra Bishnoi
Rajendra Bishnoi
FCFrancky CATTHOOR
Francky CATTHOOR
SHSaid Hamdioui
Said Hamdioui

26 February 2021 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
JYJintao Yu
Jintao Yu
MLMuath Abu Lebdeh
Muath Abu Lebdeh
HNHoang Anh Du Nguyen
Hoang Anh Du Nguyen
MTMottaqiallah Taouil
Mottaqiallah Taouil
SHSaid Hamdioui
Said Hamdioui
A novel type of hardware accelerators called automata processors (APs) have been proposed to accelerate finite-state automata. The bone structure of an AP is a hierarchical routing matrix that connects many memory arrays. With this structure, an AP can process an input symbol every clock cycle, and hence achieve much higher performance compared to conventional architectures. However, the design automation for the APs is not well researched. This paper proposes a fully automated tool named APmap for mapping the automata to APs that use a two-level routing matrix. APmap first partitions a large automaton into small graphs and then maps them. Multiple transformations are applied to the automaton by APmap to meet hardware constraints. The experiments on a standard benchmark suite show that our approach leads to around 19% less storage utilization compared to state of the art.