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

Please wait, while we are loading the content...

Compact routing schemes

Routing without flow control

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

One-to-Many routing on the mesh

Simple on-line algorithms for the maximum disjoint paths problem

Stability and non-stability of the FIFO protocol

Competitve buffer management for shared-memory switches

Tradeoffs between knowledge and time of communication in geometric radio networks

Attack propagation in networks

Deterministic resource discovery in distributed networks

Latency effects on reachability in large-scale peer-to-peer networks

Towards a first vertical prototyping of an extremely fine-grained parallel programming approach

A cost effective architecture for vectorizable numerical and multimedia applications

Automatable verification of sequential consistency

Room synchronizations

A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems

Computational power of pipelined memory hierarchies

Optimal semi-oblique tiling

Finding large independent sets of hypergraphs in parallel

Columnsort lives! an efficient out-of-core sorting program

Efficient parallel exponentiation in GF(2n) using normal basis representations

Low-contention depth-first scheduling of parallel computations with write-once synchronization variables

Scheduling on hierarchical clusters using malleable tasks

Scheduling best-effort and real-time pipelined applications on time-shared clusters

Optimal prefetching and caching for parallel I/O sytems

Ordering disks for double erasure codes

Approximation algorithms for data management in networks

A data tracking scheme for general networks

New spectral bounds on k-partitioning of graphs

Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem

Towards practical deteministic write-all algorithms

Estimating simple functions on the union of data streams

Randomized k-set agreement

Periodic, random-fault-tolerant correction networks

D-CAT: A distributed channel allocation strategy based on a threshold scheme for cellular mobile networks

A note on cycle covering

Pursuit and evasion on a ring: An infinite hierarchy for parallel real—time systems

Scheduling tasks with small communication delays for clusters of processors

Library support for orthogonal processor groups

The push tree problem

Parallel controlled conspiracy number search

On tiling space-time mapped loop nests

A parallel block algorithm for exact triangularization of rectangular matrices

Eventually consistent failure detectors

Finding strongly connected components in parallel in particle transport sweeps

A work-optimal CGM algorithm for the LIS problem

Modeling weakly consistent memories with locks

The power of duality for prefetching and sorting with parallel disks

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

Content Provider	ACM Digital Library
Author	Litman, Ami Moran-Schein, Shiri
Abstract	This paper studies fast, deterministic, permutation routing algorithms with bounded queues on the n × n mesh. Our main result is an &Ogr;(n)-step, strongly-dimensional (and thus also source-oblivious and minimal) permutation routing algorithm. This algorithm works under a relaxed model in which nodes can freely send data to their neighbors.In a more prevalent model, the standard model, data may be sent only when accompanied by a packet. Under this model we present the following two algorithms: An &Ogr;(n log n)- step strongly-dimensional algorithm and an &Ogr;(n)-step oblivious and weakly-dimensional (and thus also minimal) algorithm.As said, all these algorithms store only &Ogr;(l) packets in a node. Moreover, they use only &Ogr;(log n) state bits in a node and transfer only &Ogr;(log n) data bits on an edge in a step.All our routing algorithms are based on the following new technique of open-loop flow control. An algorithm is composed of two stages: setup and transportation.The setup stage computes certain values and stores them in the network. In particular, it computes a rational number α(e) for certain critical edges e.The transportation stage moves the packets to their destinations. It uses the computed values to slow the packets so that the traffic on each critical edge e is bounded by α(e); that is, at most [α(e).l] packets traverse e during any l consecutive steps.This bound on the burstiness of the traffic enables the algorithm to avoid hot spots and maintain bounded queues. The algorithm achieves this by an open-loop control: that is, during this stage no information is transferred in a direction opposite to that of the packets.An additional novelty of our algorithms is the application of a dynamic routing problem to solve a static one. The dynamic problem in question seems easy, as its network is just a linear array. We show, however, that this problem is unsolvable by the techniques of Adversarial Queuing Theory.
Starting Page	21
Ending Page	31
Page Count	11
File Format	PDF
ISBN	1581134096
DOI	10.1145/378580.378584
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2001-07-03
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fast, minimal and oblivious . . . with bounded queues [Extended Abstract] (2001)

Minimal adaptive routing on the mesh with bounded queue size

Simple algorithms for routing on butterfly networks with bounded queues

A Power Efficient, Oblivious, Path-Diverse, Minimal Routing for Mesh-based Networks-on-Chip

Parameterized path-based, randomized, oblivious, minimal routing in 3D mesh NoC

Delay bounded and load balanced oblivious routing algorithms

Oblivious routing algorithms on the mesh of buses

Randomized Partially-Minimal Routing: Near-Optimal Oblivious Routing for 3-D Mesh Networks

Oblivious Routing on d-dimensional Meshes (2001)

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

Similar Documents

Fast, minimal and oblivious . . . with bounded queues [Extended Abstract] (2001)

Minimal adaptive routing on the mesh with bounded queue size

Simple algorithms for routing on butterfly networks with bounded queues

A Power Efficient, Oblivious, Path-Diverse, Minimal Routing for Mesh-based Networks-on-Chip

Parameterized path-based, randomized, oblivious, minimal routing in 3D mesh NoC

Delay bounded and load balanced oblivious routing algorithms

Oblivious routing algorithms on the mesh of buses

Randomized Partially-Minimal Routing: Near-Optimal Oblivious Routing for 3-D Mesh Networks

Oblivious Routing on d-dimensional Meshes (2001)

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