18th ACM Symposium on Parallelism in Algorithms and Architectures

Cambridge, MA, USA
July 30 - August 2, 2006

The 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '06) is 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.

The SPAA Symposium was called the ACM Symposium on Parallel Algorithms and Architectures from 1989 to 2002. The new name reflects the expanded scope of the conference as detailed below.

SPAA '06 will feature regular papers, each with a 25-minute talk, and brief announcements, each with a 10-minute talk. The SPAA brief announcements are for brief communications including work in progress or demos.

In a tradition starting in 2001, SPAA defines "parallel" very broadly to encompass any computational system, or model, that can perform multiple operations or tasks simultaneously. As a consequence, contributed papers are sought in ALL areas of parallel algorithms and architectures, and of related fields for SPAA 2006. This includes traditional parallel and distributed algorithms and architectures, plus new aspects including the internet, the web, peer-to-peer networks, sensor networks, quantum and DNA computing, etc.

A renaissance of parallel computing research is on the horizon since: (i) chip multi-cores are the wave of the future for all major hardware vendors, (ii) since 2003 clock frequency of CPUs is hardly advancing any more, (iii) the 6-decade quest for an easy-to-program parallel architecture paradigm is yet to provide a competitive alternative to the serial paradigm. Contributed papers on algorithmics, software and/or hardware that address this emerging renaissance are particularly welcome for SPAA 2006.

• Call for Papers (in pdf or postscript)
• Paper Submission
• Conference Program     The SPAA program is now available. Last update 07/27.
• Registration
• Local Information