Complexity and Analysis of Distributed Algorithms (16w5152)


(University of Calgary)

(Technion - Israel Institute of Technology)

(Universidad Nacional Autonoma de Mexico)


The Casa Matemática Oaxaca (CMO) will host the "Complexity and Analysis of Distributed Algorithms" workshop from November 27th to December 2nd, 2016.

Today's commodity desktop computers contain four to eight processors; high-performance computers have hundreds. In a few years "multi-core" desktops will also have hundreds of processing units on a single board.
Our knowledge of how to most effectively exploit this parallelism lags far behind our knowledge of how to build the hardware.
Programs for these machines are very difficult to design because they need to be able to cope with asynchronous and faulty behavior of hardware, and the increasing elaborate shared memory interconnection designs.

The workshop focuses on advancing new techniques for the design and analysis of shared memory algorithms, and to explore limitations of efficient concurrent computing.
We will explore new approaches, such as the design of heuristics for fundamental distributed computing problems , and advance current active research directions, such as the use of randomization in algorithm design, and combinatorial topology for algorithm analysis.

