Ali A. El Moursy

Ali A. El Moursy

Auto-generated profile, based on publicly available information

Ali A. El Moursy

Department of Computer Engineering, College of Computing and Informatics, University of Sharjah, Sharjah, United Arab Emirates

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
27 August 2003
Verified
Conference Paper
Closed access
AEA. El-Moursy
A. El-Moursy
DAD.H. Albonesi
D.H. Albonesi
The performance and power optimization of dynamic superscalar microprocessors requires striking a careful balance between exploiting parallelism and hardware simplification. Hardware structures which are needlessly complex may exacerbate critical timing paths and dissipate extra power. One such structure requiring careful design is the issue queue. In a simultaneous multi-threading (SMT) processor it is particularly challenging to achieve issue queue simplification due to the increased utilization of the queue afforded by multi-threading. In this paper we propose new front-end policies that reduce the required integer and floating point issue queue sizes in SMT processors. We explore both general policies as well as those directed towards alleviating a particular cause of issue queue inefficiency. For the same level of performance, the most effective policies reduce the issue queue occupancy by 33% for an SMT processor with appropriately sized issue queue resources.

1 November 2017 in Egyptian Informatics Journal
Verified
Journal Article
Open access
AAAmany Abdelsamea
Amany Abdelsamea
AEAli A. El-Moursy
Ali A. El-Moursy
EHElsayed E. Hemayed
Elsayed E. Hemayed
HEHesham Eldeeb
Hesham Eldeeb
Cloud computing data centers are growing rapidly in both number and capacity to meet the increasing demands for highly-responsive computing and massive storage. Such data centers consume enormous amounts of electrical energy resulting in high operating costs and carbon dioxide emissions. The reason for this extremely high energy consumption is not just the quantity of computing resources and the power inefficiency of hardware, but rather lies in the inefficient usage of these resources. VM consolidation involves live migration of VMs hence the capability of transferring a VM between physical servers with a close to zero down time. It is an effective way to improve the utilization of resources and increase energy efficiency in cloud data centers. VM consolidation consists of host overload/underload detection, VM selection and VM placement. Most of the current VM consolidation approaches apply either heuristic-based techniques, such as static utilization thresholds, decision-making based on statistical analysis of historical data; or simply periodic adaptation of the VM allocation. Most of those algorithms rely on CPU utilization only for host overload detection. In this paper we propose using hybrid factors to enhance VM consolidation. Specifically we developed a multiple regression algorithm that uses CPU utilization, memory utilization and bandwidth utilization for host overload detection. The proposed algorithm, Multiple Regression Host Overload Detection (MRHOD), significantly reduces energy consumption while ensuring a high level of adherence to Service Level Agreements (SLA) since it gives a real indication of host utilization based on three parameters (CPU, Memory, Bandwidth) utilizations instead of one parameter only (CPU utilization). Through simulations we show that our approach reduces power consumption by 6 times compared to single factor algorithms using random workload. Also using PlanetLab workload traces we show that MRHOD improves the ESV metric by about 24% better than other single factor regression algorithms (LR and LRR). Also we developed Hybrid Local Regression Host Overload Detection algorithm (HLRHOD) that is based on local regression using hybrid factors. It outperforms the single factor algorithms

5 June 2023 in IEEE Access
Verified
Journal Article
Open access
KJkhalid javeed
khalid javeed
AEAli El-Moursy
Ali El-Moursy
DGDavid Gregg
David Gregg
Elliptic Curve Cryptography (ECC) based security protocols require much smaller key space which makes ECC the most suitable option for resource-constrained devices as compared to the other public key cryptography (PKC) schemes. This paper presents a highly efficient area-delay optimized ECC crypto processor over the general prime field (F p ). It is based on a new novel finite field multiplier (FFM) where several optimization techniques have been incorporated to reduce the latency and hardware resource consumption. The proposed FFM architecture is embedded with a finite field adder/subtractor (FFAS) unit which is utilized to perform FFAS operations instead of deploying a dedicated unit. The Common Z (Co-Z) coordinates with the Montgomery ladder algorithm are adopted to perform point multiplication, a core operation in all ECC-based crypto protocols. The work also proposes an efficient scheduling strategy to execute low-level finite field arithmetic primitives with minimum latency on the employed finite field arithmetic units. Due to these techniques, the proposed ECC processor is optimized for hardware resources, latency, and throughput. It is captured in Verilog-HDL, synthesized, and implemented on Virtex-7, Kintex-7, and Virtex-6 FPGA platforms using Xilinx Vivado and ISE Design Suite tools. On the Virtex-7 FPGA platform, it performs a 256-bit point multiplication operation in 0.7 m s, consumes just 6.2K slices, and delivers a throughput of 1428 operations per second. The implementation results show that it is a highly efficient design outperforming the state-of-the-art by providing a better area-delay product and higher efficiency. Therefore, it has the potential to be deployed in many applications where both latency and resource requirements are critical.

