Editing Ken Batcher (section)

==Awards==
In 1980, he received an ''Arnstein Award'' presented by Goodyear Aerospace Corporation for technical achievement.<ref name="kent"/>

In 1990, Batcher was awarded the [[Association for Computing Machinery|ACM]]/[[Institute of Electrical and Electronics Engineers|IEEE]] [[Eckert-Mauchly Award]] for his pioneering work on parallel computers.  He holds 14 patents.

In 2007, Batcher was awarded the [[Institute of Electrical and Electronics Engineers|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."''

Batcher is credited with discovering two important parallel sorting algorithms: the [[odd-even mergesort]] and the [[bitonic sorter|bitonic mergesort]].<ref>{{cite book| first = Thomas H. | last = Cormen | author-link = Thomas H. Cormen |author2=Charles E. Leiserson |author2-link=Charles E. Leiserson |author3=Ronald L. Rivest |author3-link=Ronald L. Rivest |author4=Clifford Stein |author4-link=Clifford Stein | title = [[Introduction to Algorithms]]| edition = 2e| publisher = MIT Press and McGraw-Hill | year = 2001| isbn = 0-262-03293-7 }}</ref><ref>[[Donald E. Knuth]]. ''[[The Art of Computer Programming]].'' ''Volume 3: [[Sorting algorithm|Sorting]] and [[Search algorithms|Searching]]''. Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), xiv+780pp.+foldout. {{ISBN|0-201-89685-0}}´</ref>

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