Supertech Research Group

From SuperTech Wiki

(Difference between revisions)
Jump to: navigation, search
(Research Support)
Line 7: Line 7:
== <br>In the News...==
== <br>In the News...==
-
[http://www.memorialsolutions.com/sitemaker/memsol.cgi?page=profile&section=info&user_id=1170629 "Don Dailey"], chess-programming whiz and author of the Supertech programs *Socrates and Cilkchess, as well as of the more recent program [http://komodochess.com/ "Komodo"], died of leukemia at age 57 on November 22, 2013.  He was a talented programmer, a good friend, and a fine role model for budding performance engineers.  He will be greatly missed by all who knew him.
+
See [http://supertech.mit.edu] for the news.
-
[http://web.mit.edu/newsoffice/2011/introduction-to-algorithms-500k-0810.html "Milestone for MIT Press’s bestseller"], MIT News Office, August 16, 2011
 
-
<br>What began as lecture notes for an MIT computer-science class has become the standard text in the field, selling half a million copies in 20 years.
 
-
 
-
[http://web.mit.edu/newsoffice/2011/multicore-series-3-0225.html "Retooling Algorithms"], MIT News Office, February 25, 2011
 
-
<br>Charles Leiserson and his team are experts at designing parallel algorithms - including one for a chess-playing program that outperformed IBM's Deep Blue.
 
== <br>Research Support ==
== <br>Research Support ==
-
Support for Supertech is provided in part by the [http://www.nsf.gov/dir/index.jsp?org=CISE National Science Foundation] (NSF) under Grant
+
See [http://supertech.mit.edu/research-support] for who supports us.
-
* [http://www.nsf.gov/awardsearch/showAward?AWD_ID=1314547 1314547] (SHF: AF: Large: Collaborative Research: Parallelism without Concurrency).
+
-
 
+
-
Previous NSF grants have included
+
-
[http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=0937860 0937680],
+
-
[http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=1162148 1162148],
+
-
[http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=1017058 1017058],
+
-
[http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=0324974 0324974],
+
-
[http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=0305606 0305606],
+
-
[http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=0540248 0540248],
+
-
[http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=0541209 0541209],
+
-
[http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=0621511 0621511], and
+
-
[http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=0615215 0615215].
+
== <br>Opportunities for Students ==
== <br>Opportunities for Students ==

Revision as of 18:58, 30 June 2015

Supertech is a research group in MIT's Computer Science and Artificial Intelligence Laboratory. The Supertech Research Group investigates the technologies that support scalable high-performance computing, including hardware, software, and theory. The goal is to make scalable computing simpler, faster, and more effective. The group is currently engaged in developing tools to simplify parallel computing, such as the Cilk multithreaded programming platform and its related tools for programmer productivity. In addition, we are developing parallel applications, focusing in particular on irregular problems such as graph applications. The group also studies adaptive computing, race detection, and cache-oblivious algorithms.

Our Motto: "Advancing the state of computing P steps at a time."


Contents


In the News...

See [1] for the news.



Research Support

See [2] for who supports us.


Opportunities for Students


Current Positions:

MIT undergraduates interested in working in the Supertech group on parallel programming and algorithms should submit the following materials:

  • Resume
  • Grade report
  • Sample of your code (preferably C/C++)
  • Sample of your technical writing
  • Cover note with any additional information

Please send these materials to Professor Leiserson. Generally, we expect that students have taken 6.172, but exceptions can be made.


Summer Internships:

We get quite a bit of email from foreign students looking for summer internships in our research group. We have no positions available, and we request that you refrain from sending us email requesting special treatment.


Prospective PhD Students:

We frequently get emails from prospective Ph.D. students asking if there are openings in the Supertech Research Group. We are not equipped to handle the overwhelming number of such requests. Moreover, individual professors at MIT are not involved with the application process. If you are interested in joining the Supertech Research Group, please contact the MIT Electrical Engineering and Computer Science (EECS) department's Graduate Admissions directly by telephone at +1 617.253.2917 or by email at either mitgrad@mit.edu or grad-ap@eecs.mit.edu and request an application. After a student has been admitted into the Ph.D. program in the EECS department at MIT, the student will then be invited to visit MIT to discuss research opportunities with various potential Ph.D. advisors, and we will be happy to discuss research interests at that time.


Contact Us

Supertech can be reached through

Cree Bruins
MIT Computer Science and Artificial Intelligence Laboratory
The Stata Center, Building 32-G764
32 Vassar Street
Cambridge, MA 02139 USA
Tel: +1 617.253.2629
For information on Supertech or this website, please email Cree Bruins.

Our group is located in the Ray and Maria Stata Center (MIT Building 32), on the 7th floor of the Gates tower. Detailed directions to CSAIL are available.


Web-Site Translations

Belorussian translation provided by webhostingrating.com.

Personal tools
Members Only
Off Topic