Date: Thu, 21 Nov 1996 19:10:56 GMT Server: NCSA/1.5 Content-type: text/html Last-modified: Fri, 11 Oct 1996 19:42:40 GMT Content-length: 5502 Kenneth Batcher

< IMG SRC="http://www.mcs.kent.edu/figs/up_motif_yb.gif">
Previous: Arvind K. Bansal Up: Computer Science Faculty Next: S teve Chapin


Kenneth Batcher

Professor

Dr. Batcher received a B.S.E.E. degree from Iowa State University in 1957 and M.S. and Ph.D. degrees from the University of Illinois in 1962 and 1964, respectively. He worked in the Computer Engineering Department of Goodyear Aerospace Corporation (later Loral Defense Systems Division, now Lockheed-Martin Tactical Defense Systems Division) for 28 years where he developed the architectures of two SIMD parallel processors: the STARAN (1972) and the MPP (1983). In 1989 he joined the faculty at Kent State University. He is the author of several technical papers and has 14 patents. He discovered two parallel sorting algorithms: the odd-even mergesort and the bitonic mergesort. He also discovered a method of scrambling data in a random access memory to allow accesses along multiple dimensions; these memories were used in the STARAN and the MPP. In 1990, Dr. Batcher was awarded the Eckert-Mauchly Award from the ACM and the IEEE Computer Society "for the pioneering implementation of parallel computers and for contributions to interconnection network theory." He is a Fellow in the ACM and a member of SIGARCH.


CS 4/56101 - Introduction to the Design and Analysis of Algorithms (Fall 96).
CS 6/75101 - Advanced Computer Architecture (Fall 96).

Education

1953 High School
Brooklyn Technical High School
1957 B.S.
Iowa State University
1962 M.S.
University of Illinois
1964 Ph.D.
Univ. of Ill, Champaign-Urbana, Illinois
Dissertation: Speed-Independent NOR Realizations
Supervisor: Prof. Sundaram Seshu

Conference Presentations (including a link to the 1968 paper on Sorting Networks).

Journal Articles

Book Chapters

U.S. Patents

Dissertations Supervised

Jimmy Shih, Adding Fault Tolerance to Cube-Connected Cycles Networks, Graduated August 1991.

Kathy Liszka, Generalizing Bitonic and Odd-Even Merging Networks, Graduated August 1992.

Majed Al-Hajery, Bit-Level Bitonic Sorting Networks and their Role in Wormhole Multicast Routing, Graduated August 1994.

Koung Goo Lee, Routing Algorithms on Shuffle Exchange Networks, Graduated May 1996.

Jae-Dong Lee, Minimizing Communication in the Bitonic Sort, Graduated May 1996.

Grants

NSF MIP-9004127 Perfect Shuffle Machines

Professional Societies

Fellow in the Association for Computing Machinery (ACM).

Chairman of the Cuyahoga Valley section of the ACM.

Member of the Special Interest Group on Computer Architecture(SIGARCH).

1982 International Conference on Parallel Processing. Program Co-chairman.

1992 Fourth Symposium on the Frontiers of Massively Parallel Computation (Frontiers 92) Program Co-Chair (Architecture)

Akron Council of Engineering and Scientific Societies (ACESS).

Local ACM section representative to ACESS.

1993-1994 President of ACESS.

Awards

1980
Arnstein Award presented by Goodyear Aerospace Corporation for technical achievement.
1990
Eckert-Mauchly Award presented by the ACM and the IEEE Computer Society ``for the pioneering implementation of parallel computers and for contributions to interconnection network theory.''


batcher@mcs.kent.edu - 10/11/96