
Many of the world's fastest computer systems are PC or workstation clusters. Numerous research groups in academia, industry, and government are currently engaged in cluster research, seeking new ways to advance the state of the art of cluster communication. The goal of the CAC workshop is to bring together researchers and practitioners working in the areas of communication hardware and software to discuss their latest findings as well as future trends in the design of scalable, high-performance, and cost-effective communication architectures for clusters.
Topics of interest for the workshop include but are not limited to the following:
Results of both theoretical and practical significance will be considered.
The proceedings of this workshop will be published together with the proceedings of other IPDPS 2006 workshops by the IEEE Computer Society Press.
Submitted manuscripts may not exceed eight single-spaced pages using a 12-point font on 8½×11-inch pages, everything included (figures, tables, references, etc.). Hardcopy submissions will be accepted, but files in either PostScript (level 2) or PDF format are strongly encouraged. Authors need to make sure that the electronically submitted files are formatted for 8½×11-inch paper. Submissions will be judged on correctness, originality, technical strength, significance, quality of presentation, and interest and relevance to the workshop attendees. Submitted papers may not have appeared in or be under consideration for another workshop, conference, or journal.
| Paper submission: | 10 October 2005 | Extended to 17 October 2005 |
|---|---|---|
| PC reviews due: | 28 November 2005 | Extended to 5 December 2005 |
| Notification of acceptance: | 12 December 2005 | Extended to 19 December 2005 |
| Camera-ready due: | 21 January 2006 | Now due 13 January 2006 |
For more information on CAC 2006 or if you have any questions please contact the workshop organizers at the e-mail addresses listed at the bottom of this page.
A single-page PDF version of this Web page is available below: