A straight-line-topology local area network (LAN) to which a number of nodes are connected either in series or in parallel is considered. A file F is arbitrarily partitioned among these sites. The problem studied is that of rearranging the records of the file such that the keys of records at lower-ranking sites are all smaller than those at higher-ranking sites. Lower bounds on the worst-case communication complexity are given for both the series and parallel arrangements, and algorithms optimal for all networks and files are presented
Published in:
Computers, IEEE Transactions on
(Volume:37
,
Issue:
2
)
Date of Publication:
Feb 1988
- Page(s):
-
239
-
243
- ISSN :
-
0018-9340
- INSPEC Accession Number:
-
3122252
- Digital Object Identifier :
-
10.1109/12.2156
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 August 2002
- Issue Date :
-
Feb 1988
- Sponsored by :
-
IEEE Computer Society