An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements

Makedon, F; Symvonis, A

dc.contributor.author	Makedon, F	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T01:41:35Z
dc.date.available	2014-03-01T01:41:35Z
dc.date.issued	1993	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/23539
dc.subject	Exact Algorithm	en
dc.subject	Packet Routing	en
dc.subject	Permutation Routing	en
dc.title	An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/71.210810	en
heal.identifier.secondary	http://dx.doi.org/10.1109/71.210810	en
heal.publicationDate	1993	en
heal.abstract	Even though exact algorithms exist for permutation routing of n2messages on a n \Theta nmesh of processors which require constant size queues, the constants are very large andthe algorithms very complicated to implement. In this paper, we present a novel, simpleheuristic for the above problem. It uses constant and very small size queues ( size=2 ). Forall the simulations we	en
heal.journalName	IEEE Transactions on Parallel and Distributed Systems	en
dc.identifier.doi	10.1109/71.210810	en