Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

13 relations
Batcher odd–even mergesortBitonic sorterComputer architectureConnection Machine
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2001
2001
Modified odd-even merge-sort network for arbitrary number of inputs
Modified network architecture for sorting data of any size is presented in this paper. The proposed VLSI archi- tecture is… Expand
  • table 1
  • figure 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1996
1996
FAULT‐TOLERANT DESIGN OF BATCHER–BANYAN CLASS ATM SWITCHES
Many proposed packet switching systems for high-speed networks have employed the Batcher–banyan fabric due to its modular… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The REFINE Multiprocessor - Theoretical Properties and Algorithms
Abstract A reconfigurable interconnection network based on a multi-ring architecture called REFINE is described. REFINE embeds a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
Design and analysis of a multilink access subsystem based on the Batcher-banyan network architecture
A multilink access subsystem based on the Batcher-banyan network architecture is proposed. With this subsystem, multiple physical… Expand
Is this relevant?
1992
1992
Multichannel ATM switch with preserved packet sequence
  • Hyong S. Kim
  • [Conference Record] SUPERCOMM/ICC '92 Discovering…
  • 1992
    • Corpus ID: 61686237
The author introduces a multichannel asynchronous transfer mode (ATM) switch that guarantees the packet sequence throughout the… Expand
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Vector Models for Data-Parallel Computing
"Vector Models for Data-Parallel Computing "describes a model of parallelism that extends and formalizes the Data-Parallel model… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Sorting inc logn parallel steps
We give a sorting network withcn logn comparisons. The algorithm can be performed inc logn parallel steps as well, where in a… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1979
Highly Cited
1979
The cube-connected-cycles: A versatile network for parallel computation
We introduce a network of processing elements, the cube-connected-cycles (CCC), complying with the present technological… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1978
Highly Cited
1978
New Parallel-Sorting Schemes
In this paper, we describe a family of parallel-sorting algorithms for a multiprocessor system. These algorithms are enumeration… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE