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

This study has clarified the best candidate routing algorithms integrated with minimum processing times and low blocking probabilities for modern parallel computing systems. Different methods were employed, such as the fast window method (FWM), fast bitwise window method (FBWM), and fast improved wi...

Full description

Saved in:
Bibliographic Details
Published inIndonesian Journal of Electrical Engineering and Computer Science Vol. 19; no. 2; p. 847
Main Authors M. Alatwi, Aadel, Zaki Rashed, Ahmed Nabih, El-Eraki, Ahmed M., Sadegh Amiri, Iraj
Format Journal Article
LanguageEnglish
Published 01.08.2020
Online AccessGet full text
ISSN2502-4752
2502-4760
DOI10.11591/ijeecs.v19.i2.pp847-854

Cover

More Information
Summary:This study has clarified the best candidate routing algorithms integrated with minimum processing times and low blocking probabilities for modern parallel computing systems. Different methods were employed, such as the fast window method (FWM), fast bitwise window method (FBWM), and fast improved window method (FIWM), to upgrade the processing time and reduce the network delay time. In addition, different algorithms were studied such as the fast window ascending, the fast window descending, the fast window sequential algorithm, and the fast window sequential down algorithms; these were studied to show the numerical results of the networks’ blocking probabilities, processing times, and delay times.
ISSN:2502-4752
2502-4760
DOI:10.11591/ijeecs.v19.i2.pp847-854