### 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 |

### ASJC Scopus subject areas

- Engineering(all)

## Cite this

Chlebus, B. S., Kaufmann, M., & Sibeyn, J. F. (1993). Deterministic permutation routing on meshes. In Anon (Ed.),

*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.