Workshop on Complexity Issues in Parallel and Distributed Computation
Description
Distributed and parallel computation are important aspects of modern computing. However, the complex interactions that may arise make it difficult to obtain correct and efficient algorithms. This workshop will bring together prominent researchers who want to develop a deeper understanding of the fundamental computational problems in these areas and techniques to solve them. Various theoretical models of parallel and distributed computation, encompassing both shared memory and communication networks, will be considered. Topics will include relationships among these models, what problems are solvable in these models, and how efficiently certain problems can be solved in these models.
Program Committee:
Faith Fich
Evangelos Kranakis
Danny Krizanc
Nicholas Pippenger
Nicola Santoro
Workshop Speakers:
- Michael Ben-Or, Hebrew University
- Gianfranco Bilardi, University of Padova, University of Illinois
- Martin Dietzfelbinger, Technische Universit�t Illmenau
- Maurice Herlihy, Brown University
- Prasad Jayanti, Dartmouth College
- Evangelos Kranakis, Carleton University
- Mirek Kutylowski, University of Wroclaw
- Nancy Lynch, Massachusetts Institute of Technology
- Bruce Maggs, Carnegie Mellon University
- Marios Mavronikolas, University of Cyprus
- Shlomo Moran, Technion, University of Arizona
- Michael Paterson, University of Warwick
- Sergio Rajsbaum, Universidad Nacional Autonoma de Mexico
- Vijaya Ramachandran, University of Texas at Austin
- R�diger Reischuk, Medizinische Universit�t zu Lubeck
- Eric Ruppert, University of Toronto
- Nicola Santoro, Carleton University
- Nir Shavit, Tel-Aviv University
- Ramesh Sitaraman, University of Massachusetts
- Sam Toueg, Cornell University
- Eli Upfal, Brown University
- Rolf Wanka, University of Paderborn
Schedule
08:30 to 09:30 |
REGISTRATION
Location:The Fields Institute |
09:30 to 10:30 |
On Communication Cost in Synchronous and Asynchronous Networks
Martin Dietzfelbinger, Technische Universit�t Illmenau Location:The Fields Institute |
10:30 to 11:00 |
Coffee break
|
11:00 to 12:00 |
Bit Complexity of Breaking and Achieving Symmetry
Shlomo Moran, Technion, University of Arizona Location:The Fields Institute |
12:00 to 13:30 |
Lunch
|
13:30 to 14:30 |
Complexity Results for General-Purpose Models of Parallel Computation
Vijaya Ramachandran, University of Texas at Austin Location:The Fields Institute |
14:30 to 15:30 |
Scheduling Time-Constrained Communication in Linear Networks
Ramesh Sitaraman, University of Massachusetts Location:The Fields Institute |
15:30 to 16:00 |
Coffee break
|
16:00 to 17:00 |
Statistical Zero-Knowledge
R�diger Reischuk, Medizinische Universit�t zu Lubeck Location:The Fields Institute |
17:00 to 17:30 |
Non-clairvoyant Multiprocessor Scheduling of Jobs with Arbitrary Arrival Times and Changing Execution Characteristics
Jeff Edmonds Location:The Fields Institute |
17:30 to 18:30 |
RECEPTION
|
09:00 to 10:00 |
Bit Complexity of Breaking and Achieving Symmetry
Shlomo Moran, Technion, University of Arizona Location:The Fields Institute |
10:00 to 10:15 |
Coffee break
|
10:15 to 11:15 |
On Optimal Adaptive Fault Diagnosis
Evangelos Kranakis, Carleton University Location:The Fields Institute |
11:15 to 12:15 |
Distributed Computing with Sense of Direction
Nicola Santoro, Carleton University Location:The Fields Institute |
12:15 to 14:00 |
Lunch
|
14:00 to 15:00 |
View-Oriented Group Communication Services
Nancy Lynch, Massachusetts Institute of Technology Location:The Fields Institute |
15:15 to 16:15 |
Dynamic Analysis of Communication Processes
Eli Upfal, Brown University Location:The Fields Institute |
16:15 to 17:00 |
Open Problems Session
Location:The Fields Institute |
09:00 to 10:00 |
The New King of the Hill Among Multistage Networks
Bruce Maggs, Carnegie Mellon University Location:The Fields Institute |
10:00 to 10:15 |
Coffee break
|
10:15 to 11:15 |
Compact Layouts for Switching and Sorting Networks
Mike Paterson Location:The Fields Institute |
11:15 to 12:15 |
Area Universal Networks with Constant Slowdown
Gianfranco Bilardi, University of Padova, University of Illinois Location:The Fields Institute |
12:15 to 13:45 |
Lunch
|
13:45 to 14:45 |
HIKE
Location:The Fields Institute |
09:00 to 10:30 |
Towards a Topological Characterization of Asynchronous Complexity
Nir Shavit, Tel-Aviv University Location:The Fields Institute |
10:30 to 11:00 |
Coffee break
|
11:00 to 12:00 |
The Unified Structure of Consensus: A Layered Analysis Approach
Sergio Rajsbaum, Universidad Nacional Autonoma de Mexico Location:The Fields Institute |
12:00 to 13:30 |
Lunch
|
13:30 to 14:30 |
A Wait-Free Classification of Loop Agreement Tasks
Maurice Herlihy, Brown University Location:The Fields Institute |
14:30 to 15:00 |
A Tight Lower Bound for Randomized Synchronous Consensus
Michael Ben-Or, Hebrew University Location:The Fields Institute |
15:00 to 15:30 |
Coffee break
|
15:30 to 16:30 |
Consensus Numbers of Multi-Objects
Eric Ruppert, University of Toronto Location:The Fields Institute |
16:30 to 17:00 |
A Time Complexity Lower Bound for Wait-free Universal Constructions
Prasad Jayanti, Dartmouth College Location:The Fields Institute |
09:00 to 10:00 |
Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes
Mirek Kutylowski, University of Wroclaw Location:The Fields Institute |
10:00 to 10:15 |
Coffee break
|
10:15 to 11:00 |
Local Divergence of Markov Chains and the Analysis of Iterative Load-Balancing Schemes
Rolf Wanka, University of Paderborn Location:The Fields Institute |
11:00 to 13:30 |
Lunch
|
13:30 to 14:30 |
The Theory of Counting Networks
Marios Mavronikolas, University of Cyprus Location:The Fields Institute |
14:30 to 15:00 |
Self-Stabilizing Token Circulation on Synchronous Message Passing Rings
Steve Myers Location:The Fields Institute |
15:00 to 15:15 |
Coffee break
|
15:15 to 16:15 |
Weak Memory Consistency Models: Definitions and Comparisons, and Process Coordination Problems
Lisa Higham Location:The Fields Institute |
16:15 to 17:15 |
Hierarchical Cooperative Caching
Rajmohan Rajaraman Location:The Fields Institute |