Difference between revisions of "Star Socrates"
|Line 43:||Line 43:|
|Line 61:||Line 59:|
'''[[Engines|Up one Level]]'''
'''[[Engines|Up one Level]]'''
Revision as of 21:44, 2 September 2018
a parallel chess program, developed by a team from MIT and Sandia National Laboratories  headed by Charles Leiserson. Primary programmers were Don Dailey, co-author of Socrates and Titan aka Socrates II, on which *Socrates was based on, and Chris Joerg. Further contributers were Robert Blumofe, Matteo Frigo, Larry Kaufman, Bradley Kuszmaul, Keith H. Randall, Eric Brewer, Michael Halbherr, Rolf Riesen (Sandia) and Yuli Zhou.
Massively Parallel Chess
Computer chess provides a good testbed for understanding dynamic MIMD-style computations. To investigate the programming issues, we engineered a parallel chess program called *Socrates, which running on NCSA's 512 processor CM-5, tied for third in the 1994 ACM International Computer Chess Championship. *Socrates uses the Jamboree algorithm to search game trees in parallel and uses the Cilk 1.0 language and run-time system to express and to schedule the computation. In order to obtain good performance for chess, we use several mechanisms not directly provided by Cilk, such as aborting computations and directly accessing the active message layer to implement a global transposition table distributed across the processors. We found that we can use the critical path C and the total work W to predict the performance of our chess programs. Empirically *Socrates runs in time
T ≈ 0.95C + 1.09W/P on P processors. For best-ordered uniform trees of height h and degree d the average available parallelism in Jamboree search is ϴ((d/2)h/2) *Socrates searching real chess trees under tournament time controls yields average available parallelism of over 1000.
History of *Socrates
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 algorithm and the transposition table. During June Dailey visited 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 1994 ACM International Computer Chess Championship in Cape May, New Jersey. We ran the program on a 512-node CM-5 at the National Center for Supercomputing Applications (NCSA) at the 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.
by Chris Joerg from his Ph. D. thesis:
I am especially grateful to my thesis supervisor, Professor Charles Leiserson, who has led the Cilk project. I still remember the day he came to my office and recruited me. He explained how he realized I had other work to do but he wanted to know if I would like to help out part time" on implementing a chess program using PCM. It sounded like a interesting project, so I agreed, but only after making it clear that I could only work part time because I had my thesis project to work on. Well, part time" became full time", and at times full time" became much more than that. Eventually, the chess program was completed, and the chess tournament came and went, yet I still kept working on the PCM system (which was now turning into Cilk). Ultimately, I realized that I should give up on my other project and make Cilk my thesis instead. Charles is a wonderful supervisor and under his leadership, the Cilk project has achieved more than I ever expected. Charles' influence can also be seen in this write-up itself. He has helped me turn this thesis into a relatively coherent document, and he has also pointed out some of my more malodorous grammatical constructions.
The Cilk project has been a team effort and I am indebted to all the people who have contributed in some way to the Cilk system: Bobby Blumofe, Feng Ming Dong, Matteo Frigo, Shail Aditya Gupta, Michael Halbherr, Charles Leiserson, Bradley Kuszmaul, Rob Miller, Keith Randall, Rolf Riesen, Andy Shaw, Richard Tauriello, and Yuli Zhou. Their contributions are noted throughout this document.
I thank, along with the members of the Cilk team, the past and present members of the Computation Structures Group. These friends have made MIT both a challenging and a fun place to be. In particular I should thank Michael Halbherr. He not only began the work that lead to the PCM system, but he tried many times to convince me to switch my thesis to this system. It took a while, but I finally realized he was right.
I am also indebted to Don Dailey and Larry Kaufman, both formerly of Heuristic Software. They wrote the serial Socrates program on which *Socrates is based. In addition, Don and I spent many long nights debugging, testing, and improving (or at least trying to improve) *Socrates. Most of this time we even had fun.
Professor Arvind, Dr. Andy Boughton, and Dr. Greg Papadopoulus also deserve many thanks. They provided me the freedom, encouragement, and support to work on a wide range of exciting projects throughout my years at MIT.
The Star Socrates 2.0 chess program developed at the MIT Laboratory for Computer Science, will be running on the 1824 node Intel Paragon parallel supercomputer located at Sandia National Laboratories. The lead programmers are Don Bailey and Christopher F.Joerg and the project team is lead by Prof. Leiserson. Heuristic Software provided the original Socrates program on which StarSocrates was originally based. The Paragon is about 50 feet long and weighs about 30,000 pounds. Each node consists of two 50MHz i860 processors with either 16 or 32MB of memory. The program currently runs on both the Connection Machine CM-5 and the Intel Paragon.
Awards for Cilk Technology & Research  :
1995, Second Place in the 1995 International Computer Chess Association's Eighth Computer Chess World Championship for *Socrates 2.0, a chess-playing program written in Cilk.
- Chris Joerg, Bradley Kuszmaul (1994). Massively Parallel Chess. Proceedings of the Third DIMACS Parallel Implementation Challenge, 1994, pdf
- Bradley Kuszmaul, Alan Sherman (1995). *Socrates 2.0 Beats Grandmaster Sagalchik. ICCA Journal, Vol. 18, No. 2
- 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), pdf
- Chris Joerg (1996). The Cilk System for Parallel Multithreaded Computing. Ph. D. thesis, Department of Electrical Engineering and Computer Science, MIT, pdf
- Bust of Socrates. Marble, Roman copy after a Greek original from the 4th century BC. From the Quintili Villa on the Via Appia, Socrates from Wikipedia
- 8th World Computer Chess Championship, pdf, Courtesy of Monroe Newborn, The Computer History Museum
- Chris Joerg, Bradley Kuszmaul (1994). Massively Parallel Chess. Proceedings of the Third DIMACS Parallel Implementation Challenge, pdf
- Chris Joerg (1996). The Cilk System for Parallel Multithreaded Computing Ph. D. thesis, Department of Electrical Engineering and Computer Science, MIT, pdf
- Star Socrates' ICGA Tournaments
- Awards for Cilk Technology & Research