EDBT 2026 Demo / reviewers in the wild / expert
Mohammed Moness
dblp:53/9428
· DBLP profile ↗
8ranked-venue papers
4as first author
2since 2021 · last 2022
0000-0002-8042-0253ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 2 first-authorComputer networks · 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
1 paper |
Distributed systems · 67% Processor architecture and microarchitecture · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Processor architecture and microarchitecture
chip multiprocessor |
0.5 | 1 | 2021 | An Optimized Weighted Average Makespan in Fault-Tolerant Heterogeneous MPSoCs · IEEE Trans. Parallel Distributed Syst. 2021 |
Distributed systems › fault tolerance › fault-tolerant real-time systems
fault-tolerant scheduling |
0.5 | 1 | 2021 | An Optimized Weighted Average Makespan in Fault-Tolerant Heterogeneous MPSoCs · IEEE Trans. Parallel Distributed Syst. 2021 |
Distributed systems › replication
task replication |
0.5 | 1 | 2021 | An Optimized Weighted Average Makespan in Fault-Tolerant Heterogeneous MPSoCs · IEEE Trans. Parallel Distributed Syst. 2021 |
Methods — techniques the papers use, named apart from their topics
simulated annealing · 0.5list scheduling · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Automated Design Error Debugging of Digital VLSI CircuitsabstractAbstract As the complexity and scope of VLSI designs continue to grow, fault detection processes in the pre-silicon stage have become crucial to guaranteeing reliability in IC design. Most fault detection algorithms can be solved by transforming them into a satisfiability (SAT) problem decipherable by SAT solvers. However, SAT solvers consume significant computational time, as a result of the search space explosion problem. This ever- increasing amount of data can be handled via machine learning techniques known as deep learning algorithms. In this paper, we propose a new approach utilizing deep learning for fault detection (FD) of combinational and sequential circuits in a type of stuck-at-faults. The goal of the proposed semi-supervised FD model is to avoid the search space explosion problem by taking advantage of unsupervised and supervised learning processes. First, the unsupervised learning process attempts to extract underlying concepts of data using Deep sparse autoencoder. Then, the supervised process tends to describe rules of classification that are applied to the reduced features for detecting different stuck-at faults within circuits. The FD model proposes good performance in terms of running time about 187 × compared to other FD algorithm based on SAT solvers. In addition, it is compared to common classical machine learning models such as Decision Tree (DT), Random Forest (RF) and Gradient Boosting (GB) classifiers, in terms of validation accuracy. The results show a maximum validation accuracy of the feature extraction process at 99.93%, using Deep sparse autoencoder for combinational circuits. For sequential circuits, stacked sparse autoencoder presents 99.95% as average validation accuracy. The fault detection process delivers around 99.6% maximum validation accuracy for combinational circuits from ISCAS’85 and 99.8% for sequential circuits from ISCAS’89 benchmarks. Moreover, the proposed FD model has achieved a running time of about 1.7x, compared to DT classifier and around 1.6x, compared to RF classifier and GB machine learning classifiers, in terms of validation accuracy in detecting faults occurred in eight different digital circuits. Furthermore, the proposed model outperforms other FD models, based on Radial Basis Function Network (RBFN), achieving 97.8% maximum validation accuracy. Mohammed Moness, Lamya Gaber, Aziza I. Hussein, Hanafy M. Ali |
J. Electron. Test. | 1 |
| 2021 | An Optimized Weighted Average Makespan in Fault-Tolerant Heterogeneous MPSoCsabstractThe multiprocessor system on chips (MPSoCs) are considered today the core of most modern systems. Most of the applications of these heterogeneous MPSoCs include critical systems and hence terms of fault tolerance and reliability have become essential. Task replication is a technique to carry out fault tolerance and can help for reducing the schedule length by increasing locality. It introduces an upper and lower bound for the makespan of each schedule while each task is replicated more than once. If a fault occurs during execution, the expected makespan will be some value between the upper bound and the lower bound based on when and where the fault has occurred. In this research a new performance parameter namely the weighted average makespan is introduced. It is calculated as the average of the lower and upper bounds of makespan using the probability of occurrence of each. Two scheduling algorithms are presented for fault tolerant scheduling based on directed acyclic graphs. These algorithms are the list scheduling algorithm and the optimizing of the weighted average makespan based on simulated annealing method. The simulation results show that the techniques can improve the schedule length and increase the system reliability without compromising the performance. Hassan A. Youness, Aly Omar, Mohammed Moness |
IEEE Trans. Parallel Distributed Syst. | 3 |
| 2020 | Real-Time Switched Model Predictive Control for a Cyber-Physical Wind Turbine EmulatorabstractThe high complexity and nonlinearity of wind turbine (WT) systems impose the utilization of rigorous control methods such as model predictive control (MPC). MPC algorithms are computationally intensive requiring investigation of real-time implementability and feasibility in addition to control performance metrics. In this article, a switched model predictive controller (SMPC) is developed, implemented, and investigated for control objectives performance and real-time metrics. This article has two main contributions. First, embedded real-time SMPC is developed using qpOASES as an embedded solver for the online optimal control problem. Second, a cyber-physical real-time emulator for variable-speed variable-pitch utility-scale WT is developed and implemented on an xPC target machine using a high-fidelity linear parameter-varying model. The SMPC is evaluated on the fatigue, aerodynamics, structures, and turbulence (FAST) design code and the real-time emulator. The analysis and investigation of results highlight the feasibility and capability of SMPC for handling control objectives of WT systems within real-time using short control periods. Mohammed Moness, Ahmed Mahmoud Moustafa |
IEEE Trans. Ind. Informatics | 1 |
| 2018 | A Real-Time Heterogeneous Emulator of a High-Fidelity Utility-Scale Variable-Speed Variable-Pitch Wind TurbineabstractWind energy has the highest development rates of renewables. The increasing complexity of wind turbine (WT) systems requires careful analysis and design with thorough testing and certification procedures. Hardware emulators contribute to safe and cost-effective assessment and testing of WT in research and industry. Most of the available emulators concentrate on emulating electrical subsystems with simplified mechanical models. In this paper, a real-time (RT) heterogeneous emulator that combines RT discrete-time step simulation and a high-fidelity linear parameter-varying model of a utility-scale WT system is proposed and implemented on a heterogeneous CPU/GPU platform. The RT emulator is built on an embedded NVIDIA Jetson TK1 board for a National Renewable Energy Laboratory 5-MW WT as a case study. The proposed emulator is capable of further integration of electrical models and control systems of WT. Mohammed Moness, Muhammad Osama 0003, Ahmed Mahmoud Moustafa |
IEEE Trans. Ind. Informatics | 1 |
| 2016 | A Survey of Cyber-Physical Advances and Challenges of Wind Energy Conversion Systems: Prospects for Internet of EnergyabstractWind energy has the biggest market share of renewable energy around the world. High growth and development rates of wind energy lead to a massive increase in complexity and scale of wind energy conversion systems (WECSs). Therefore, it is required to upgrade methods and strategies for design and implementation of WECS. Considering WECS as cyber-physical systems (CPSs) will enable wind energy for the Internet of Energy (IoE). IoE is a cloud network where power sources with embedded and distributed intelligence are interfaced to smart grid and mass of consumption devices like smart buildings, appliances, and electric vehicles. Research trends of CPS for energy applications are mainly focusing on smart grids and energy systems for demand-side management and smart buildings with less attention given to generation systems. This paper introduces potentials of cyber-physical (CP) integration of next-generation WECS. In addition, this paper surveys the advances and state-of-the-art technologies that enable WECS for IoE. Challenges and new requirements of future WECS as CPS like abstractions, networking, control, safety, security, sustainability, and social components are discussed. Mohammed Moness, Ahmed Mahmoud Moustafa |
IEEE Internet Things J. | 1 |
| 2015 | An Efficient Implementation of Ant Colony Optimization on GPU for the Satisfiability ProblemabstractThis paper focuses on solving the Boolean Satisfiability (SAT) problem using a parallel implementation of the Ant Colony Optimization (ACO) algorithm for execution on the Graphics Processing Unit (GPU) using NVIDIA CUDA (Compute Unified Device Architecture). We propose a new efficient parallel strategy for the ACO algorithm executed entirely on the CUDA architecture, and perform experiments to compare it with the best sequential version exists implemented on CPU with incomplete approaches. We show how SAT problem can benefit from the GPU solutions, leading to significant improvements in speed-up even though keeping the quality of the solution. Our results shows that the new parallel implementation executes up to 21x faster compared to its sequential counterpart. Hassan A. Youness, Aziza Ibraheim, Mohammed Moness, Muhammad Osama 0003 |
PDP | 3 |
| 2014 | MPSoCs and Multicore Microcontrollers for Embedded PID Control: A Detailed StudyabstractThis paper presents different multiprocessor implementations of the proportional-integral-derivative (PID) controller using two technologies: 1) field programmable gate array (FPGA)-based multiprocessor system-on-chip (MPSoC); and 2) multicore microcontrollers (MCUs). Techniques to implement a parallelized PID controller, a multi-PID controller, and a self-tuning PID controller are proposed. These techniques are verified using hardware (HW) in the loop (HIL) simulations. Then, the paper presents a detailed case study of an embedded real-time (RT) self-tuning PID controller for a 1-degree-of-freedom (1-DOF) aerodynamical system. This includes controller design, parameters tuning, and implementation using a multiprocessor system. Results proved the effectiveness of the proposed techniques to improve performance and functionality. It is shown that customizing HW and software (SW) within MPSoCs provides higher RT performance. Moreover, using multicore MCUs can reduce design time, implementation time, and cost, while keeping adequate performance. Therefore, it is possible to realize and implement complex RT embedded controllers that employ advanced control algorithms in rapid, effective, and cost-efficient fashion. Hassan A. Youness, Mohammed Moness, Mahmoud Khaled |
IEEE Trans. Ind. Informatics | 2 |
| 2010 | Efficient partitioning technique on multiple cores based on optimal scheduling and mapping algorithmabstractIn this paper, efficient hardware-software (HW-SW) partitioning technique based on high performance scheduling and mapping algorithms on multiple cores is presented. The scheduling and mapping algorithms produce the optimality of mapping tasks onto cores. The partitioning technique reduces the overall execution time and number of buses among the cores. The viability and potential of the proposed algorithms are demonstrated by extensive experimental results to conclude that the proposed algorithms are efficient scheme to obtain the optimality of scheduling, mapping and partitioning with hard and large task graph problems. Hassan A. Youness, Abdel-Moniem Wahdan, Mohammed Hassan, Ashraf Salem, Mohammed Moness, Keishi Sakanushi, Yoshinori Takeuchi, Masaharu Imai |
ISCAS | 5 |