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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
1996
1996
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
1994
1994
This paper presents two novel sorting network-based architectures for computing high sample rate nonrecursive rank order filters… Expand
  • table 2
  • figure 1
  • figure 5
1992
1992
A multilink access subsystem based on the Batcher-banyan network architecture is proposed. With this subsystem, multiple physical… Expand
1992
1992
  • H. 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
Highly Cited
1990
Highly Cited
1990
Abstract This paper presents a deterministic sorting algorithm, called Sharesort, that sorts n records on an n -processor… Expand
Highly Cited
1988
Highly Cited
1988
It is shown that the Batcher-banyan network performs as a universal self-routing switch when inputs with unassigned destinations… Expand
  • figure I
  • figure 1
  • figure 2
  • figure 5
  • figure 4
Highly Cited
1983
Highly Cited
1983
We give a sorting network withcn logn comparisons. The algorithm can be performed inc logn parallel steps as well, where in a… Expand
Highly Cited
1979
Highly Cited
1979
We introduce a network of processing elements, the cube-connected-cycles (CCC), complying with the present technological… Expand
  • figure 1
  • figure 2
Highly Cited
1979
Highly Cited
1979
An O(n) algorithm to sort n2elements on an Illiac IV-like n × n mesh-connected processor array is presented. This algorithm sorts… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Highly Cited
1978
Highly Cited
1978
  • F. Preparata
  • IEEE Transactions on Computers
  • 1978
  • Corpus ID: 9391881
In this paper, we describe a family of parallel-sorting algorithms for a multiprocessor system. These algorithms are enumeration… Expand