Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,177,988 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Batcher odd–even mergesort
Bitonic sorter
Computer architecture
Connection Machine
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
1996
1996
FAULT-TOLERANT DESIGN OF BATCHER–BANYAN CLASS ATM SWITCHES
Ruizhi Liao
,
A. Leon-Garcia
1996
Corpus ID: 17698732
Many proposed packet switching systems for high-speed networks have employed the Batcher–banyan fabric due to its modular…
Expand
Highly Cited
1995
Highly Cited
1995
The REFINE Multiprocessor - Theoretical Properties and Algorithms
S. Bhandarkar
,
H. Arabnia
Parallel Computing
1995
Corpus ID: 9430250
1992
1992
Design and analysis of a multilink access subsystem based on the Batcher-banyan network architecture
P. Lau
,
A. Leon-Garcia
IEEE Transactions on Communications
1992
Corpus ID: 34275599
A multilink access subsystem based on the Batcher-banyan network architecture is proposed. With this subsystem, multiple physical…
Expand
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
Highly Cited
1990
Highly Cited
1990
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
R. Cypher
,
C. G. Plaxton
Symposium on the Theory of Computing
1990
Corpus ID: 15389747
Abstract This paper presents a deterministic sorting algorithm, called Sharesort, that sorts n records on an n -processor…
Expand
Highly Cited
1983
Highly Cited
1983
Sorting inc logn parallel steps
M. Ajtai
,
J. Komlos
,
E. Szemerédi
1983
Corpus ID: 519246
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
1983
Highly Cited
1983
An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
Manoj Kumar
,
D. Hirschberg
IEEE transactions on computers
1983
Corpus ID: 7616692
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
Highly Cited
1979
Highly Cited
1979
The cube-connected-cycles: A versatile network for parallel computation
F. Preparata
,
J. Vuillemin
20th Annual Symposium on Foundations of Computer…
1979
Corpus ID: 8538576
We introduce a network of processing elements, the cube-connected-cycles (CCC), complying with the present technological…
Expand
Highly Cited
1979
Highly Cited
1979
Bitonic Sort on a Mesh-Connected Parallel Computer
David Nassimi
,
S. Sahni
IEEE transactions on computers
1979
Corpus ID: 36035966
An O(n) algorithm to sort n2elements on an Illiac IV-like n × n mesh-connected processor array is presented. This algorithm sorts…
Expand
Highly Cited
1978
Highly Cited
1978
New Parallel-Sorting Schemes
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
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE