Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aniebiet Micheal Ezekiel

dblp:332/4858 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
0009-0001-4289-0342ORCID · verified

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

Systems, architecture and hardware · 3 · 1 first-author · 3 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

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
1 paper
Hardware accelerators and domain-specific architectures · 75% Embedded and real-time systems · 25%

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

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.912025
Superscalar Time-Triggered Versatile-Tensor Accelerator · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2025
Hardware accelerators and domain-specific architectures
tensor accelerator
0.912025
Superscalar Time-Triggered Versatile-Tensor Accelerator · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2025

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

pattern-based timing schedules · 0.9cycle-accurate simulation · 0.9DRAMSim2 · 0.9
YearPublicationVenuePosition
2025 Superscalar Time-Triggered Versatile-Tensor Accelerator
abstract
Integrating AI hardware accelerators into safety-critical real-time systems to speed up the inference execution of safety-critical AI applications demands rigorous assurance to prevent potentially catastrophic outcomes, especially in environments where timely and accurate results are crucial. Even in cases where AI models are potentially designed and constructed correctly using AI frameworks, the systems safety will also rely on the real-time behavior of the AI hardware accelerator. While AI hardware accelerators can achieve the necessary throughput, conventional accelerators such as the Versatile Tensor Accelerator (VTA) encounter significant challenges in predictability and reliability. These challenges stem from the variability in event-driven inference execution and insufficient timing control, posing considerable risks in safety-critical scenarios where delays in providing inference results can have severe consequences. To address this challenge, previous work introduced the Time-Triggered Versatile Tensor Accelerator (TT-VTA) to ensure timely execution of tensor operations. Nonetheless, the TTVTA exhibited a slightly longer average inference time of 53ms compared to the conventional VTAs 51ms, underscoring the ongoing need for optimization in this crucial domain to speed up the inference execution, while sustaining the deterministic and predictable behavior of the TT-VTA. This paper proposes a novel Superscalar Time-Triggered VTA (STT-VTA) architecture specifically designed to address the deficiencies of conventional VTAs and TT-VTAs. The STT-VTA architecture employs pattern-based timing schedules generated by an extended software simulator and an architecture configuration manager to analyze tensor operations within a given AI model and determine the required number of additional VTA modules for faster inference than a single (TT-)VTA setup. It integrates DRAMSim2 for memory instructions and a cycle-accurate simulator for non-memory instructions. Evaluation using various models demonstrates that the STT-VTA achieves identical classification accuracy as the conventional VTA and TT-VTA, while improving performance and reducing inference time by 20-41%. Moreover, it ensures deterministic temporal use of shared resources such as memories and memory-buses and precise timing control to avoid interference. These results contribute towards safety and reliability of AI systems deployed in a safety-critical environment
Yosab Bebawy, Aniebiet Micheal Ezekiel, Roman Obermaisser
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
2024 Enhancing Neural Network Predictability through Simulation-Based Analysis of Memory Accesses for Time-Triggered Tensor Acceleration
abstract
This paper introduces an innovative simulation-based analysis and optimizing technique for managing memory access in neural network deployment, specifically focusing on the Versatile Tensor Accelerator (VTA). Our work addresses critical issues and challenges in memory access involving inefficient resource utilization, resource contention, memory collisions, unpredictable memory access, and erratic behavior, which are detrimental to safety-critical applications. These challenges underscore the need to not only eliminate memory contention but also improve memory throughput and efficiently utilize memory access idle phases while ensuring deterministic execution. Our proposed techniques aim to enhance the safety and predictability of neural networks by offering a schedule guaranteeing timing while significantly improving memory access efficiency. Our approach strategically leverages idle zones for prefetching data, achieving 5% overall time savings in memory execution. Evaluated on the simulation testbench, this advancement paves the way for further hardware integration with a time-triggered controller, optimizing memory access across diverse neural network architectures. This advancement represents progress towards a safer, more predictable, and more efficient neural network memory access architecture for applications in safety-critical domains.
Aniebiet Micheal Ezekiel, Yosab Bebawy, Roman Obermaisser
CoDIT1
2024 Time-Triggered Inference on FPGAs
abstract
Safety-critical AI systems demand the utmost reliability to prevent catastrophic outcomes. However, conventional AI hardware accelerators, such as the Versatile Tensor Accelerator (VTA), suffer from limitations in predictability and reliability due to inherent variability in event-driven task execution and the lack of precise timing control. These limitations make them unsuitable for safety-critical applications where erroneous or untimely operations could lead to catastrophic consequences. This paper proposes a novel time-triggered VTA (TT-VTA) architecture specifically designed to address the shortcomings of conventional VTAs and enhance safety and reliability in safety-critical AI systems. The TT-VTA architecture utilizes pattern-based timing schedules which are generated by a software simulator that integrates DRAMSim2 to simulate memory-related instructions as well as by a cycle-accurate simulator to provide accurate cycle counts for non-memory-related instructions. A comparative evaluation using a ResNet18 classification model demonstrates that the TT-VTA achieves identical classification accuracy while maintaining deterministic resource utilization and enabling precise timing control. Our proposed TT-VTA architecture demonstrates significant promise for enhancing the safety and reliability of AI systems in safety-critical applications.
Yosab Bebawy, Michael Schmidt 0014, Hamidreza Ahmadian, Aniebiet Micheal Ezekiel, Roman Obermaisser
ETFA4
2023 Optimization of the Versatile Tensor Accelerator (VTA) Load Module in a Time-Triggered Memory Access
abstract
Embedded systems powered by artificial intelligence (AI) are widely employed in diverse domains. However, the lack of inherent predictability in existing AI accelerators poses significant challenges, especially in safety-critical applications where deterministic safety specifications are essential. Moreover, temporal unpredictability caused by memory access contention further hinders the suitability of current platforms for safety-critical tasks. To address these issues, we propose a time-triggered memory access approach for the versatile tensor accelerator (VTA) that provides temporal predictability guarantees for load data. Our research focuses on investigating the temporal predictability of Neural Network load input, weight, and operations. We introduce a time-triggered memory access mechanism that pre-fetches data from DDR memory ahead of the VTA load module request. Through extensive experimentation and analytical evaluations in the VTA runtime environment, we demonstrate the effectiveness of our time-triggered memory access concept. The results reveal an 8% performance improvement and reduced execution time while upholding strict safety specifications and predictability. These findings establish the feasibility of employing a time-triggered approach for runtime neural network prediction.
Aniebiet Micheal Ezekiel, Daniel Onwuchekwa, Roman Obermaisser
DSD1