Mohammad Abdel-Majeed

Dr. Mohammad Abdel-Majeed

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
1 February 2013
Verified
Conference Paper
Closed access
Mohammad Abdel-MajeedMohammad Abdel-Majeed
Mohammad Abdel-Majeed
MAMurali Annavaram
Murali Annavaram
General purpose graphics processing units (GPGPUs) have the ability to execute hundreds of concurrent threads. To support massive parallelism GPGPUs provide a very large register file, even larger than a cache, to hold the state of each thread. As technology scales, the leakage power consumption of the SRAM cells is getting worse making the register file static power consumption a major concern. As the supply voltage scaling slows, dynamic power consumption of a register file is not reducing. These concerns are particularly acute in GPGPUs due to their large register file size. This paper presents two techniques to reduce the GPGPU register file power consumption. By exploiting the unique software execution model of GPGPUs, we propose a tri-modal register access control unit to reduce the leakage power. This unit first turns off any unallocated register, and places all allocated registers into drowsy state immediately after each access. The average inter-access distance to a register is 789 cycles in GPGPUs. Hence, aggressively moving a register into drowsy state immediately after each access results in 90% reduction in leakage power with negligible performance impact. To reduce dynamic power this paper proposes an active mask aware activity gating unit that avoids charging bit lines and wordlines of registers associated with all inactive threads within a warp. Due to insufficient parallelism and branch divergence warps have many inactive threads. Hence, registers associated with inactive threads can be identified precisely using the active mask. By combining the two techniques we show that the power consumption of the register file can be reduced by 69% on average.

1 June 2022 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
GAGheith Ali Abandah
Gheith Ali Abandah
MKMohammed Z. Khedher
Mohammed Z. Khedher
Mohammad Abdel-MajeedMohammad Abdel-Majeed
Mohammad Abdel-Majeed
HMHamdi M Mansour
Hamdi M Mansour
SHSalma F Hulliel
Salma F Hulliel
LBLara M Bisharat
Lara M Bisharat

1 February 2017
Verified
Conference Paper
Closed access
Mohammad Abdel-MajeedMohammad Abdel-Majeed
Mohammad Abdel-Majeed
ASAlireza Shafaei
Alireza Shafaei
HJHyeran Jeon
Hyeran Jeon
MPMassoud Pedram
Massoud Pedram
MAMurali Annavaram
Murali Annavaram
GPU adoption for general purpose computing has been accelerating. To support a large number of concurrently active threads, GPUs are provisioned with a very large register file (RF). The RF power consumption is a critical concern. One option to reduce the power consumption dramatically is to use near-threshold voltage(NTV) to operate the RF. However, operating MOSFET devices at NTV is fraught with stability and reliability concerns. The adoption of FinFET devices in chip industry is providing a promising path to operate the RF at NTV while satisfactorily tackling the stability and reliability concerns. However, the fundamental problem of NTV operation, namely slow access latency, remains. To tackle this challenge in this paper we propose to build a partitioned RF using FinFET technology. The partitioned RF design exploits our observation that applications exhibit strong preference to utilize a small subset of their registers. One way to exploit this behavior is to cache the RF content as has been proposed in recent works. However, caching leads to unnecessary area overheads since a fraction of the RF must be replicated. Furthermore, we show that caching is not efficient as we increase the number of issued instructions per cycle, which is the expected trend in GPU designs. The proposed partitioned RF splits the registers into two partitions: the highly accessed registers are stored in a small RF that switches between high and low power modes. We use the FinFET's back gate control to provide low overhead switching between the two power modes. The remaining registers are stored in a large RF partition that always operates at NTV. The assignment of the registers to the two partitions will be based on statistics collected by the a hybrid profiling technique that combines the compiler based profiling and the pilot warp profiling technique proposed in this paper. The partitioned FinFET RF is able to save 39% and 54% of the RF leakage and the dynamic energy, respectively, and suffers less than 2% performance overhead.

15 September 2020 in Informatica
Verified
Journal Article
Open access
PDF file
RSRamzi Saifan
Ramzi Saifan
KSKhaled Sharif
Khaled Sharif
MAMohammad Abu-Ghazaleh
Mohammad Abu-Ghazaleh
Mohammad Abdel-MajeedMohammad Abdel-Majeed
Mohammad Abdel-Majeed
Recent advances in the machine learning field have given rise to efficient ensemble methods that accurately forecast time-series. In this paper, we use the Quantopian algorithmic stock market trading simulator to assess ensemble methods performance in daily prediction and trading. The ensemble methods used are Extremely Randomized Trees, Random Forest, and Gradient Boosting. All methods are trained using multiple technical indicators and automatic stock selection is used. Simulation results show significant returns relative to the benchmark and large values of alpha are produced from all methods. These results strengthen the role of ensemble method based machine learning in automated stock market trading.

20 April 2018 in Computer Applications in Engineering Education
Verified
Journal Article
Closed access
PDF file
RSRamzi Saifan
Ramzi Saifan
WDWaleed Dweik
Waleed Dweik
Mohammad Abdel-MajeedMohammad Abdel-Majeed
Mohammad Abdel-Majeed

1 June 2015
Verified
Conference Paper
Closed access
Mohammad Abdel-MajeedMohammad Abdel-Majeed
Mohammad Abdel-Majeed
WDWaleed Dweik
Waleed Dweik
HJHyeran Jeon
Hyeran Jeon
MAMurali Annavaram
Murali Annavaram
Graphics processing units (GPUs) are now the dominant computing fabric within many supercomputers. As such many mission critical applications run on GPUs, which demand stringent reliability and computational correctness guarantees from GPUs. Prior approaches to GPU reliability have tackled solely either error detection, or error correction assuming error detection is already present. In this paper we present Warped Redundant Execution (Warped-RE), a unified framework that is capable of detecting and then correcting transient and nontransient errors in the GPU execution lanes. Our work exploits two critical properties of applications running on GPUs. First, we observe that neighboring execution lanes in GPUs may operate on the same values. Thus when neighboring lanes execute the same instruction using the same values then these lanes provide inherent DMR (dual modular redundancy) or even inherent TMR (triple modular redundancy) opportunities. The second property we exploit is that due to insufficient parallelism or due to branch divergence, applications do not fully utilize all the available execution lanes. In this case it is possible to force DMR or TMR on unused execution lanes, when inherent redundancy is insufficient. During error-free execution, Warped-RE uses a combination of inherent and forced DMR to guarantee that every thread computation within every warp instruction will be verified. When an error is detected in a warp instruction, the instruction is re-executed in TMR mode in order to correct the error and identify execution lanes with potential non-transient errors. Our evaluations show 8.4% and 29% average performance overhead during the DMR and TMR operation modes, respectively. Compared to traditional DMR and TMR, Warped-RE reduces the power overhead by 42% and 40%, respectively.