Duplicating keys to streamline sorting on a mesh-connected computer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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 languageEnglish (US)
Title of host publicationProceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages296-300
Number of pages5
ISBN (Electronic)0818623101, 9780818623103
DOIs
StatePublished - Jan 1 1991
Event3rd IEEE Symposium on Parallel and Distributed Processing, PDPS 1991 - Dallas, United States
Duration: Dec 2 1991Dec 5 1991

Publication series

NameProceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991

Conference

Conference3rd IEEE Symposium on Parallel and Distributed Processing, PDPS 1991
Country/TerritoryUnited States
CityDallas
Period12/2/9112/5/91

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Duplicating keys to streamline sorting on a mesh-connected computer'. Together they form a unique fingerprint.

Cite this