PERFORMANCE OF A SPECULATIVE TRANSMISSION SCHEME FOR SCHEDULING LATENCY REDUCTION-NE

[amol_cool]

PERFORMANCE OF A SPECULATIVE TRANSMISSION SCHEME FOR SCHEDULING LATENCY REDUCTION-NETWORKING

Abstract: This work was motivated by the need to achieve low latency in an input centrally-scheduled cell switch for high-performance computing applications; specifically, the aim is to reduce the latency incurred between issuance of a request and arrival of the corresponding grant. We introduce a speculative transmission scheme to significantly reduce the average latency by allowing cells to proceed without waiting for a grant. It operates in conjunction with any centralized matching algorithm to achieve a high maximum utilization. An analytical model is presented to investigate the efficiency of the speculative transmission scheme employed in a non-blocking N*NR input-queued crossbar switch with receivers R per output. The results demonstrate that the can be almost entirely eliminated for loads up to 50%. Our simulations confirm the analytical results.
Technology to use:JAVA