Ken 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 Akron, Ohio for 28 years. In 1964, Batcher received his Ph.D. in electrical engineering from the University of Illinois. He graduated from Brooklyn Technical High School.

Among the designs he worked on at Goodyear were the:

Massively Parallel Processor (16,384 custom bit-serial processors {8 to a chip} organized in a SIMD 128 x 128 processor array with additional CPU rows for fault-tolerance) which was located at the NASA Goddard Space Flight Center, and is now in the Smithsonian. This unit predates Danny Hillis' Thinking Machines Corporation's Connection Machine
The Goodyear STARAN associative processor arrays, a version of which (called ASPRO) was found in the US Navy Northrop Grumman E-2 Hawkeye radar planes.

In 1990, Batcher was awarded the ACM/IEEE Eckert-Mauchly Award for his pioneering work on parallel computers. He holds 14 patents.

In 2007, Batcher was awarded the IEEE Seymour Cray Computer Engineering Award; "For fundamental theoretical and practical contributions to massively parallel computation, including parallel sorting algorithms, interconnection networks, and pioneering designs of the STARAN and MPP computers."

He is credited with discovering two important parallel sorting algorithms: the odd-even mergesort and the bitonic mergesort.^[1]^[2]

Batcher is known for his half-serious, half-humorous definition that "A supercomputer is a device for turning compute-bound problems into I/O-bound problems."

References

↑ Cormen, Thomas H.; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein (2001). Introduction to Algorithms (2e ed.). MIT Press and McGraw-Hill. ISBN 0-262-03293-7.
↑ Donald E. Knuth. The Art of Computer Programming. Volume 3: Sorting and Searching. Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), xiv+780pp.+foldout. ISBN 0-201-89685-0´

Batcher, K. E., "Design of a Massively Parallel Processor," IEEE Transactions on Computers, Vol. C29, September 1980, 836-840.

External links

Batcher's web page at Kent State University

Sorting algorithms

Theory	Computational complexity theory Big O notation Total order Lists Inplacement Stability Comparison sort Adaptive sort Sorting network Integer sorting X + Y sorting Transdichotomous model Quantum sort

Exchange sorts	Bubble sort Cocktail shaker sort Odd–even sort Comb sort Gnome sort Quicksort Stooge sort Bogosort

Selection sorts	Selection sort Heapsort Smoothsort Cartesian tree sort Tournament sort Cycle sort

Insertion sorts	Insertion sort Shellsort Splaysort Tree sort Library sort Patience sorting

Merge sorts	Merge sort Cascade merge sort Oscillating merge sort Polyphase merge sort

Distribution sorts	American flag sort Bead sort Bucket sort Burstsort Counting sort Pigeonhole sort Proxmap sort Radix sort Flashsort

Concurrent sorts	Bitonic sorter Batcher odd–even mergesort Pairwise sorting network

Hybrid sorts	Block sort Timsort Introsort Spreadsort

Other	Topological sorting Pancake sorting Spaghetti sort

Authority control	VIAF: 242523881

This article is issued from Wikipedia - version of the Thursday, February 04, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.

Ken Batcher

See also

References

External links