FAQ

Ken Batcher

Known as: Batcher, K. E. Batcher, Kenneth E. Batcher 
Ken Batcher is an emeritus professor of Computer Science at Kent State University. He also worked as a computer architect at Goodyear Aerospace in… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2017
051019742017

Related topics

Related topics

13 relations
Batcher odd–even mergesortBitonic sorterComputer architectureConnection Machine
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Ken Batcher
Electrical engineering
Supercomputer
Computer architecture
SIMD
Goodyear MPP

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2000
2000
An Optimal Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device
ÐWe present a hardware-algorithm for sortingN elements using either a p-sorter or a sorting network of fixed I/O size p while… (More)
  • figure 1
  • figure 2
Is this relevant?
1997
1997
Design Issues in Ultra-Fast Ultra-Low-Power Superconductor Batcher-Banyan Switching Fabric Based on RSFQ Logic/Memory Family
|We present the results of the feasibility study of ultra-fast low-power superconductor digital switches based on Rapid Single… (More)
  • figure 3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Powerlist: A Structure for Parallel Recursion
Many data-parallel algorithms—Fast Fourier Transform, Batcher's sorting schemes, and the prefix-sum—exhibit recursive structure… (More)
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Vector Models for Data-Parallel Computing
ion,<lb>level of, 24<lb>access-fixed code, 150, 217<lb>access-restricted code, 149, 217<lb>algorithm,<lb>biconnectivity, 114<lb… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A Broadband Packet Switch for Integrated Transport
This paper gives a broadband (total throughput approaching 1 terabit /s) self-routing packet switch design for providing flexible… (More)
  • figure 1
  • figure 3
  • figure 6
  • figure 5
  • figure 7
Is this relevant?
1985
1985
A Robust Sorting Network
Beginning with the recently introduced balanced sorting network, we propose a shuffle-exchange type layout consisting of a single… (More)
  • figure 1-1
Is this relevant?
1983
1983
An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
An algorithm is presented to merge two subfiles of size n/2 each, stored in the left and the right halves of a linearly connected… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Bitonic Sort on a Mesh-Connected Parallel Computer
An O(n) algorithm to sort n2elements on an Illiac IV-like n × n mesh-connected processor array is presented. This algorithm sorts… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
1975
1975
Merging with Parallel Processors
Consider two linearly ordered sets <italic>A, B</italic>, | <italic>A</italic> | = <italic>m</italic>, | <italic>B</italic… (More)
Is this relevant?
1974
1974
An economical construction for sorting networks
An <i>N</i>-input <i>sorting network</i>, or an <i>N-sorter</i>, is a switching circuit with <i>N</i> outputs that satisfy the… (More)
  • figure 1-4
  • figure 2
Is this relevant?