### Abstract

Introduces a model of a mesh-connected computer in which multiple-key packets can be exchanged between processors in single routing steps. The author develops a sorting algorithm for such an enhanced model, which has time performance better than optimal algorithms in the traditional model. The technical contributions of this paper are as follows. The first is a new 5n-o(n) lower bound for sorting in a row-major ordering. This improves the best previously known bound of 4n-4. The second contribution is a new sorting algorithm utilizing multiple-packet routing capabilities. The time complexity of this algorithm, measured in the number of concurrent routing steps, can be arbitrarily close to the absolute distance lower bound of 2n-2, provided the number of keys that fit in one routing packet is sufficiently large.

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

Title of host publication | Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991 |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 296-300 |

Number of pages | 5 |

ISBN (Electronic) | 0818623101, 9780818623103 |

DOIs | |

State | Published - Jan 1 1991 |

Externally published | Yes |

Event | 3rd IEEE Symposium on Parallel and Distributed Processing, PDPS 1991 - Dallas, United States Duration: Dec 2 1991 → Dec 5 1991 |

### Publication series

Name | Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991 |
---|

### Conference

Conference | 3rd IEEE Symposium on Parallel and Distributed Processing, PDPS 1991 |
---|---|

Country | United States |

City | Dallas |

Period | 12/2/91 → 12/5/91 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Networks and Communications
- Hardware and Architecture

### Cite this

*Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991*(pp. 296-300). [218266] (Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SPDP.1991.218266

**Duplicating keys to streamline sorting on a mesh-connected computer.** / Chlebus, B. S.

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

*Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991.*, 218266, Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991, Institute of Electrical and Electronics Engineers Inc., pp. 296-300, 3rd IEEE Symposium on Parallel and Distributed Processing, PDPS 1991, Dallas, United States, 12/2/91. https://doi.org/10.1109/SPDP.1991.218266

}

TY - GEN

T1 - Duplicating keys to streamline sorting on a mesh-connected computer

AU - Chlebus, B. S.

PY - 1991/1/1

Y1 - 1991/1/1

N2 - Introduces a model of a mesh-connected computer in which multiple-key packets can be exchanged between processors in single routing steps. The author develops a sorting algorithm for such an enhanced model, which has time performance better than optimal algorithms in the traditional model. The technical contributions of this paper are as follows. The first is a new 5n-o(n) lower bound for sorting in a row-major ordering. This improves the best previously known bound of 4n-4. The second contribution is a new sorting algorithm utilizing multiple-packet routing capabilities. The time complexity of this algorithm, measured in the number of concurrent routing steps, can be arbitrarily close to the absolute distance lower bound of 2n-2, provided the number of keys that fit in one routing packet is sufficiently large.

AB - Introduces a model of a mesh-connected computer in which multiple-key packets can be exchanged between processors in single routing steps. The author develops a sorting algorithm for such an enhanced model, which has time performance better than optimal algorithms in the traditional model. The technical contributions of this paper are as follows. The first is a new 5n-o(n) lower bound for sorting in a row-major ordering. This improves the best previously known bound of 4n-4. The second contribution is a new sorting algorithm utilizing multiple-packet routing capabilities. The time complexity of this algorithm, measured in the number of concurrent routing steps, can be arbitrarily close to the absolute distance lower bound of 2n-2, provided the number of keys that fit in one routing packet is sufficiently large.

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

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

U2 - 10.1109/SPDP.1991.218266

DO - 10.1109/SPDP.1991.218266

M3 - Conference contribution

AN - SCOPUS:3042876690

T3 - Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991

SP - 296

EP - 300

BT - Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991

PB - Institute of Electrical and Electronics Engineers Inc.

ER -