ETH Zurich – Distributed Computing Group Stephan Holzer 1ETH Zurich – Distributed Computing – www.disco.ethz.ch Stephan Holzer Yvonne Anne Pignolet Jasmin.

Slides:

Advertisements

Similar presentations

MASSIMO FRANCESCHETTI University of California at San Diego Information-theoretic and physical limits on the capacity of wireless networks TexPoint fonts.

Advertisements

Multi-Query Computationally-Private Information Retrieval with Constant Communication Rate Jens Groth, University College London Aggelos Kiayias, University.

The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement Allison Lewko The University of Texas at Austin TexPoint fonts used in.

* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.

Matroids from Lossless Expander Graphs

Factor Graphs, Variable Elimination, MLEs Joseph Gonzalez TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A AA A A.

ETH Zurich – Distributed Computing Group Raphael Eidenbenz, INFOCOM ETH Zurich – Distributed Computing Group Raphael Eidenbenz, Thomas Locher, Roger.

Paul Cuff THE SOURCE CODING SIDE OF SECRECY TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA.

Johannes Schneider –1 A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs Johannes Schneider Roger Wattenhofer TexPoint.

The double-dimer model and skew Young diagrams Richard W. Kenyon David B. Wilson Brown University Microsoft Research TexPoint fonts used in EMF. Read the.

Routing, Anycast, and Multicast for Mesh and Sensor Networks Roland Flury Roger Wattenhofer RAM Distributed Computing Group.

TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAA A.

Speed Dating despite Jammers Dominik Meier Yvonne-Anne Pignolet Stefan Schmid Roger Wattenhofer.

ETH Zurich – Distributed Computing Group Roger Wattenhofer 1ETH Zurich – Distributed Computing – Christoph Lenzen Roger Wattenhofer Exponential.

Leveraging Linial's Locality Limit Christoph Lenzen, Roger Wattenhofer Distributed Computing Group.

Dissuasive Methods Against Cheaters in Distributed Systems Kévin Huguenin Ph.D. defense, December 10 th 2010 TexPoint fonts used in EMF. Read the TexPoint.

Distributed Computing Group TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAA Distributed Asymmetric Verification.

ETH Zurich – Distributed Computing Group Samuel Welten 1ETH Zurich – Distributed Computing Group Michael Kuhn Roger Wattenhofer Samuel Welten TexPoint.

Uniform Power Connectivity University of the Negev

ETH Zurich – Distributed Computing Group Jasmin Smula 1ETH Zurich – Distributed Computing – Stephan Holzer Yvonne Anne Pignolet Jasmin.

ETH Zurich – Distributed Computing Group Roger Wattenhofer 1ETH Zurich – Distributed Computing – Christoph Lenzen Roger Wattenhofer Minimum.

The Power of Super-Log Number of Players Arkadev Chattopadhyay (TIFR, Mumbai) Joint with: Michael Saks ( Rutgers )

On Rearrangements of Fourier Series Mark Lewko TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A AAA A AAA A A A A.

Johannes PODC 2009 –1 Coloring Unstructured Wireless Multi-Hop Networks Johannes Schneider Roger Wattenhofer TexPoint fonts used in EMF. Read.

CS 3388 Working with 3D Vectors

Distributed Verification and Hardness of Distributed Approximation Atish Das Sarma Stephan Holzer Danupon Nanongkai Gopal Pandurangan David Peleg 1 Weizmann.

Continued Fractions, Euclidean Algorithm and Lehmer’s Algorithm Applied Symbolic Computation CS 567 Jeremy Johnson TexPoint fonts used in EMF. Read the.

The Chain Rule Rule for finding the derivative of a composition of two functions. If y is a function of u and u is a function of x, then y is a function.

1 Visual Processing for Social Media Andrew C. Gallagher Tsuhan Chen September 30, 2012 Cornell University Demo Materials TexPoint fonts used in EMF. Read.

1 The Power of Non-Uniform Wireless Power ETH Zurich – Distributed Computing Group Magnus M. Halldorsson Reykjavik University Stephan Holzer ETH Zürich.

PODC Distributed Computation of the Mode Fabian Kuhn Thomas Locher ETH Zurich, Switzerland Stefan Schmid TU Munich, Germany TexPoint fonts used in.

On Cost Sharing Mechanisms in the Network Design Game Rohit Khandekar IBM Watson Joint work with Baruch Awerbuch JHU TexPoint fonts used in EMF. Read the.

Lec 4 . Graphical System Representations and Simplifications

Implementation Requirements for UK General Elections TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A Chris.

Another story on Multi-commodity Flows and its “dual” Network Monitoring Rohit Khandekar IBM Watson Joint work with Baruch Awerbuch JHU TexPoint fonts.

ETH Zurich – Distributed Computing – Klaus-Tycho Förster, Rijad Nuridini, Jara Uitto, Roger Wattenhofer Lower Bounds for the Capture.

ETH Zurich – Distributed Computing Group Raphael Eidenbenz, PhD Thesis 1ETH Zurich – Distributed Computing Group PhD Thesis Raphael Eidenbenz Prof. Roger.

Cam Id- 498 Class: Three Subject: Elementary Science.

Lec 12. PID Controller Design PID Controller Ziegler-Nichols Tuning Rule Reading: 10.1, 10.2, TexPoint fonts used in EMF. Read the TexPoint manual before.

ETH Zurich – Distributed Computing – Silvio Frischknecht, Barbara Keller, Roger Wattenhofer Convergence in (Social) Influence Networks.

