[Date Prev][Date Next][Date Index]
CFP: 21st Annual ACM SIGACT-SIGOPS Symposium on PRINCIPLES OF DISTRIBUTED COMPUTING (PODC 2002), July 20 - 24, 2002, Monterey, California
- From: "K. Pawlikowski" <email@example.com>
- Subject: CFP: 21st Annual ACM SIGACT-SIGOPS Symposium on PRINCIPLES OF DISTRIBUTED COMPUTING (PODC 2002), July 20 - 24, 2002, Monterey, California
- Date: Sun, 13 Jan 2002 20:31:05 +1300
***************** CALL FOR PAPERS *****************
Twenty-First Annual ACM SIGACT-SIGOPS Symposium on
PRINCIPLES OF DISTRIBUTED COMPUTING (PODC 2002)
July 20 - 24, 2002, Monterey, California
* Submission deadline: January 27, 2002
(!!! The PODC 2002 paper submission site is now open. !!!)
* Acceptance notification: April 9, 2002
* Camera-ready copy due: April 9, 2002
We are soliciting research contributions on the design, specification,
implementation, application and theory of distributed systems.
We are continuing to broaden the conference by actively seeking papers
reporting on the implementation, analysis, evaluation, and deployment
of real systems. We will favor work that explores new territory or
on experience with practical applications of the community's knowledge.
Topics of interest include, but are not limited to, the following:
* Distributed middleware platforms, operating systems, and databases
* Multiprocessor/cluster architectures, algorithms, and performance
* Distributed computing issues in the Internet and the Web
* Hardware, software, and compiler support for coordination and
* Mobile computing
* Communication network protocols and architectures
* High-performance distributed computing and the computational grid
* Distributed algorithms and their complexity
* Fault tolerance and availability in distributed systems
* Distributed cryptographic and security protocols
* Specification, semantics, and verification of distributed systems
Conference presentations will have two formats:
Regular presentations of approximately 25 minutes accompanied by
papers of up to 10 pages in the proceedings. This format is intended
for contributions reporting on original research, submitted exclusively
to this conference.
Brief announcements of approximately 10 minutes accompanied by
one-page abstracts in the proceedings. This format is a forum for
brief communications, which may be published in other conferences.
Longer versions expanding the brief announcements will be collected
at a web site.
HOW TO SUBMIT
Electronic submissions are encouraged; information on how to submit
electronically will be available on the web site by January 10, 2002.
Authors unable to submit electronically should contact the program
Keith Marzullo, by email, firstname.lastname@example.org, to receive instructions.
All electronic submissions must be in postscript, and capable of being
previewed by ghostview. The cover page should include title,
authors and affiliation, postal and e-mail address of the contact
a brief abstract describing the work, and at the bottom of the brief
abstract, in boldface, an indication of non-student or student status,
and an indication if this is a regular presentation or brief
It is recommended that each submission begin with a succinct statement
of the problem, summary of the main results, and a brief explanation of
their significance, all suitable for a non-specialist. Technical
development of the work, directed to the specialist, should follow.
A submission for the REGULAR PRESENTATION format should be no
longer than 4,500 words (10 pages on letter-size paper using at least
11-point font). Additional necessary details may be included in a
marked appendix that will be read at the discretion of the program
A submission for the BRIEF ANNOUNCEMENT format should be no longer
than three pages. Authors of accepted brief announcements will have the
option of placing a full version of their work on the conference web
If requested by the authors, an extended abstract that is not selected
regular presentation will also be considered for the brief announcement
format. Such a request will not affect consideration of the paper for a
Extended abstracts deviating significantly from these guidelines will be
rejected without consideration of their merits. Late papers will not be
read or considered.
BEST STUDENT PAPER AWARD
A prize will be given to the best student paper. A paper is eligible if
at least one author is a full-time student at the time of submission.
This must be noted on the cover page. The program committee may
decline to make the award or split it.
Andrea Arpaci-Dusseau: U. Wisc. Madison
Michael Dahlin: U. Texas Austin
Shlomi Dolev: Ben-Gurion U.
Alan Fekete: U. Sydney
Ian Foster: Argonne & U. Chicago
Eli Gafni: U. Calif. Los Angeles
Michael Greenwald: U. Penn.
Rachid Guerraoui: EPF Lausanne
Prasad Jayanti: Dartmouth
Idit Keidar: MIT & Technion
Ajay Kshemkalyani: U. Illinois Chicago
Keith Marzullo: U. Calif. San Diego, Chair
Michael Mitzenmacher: Harvard
Sergio Rajsbaum: Compaq & UNAM
Michael Reiter: CMU
Aleta Ricciardi: Valaran Corp.
Alex Shvartsman: U. Connecticut
Marvin Theimer: Microsoft Research
Yi-Min Wang: Microsoft Research
Roger Wattenhofer: ETH Zurich
Jeannette Wing: CMU
Elizabeth Borowsky: Boston Coll., Treasurer
Rajeev Joshi: Compaq SRC, Local Arrangements Chair
Hyunyoung Lee: U. Denver, Publicity Chair
Keith Marzullo: U. Calif. San Diego, Program Chair
Gil Neiger: Intel Labs, Webmaster
Aleta Ricciardi: Valaran Corp., General Chair
James Anderson: U. North Carolina
Elizabeth Borowsky: Boston Coll.
Keith Marzullo: U. Calif. San Diego
Yoram Moses: Technion
Gil Neiger: Intel Labs, Chair
Aleta Ricciardi: Valaran Corp.
Nir Shavit: Tel-Aviv U. & Sun Labs
PODC 2002 Publicity Chair
This message is forwarded to members of the COSC/EEE/Management research
group on networks at the University of Canterbury, Christchurch,
New zealand, and anybody else interested in research in this area
Associate Professor Dr Krzysztof Pawlikowski
Department of Computer Science, University of Canterbury
Christchurch, New Zealand
ph. +(64) 3 3642 987 ext.7772 email: email@example.com
fax. +(64) 3 3642 569 URL: http://www.cosc.canterbury.ac.nz/~krys