default search action
Ismail Ababneh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j22]Saad Bani-Mohammad, Ismail Ababneh:
On rapid transitioning to online learning under COVID-19: challenges and solutions at al al-bayt university. Int. Arab J. Inf. Technol. 20(3A): 446-460 (2023) - [j21]Abeer Shdefat, Saad Bani-Mohammad, Ismail Ababneh:
On Allocation Algorithms for Manycore Systems With Network on Chip. Int. J. Grid High Perform. Comput. 15(1): 1-22 (2023) - [c13]Saad Bani-Mohammad, Ismail Ababneh:
A Study on Transitioning From Campus Learning to Online Learning During The Covid-19 Pandemic From The Perspective of Faculty Members in Jordanian Private Universities. ACIT 2023: 1-16 - 2022
- [j20]Areen Al Abass, Saad Bani-Mohammad, Ismail Ababneh:
Performance Evaluation of Contiguous and Noncontiguous Processor Allocation Based on Common Communication Patterns for 2D Mesh Interconnection Network. Int. J. Cloud Appl. Comput. 12(1): 1-21 (2022) - [c12]Saad Bani-Mohammad, Ismail Ababneh:
Challenges and Strategies for Online Learning: A Rapid Evaluation of Transitioning from Face-to-Face Learning to Online Learning during the COVID-19 Pandemic from the Perspective of Al al-Bayt University Faculty Members. ACIT 2022: 1-8
2010 – 2019
- 2018
- [j19]Saad Bani-Mohammad, Ismail Ababneh:
Improving system performance in non-contiguous processor allocation for mesh interconnection networks. Simul. Model. Pract. Theory 80: 19-31 (2018) - 2015
- [j18]Ismail Ababneh, Saad Bani-Mohammad, Motasem Al Smadi:
Corner-Boundary Processor Allocation for 3D Mesh-Connected Multicomputers. Int. J. Cloud Appl. Comput. 5(1): 1-13 (2015) - [j17]Saad Bani-Mohammad, Ismail M. Ababneh, Mohammad Yassen:
A New Compacting Non-Contiguous Processor Allocation Algorithm for 2D Mesh Multicomputers. J. Inf. Technol. Res. 8(4): 57-75 (2015) - 2013
- [j16]Sanaa A. Alwidian, Ismail M. Ababneh, Muneer O. Bani Yassein:
Neighborhood-Based Route Discovery Protocols for Mobile Ad Hoc Networks. Int. J. Mob. Comput. Multim. Commun. 5(3): 68-87 (2013) - [j15]Saad Bani-Mohammad, Ismail Ababneh:
On the performance of non-contiguous allocation for common communication patterns in 2D mesh-connected multicomputers. Simul. Model. Pract. Theory 32: 155-165 (2013) - [c11]Fayez Khazalah, Ismail Ababneh, Zaki Malik:
Forwarding Group Maintenance of ODMRP in MANETs. ANT/SEIT 2013: 289-296 - 2012
- [j14]Raed Almomani, Ismail Ababneh:
Communication overhead in non-contiguous processor allocation policies for 3D mesh-connected multicomputers. Int. Arab J. Inf. Technol. 9(2): 133-141 (2012) - [j13]Ismail Ababneh, Saad Bani-Mohammad, Wail Mardini, Hilal Alawneh, Mohammad Hamed:
The effect of communication on the performance of allocation request shape changes in 2D mesh-connected multicomputers. Int. J. Parallel Emergent Distributed Syst. 27(5): 409-433 (2012) - [c10]Amal Alhosban, Ismail Ababneh, Zaki Malik:
GFDA: Route Discovery Algorithms for On-demand Mobile Ad Hoc Routing Protocols. ANT/MobiWIS 2012: 70-77 - 2011
- [j12]Saad Bani-Mohammad, Ismail Ababneh, Mazen Hamdan:
Performance evaluation of noncontiguous allocation algorithms for 2D mesh interconnection networks. J. Syst. Softw. 84(12): 2156-2170 (2011) - [j11]Ismail Ababneh, Saad Bani-Mohammad:
A new window-based job scheduling scheme for 2D mesh multicomputers. Simul. Model. Pract. Theory 19(1): 482-493 (2011) - 2010
- [j10]Ismail Ababneh, Saad Bani-Mohammad, Mohamed Ould-Khaoua:
All shapes contiguous submesh allocation for 2D mesh multicomputers. Int. J. Parallel Emergent Distributed Syst. 25(5): 411-421 (2010) - [j9]Ismail Ababneh, Saad Bani-Mohammad, Mohamed Ould-Khaoua:
An adaptive job scheduling scheme for mesh-connected multicomputers. J. Supercomput. 53(1): 5-25 (2010) - [c9]Ismail Ababneh, Wail Mardini, Hilal Alawneh, Mohammad Hamed, Saad Bani-Mohammad:
Effects of Allocation Request Shape Changes on Performance in 2D Mesh-Connected Multicomputers. CIT 2010: 123-130 - [c8]Saad Bani-Mohammad, Ismail Ababneh, Mazen Hamdan:
Comparative Performance Evaluation of Non-Contiguous Allocation Algorithms in 2D Mesh-Connected Multicomputers. CIT 2010: 2933-2939
2000 – 2009
- 2009
- [j8]Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ababneh, Lewis M. Mackenzie:
Comparative evaluation of contiguous allocation strategies on 3D mesh multicomputers. J. Syst. Softw. 82(2): 307-318 (2009) - [j7]Ismail Ababneh:
On submesh allocation for 2D mesh multicomputers using the free-list approach: Global placement schemes. Perform. Evaluation 66(2): 105-120 (2009) - [c7]Saad Bani-Mohammad, Ismail Ababneh, Mohamed Ould-Khaoua:
A Comparative Study of Real Workload Traces and Synthetic Workload Models for Non-contiguous Allocation in 2D Meshes. ScalCom-EmbeddedCom 2009: 633-639 - 2008
- [j6]Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ababneh:
Greedy-Available Non-Contiguous Processor Allocation Strategy and Job Scheduling for 2D Mesh Connected Multicomputers. Int. J. Comput. Their Appl. 15(4): 283-296 (2008) - [j5]Ismail Ababneh:
Availability-based noncontiguous processor allocation policies for 2D mesh-connected multicomputers. J. Syst. Softw. 81(7): 1081-1092 (2008) - [c6]Saad Bani-Mohammad, Mohamed Ould-Khaoua, Lewis M. Mackenzie, Ismail Ababneh, John D. Ferguson:
The effect of real workloads and stochastic workloads on the performance of allocation and scheduling algorithms in 2D mesh multicomputers. IPDPS 2008: 1-8 - 2007
- [j4]Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ababneh:
An efficient non-contiguous processor allocation strategy for 2D mesh connected multicomputers. Inf. Sci. 177(14): 2867-2883 (2007) - [j3]Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ababneh:
A new processor allocation strategy with a high degree of contiguity in mesh-connected multicomputers. Simul. Model. Pract. Theory 15(4): 465-480 (2007) - [c5]Ismail Ababneh:
A Performance Comparison of Contiguous Allocation Placement Schemes for 2D Mesh-connected Multicomputers. AICCSA 2007: 926-933 - [c4]Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ababneh, Lewis M. Mackenzie:
An Efficient Processor Allocation Strategy that Maintains a High Degree of Contiguity among Processors in 2D Mesh Connected Multicomputers. AICCSA 2007: 934-941 - [c3]Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ababneh, Lewis M. Mackenzie:
Comparative evaluation of the non-contiguous processor allocation strategies based on a real workload and a stochastic workload on multicomputers. ICPADS 2007: 1-7 - [c2]Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ababneh, Lewis M. Mackenzie:
A Performance Comparison of the Contiguous Allocation Strategies in 3D Mesh Connected Multicomputers. ISPA 2007: 645-656 - 2006
- [j2]Ismail Ababneh:
An efficient free-list submesh allocation scheme for two-dimensional mesh-connected multicomputers. J. Syst. Softw. 79(8): 1168-1179 (2006) - [c1]Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ababneh, Lewis M. Mackenzie:
Non-contiguous Processor Allocation Strategy for 2D Mesh Connected Multicomputers based on Sub-meshes Available for Allocation. ICPADS (2) 2006: 41-48 - 2004
- [j1]Ahmed Yassin Al-Dubai, Mohamed Ould-Khaoua, K. El-Zayyat, Ismail Ababneh, S. Al-Dobai:
Towards scalable collective communication for multicomputer interconnection networks. Inf. Sci. 163(4): 293-306 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint