A Note on Deflection Worm Routing on Meshes

Symvonis, A

dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T01:47:47Z
dc.date.available	2014-03-01T01:47:47Z
dc.date.issued	1999	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25322
dc.subject	Asymptotic Optimality	en
dc.subject	Deflection Routing	en
dc.subject	Packet Routing	en
dc.subject	Parallel Processing	en
dc.subject	Permutation Routing	en
dc.title	A Note on Deflection Worm Routing on Meshes	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0020-0190(99)00105-2	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0020-0190(99)00105-2	en
heal.publicationDate	1999	en
heal.abstract	We prove the existence of asymptotically optimal routing schedules for deflection worm routing of permutations on nn meshes. We achieve this by deriving an off-line algorithm which routes permutations in O.kn/ steps where k is the number of flits of a worm. The best to date off-line algorithms for deflection worm routing of permutations were due to Newman and Schuster	en
heal.journalName	Information Processing Letters	en
dc.identifier.doi	10.1016/S0020-0190(99)00105-2	en