ACM Student Research Competition
Important DatesAbstract submission: 11:59pm Eastern Time Friday June 21, 2013 Acceptance notification: 11:59pm Eastern Time Friday July 12, 2013
Submissions to the PACT 2013 ACM Student Research Competition (SRC) must be submitted electronically at the following site:
The submission should be in pdf format, not exceeding 1 page, and not exceeding 800 words. Figures and References are fine, and must fit within the single page. Please feel free to use this latex template to format your paper in this style. Blind submissions are fine, but not required.
The 21st International Conference on Parallel Architectures and Compilation Techniques (PACT) invites participation in the ACM Student Research Competition (SRC). Sponsored by ACM and Microsoft Research, the SRC is a forum for undergraduates and graduate students to share their research results, exchange ideas, and improve their communication skills while competing for prizes. Students accepted to participate in the SRC are entitled to a travel grant (up to $500) to help cover travel expenses. The top 3 undergraduate and graduate winners will receive all of the following prizes:
- Monetary prizes of $500, $300, and $200, respectively.
- An award plaque and a two-year complimentary ACM membership with a subscription to ACM's Digital Library.
- The names and research abstracts of the winners will be posted on the ACM SRC web site.
- An invitation to participate in the SRC Grand Finals, an on-line round of competitions among the winners of individual conference-hosted SRCs. The top three graduate and undergraduate Grand Finalists will receive an additional $500, $300, and $200, respectively, along with Grand Finalist plaques. Grand Finalists and their advisors will be invited to the Annual ACM Awards Banquet for an all-expenses-paid trip, where they will be recognized for their accomplishments, along with other prestigious ACM award winners, including the winner of the Turing Award.
The SRC consists of two rounds: a poster session and a presentation session. A panel of judges will select a number of finalists from the poster session, who will be invited to the presentation session at PACT 2013 and compete for the prizes. The evaluation will be concentrated on the quality of both visual and oral presentation, the research methods, and the significance of contribution. You can find more information on the ACM Student Research Competition site.
EligibilityA participant in the SRC must meet all following conditions:
- The participant must submit an up to 800-word abstract outlining the content of a poster that is going to be presented during the competition. The abstract must include the poster title, author names, affiliations, and the name of the academic advisor. It should describe the research problem, motivation and background, techniques and results, and the prospect for clearly and concisely conveying the work in a poster format. It should state the novelty and contributions of the work explicitly. The submission deadline is Friday June 21, 2013, at 11:59 pm US Eastern Time.
- The abstract can have some overlap with previous publications (including PACT-2013), but some significant part of it must have not appeared before. Novelty is one of the criteria for selection.
- The abstract and the poster must be authored solely by the participant.
- The participant must be an ACM student member, and must maintain an undergraduate or graduate student status as of June 21, 2013. Please indicate whether you are an undergraduate or graduate student.
ContactFor questions regarding the submission process, or for additional information, clarifications, or questions, please contact the ACM Student Research Competition Chair, Erik Altman.
SponsorsThe ACM Student Research Competition at PACT-2013 is sponsored by the ACM and Microsoft Research.
Winners from 2012
- Transactional Event Profiling in a Best-Effort Hardware Transactional Memory System: Matthew Gaudet, University of Alberta
- Efficient Data Compression for Memory Hierarchies: Gennady Pekhimenko, Carnegie Mellon University
- Transparent Runtime Deadlock Elimination: Hari K. Pyla, Virginia Tech