ETH Zurich – Distributed Computing Group Stephan Holzer 1ETH Zurich – Distributed Computing – Stephan Holzer Yvonne Anne Pignolet Jasmin.

Hashing TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA Course: Data Structures Lecturer: Haim Kaplan and Uri Zwick.

ETH Zurich – Distributed Computing Group Stephan Holzer 1ETH Zurich – Distributed Computing – Stephan Holzer Yvonne Anne Pignolet Jasmin.

ETH Zurich – Distributed Computing Group Stephan HolzerSODA Stephan Holzer Silvio Frischknecht Roger Wattenhofer Networks Cannot Compute Their Diameter.

ETH Zurich – Distributed Computing – Sharing a Medium Between Concurrent Protocols Without Overhead Using the Capture Effect Michael.

ITEC452 Distributed Computing Lecture 2 – Part 3 Models in Distributed Systems Hwajung Lee.

Lecture 9: Time-Response Characteristics (II) TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A AAA A A A A A A A.

ETH Zurich – Distributed Computing – Klaus-Tycho Förster, Ratul Mahajan, and Roger Wattenhofer Consistent Updates in Software Defined.

ETH Zurich – Distributed Computing Group Stephan HolzerETH Zurich – Distributed Computing – Stephan Holzer - ETH Zürich Thomas Locher.

Slotted Programming for Sensor Networks

A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs Johannes Schneider Roger Wattenhofer TexPoint fonts used in EMF.

Dynamic connection system

Monitoring Churn in Wireless Networks

Jens Groth, University College London

JamBot: Music Theory Aware Chord Based Generation of Polyphonic Music with LSTMs Gino Brunner, Yuyi Wang, Roger Wattenhofer, Jonas Wiesendanger Distributed.

Lec 4 . Graphical System Representations

Hashing Course: Data Structures Lecturer: Uri Zwick March 2008

CDA6530: Performance Models of Computers and Networks Project 3 Q&A

TexPoint fonts used in EMF.

TexPoint fonts used in EMF.

Blind Source Separation with a Time-Varying Mixing Matrix

CS 154, Lecture 6: Communication Complexity

TexPoint fonts used in EMF.

Husam Abu-Haimed David L. Dill Sergey Berezin

Distributed Network Measurements

CDA6530: Performance Models of Computers and Networks Project 3 Q&A

TexPoint fonts used in EMF.

New Direct Product results in Communication Complexity

Combinatorial Topology and Distributed Computing

Hashing Course: Data Structures Lecturer: Uri Zwick March 2008

Presentation transcript:

ETH Zurich – Distributed Computing Group Stephan Holzer 1ETH Zurich – Distributed Computing – Stephan Holzer Yvonne Anne Pignolet Jasmin Smula Roger Wattenhofer TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAA A A AA AA Time-Optimal Information Exchange on Multiple Channels

ETH Zurich – Distributed Computing Group Stephan Holzer 2 Problem : Time-Optimal Information Exchange on Multiple Channels n:= # nodes

ETH Zurich – Distributed Computing Group Stephan Holzer 3 Problem : Time-Optimal Information Exchange on Multiple Channels n:= # nodes k:= # information Have information Disseminate to all! ?

ETH Zurich – Distributed Computing Group Stephan Holzer 4 Problem : Time-Optimal Information Exchange on Multiple Channels Disseminate to all! ?

ETH Zurich – Distributed Computing Group Stephan Holzer 5 Problem : Time-Optimal Information Exchange on Multiple Channels Disseminate to all! ? Easy: O(n) Faster?

ETH Zurich – Distributed Computing Group Stephan Holzer 6 Problem : Time-Optimal Information Exchange on Multiple Channels n:= # nodes n Unique IDs 1…n

ETH Zurich – Distributed Computing Group Stephan Holzer 7 I can: send / receive reach each node Time-Optimal Information Exchange on Multiple Channels

ETH Zurich – Distributed Computing Group Stephan Holzer 8 I can: send / receive ? reach each node Time-Optimal Information Exchange on Multiple Channels

ETH Zurich – Distributed Computing Group Stephan Holzer 9 Time-Optimal Information Exchange on Multiple Channels no collision detection I can: send / receive reach each node

ETH Zurich – Distributed Computing Group Stephan Holzer 10 switch channels no collision detection I can: send / receive reach each node 101 Mhz 117 Mhz 132 Mhz … Time-Optimal Information Exchange on Multiple Channels

ETH Zurich – Distributed Computing Group Stephan Holzer 11 switch channels no collision detection I can: send / receive reach each node complexity computation: free radio: time 1 Time-Optimal Information Exchange on Multiple Channels

ETH Zurich – Distributed Computing Group Stephan Holzer 12 One Information / log n bits per message O(1) Time-Optimal Information Exchange on Multiple Channels n:= # nodes k:= # information => Ω( k )

ETH Zurich – Distributed Computing Group Stephan Holzer 13 => Ω( k ) Time-Optimal Information Exchange on Multiple Channels n:= # nodes k:= # information + log n [Kushilevitz, Mansour SIAM JComp 1998] one channel ? Multi channel

ETH Zurich – Distributed Computing Group Stephan Holzer 14 Problem : Time-Optimal Information Exchange on Multiple Channels How to find them In time O(2) ?

ETH Zurich – Distributed Computing Group Stephan Holzer 15ETH Zurich – Distributed Computing – Stephan Holzer Yvonne Anne Pignolet Jasmin Smula Roger Wattenhofer Thank You! Questions & Comments? TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAA A A A