A (2.954 + ε)n oblivious routing algorithm on 2D meshes

Authors:
Kazuo Iwama;Eiji Miyano
Affiliations:
School of Informatics, Kyoto University, Kyoto 606-8501, Japan;Kyushu Institute of Design, Fukuoka 815-8540, Japan
Venue:
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Year:
2000

Citing 13
Cited 2

Routing and sorting on mesh-connected arrays (extended abstract)

VLSI Algorithms and Architectures
Average case analysis of greedy routing algorithms on arrays

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Oblivious routing with limited buffer capacity

Journal of Computer and System Sciences
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Constant queue routing on a mesh

Journal of Parallel and Distributed Computing
Simple path selection for optimal routing on processor arrays

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Minimal adaptive routing on the mesh with bounded queue size

Journal of Parallel and Distributed Computing
Deterministic permutation routing on meshes

Journal of Algorithms
Parallel algorithms for regular architectures: meshes and pyramids

Parallel algorithms for regular architectures: meshes and pyramids
Packet routing in fixed-connection networks: a survey

Journal of Parallel and Distributed Computing
An O( N ) oblivious routing algorithm for 2-D meshes of constant queue-size

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Derandomizing algorithms for routing and sorting on meshes

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms

Fast, minimal and oblivious routing algorithms on the mesh with bounded queues

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Optimal oblivious routing on d-dimensional meshes

Theoretical Computer Science - Foundations of software science and computation structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a deterministic, oblivious, permutation-routing algorithm on the n × n mesh of constant queue-size. It runs in (2.954+&egr;)n steps for any &egr; 0. Previously, an O(n)-time algorithm was known but with no nontrivial upper bounds on the constant factor.