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

Fahed Jubair

dblp:13/10955 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
4since 2021 · last 2024
0000-0002-9311-807XORCID · verified

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Systems, architecture and hardware · 1Computer networks · 1

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
Parallel and multicore computing · 87% High-performance computing · 13%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization › parallelization
automatic parallelization
0.112012
A hybrid approach of OpenMP for clusters · PPoPP 2012
Parallel and multicore computing › parallel programming models › directive-based programming
OpenMP
0.112012
A hybrid approach of OpenMP for clusters · PPoPP 2012
Parallel and multicore computing
parallel programming models
0.112012
A hybrid approach of OpenMP for clusters · PPoPP 2012
High-performance computing
cluster computing
0.012012
A hybrid approach of OpenMP for clusters · PPoPP 2012

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

runtime data flow analysis · 0.3data affinity optimization · 0.3
YearPublicationVenuePosition
2024 GoFish: A customizable open-source chess engine in Go
Fahed Jubair, Ahmad Abu Salem, Yazan Assaf, Khalid A. Darabkh
Expert Syst. Appl.1
2024 Deep learning model for early prediction of material fracture in tensile testing
Fahed Jubair, Ahmad Alhamayel, Raed Aljaiose, Khalid A. Darabkh
Neural Comput. Appl.1
2024 A revolutionary RPL-based IoT routing protocol for monitoring building structural health in smart city domain utilizing equilibrium optimizer algorithm
Khalid A. Darabkh, Hebah H. AlAdwan, Muna Al-Akhras, Fahed Jubair, Samah Rahamneh
Soft Comput.4
2022 An innovative RPL objective function for broad range of IoT domains utilizing fuzzy logic and multiple metrics
Khalid A. Darabkh, Muna Al-Akhras, Alá F. Khalifeh, Iyad F. Jafar, Fahed Jubair
Expert Syst. Appl.5
2018 Sensing Device Management for History-Based Spectrum Sharing in Cognitive Radio Networks
abstract
A novel approach to managing a fully distributed cognitive radio network (CRN) is presented. This approach builds on the concept of history‐based spectrum access, in which cognitive base stations (BSs) independently estimate the system load using history records and adaptively swap their occupied spectrum bands to ensure allocation fairness and high overall throughput. In addition, cognitive BSs monitor primary user (PU) behavior in order to avoid interfering with active PUs. In this work, we address two issues that afflict history‐based access: the first is the high cost of the sensing devices needed at each cognitive BS to be able to independently draw conclusions about the status of the CRN and the second is the unreliability inherent in practical sensing hardware (such as energy detectors). Simulation results show that the proposed technique manages to solve the two abovementioned issues without any noticeable drop in performance and without sacrificing the distributed nature of the protocol.
Mohammed Hawa, Fahed Jubair, Raed T. Al-Zubi, Ramzi R. Saifan
Wirel. Commun. Mob. Comput.2
2012 A hybrid approach of OpenMP for clusters
abstract
We present the first fully automated compiler-runtime system that successfully translates and executes OpenMP shared-address-space programs on laboratory-size clusters, for the complete set of regular, repetitive applications in the NAS Parallel Benchmarks. We introduce a hybrid compiler-runtime translation scheme. Compared to previous work, this scheme features a new runtime data flow analysis and new compiler techniques for improving data affinity and reducing communication costs. We present and discuss the performance of our translated programs, and compare them with the performance of the MPI, HPF and UPC versions of the benchmarks. The results show that our translated programs achieve 75% of the hand-coded MPI programs, on average.
Okwan Kwon, Fahed Jubair, Rudolf Eigenmann, Samuel P. Midkiff
PPoPP2