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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | EJournal Article |
| Published: |
Institute of Advanced Engineering and Science,
2020-08-01.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| 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. |
|---|---|
| Item Description: | https://ijeecs.iaescore.com/index.php/IJEECS/article/view/21694 |