Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Duplicating keys to streamline sorting on a mesh-connected computer

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Chlebus, B.S. ; Inst. Inf., Warszawski Univ., Poland

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

Published in:

Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on

Date of Conference:

2-5 Dec 1991