Muhammad Abdullah Hanif

Mr. Muhammad Abdullah Hanif


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
23 April 2022 in Journal of Intelligent & Robotic Systems
Verified
Journal Article
Closed access
PDF file
KSKhadija Shaheen
Khadija Shaheen
MHMuhammad Abdullah Hanif
Muhammad Abdullah Hanif
OHOsman Hasan
Osman Hasan
DSDR SHAFIQUE
DR SHAFIQUE

5 March 2025 in ACM Computing Surveys
Verified
Journal Article
Open access
VLVasileios Leon
Vasileios Leon
MHMuhammad Abdullah Hanif
Muhammad Abdullah Hanif
GAGiorgos Armeniakos
Giorgos Armeniakos
XJXun Jiao
Xun Jiao
DSDR SHAFIQUE
DR SHAFIQUE
DSDimitrios Soudris
Dimitrios Soudris
The rapid growth of demanding applications in domains applying multimedia processing and machine learning has marked a new era for edge and cloud computing. These applications involve massive data and compute-intensive tasks, and thus, typical computing paradigms in embedded systems and data centers are stressed to meet the worldwide demand for high performance. Concurrently, over the last 15 years, the semiconductor industry has established power efficiency as a first-class design concern. As a result, the community of computing systems is forced to find alternative design approaches to facilitate high-performance and power-efficient computing. Among the examined solutions, Approximate Computing has attracted an ever-increasing interest, which has resulted in novel approximation techniques for all the layers of the traditional computing stack. More specifically, during the last decade, a plethora of approximation techniques in software (programs, frameworks, compilers, runtimes, languages), hardware (circuits, accelerators), and architectures (processors, memories) have been proposed in the literature. The current article is Part I of a comprehensive survey on Approximate Computing. It reviews its motivation, terminology, and principles, as well as it classifies the state-of-the-art software & hardware approximation techniques, presents their technical details, and reports a comparative quantitative analysis.

29 March 2025
Verified
Book Chapter
Closed access
PDF file
KZKamila Zaman
Kamila Zaman
TATasnim Ahmed
Tasnim Ahmed
MHMuhammad Abdullah Hanif
Muhammad Abdullah Hanif
Alberto MarchisioAlberto Marchisio
Alberto Marchisio
DSDR SHAFIQUE
DR SHAFIQUE

23 December 2019 in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
Verified
Journal Article
Closed access
MHMuhammad Abdullah Hanif
Muhammad Abdullah Hanif
DSDR SHAFIQUE
DR SHAFIQUE
Deep neural networks (DNNs) have proliferated in most of the application domains that involve data processing, predictive analysis and knowledge inference. Alongside the need for developing highly performance-efficient DNN accelerators, there is an utmost need to improve the yield of the manufacturing process in order to reduce the per unit cost of the DNN accelerators. To this end, we present ‘SalvageDNN’, a methodology to enable reliable execution of DNNs on the hardware accelerators with permanent faults (typically due to imperfect manufacturing processes). It employs a fault-aware mapping of different parts of a given DNN on the hardware accelerator (subjected to faults) by leveraging the saliency of the DNN parameters and the fault map of the underlying processing hardware. We also present novel modifications in a systolic array design to further improve the yield of the accelerators while ensuring reliable DNN execution using ‘SalvageDNN’ and negligible overheads in terms of area, power/energy and performance. This article is part of the theme issue ‘Harmonizing energy-autonomous computing and intelligence’.

1 April 2021 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
RPRachmad Vidya Wicaksana Putra
Rachmad Vidya Wicaksana Putra
MHMuhammad Abdullah Hanif
Muhammad Abdullah Hanif
DSDR SHAFIQUE
DR SHAFIQUE
Enabling high energy efficiency is crucial for embedded implementations of deep learning. Several studies have shown that the DRAM-based off-chip memory accesses are one of the most energy-consuming operations in deep neural network (DNN) accelerators and, thereby, limit the designs from achieving efficiency gains at the full potential. DRAM access energy varies depending upon the number of accesses required and the energy consumed per-access. Therefore, searching for a solution toward the minimum DRAM access energy is an important optimization problem. Toward this, we propose the ROMANet methodology that aims at reducing the number of memory accesses, by searching for the appropriate data partitioning and scheduling for each layer of a network using a design space exploration, based on the knowledge of the available on-chip memory and the data reuse factors. Moreover, ROMANet also targets decreasing the number of DRAM row buffer conflicts and misses by exploiting the DRAM multibank burst feature to improve the energy-per-access. Besides providing the energy benefits, our proposed DRAM data mapping also results in an increased effective DRAM throughput, which is useful for latency-constraint scenarios. Our experimental results show that the ROMANet saves DRAM access energy by 12% for the AlexNet, 36% for the VGG-16, 46% for the MobileNet, and 45% for the SqueezeNet while improving the DRAM throughput by 10% on average across different networks compared to the state of the art, i.e., bus-width aware (BWA) technique.

7 September 2020 in IEEE Access
Verified
Journal Article
Open access
PAPaniti Achararit
Paniti Achararit
MHMuhammad Abdullah Hanif
Muhammad Abdullah Hanif
RPRachmad Vidya Wicaksana Putra
Rachmad Vidya Wicaksana Putra
DSDR SHAFIQUE
DR SHAFIQUE
YHYuko Hara-Azumi
Yuko Hara-Azumi
Designing resource-efficient deep neural networks (DNNs) is a challenging task due to the enormous diversity of applications as well as their time-consuming design, training, optimization, and evaluation cycles, especially the resource-constrained embedded systems. To address these challenges, we propose a novel DNN design framework called accuracy-and-performance-aware neural architecture search (APNAS), which can generate DNNs efficiently, as it does not require hardware devices or simulators while searching for optimized DNN model configurations that offer both inference accuracy and high execution performance. In addition, to accelerate the process of DNN generation, APNAS is built on a weight sharing and reinforcement learning-based exploration methodology, which is composed of a recurrent neural network controller as its core to generate sample DNN configurations. The reward in reinforcement learning is formulated as a configurable function to consider the sample DNNs’ accuracy and cycle count required to run on a target hardware architecture. To further expedite the DNN generation process, we devise analytical models for cycle count estimation instead of running millions of DNN configurations on real hardware. We demonstrate that these analytical models are highly accurate and provide cycle count estimates identical to those of a cycle-accurate hardware simulator. Experiments that involve quantitatively varying hardware constraints demonstrate that APNAS requires only 0.55 graphics processing unit (GPU) days on a single Nvidia GTX 1080Ti GPU to generate DNNs that offer an average of 53% fewer cycles with negligible accuracy degradation (on average 3%) for image classification compared to state-of-the-art techniques.