Student Workshop Abstract Template

Matthew Frank^{∗}

mfrank@lcs.mit.edu

MIT Laboratory for Computer Science

This is a sample latex template for abstracts submitted to the 1996 Student Workshop on Computing Technology. The workshop will be sponsored by the MIT Laboratory for Computer Science to promote an interchange of ideas among the various research activities at MIT related to scalable computing. This year’s student workshop will be entirely organized by students. Students � undergraduate, graduate, and postdoctoral � are encouraged to submit short, 2-page abstracts of recent technical accomplishments. Abstracts will be bound in a volume to be distributed at the workshop and which will later be available as an LCS technical report. About 18 of the submitted abstracts will be selected for presentation.

Please follow these instructions carefully. Submit a single-sided original (for reproduction) and 15 double-sided and 3-hole punched copies (for committee evaluation) of a 2-page abstract that brie�y describes the technical contributions of the work. The �rst page must begin with a title, the author’s name, and MIT and email addresses. Joint submissions by students are acceptable, but the student making the presentation should be listed as �rst author. Faculty coauthorship is not allowed, although student-written abstracts based on joint work with faculty members are permitted. The abstract should describe the essential ideas in the research and have a short bibliography that includes

Figure 1: A single-column �gure.

any published papers or technical memoranda on which the abstract is based. Every abstract should have at least one �gure, table, diagram, or photograph. A footnote on the bottom of the �rst page should identify the student’s faculty supervisor and acknowledge research support.

Figure 1 is an example of a �gure which is one column in width. Figure 2 is an example of a �gure which is two columns in width. These are cites for a book [4], a conference paper [6], a journal paper [3], a technical report [5], a thesis [1], and an unpublished manuscript [2].

∗Matt Frank is advised by Anant Agarwal and is supported in part by ARPA contract N00014-94-1-09885, by NSF Experimental Systems grant MIP-9012773, and by an NSF Presidential Young Investigator Award to Prof. Agarwal. Address:

Room 627, 545 Technology Square, Cambridge MA 02139.

Web: http://www.cag.lcs.mit.edu/ mfrank

Figure 2: A double-column �gure.

References

[1] Eric A. Brewer. Aspects of a high-performance parallel-architecture simulator. Master’s thesis, MIT, September 1991.

[2] David Culler, Andrea Dusseau, Seth Goldstein, Avind Krishnamurthy, Steven Lumetta, Thorsten von Eicken, and Katherine Yelic. Introduction to split-c. Version 1.0, April 1993.

[3] Joseph Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Transactions on Computers, 30(7):478�490, July 1981.

[4] F. T. Leighton. Introduction to parallel algorithms and architectures. Morgan Kaufmann, San Mateo, CA, 1992.

[5] Charles E. Leiserson. Vlsi theory and parallel supercomputing. MIT/LCS/TM 402, MIT, 545 Technology Sq., Cambridge, MA 02139, May 1989. Also appears as an invited presentation at the 1989 Caltech Decennial VLSI Conference.

[6] Charles E. Leiserson et al. The network architecture of the connection machine CM-5.

In Symposium on Parallel Architectures and Algorithms, pages 272�285, San Diego, California, June 1992. ACM.