Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ICPP

1992

IEEE

1992

IEEE

Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on a new model, called an adaptive sorting network. We show that any sequence of t ) bits can be sorted on this model in O(lg` 7 t ) bit-level delay using O ( H )constant fanin gates. This improves the cost complexity of Batcher's binary sorters by a factor of O(lg' r t ) while matching their sorting time. The only other network that can sort binary sequences in O ( t t ) cost is the network version of columnsort algorithm, but this requires excessive pipelining. In addition, using binary sorters, we construct permutation networks with O(r) Ig t t ) bitlevel cost and O(Ig ' T I ) bit-level delay. These results provide the asymptotically least-cost practical concentrators and permutation networks to date. We note, of course, that the well-known AKS sorting network has O(Ig )I ) sorting time and O(t...

Added |
10 Aug 2010 |

Updated |
10 Aug 2010 |

Type |
Conference |

Year |
1992 |

Where |
ICPP |

Authors |
Minze V. Chien, A. Yavuz Oruç |

Comments (0)