Wormhole Routing: need in Parallel Computers

Abstract

To produce low communication latency and reduced buffer requirements, wormhole routing has been used in most new generation parallel computers. it has been a powerful shift technique where its communication latency is distance insensitive. On the alternative hand, dead finish rejection is that the foremost vital issue in hollow networks. If dead finish handling is not thought-about, wormhole routers can't be used in multiprocessors. Also, performance and fault-tolerancy unit of measurement a pair of dominant issues at intervals the design of interconnection networks of large-scale data processor architectures. throughout this paper, alone a fast review of hollow routing issues mentioned can be created amongst the exhaustive written works.