This paper addresses the issue of how router complexity a ects the overall performance in deterministic and adaptive routing under virtual cut-through switching in k-ary n-cube ne...
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...