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!
|
Internet
Get fulltext3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |