A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
type: Item
instance of: scholarly article
title: A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
zbMATH Open document ID: 0833.68058
DOI: 10.1007/BF01294128
author: Yanyan Li
published in: Algorithmica
publication date: 1996-03-18T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 803316
zbMATH Keywords: routing algorithm
zbMATH Keywords: packet-routing problem
zbMATH Keywords: queues
MaRDI profile type: Publication
cites work: Q4002466
cites work: Q4035691
cites work: Sorting on a mesh-connected parallel computer
full work available at URL: https://doi.org/10.1007/bf01294128
OpenAlex ID: W2027063844
Recommended article: An \(O(\sqrt N)\) oblivious routing algorithm for two-dimensional meshes of constant queue-size
Recommended article: Q4252322
Recommended article: An algorithm for sub-optimal routeing in series-parallel queueing networks
Recommended article: Optimal routeing in two-queue polling systems
Recommended article: Parameterized Algorithms for Queue Layouts
Recommended article: Two Parallel Queues with Dynamic Routing
Recommended article: Q4790568
Recommended article: A polynomial time algorithm for 2-layer channel routing problem
Recommended article: Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
description: scientific article; zbMATH DE number 803316