Ali Shatnawi

Prof. Ali Shatnawi

orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
1 January 2018 in Neurocomputing
Verified
Journal Article
Closed access
MAMostafa Ali
Mostafa Ali
NANoor H. Awad
Noor H. Awad
PSPonnuthurai N. Suganthan
Ponnuthurai N. Suganthan
ASAli Shatnawi
Ali Shatnawi
RRRobert G. Reynolds
Robert G. Reynolds

1 October 2013 in Computers & Operations Research
Verified
Journal Article
Closed access
ABAhmad Al Badawi
Ahmad Al Badawi
ASAli Shatnawi
Ali Shatnawi

1 February 2019 in Future Generation Computer Systems
Verified
Journal Article
Closed access
Khalil Ahmad YousefKhalil Ahmad Yousef
Khalil Ahmad Yousef
ASAli Shatnawi
Ali Shatnawi
MLMohammad Latayfeh
Mohammad Latayfeh

26 October 2018 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
ASAli Shatnawi
Ali Shatnawi
YAYathrip AlZahouri
Yathrip AlZahouri
MSMohammed A. Shehab
Mohammed A. Shehab
YJYaser Jararweh
Yaser Jararweh
MAMahmoud Al-Ayyoub
Mahmoud Al-Ayyoub

5 April 2022 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
RARaffi Al-Qurran
Raffi Al-Qurran
MAMahmoud Al-Ayyoub
Mahmoud Al-Ayyoub
ASAli Shatnawi
Ali Shatnawi

20 January 2003
Verified
Conference Paper
Closed access
ASAli Shatnawi
Ali Shatnawi
MAM.O. Ahmad
M.O. Ahmad
MSM.N.S. Swamy
M.N.S. Swamy
A novel technique to obtain a rate- and processor-optimal schedule for a fully-static data flow graph (DFG) onto a multiprocessor system is presented. In this technique, Floyd-Warshall's shortest path algorithm is used to evaluate the relative firing times of the nodes of the given DFG. Despite its implementation simplicity, the proposed technique has a lower time complexity than all the previously proposed techniques. The technique is tested on various benchmark problems to demonstrate its optimal performance.