Best candidate routing algorithms integrated with minimum processing time and low blocking probability for modern parallel computing systems

Aadel M. Alatwi, Ahmed Nabih Zaki Rashed, Ahmed M. El-Eraki, Iraj Sadegh Amiri

Open source

DOI
10.11591/ijeecs.v19.i2.pp847-854
Published
2020-08-01
Container
Indonesian Journal of Electrical Engineering and Computer Science
Publisher
Institute of Advanced Engineering and Science
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.11591/ijeecs.v19.i2.pp847-854,
  title = {Best candidate routing algorithms integrated with minimum processing time and low blocking probability for modern parallel computing systems},
  author = {Aadel M. Alatwi and Ahmed Nabih Zaki Rashed and Ahmed M. El-Eraki and Iraj Sadegh Amiri},
  year = {2020},
  journal = {Indonesian Journal of Electrical Engineering and Computer Science},
  doi = {10.11591/ijeecs.v19.i2.pp847-854},
  url = {https://doi.org/10.11591/ijeecs.v19.i2.pp847-854}
}

RIS

TY  - JOUR
TI  - Best candidate routing algorithms integrated with minimum processing time and low blocking probability for modern parallel computing systems
AU  - Aadel M. Alatwi
AU  - Ahmed Nabih Zaki Rashed
AU  - Ahmed M. El-Eraki
AU  - Iraj Sadegh Amiri
PY  - 2020
JO  - Indonesian Journal of Electrical Engineering and Computer Science
DO  - 10.11591/ijeecs.v19.i2.pp847-854
UR  - https://doi.org/10.11591/ijeecs.v19.i2.pp847-854
ER  - 

APA

Alatwi, A. M., Rashed, A. N. Z., El-Eraki, A. M., & Amiri, I. S. (2020). Best candidate routing algorithms integrated with minimum processing time and low blocking probability for modern parallel computing systems. Indonesian Journal of Electrical Engineering and Computer Science. https://doi.org/10.11591/ijeecs.v19.i2.pp847-854

Source records