### Abstract

We present new deterministic algorithms for routing permutations on a two-dimensional n×n MIMD mesh. One algorithm runs in the optimal time 2·n-2, while the maximal number of packets stored in a processing unit is bounded to 81. Another algorithm runs in near-optimal time, 2·n+O(1), and has maximal queue length only 31.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing |

Editors | Anon |

Publisher | Publ by IEEE |

Pages | 814-821 |

Number of pages | 8 |

ISBN (Print) | 081864222X |

State | Published - Dec 1 1993 |

Externally published | Yes |

Event | Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing - Dallas, TX, USA Duration: Dec 1 1993 → Dec 4 1993 |

### Publication series

Name | Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing |
---|

### Conference

Conference | Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing |
---|---|

City | Dallas, TX, USA |

Period | 12/1/93 → 12/4/93 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing*(pp. 814-821). (Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing). Publ by IEEE.

**Deterministic permutation routing on meshes.** / Chlebus, Bogdan S.; Kaufmann, Michael; Sibeyn, Jop F.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing.*Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing, Publ by IEEE, pp. 814-821, Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing, Dallas, TX, USA, 12/1/93.

}

TY - GEN

T1 - Deterministic permutation routing on meshes

AU - Chlebus, Bogdan S.

AU - Kaufmann, Michael

AU - Sibeyn, Jop F.

PY - 1993/12/1

Y1 - 1993/12/1

N2 - We present new deterministic algorithms for routing permutations on a two-dimensional n×n MIMD mesh. One algorithm runs in the optimal time 2·n-2, while the maximal number of packets stored in a processing unit is bounded to 81. Another algorithm runs in near-optimal time, 2·n+O(1), and has maximal queue length only 31.

AB - We present new deterministic algorithms for routing permutations on a two-dimensional n×n MIMD mesh. One algorithm runs in the optimal time 2·n-2, while the maximal number of packets stored in a processing unit is bounded to 81. Another algorithm runs in near-optimal time, 2·n+O(1), and has maximal queue length only 31.

UR - http://www.scopus.com/inward/record.url?scp=0027885682&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027885682&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027885682

SN - 081864222X

T3 - Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing

SP - 814

EP - 821

BT - Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing

A2 - Anon, null

PB - Publ by IEEE

ER -