Improved layout of the odd-even sorting network

Authors:
Maria Artishchev-Zapolotsky
Affiliations:
Software Engineering Department, Afeka - Tel-Aviv Academic College of Engineering, Tel-Aviv 69107, Israel
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2009

Citing 2
Cited 0

Introduction to Algorithms

Introduction to Algorithms
Sorting networks and their applications

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sorting networks are of great interest in many VLSI architectures. We study a problem of minimizing area of odd-even sorting network (defined by Batcher). By now, the best known result is presented by Shimon Even in 2001 - a layout of 3N^2 area. In this paper, we describe layouts, of 2N^2 and 213N^2 with and without knock-knees, respectively.