2 May 2022 in IEEE Access
Verified
Journal Article
Open access
SASam Ansari
Sam Ansari
KAKhawla A Alnajjar
Khawla A Alnajjar
MSMohamed Saad
Mohamed Saad
SASaeed Abdallah
Saeed Abdallah
AEAli A. El-Moursy
Ali A. El-Moursy
Recognition of the modulation scheme is the intermediate step between signal detection and demodulation of the received signal in communication networks. Automatic modulation recognition (AMR) plays a central role in many applications, especially in the military and security sectors. In general, several properties of the received signal are extracted and employed for AMR. Selecting the appropriate features has a significant impact on increasing the efficiency of AMR. In this paper, we implement and compare digital modulation recognition via multi-layer perceptrons (MLP), radial basis function (RBF), adaptive neuro-fuzzy inference system (ANFIS), decision tree (DT), and naïve Bayes (NB) algorithms. In addition, the optimal parameters of each model are obtained by utilizing a genetic algorithm (GA). A series of studies are conducted in this work in order to determine the efficiency of different algorithms in identifying modulated signals with commonly used digital modulations. Numerous computer simulations are performed in the presence of additive white Gaussian noise (AWGN) with a signal-to-noise ratio (SNR) ranging from -10 dB to 30 dB. The simulation results and comparisons with previous studies demonstrate that applying the proposed algorithms along with the selected features leads to a significant enhancement in the accuracy and speed of the automatic determination of the digital modulation types at low SNRs. In addition, the convergence rates of the models are enhanced.

13 June 2019 in Journal of Cloud Computing
Verified
Journal Article
Open access
PDF file
AEAli A. El-Moursy
Ali A. El-Moursy
AAAmany Abdelsamea
Amany Abdelsamea
RKRukshanda Kamran
Rukshanda Kamran
MSMohamed Saad
Mohamed Saad
The use of cloud computing data centers is growing rapidly to meet the tremendous increase in demand for high-performance computing (HPC), storage and networking resources for business and scientific applications. Virtual machine (VM) consolidation involves the live migration of VMs to run on fewer physical servers, and thus allowing more servers to be switched off or run on low-power mode, as to improve the energy consumption efficiency, operating cost and CO2 emission. A crucial step in VM consolidation is host overload detection, which attempts to predict whether or not a physical server will be oversubscribed with VMs. In contrast to the majority of previous work which use CPU utilization as the sole indicator for host overload, a recent study has proposed a multiple regression host overload detection algorithm, which takes multiple factors into consideration: CPU, memory and network BW utilization. This paper provides further improvement along two directions. First, we provide Multi-Dimensional Regression Host Utilization (MDRHU) algorithms that combine CPU, memory and network BW utilization via Euclidean Distance (MDRHU-ED) and absolute summation (MDRHU-AS), respectively. This leads to improved results in terms of energy consumption and service level agreement violation. Second, the study explicitly takes real-world HPC workloads into consideration. Our extensive simulation study further illustrates the superiority of our proposed algorithms over existing methods. In particular, as compared to the most recently proposed multiple regression algorithm that is based on Geometric Relation (GR), our proposed algorithms provide an improvement of at least 12% in energy consumption, and an improvement of at least 80% in a metric that combines energy consumption, service-level-violation, and number of VM migrations.

1 January 2006
Verified
Conference Paper
Closed access
AEA. El-Moursy
A. El-Moursy
RGR. Garg
R. Garg
DAD.H. Albonesi
D.H. Albonesi
SDS. Dwarkadas
S. Dwarkadas
The industry is rapidly moving towards the adoption of chip multi-processors (CMPs) of simultaneous multi-threaded (SMT) cores for general purpose systems. The most prominent use of such processors, at least in the near term, is as job servers running multiple independent threads on the different contexts of the various SMT cores. In such an environment, the co-scheduling of phases from different threads plays a significant role in the overall throughput. Less throughput is achieved when phases from different threads that conflict for particular hardware resources are scheduled together, compared with the situation where compatible phases are co-scheduled on the same SMT core. Achieving the latter requires precise per-phase hardware statistics that the scheduler can use to rapidly identify possible incompatibilities among phases of different threads, thereby avoiding the potentially high performance cost of inter-thread contention. In this paper, we devise phase co-scheduling policies for a dual-core CMP of dual-threaded SMT processors. We explore a number of approaches and find that the use of ready and in-flight instruction metrics permits effective co-scheduling of compatible phases among the four contexts. This approach significantly outperforms the worst static grouping of threads, and very closely matches the best static grouping, even outperforming it by as much as 7%