Sorting networks and their applications

1.7kCitations
Citations of this article
188Readers
Mendeley users who have this article in their library.
Get full text

Abstract

To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing operations are done concurrently. A major problem in the design of such a computing system is the connecting together of the various parts of the system (the I/O devices, memories, processing units, etc.) in such a way that all the required data transfers can be accommodated. One common scheme is a high-speed bus which is time-shared by the various parts; speed of available hardware limits this scheme. Another scheme is a cross-bar switch or matrix; limiting factors here are the amount of hardware (an m × n matrix requires m × n cross-points) and the fan-in and fan-out of the hardware.

Cite

CITATION STYLE

APA

Batcher, K. E. (1968). Sorting networks and their applications. In AFIPS 1968 Conference Proceedings - Spring Joint Computer Conference (pp. 307–314). Association for Computing Machinery, Inc. https://doi.org/10.1145/1468075.1468121

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free