Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Ken Batcher
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Career and achievements== Among the designs he worked on at Goodyear were the: * [[Goodyear MPP|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. Batcher published several technical papers and owns 14 patents of his own. "He discovered two parallel sorting algorithms: the odd-even mergesort and the bitonic mergesort". He is also a discoverer of scrambling data method in a random access memory which allows accesses along multiple dimensions. These memories were used in the STARAN and the MPP parallel processors.<ref name="kent">[http://www.cs.kent.edu/~batcher/ Kenneth E. Batcher] Retrieved on 5 Mar 2018</ref><ref>[https://www.computer.org/web/awards/cray-kenneth-batcher/ Kenneth E. Batcher] {{Webarchive|url=https://web.archive.org/web/20181121103956/https://www.computer.org/web/awards/cray-kenneth-batcher/ |date=2018-11-21 }} Retrieved on 5 Mar 2018</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)