Best candidate routing algorithms integrated with minimum processing time and low blocking probability for modern parallel computing systems
Sign Up to like & getrecommendations! Published in 2020 at "Indonesian Journal of Electrical Engineering and Computer Science"
DOI: 10.11591/ijeecs.v19.i2.pp847-854
Abstract: 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… read more here.
Keywords: time; best candidate; candidate routing; routing algorithms ... See more keywords