25,161
edits
Changes
Created page with "'''Home * Hardware * Connection Machine''' [[FILE:Frostburg.jpg|border|right|thumb| [https://en.wikipedia.org/wiki/FROSTBURG FROSTBURG] on display <ref>The..."
'''[[Main Page|Home]] * [[Hardware]] * Connection Machine'''
[[FILE:Frostburg.jpg|border|right|thumb| [https://en.wikipedia.org/wiki/FROSTBURG FROSTBURG] on display <ref>The light panels of [https://en.wikipedia.org/wiki/FROSTBURG FROSTBURG], a CM-5, on display at the [https://en.wikipedia.org/wiki/National_Cryptologic_Museum National Cryptologic Museum] in 2005. The panels were used to check the usage of the processing nodes, and to run diagnostics.</ref>]]
'''Connection Machine''',<br/>
a series of supercomputers that grew out of [[Mathematician#Hillis|Danny Hillis']] doctoral research at [[Massachusetts Institute of Technology|MIT]] in the early 1980s on alternatives to the traditional [[Von Neumann Architecture|von Neumann architecture]] of computation, originally intended for applications in [[Artificial Intelligence|artificial intelligence]] and [https://en.wikipedia.org/wiki/Symbolic_computation symbolic computation]. The Connection Machine was manufacturered since 1983 by [https://en.wikipedia.org/wiki/Thinking_Machines_Corporation Thinking Machines Corporation] (TMC), founded by Danny Hillis and [https://en.wikipedia.org/wiki/Sheryl_Handler Sheryl Handler] <ref> [https://en.wikipedia.org/wiki/Connection_Machine Connection Machine from Wikipedia]</ref>.
=CM-1, CM-2, CM-200=
The '''CM-1''' consisted of up to 64 kibi of 1-bit [https://en.wikipedia.org/wiki/SIMD SIMD] processors with 4 kibibits of [[Memory#RAM|RAM]] each inside a network of a 12-dimensional boolean [https://en.wikipedia.org/wiki/Hypercube n-cube] structure suggested by physicist [[Mathematician#RFeynman|Richard Feynman]]. Within this hardwired physical structure, the software data structures for communication and transfer of data between processors could change as needed depending on the nature of the problem. This meant the mutability of the connections between processors were more important than the processors themselves. The '''CM-2''', released in 1987, was a more advanced successor (including floating point hardware) with the same physical structure <ref>[http://www.tamikothiel.com/cm/ The Connection Machine] by [https://en.wikipedia.org/wiki/Tamiko_Thiel Tamiko Thiel]</ref>.
<span id="CM5"></span>
=CM-5=
Under guidance of [[Charles Leiserson|Charles E. Leiserson]] and [[Bradley Kuszmaul|Bradley C. Kuszmaul]], the '''CM-5''', announced in 1991, switched from the CM-2's hypercubic architecture of simple processors to an entirely new [https://en.wikipedia.org/wiki/MIMD MIMD] architecture based on the [https://en.wikipedia.org/wiki/Fat_tree fat tree] <ref>[[Charles Leiserson|Charles E. Leiserson]] ('''1985'''). '' Fat-Trees: Universal Networks for Hardware-efficient Supercomputing''. [[IEEE#TOC|IEEE Transactions on Computers]], Vol. 34 , No. 10, [http://courses.csail.mit.edu/6.896/spring04/handouts/papers/fat_trees.pdf pdf]</ref> network of [[SPARC|SPARC]], and for the later CM-5E, SuperSPARC processors <ref>[https://www.top500.org/system/166997 CM-5/1024 | TOP500 Supercomputer Sites]</ref>.
=Chess=
[[Lewis Stiller]] used a CM-2 to generate certain chess six-piece [[Endgame Tablebases|endgame tablebases]] by massively parallel [[Retrograde Analysis|retrograde analysis]] <ref>[[Lewis Stiller]] ('''1996'''). ''Multilinear Algebra and Chess Endgames''. [http://library.msri.org/books/Book29/index.html Games of No Chance] edited by [[Richard J. Nowakowski]], [http://library.msri.org/books/Book29/files/stiller.pdf pdf]</ref>. CM-5 architects [[Charles Leiserson|Charles E. Leiserson]] and [[Bradley Kuszmaul|Bradley C. Kuszmaul]] were also co-authors of the parallel [[Massachusetts Institute of Technology|MIT]] chess programs [[StarTech]] and [[Star Socrates|*Socrates]]. StarTech played the [[ACM 1993]] on [[University of Illinois at Urbana-Champaign#NCSA|NCSA's]] 512-processor CM-5 <ref>[https://www.top500.org/system/167057 CM-5/512 | TOP500 Supercomputer Sites]</ref> for third place <ref>[http://groups.google.com/group/rec.games.chess/browse_frm/thread/45699b80a93fde41 1993 ACM International Computer Chess Championship (with corrections)] by [[Bradley Kuszmaul]], [[Computer Chess Forums|rec.games.chess]], February 19, 1993</ref>. Incorporating the ACM 1993 winner, the serial program [[Titan|Socrates II]] by [[Don Dailey]] and [[Larry Kaufman]], StarTech emerged to *Socrates, which played the [[ACM 1994]] on the CM-5/512 again to become third behind [[Deep Thought|Deep Thought II]] and [[Zarkov]]. At the [[WCCC 1995]] in [https://en.wikipedia.org/wiki/Hong_Kong Hong Kong], *Socrates played on a [[Paragon|Intel Paragon]], where it lost the [[WCCC 1995#Playoff|playoff]] versus [[Fritz]].
=Quotes=
Quote from ''History of *Socrates'' by [[Chris Joerg]] from his Ph.D. Thesis <ref>[[Chris Joerg|Christopher F. Joerg]] ('''1996'''). ''The Cilk System for Parallel Multithreaded Computing'' Ph. D. thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology|MIT]], [http://supertech.csail.mit.edu/papers/joerg-phd-thesis.pdf pdf]</ref> :
We began work on this program in May of 1994. [[Don Dailey]] and [[Larry Kaufman]] of [[Heuristic Software]] provided us with a version of [[Socrates]], their serial chess program. During May and June we parallelized the program using [[Cilk]], focusing mainly on the [[Search|search algorithm]] and the [[Transposition Table|transposition table]]. During June Dailey visited [[Massachusetts Institute of Technology|MIT]] to help tune the program, but we spent most of June simply getting the parallel version of the program to work correctly. In late June, we entered *Socrates in the [[ACM 1994|1994 ACM International Computer Chess Championship]] in Cape May, New Jersey. We ran the program on a 512-node [[Connection Machine|CM-5]] at the [[University of Illinois at Urbana-Champaign#NCSA|National Center for Supercomputing Applications]] (NCSA) at the [[University of Illinois at Urbana-Champaign|University of Illinois]]. Despite the fact that we had begun working on the program less than two months earlier, the program ran reliable and finished in third place.
=Chess Programs=
* [[StarTech]]
* [[Star Socrates|*Socrates]]
=See also=
* [[nCUBE]]
* [[Paragon]]
=Selected Publications=
==1985 ...==
* [[Mathematician#Hillis|W. Daniel Hillis]] ('''1985'''). ''The Connection Machine''. Ph. D. thesis, [[Massachusetts Institute of Technology|MIT]], advisors [[Mathematician#Sussman|Gerald Jay Sussman]], [[Claude Shannon]], and [[Marvin Minsky]], [https://dspace.mit.edu/bitstream/handle/1721.1/14719/18524280-MIT.pdf?sequence=2 pdf]
* [[Mathematician#Hillis|W. Daniel Hillis]] ('''1986'''). ''The Connection Machine''. [https://en.wikipedia.org/wiki/MIT_Press MIT Press], ISBN 0262081571, [https://www.amazon.com/Connection-Machine-Press-Artificial-Intelligence/dp/0262081571 Amazon]
* [http://dblp.uni-trier.de/pers/hd/t/Tucker:Lewis_W= Lewis W. Tucker], [https://en.wikipedia.org/wiki/George_G._Robertson George G. Robertson] ('''1988'''). ''Architecture and Applications of the Connection Machine''. [[IEEE#Computer|Computer]], Vol. 21, No. 8
* [https://en.wikipedia.org/wiki/Lennart_Johnsson S. Lennart Johnsson], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/k/Krawitz:Robert_L=.html Robert L. Krawitz], [[Roger Frye]], [http://dblp.uni-trier.de/pers/hd/m/MacDonald:Douglas Douglas MacDonald] ('''1989'''). ''A Radix-2 FFT on the Connection Machine''. [http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5348943 Supercomputing 89], [http://www.cs.yale.edu/publications/techreports/tr734.pdf pdf]
* [https://en.wikipedia.org/wiki/Lennart_Johnsson S. Lennart Johnsson], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/k/Krawitz:Robert_L=.html Robert L. Krawitz], [[Roger Frye]], [http://dblp.uni-trier.de/pers/hd/m/MacDonald:Douglas Douglas MacDonald] ('''1989'''). ''Cooley-Tukey FFT on the Connection Machine''. [http://www.journals.elsevier.com/parallel-computing/ Parallel Computing], [http://www.cs.yale.edu/publications/techreports/tr750.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Cooley%E2%80%93Tukey_FFT_algorithm Cooley–Tukey FFT algorithm from Wikipedia]</ref>
==1990 ...==
* [[Mathematician#EGelenbe|Erol Gelenbe]] ('''1990'''). ''[http://dl.acm.org/citation.cfm?id=98757 Performance Analysis of the Connection Machine]''. [[ACM#SIGMETRICS|ACM SIGMETRICS]], [https://assets.cs.ncl.ac.uk/seminars/81.pdf pdf]
* [http://dblp.uni-trier.de/pers/hd/t/Trew:Arthur_S= Arthur Trew], [[Greg Wilson]] (eds.) ('''1991'''). ''[http://link.springer.com/book/10.1007%2F978-1-4471-1842-8 Past, Present, Parallel: A Survey of Available Parallel Computing Systems]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Mark Bromley]], [http://dblp.uni-trier.de/pers/hd/h/Heller:Steven Steven Heller], [http://xenia.media.mit.edu/~mcnerney/ Tim McNerney], [[Mathematician#GSteele|Guy L. Steele Jr.]] ('''1991'''). ''[http://dl.acm.org/citation.cfm?id=113458 Fortran at ten gigaflops: the connection machine convolution compiler]''. [http://www.informatik.uni-trier.de/~ley/db/conf/pldi/pldi91.html#BromleyHMS91 PLDI '91]
* [http://dblp.uni-trier.de/pers/hd/m/Myczkowski:Jacek Jacek Myczkowski], [[Mathematician#GSteele|Guy L. Steele Jr.]] ('''1991'''). ''[http://dl.acm.org/citation.cfm?id=126004 Seismic modeling at 14 gigaflops on the connection machine]''. [http://dl.acm.org/citation.cfm?id=125826&picked=prox&CFID=67541071&CFTOKEN=91822939 Supercomputing '91]
* [[Charles Leiserson|Charles E. Leiserson]], [https://www.linkedin.com/in/zahi-abuhamdeh-703aab1 Zahi S. Abuhamdeh], David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, [[Mathematician#Hillis|W. Daniel Hillis]], [[Bradley Kuszmaul|Bradley C. Kuszmaul]], Margaret A. St. Pierre, David S. Wells, Monica C. Wong, Shaw-Wen Yang, Robert Zak ('''1992'''). ''The Network Architecture of the Connection Machine CM-5''. 4th ACM Symposium on Parallel Algorithms and Architectures, ('''1996'''). ''revised version''. [http://www.journals.elsevier.com/journal-of-parallel-and-distributed-computing Journal of Parallel and Distributed Computing], Vol. 33, No. 2
* [[Mathematician#Hillis|W. Daniel Hillis]], [http://dblp.uni-trier.de/pers/hd/t/Tucker:Lewis_W= Lewis W. Tucker] ('''1993'''). ''The CM-5 Connection Machine: A Scalable Supercomputer''. [[ACM#Communications|Communications of the ACM]], Vol. 36, No. 11
* [[Burton Wendroff]], [[Tony Warnock]], [[Lewis Stiller]], [[Dean Mayer]], [[Ralph Brickner]] ('''1993'''). ''Bits and pieces: constructing chess endgame databases on parallel and vector architectures''. Applied Numerical Mathematics, Vol. 12, Nos. 1-3
* [http://www.personal.psu.edu/lnl/ Lyle N. Long], [http://dblp.uni-trier.de/pers/hd/m/Myczkowski:Jacek Jacek Myczkowski] ('''1993'''). ''[http://dl.acm.org/citation.cfm?id=169627.169795&coll=DL&dl=GUIDE&CFID=67541071&CFTOKEN=91822939 Solving the Boltzmann Equation at 61 gigaflops on a 1024-Node CM-5]''. [http://www.personal.psu.edu/lnl/papers/bgk.pdf pdf]
* [https://en.wikipedia.org/wiki/Tamiko_Thiel Tamiko Thiel] ('''1994'''). ''[http://tamikothiel.com/theory/cm_txts/di-frames.html The Design of the Connection Machine]''. [http://www.mitpressjournals.org/loi/desi DesignIssues], Vol. 10, No. 1, [https://en.wikipedia.org/wiki/MIT_Press MIT Press]
* [[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology|MIT]], [http://supertech.csail.mit.edu/papers/thesis-kuszmaul.pdf pdf]
* [[Chris Joerg]], [[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Massively Parallel Chess''. Third DIMACS Parallel Implementation Challenge, [https://en.wikipedia.org/wiki/Rutgers_University Rutgers University], [http://supertech.csail.mit.edu/papers/dimacs94.pdf pdf]
* [[Michael Halbherr]], [[Yuli Zhou]], [[Chris Joerg]] ('''1994'''). ''[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.9812 MIMD-Style Parallel Programming with Continuation-Passing Threads]''. Proceedings of the 2nd International Workshop on Massive Parallelism: Hardware, Software, and Applications
==1995 ...==
* [[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1995'''). ''The StarTech Massively Parallel Chess Program''. [[ICGA Journal#18_1|ICCA Journal, Vol. 18, No. 1]], [http://supertech.csail.mit.edu/papers/startech.pdf pdf]
* [[Robert Blumofe]], [[Chris Joerg]], [[Bradley Kuszmaul]], [[Charles Leiserson]], [[Keith H. Randall]], [[Yuli Zhou]] ('''1995'''). ''Cilk: An Efficient Multithreaded Runtime System''. Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP) Santa Barbara, California Pg. 207–216, [http://supertech.csail.mit.edu/papers/PPoPP95.pdf pdf]
* [[Lewis Stiller]] ('''1995'''). ''Exploiting symmetry on parallel architectures''. Ph.D. thesis
* [[Chris Joerg]] ('''1996'''). ''The Cilk System for Parallel Multithreaded Computing'' Ph. D. thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology|MIT]], [http://supertech.csail.mit.edu/papers/joerg-phd-thesis.pdf pdf]
* [[Lewis Stiller]] ('''1996'''). ''Multilinear Algebra and Chess Endgames''. [http://library.msri.org/books/Book29/index.html Games of No Chance] edited by [[Richard J. Nowakowski]], [http://library.msri.org/books/Book29/files/stiller.pdf pdf]
=External Links=
* [https://en.wikipedia.org/wiki/Connection_Machine Connection Machine from Wikipedia]
* [http://longnow.org/essays/richard-feynman-connection-machine/ Richard Feynman and The Connection Machine] - [https://en.wikipedia.org/wiki/Long_Now_Foundation The Long Now]
* [http://www.computerhistory.org/revolution/supercomputers/10/73 The Connection Machine - CHM Revolution] from [[The Computer History Museum]]
* [http://www.tamikothiel.com/cm/ The Connection Machine] by [https://en.wikipedia.org/wiki/Tamiko_Thiel Tamiko Thiel]
* [http://www.corestore.org/cm200.htm Corestore collection: Connection Machine CM-200]
* [http://people.csail.mit.edu/bradley/cm5/ Gallery of Connection Machine CM-5 Images] hosted by [[Bradley Kuszmaul|Bradley C. Kuszmaul]]
* [http://people.csail.mit.edu/bradley/cm5docs/ CM-5 Manuals] hosted by [[Bradley Kuszmaul|Bradley C. Kuszmaul]]
* [https://www.top500.org/system/167057 CM-5/512 | TOP500 Supercomputer Sites]
* [https://www.top500.org/system/166997 CM-5/1024 | TOP500 Supercomputer Sites]
=References=
<references />
'''[[Hardware|Up one Level]]'''
[[FILE:Frostburg.jpg|border|right|thumb| [https://en.wikipedia.org/wiki/FROSTBURG FROSTBURG] on display <ref>The light panels of [https://en.wikipedia.org/wiki/FROSTBURG FROSTBURG], a CM-5, on display at the [https://en.wikipedia.org/wiki/National_Cryptologic_Museum National Cryptologic Museum] in 2005. The panels were used to check the usage of the processing nodes, and to run diagnostics.</ref>]]
'''Connection Machine''',<br/>
a series of supercomputers that grew out of [[Mathematician#Hillis|Danny Hillis']] doctoral research at [[Massachusetts Institute of Technology|MIT]] in the early 1980s on alternatives to the traditional [[Von Neumann Architecture|von Neumann architecture]] of computation, originally intended for applications in [[Artificial Intelligence|artificial intelligence]] and [https://en.wikipedia.org/wiki/Symbolic_computation symbolic computation]. The Connection Machine was manufacturered since 1983 by [https://en.wikipedia.org/wiki/Thinking_Machines_Corporation Thinking Machines Corporation] (TMC), founded by Danny Hillis and [https://en.wikipedia.org/wiki/Sheryl_Handler Sheryl Handler] <ref> [https://en.wikipedia.org/wiki/Connection_Machine Connection Machine from Wikipedia]</ref>.
=CM-1, CM-2, CM-200=
The '''CM-1''' consisted of up to 64 kibi of 1-bit [https://en.wikipedia.org/wiki/SIMD SIMD] processors with 4 kibibits of [[Memory#RAM|RAM]] each inside a network of a 12-dimensional boolean [https://en.wikipedia.org/wiki/Hypercube n-cube] structure suggested by physicist [[Mathematician#RFeynman|Richard Feynman]]. Within this hardwired physical structure, the software data structures for communication and transfer of data between processors could change as needed depending on the nature of the problem. This meant the mutability of the connections between processors were more important than the processors themselves. The '''CM-2''', released in 1987, was a more advanced successor (including floating point hardware) with the same physical structure <ref>[http://www.tamikothiel.com/cm/ The Connection Machine] by [https://en.wikipedia.org/wiki/Tamiko_Thiel Tamiko Thiel]</ref>.
<span id="CM5"></span>
=CM-5=
Under guidance of [[Charles Leiserson|Charles E. Leiserson]] and [[Bradley Kuszmaul|Bradley C. Kuszmaul]], the '''CM-5''', announced in 1991, switched from the CM-2's hypercubic architecture of simple processors to an entirely new [https://en.wikipedia.org/wiki/MIMD MIMD] architecture based on the [https://en.wikipedia.org/wiki/Fat_tree fat tree] <ref>[[Charles Leiserson|Charles E. Leiserson]] ('''1985'''). '' Fat-Trees: Universal Networks for Hardware-efficient Supercomputing''. [[IEEE#TOC|IEEE Transactions on Computers]], Vol. 34 , No. 10, [http://courses.csail.mit.edu/6.896/spring04/handouts/papers/fat_trees.pdf pdf]</ref> network of [[SPARC|SPARC]], and for the later CM-5E, SuperSPARC processors <ref>[https://www.top500.org/system/166997 CM-5/1024 | TOP500 Supercomputer Sites]</ref>.
=Chess=
[[Lewis Stiller]] used a CM-2 to generate certain chess six-piece [[Endgame Tablebases|endgame tablebases]] by massively parallel [[Retrograde Analysis|retrograde analysis]] <ref>[[Lewis Stiller]] ('''1996'''). ''Multilinear Algebra and Chess Endgames''. [http://library.msri.org/books/Book29/index.html Games of No Chance] edited by [[Richard J. Nowakowski]], [http://library.msri.org/books/Book29/files/stiller.pdf pdf]</ref>. CM-5 architects [[Charles Leiserson|Charles E. Leiserson]] and [[Bradley Kuszmaul|Bradley C. Kuszmaul]] were also co-authors of the parallel [[Massachusetts Institute of Technology|MIT]] chess programs [[StarTech]] and [[Star Socrates|*Socrates]]. StarTech played the [[ACM 1993]] on [[University of Illinois at Urbana-Champaign#NCSA|NCSA's]] 512-processor CM-5 <ref>[https://www.top500.org/system/167057 CM-5/512 | TOP500 Supercomputer Sites]</ref> for third place <ref>[http://groups.google.com/group/rec.games.chess/browse_frm/thread/45699b80a93fde41 1993 ACM International Computer Chess Championship (with corrections)] by [[Bradley Kuszmaul]], [[Computer Chess Forums|rec.games.chess]], February 19, 1993</ref>. Incorporating the ACM 1993 winner, the serial program [[Titan|Socrates II]] by [[Don Dailey]] and [[Larry Kaufman]], StarTech emerged to *Socrates, which played the [[ACM 1994]] on the CM-5/512 again to become third behind [[Deep Thought|Deep Thought II]] and [[Zarkov]]. At the [[WCCC 1995]] in [https://en.wikipedia.org/wiki/Hong_Kong Hong Kong], *Socrates played on a [[Paragon|Intel Paragon]], where it lost the [[WCCC 1995#Playoff|playoff]] versus [[Fritz]].
=Quotes=
Quote from ''History of *Socrates'' by [[Chris Joerg]] from his Ph.D. Thesis <ref>[[Chris Joerg|Christopher F. Joerg]] ('''1996'''). ''The Cilk System for Parallel Multithreaded Computing'' Ph. D. thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology|MIT]], [http://supertech.csail.mit.edu/papers/joerg-phd-thesis.pdf pdf]</ref> :
We began work on this program in May of 1994. [[Don Dailey]] and [[Larry Kaufman]] of [[Heuristic Software]] provided us with a version of [[Socrates]], their serial chess program. During May and June we parallelized the program using [[Cilk]], focusing mainly on the [[Search|search algorithm]] and the [[Transposition Table|transposition table]]. During June Dailey visited [[Massachusetts Institute of Technology|MIT]] to help tune the program, but we spent most of June simply getting the parallel version of the program to work correctly. In late June, we entered *Socrates in the [[ACM 1994|1994 ACM International Computer Chess Championship]] in Cape May, New Jersey. We ran the program on a 512-node [[Connection Machine|CM-5]] at the [[University of Illinois at Urbana-Champaign#NCSA|National Center for Supercomputing Applications]] (NCSA) at the [[University of Illinois at Urbana-Champaign|University of Illinois]]. Despite the fact that we had begun working on the program less than two months earlier, the program ran reliable and finished in third place.
=Chess Programs=
* [[StarTech]]
* [[Star Socrates|*Socrates]]
=See also=
* [[nCUBE]]
* [[Paragon]]
=Selected Publications=
==1985 ...==
* [[Mathematician#Hillis|W. Daniel Hillis]] ('''1985'''). ''The Connection Machine''. Ph. D. thesis, [[Massachusetts Institute of Technology|MIT]], advisors [[Mathematician#Sussman|Gerald Jay Sussman]], [[Claude Shannon]], and [[Marvin Minsky]], [https://dspace.mit.edu/bitstream/handle/1721.1/14719/18524280-MIT.pdf?sequence=2 pdf]
* [[Mathematician#Hillis|W. Daniel Hillis]] ('''1986'''). ''The Connection Machine''. [https://en.wikipedia.org/wiki/MIT_Press MIT Press], ISBN 0262081571, [https://www.amazon.com/Connection-Machine-Press-Artificial-Intelligence/dp/0262081571 Amazon]
* [http://dblp.uni-trier.de/pers/hd/t/Tucker:Lewis_W= Lewis W. Tucker], [https://en.wikipedia.org/wiki/George_G._Robertson George G. Robertson] ('''1988'''). ''Architecture and Applications of the Connection Machine''. [[IEEE#Computer|Computer]], Vol. 21, No. 8
* [https://en.wikipedia.org/wiki/Lennart_Johnsson S. Lennart Johnsson], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/k/Krawitz:Robert_L=.html Robert L. Krawitz], [[Roger Frye]], [http://dblp.uni-trier.de/pers/hd/m/MacDonald:Douglas Douglas MacDonald] ('''1989'''). ''A Radix-2 FFT on the Connection Machine''. [http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5348943 Supercomputing 89], [http://www.cs.yale.edu/publications/techreports/tr734.pdf pdf]
* [https://en.wikipedia.org/wiki/Lennart_Johnsson S. Lennart Johnsson], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/k/Krawitz:Robert_L=.html Robert L. Krawitz], [[Roger Frye]], [http://dblp.uni-trier.de/pers/hd/m/MacDonald:Douglas Douglas MacDonald] ('''1989'''). ''Cooley-Tukey FFT on the Connection Machine''. [http://www.journals.elsevier.com/parallel-computing/ Parallel Computing], [http://www.cs.yale.edu/publications/techreports/tr750.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Cooley%E2%80%93Tukey_FFT_algorithm Cooley–Tukey FFT algorithm from Wikipedia]</ref>
==1990 ...==
* [[Mathematician#EGelenbe|Erol Gelenbe]] ('''1990'''). ''[http://dl.acm.org/citation.cfm?id=98757 Performance Analysis of the Connection Machine]''. [[ACM#SIGMETRICS|ACM SIGMETRICS]], [https://assets.cs.ncl.ac.uk/seminars/81.pdf pdf]
* [http://dblp.uni-trier.de/pers/hd/t/Trew:Arthur_S= Arthur Trew], [[Greg Wilson]] (eds.) ('''1991'''). ''[http://link.springer.com/book/10.1007%2F978-1-4471-1842-8 Past, Present, Parallel: A Survey of Available Parallel Computing Systems]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Mark Bromley]], [http://dblp.uni-trier.de/pers/hd/h/Heller:Steven Steven Heller], [http://xenia.media.mit.edu/~mcnerney/ Tim McNerney], [[Mathematician#GSteele|Guy L. Steele Jr.]] ('''1991'''). ''[http://dl.acm.org/citation.cfm?id=113458 Fortran at ten gigaflops: the connection machine convolution compiler]''. [http://www.informatik.uni-trier.de/~ley/db/conf/pldi/pldi91.html#BromleyHMS91 PLDI '91]
* [http://dblp.uni-trier.de/pers/hd/m/Myczkowski:Jacek Jacek Myczkowski], [[Mathematician#GSteele|Guy L. Steele Jr.]] ('''1991'''). ''[http://dl.acm.org/citation.cfm?id=126004 Seismic modeling at 14 gigaflops on the connection machine]''. [http://dl.acm.org/citation.cfm?id=125826&picked=prox&CFID=67541071&CFTOKEN=91822939 Supercomputing '91]
* [[Charles Leiserson|Charles E. Leiserson]], [https://www.linkedin.com/in/zahi-abuhamdeh-703aab1 Zahi S. Abuhamdeh], David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, [[Mathematician#Hillis|W. Daniel Hillis]], [[Bradley Kuszmaul|Bradley C. Kuszmaul]], Margaret A. St. Pierre, David S. Wells, Monica C. Wong, Shaw-Wen Yang, Robert Zak ('''1992'''). ''The Network Architecture of the Connection Machine CM-5''. 4th ACM Symposium on Parallel Algorithms and Architectures, ('''1996'''). ''revised version''. [http://www.journals.elsevier.com/journal-of-parallel-and-distributed-computing Journal of Parallel and Distributed Computing], Vol. 33, No. 2
* [[Mathematician#Hillis|W. Daniel Hillis]], [http://dblp.uni-trier.de/pers/hd/t/Tucker:Lewis_W= Lewis W. Tucker] ('''1993'''). ''The CM-5 Connection Machine: A Scalable Supercomputer''. [[ACM#Communications|Communications of the ACM]], Vol. 36, No. 11
* [[Burton Wendroff]], [[Tony Warnock]], [[Lewis Stiller]], [[Dean Mayer]], [[Ralph Brickner]] ('''1993'''). ''Bits and pieces: constructing chess endgame databases on parallel and vector architectures''. Applied Numerical Mathematics, Vol. 12, Nos. 1-3
* [http://www.personal.psu.edu/lnl/ Lyle N. Long], [http://dblp.uni-trier.de/pers/hd/m/Myczkowski:Jacek Jacek Myczkowski] ('''1993'''). ''[http://dl.acm.org/citation.cfm?id=169627.169795&coll=DL&dl=GUIDE&CFID=67541071&CFTOKEN=91822939 Solving the Boltzmann Equation at 61 gigaflops on a 1024-Node CM-5]''. [http://www.personal.psu.edu/lnl/papers/bgk.pdf pdf]
* [https://en.wikipedia.org/wiki/Tamiko_Thiel Tamiko Thiel] ('''1994'''). ''[http://tamikothiel.com/theory/cm_txts/di-frames.html The Design of the Connection Machine]''. [http://www.mitpressjournals.org/loi/desi DesignIssues], Vol. 10, No. 1, [https://en.wikipedia.org/wiki/MIT_Press MIT Press]
* [[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology|MIT]], [http://supertech.csail.mit.edu/papers/thesis-kuszmaul.pdf pdf]
* [[Chris Joerg]], [[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Massively Parallel Chess''. Third DIMACS Parallel Implementation Challenge, [https://en.wikipedia.org/wiki/Rutgers_University Rutgers University], [http://supertech.csail.mit.edu/papers/dimacs94.pdf pdf]
* [[Michael Halbherr]], [[Yuli Zhou]], [[Chris Joerg]] ('''1994'''). ''[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.9812 MIMD-Style Parallel Programming with Continuation-Passing Threads]''. Proceedings of the 2nd International Workshop on Massive Parallelism: Hardware, Software, and Applications
==1995 ...==
* [[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1995'''). ''The StarTech Massively Parallel Chess Program''. [[ICGA Journal#18_1|ICCA Journal, Vol. 18, No. 1]], [http://supertech.csail.mit.edu/papers/startech.pdf pdf]
* [[Robert Blumofe]], [[Chris Joerg]], [[Bradley Kuszmaul]], [[Charles Leiserson]], [[Keith H. Randall]], [[Yuli Zhou]] ('''1995'''). ''Cilk: An Efficient Multithreaded Runtime System''. Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP) Santa Barbara, California Pg. 207–216, [http://supertech.csail.mit.edu/papers/PPoPP95.pdf pdf]
* [[Lewis Stiller]] ('''1995'''). ''Exploiting symmetry on parallel architectures''. Ph.D. thesis
* [[Chris Joerg]] ('''1996'''). ''The Cilk System for Parallel Multithreaded Computing'' Ph. D. thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology|MIT]], [http://supertech.csail.mit.edu/papers/joerg-phd-thesis.pdf pdf]
* [[Lewis Stiller]] ('''1996'''). ''Multilinear Algebra and Chess Endgames''. [http://library.msri.org/books/Book29/index.html Games of No Chance] edited by [[Richard J. Nowakowski]], [http://library.msri.org/books/Book29/files/stiller.pdf pdf]
=External Links=
* [https://en.wikipedia.org/wiki/Connection_Machine Connection Machine from Wikipedia]
* [http://longnow.org/essays/richard-feynman-connection-machine/ Richard Feynman and The Connection Machine] - [https://en.wikipedia.org/wiki/Long_Now_Foundation The Long Now]
* [http://www.computerhistory.org/revolution/supercomputers/10/73 The Connection Machine - CHM Revolution] from [[The Computer History Museum]]
* [http://www.tamikothiel.com/cm/ The Connection Machine] by [https://en.wikipedia.org/wiki/Tamiko_Thiel Tamiko Thiel]
* [http://www.corestore.org/cm200.htm Corestore collection: Connection Machine CM-200]
* [http://people.csail.mit.edu/bradley/cm5/ Gallery of Connection Machine CM-5 Images] hosted by [[Bradley Kuszmaul|Bradley C. Kuszmaul]]
* [http://people.csail.mit.edu/bradley/cm5docs/ CM-5 Manuals] hosted by [[Bradley Kuszmaul|Bradley C. Kuszmaul]]
* [https://www.top500.org/system/167057 CM-5/512 | TOP500 Supercomputer Sites]
* [https://www.top500.org/system/166997 CM-5/1024 | TOP500 Supercomputer Sites]
=References=
<references />
'''[[Hardware|Up one Level]]'''
