skip to main content
10.1145/1989493acmconferencesBook PagePublication PagesspaaConference Proceedingsconference-collections
SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
ACM2011 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
SPAA '11: 23rd ACM Symposium on Parallelism in Algorithms and Architectures San Jose California USA June 4 - 6, 2011
ISBN:
978-1-4503-0743-7
Published:
04 June 2011
Sponsors:
In-Cooperation:
EATCS
Next Conference
Bibliometrics
Skip Abstract Section
Abstract

This volume consists of papers that were presented at the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'11), held on June 4-6, 2011, in San Jose, USA. It was sponsored by the ACM Special Interest Groups on Algorithms and Computation Theory (SIGACT) and Computer Architecture (SIGARCH) and organized in cooperation with the European Association for Theoretical Computer Science (EATCS). SPAA'11 is part of the Federated Computing Research Conference (FCRC'11). Financial support was provided by Akamai and IBM Research.

The program committee selected the 35 SPAA'11 regular presentations following electronic discussions and a day-long phone conference on March 4, 2011 that was graciously arranged by IBM Research. Of these papers, the paper "Graph Expansion and Communication Costs of Fast Matrix Multiplication" by Grey Ballard, James Demmel, Olga Holtz and Oded Schwartz was selected to receive the best paper award.

The regular presentations were selected out of 116 submitted abstracts. The mix of selected papers reflects the unique nature of SPAA in bringing together the theory and practice of parallel computing. SPAA defines parallelism very broadly to encompass any computational device or scheme that can perform multiple operations or tasks simultaneously or concurrently. The technical papers in this volume are to be considered preliminary versions, and authors are generally expected to publish polished and complete versions in archival scientific journals.

In addition to the regular presentations, this volume includes 15 brief announcements. The committee's decisions in accepting brief announcements were based on the perceived interest of these contributions, with the goal that they serve as bases for further significant advances in parallelism in computing. Extended versions of the SPAA brief announcements and posters may be published later in other conferences or journals. Finally, this year's program also included a panel discussion on teaching parallelism, featuring panelists Guy Blelloch, Charles Leiserson, Paul Petersen, Nir Shavit, and Uzi Vishkin, with Christian Scheideler as moderator.

Contributors
  • Paderborn University
  • Northeastern University
Index terms have been assigned to the content through auto-classification.

Recommendations

Acceptance Rates

Overall Acceptance Rate447of1,461submissions,31%
YearSubmittedAcceptedRate
SPAA '191093431%
SPAA '181203630%
SPAA '171273124%
SPAA '151313124%
SPAA '141223025%
SPAA '131303124%
SPAA '031063836%
SPAA '01933437%
SPAA '00452453%
SPAA '99902629%
SPAA '98843036%
SPAA '97973233%
SPAA '961063937%
SPAA '951013131%
Overall1,46144731%