### Abstract

New deterministic algorithms for routing permutations on an n ×n MIMD mesh are presented. They are very efficient in terms of the size of auxiliary memory at each processor, measured as the maximum number of packets that need to be queued. One algorithm runs in the optimal time 2·n-2 with a maximum queue length of 33. Another runs in the near-optimal time 2·n + O(1) with a maximum queue length of only 12. The attained queue sizes are less than half of the previously best queue bounds. The improvements in the queue sizes are due to a new general routing scheme, a better scattering algorithm, and a new technique called spreading.

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

Title of host publication | Mathematical Foundations of Computer Science 1994 - 19th International Symposium, MFCS 1994, Proceedings |

Editors | Igor Privara, Branislav Rovan, Peter Ruzicka |

Publisher | Springer Verlag |

Pages | 597-607 |

Number of pages | 11 |

ISBN (Print) | 9783540583387 |

State | Published - Jan 1 1994 |

Event | 19th International Symposium on Mathematical Foundations of Computer Science, MFCS 1994 - Kosice, Slovakia Duration: Aug 22 1994 → Aug 26 1994 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 841 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 19th International Symposium on Mathematical Foundations of Computer Science, MFCS 1994 |
---|---|

Country | Slovakia |

City | Kosice |

Period | 8/22/94 → 8/26/94 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Mathematical Foundations of Computer Science 1994 - 19th International Symposium, MFCS 1994, Proceedings*(pp. 597-607). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 841 LNCS). Springer Verlag.

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

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

*Mathematical Foundations of Computer Science 1994 - 19th International Symposium, MFCS 1994, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 841 LNCS, Springer Verlag, pp. 597-607, 19th International Symposium on Mathematical Foundations of Computer Science, MFCS 1994, Kosice, Slovakia, 8/22/94.

}

TY - GEN

T1 - Shorter queues for permutation routing on meshes

AU - Sibeyn, Jop F.

AU - Chlebus, Bogdan S.

AU - Kaufmann, Michael

PY - 1994/1/1

Y1 - 1994/1/1

N2 - New deterministic algorithms for routing permutations on an n ×n MIMD mesh are presented. They are very efficient in terms of the size of auxiliary memory at each processor, measured as the maximum number of packets that need to be queued. One algorithm runs in the optimal time 2·n-2 with a maximum queue length of 33. Another runs in the near-optimal time 2·n + O(1) with a maximum queue length of only 12. The attained queue sizes are less than half of the previously best queue bounds. The improvements in the queue sizes are due to a new general routing scheme, a better scattering algorithm, and a new technique called spreading.

AB - New deterministic algorithms for routing permutations on an n ×n MIMD mesh are presented. They are very efficient in terms of the size of auxiliary memory at each processor, measured as the maximum number of packets that need to be queued. One algorithm runs in the optimal time 2·n-2 with a maximum queue length of 33. Another runs in the near-optimal time 2·n + O(1) with a maximum queue length of only 12. The attained queue sizes are less than half of the previously best queue bounds. The improvements in the queue sizes are due to a new general routing scheme, a better scattering algorithm, and a new technique called spreading.

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

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

M3 - Conference contribution

AN - SCOPUS:21844497019

SN - 9783540583387

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 597

EP - 607

BT - Mathematical Foundations of Computer Science 1994 - 19th International Symposium, MFCS 1994, Proceedings

A2 - Privara, Igor

A2 - Rovan, Branislav

A2 - Ruzicka, Peter

PB - Springer Verlag

ER -