The following is the program for PODC 2002.
Note that this program differs from that of other recent PODCs in that the Sunday program contains, in addition to a tutorial and a reception, half a day of technical sessions. The conference ends at midday on Wednesday. You should plan your travel accordingly.
July 21, 2002, Sunday
10:00 - 12:00 Tutorial
On the Cost of Fault-Tolerant Consensus When There Are No Faults
Idit Keidar and Sergio Rajsbaum12:00 - 13:45 Lunch (on your own) 14:00 - 14:05 Opening Remarks
Keith Marzullo, Program Chair 14:05 - 15:0515:05 - 15:25 Break 15:25 - 17:05 Session 1 (Chair: Prasad Jayanti) Nonatomic Mutual Exclusion with Local Spinning
James H. Anderson and Yong-Jik Kim
Winner of Best Student-Paper AwardSpace-Optimal Multi-Writer Snapshot Objects Are Slow
Panagiota Fatourou, Faith Fich, and Eric RuppertSafe Memory Reclamation for Dynamic Lock-Free Objects Using Atomic Reads and Writes
Maged M. MichaelNon-Blocking Timeout in Scalable Queue-Based Spin Locks
Michael L. Scott17:30 - 19:30 Reception July 22, 2002, Monday
9:00 - 10:00 Invited Presentation
Peer-to-peer computing: a new direction in distributed computing
Frans Kaashoek, M.I.T.10:00 - 10:20 Break 10:20 - 12:00 Session 2 (Chair: Michael Mitzenmacher) Establishing Wireless Conference Calls Under Delay Constraints
Amotz Bar-Noy, Grzegorz MalewiczEfficient algorithms for leader election in radio networks
Tomasz Jurdzinski, Miroslaw Kutylowski, Jan ZatopianskiGS3: Scalable Self-configuration and Self-healing in Wireless Networks
Hongwei Zhang and Anish AroraLexicographically Optimal Smoothing for Broadband Traffic Multiplexing (PDF, postscript)
Stergios Anastasiadis, Peter Varman, Jeffrey Scott Vitter, Ke Yi12:00 - 13:45 Lunch (hosted by PODC) 13:45 - 15:50 Session 3 (Chair: Idit Keidar) Optimal Plans for Aggregation
Andrei Broder and Michael MitzenmacherThe Inherent Price of Indulgence
Partha Dutta and Rachid GuerraouiMinimal Replication Cost for Availability
Haifeng Yu and Amin VahdatBuilding secure file systems out of Byzantine storage
David Mazières and Dennis ShashaDetectable Byzantine Agreement Secure Against Faulty Majorities
Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, and Adam Smith15:50 - 16:10 Break 16:10 - 17:20 Session 4 (Chair: Eli Gafni) Building Responsive TMR-Based Servers in Presence of Timing Constraints
Paul Ezhilchelvan, Jean-Michel Hélary, Michel RaynalExploiting Precision vs. Efficiency Tradeoffs in Symmetric Replication Environments
Ugur Cetintemel, Peter Keleher, and Yanif AhmadTowards a Formal Model for View Maintenance in Data Warehouses
Achour Mostéfaoui, Michel Raynal, Matthieu Roy, Divyakant Agrawal, Amr El AbbadiA highly concurrent group mutual l-exclusion algorithm
K. VidyasankarDynamic-Sized Lock-Free Data Structures
Maurice Herlihy, Victor Luchangco, Paul Martin, Mark MoirOptimally Work-Competitive Scheduling for Cooperative Computing with Merging Groups
Chryssis Georgiou, Alexander Russell and Alex A. ShvartsmanAssignment-based Partitioning in a Condition Monitoring System
Yongqiang Huang and Hector Garcia-Molina17:20 - 20:00 Dinner (on your own) 20:00 - 22:30 Business Meeting, PODC Influential Paper Award Presentation, and Rump Session July 23, 2002, Tuesday
8:30 - 10:10 Session 5 (Chair: Ajay Kshemkalyani) Nearly Optimal FIFO Buffer Management for DiffServ
Zvi Lotker and Boaz Patt-ShamirActive Disk Paxos with infinitely many processes
Gregory Chockler and Dahlia MalkhiSearching for a Black Hole in Arbitrary Networks: Optimal Mobile Agent Protocols
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola SantoroGeneral Perfectly Periodic Scheduling
Zvika Brakerski, Aviv Nisgav, and Boaz Patt-Shamir10:10 - 10:30 Break 10:30 - 12:10 Session 6 (Chair: Michael Greenwald) A BGP-based Mechanism for Lowest-Cost Routing (postscript, PDF)
Joan Feigenbaum, Christos Papadimitriou, Rahul Sami, Scott ShenkerViceroy: A Scalable and Dynamic Emulation of the Butterfly
Dahlia Malkhi, Moni Naor and David RatajczakOn Perfectly Secure Communication over Arbitrary Networks
M V N Ashwin Kumar, Pranava Raja Goundan, K Srinathan, C Pandu RanganSequential Composition of Protocols without Simultaneous Termination
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin12:10 - 13:50 Lunch (hosted by PODC) 13:50 - 15:30 Session 7 (Chair: Aleta Ricciardi) Squirrel: A decentralized peer-to-peer web cache (project web page)
Sitaram Iyer, Antony Rowstron, and Peter DruschelFault-tolerant Routing in Peer-to-peer Systems
James Aspnes, Zoe Diamadi, Gauri ShahAnalysis of the Evolution of Peer-to-Peer Systems
David Liben-Nowell, Hari Balakrishnan and David KargerEvaluating the Running Time of a Communication Round over the Internet
Omar Bakr and Idit Keidar15:30 - 15:50 Break 15:50 - 17:00 Session 8 (Chair: Yi-Min Wang) Asynchronous Interactive Consistency and its Relation with Error-Correcting Codes
Achour Mostefaoui, Sergio Rajsbaum, Michel RaynalSelective Anti-Entropy
Weibin Zhao and Henning SchulzrinneCompact Routing for Average-Case Networks (longer draft)
Kazuo Iwama and Masaki OkitaHow to wait when you are not going to block
Michael GreenwaldUnderstanding Perfect Failure Detectors
Mikel LarreaEarly Stopping in Global Data Computation
Carole Delporte-Gallet, Hugues Fauconnier, Jean-Michel Hélary, Michel RaynalRandom Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks (link to page with full paper)
Shlomi Dolev, Elad Schiller, and Jennifer Welch18:30 - 21:00 Banquet July 24, 2002, Wednesday
9:00 - 10:00 Invited Presentation
Global Content Delivery
Bruce Maggs, Akamai and Carnegie-Mellon University10:00 - 10:20 Break 10:20 - 12:00 Session 9 (Chair: Sergio Rajsbaum) Two-Handed Emulation: How to build non-blocking implementations of complex data-structures using DCAS
Michael B. Greenwaldf-Arrays: Implementation and Applications
Prasad JayantiNon-Blocking Steal-half Work Queues
Danny Hendler and Nir ShavitDynamic and Self-Stabilizing Distributed Matching
Subhendu Chattopadhyay, Lisa Higham, Karen Seyffarth12:00 Concluding Remarks
Keith Marzullo, Program Chair12:10 Conference adjourns
The links in this document should provide you with access to the fullest versions of the papers that are available. In some cases, different versions are listed. Please consult the authors' home pages (if indicated) for further information and for email address by which you might inquire for future versions or related papers. If you find the links to be broken, please contact the authors (and not PODC).
Authors of PODC papers wishing to be listed here should send email with the appropriate URL's to Gil Neiger (gil AT acm dot org).
Last modified: August 2, 2002