Multi-Core Computing
with Transactional Memory
Johannes Schneider and Prof. Roger Wattenhofer
1
Overview
Introduction
Difficulties with parallel (multi-core) programming
A (partial) solution: Transact
From Shared Memory
to Message Passing
Stefan Schmid
T-Labs / TU Berlin
Some parts of the lecture, parts of the Skript and exercises will be based on the lectures of
Prof. Roger Wattenhofer at ETH Zuri
Distributed
Computing
FS 2012
Prof. R. Wattenhofer
Philipp Brandes
Principles of Distributed Computing
Exercise 13: Sample Solution
1
Determining the Median
As stated in the hint, we start with initia
Distributed
Computing
FS 2013
Prof. R. Wattenhofer
Michael Knig
o
Principles of Distributed Computing
Exercise 13: Sample Solution
1
Pancake Networks
log N
Generally, observe that N = |V (Pn )| = n! O
DDA 2010, lecture 3:
Ramseys theorem
A generalisation of the pigeonhole principle
Frank P. Ramsey (1930):
On a problem of formal logic
. in the course of this investigation it is necessary
to use c
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
Barbara Keller
Principles of Distributed Computing
Sample Solution to Exercise 13
1
Self-stabilizing Spanning Tree
a) If the whole memory state of al
DDA 2010, lecture 3:
Ramseys theorem
A generalisation of the pigeonhole principle
Frank P. Ramsey (1930):
On a problem of formal logic
. in the course of this investigation it is necessary
to use c
Distributed
Computing
FS 2015
Prof. R. Wattenhofer / Michael Knig
o
Principles of Distributed Computing
Exercise 9: Sample Solution
1
Scale Free Networks
a) The node-degree distribution of a graph doe
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
Sebastian Brandt
Principles of Distributed Computing
Exercise 11
1
Communication Complexity of Set Disjointness
In the lecture we studied the communi
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
Sebastian Brandt
Principles of Distributed Computing
Exercise 11: Sample Solution
1
Communication Complexity of Set Disjointness
a) We obtain
M DISJ
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
Laura Peer
Principles of Distributed Computing
Exercise 10
1
Distributed Network Partitioning
In this exercise, we will derive an asynchronous distri
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
Barbara Keller
Principles of Distributed Computing
Exercise 13
1
Self-stabilizing Spanning Tree
In this exercise, we are searching for ecient, self-s
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
Laura Peer
Principles of Distributed Computing
Exercise 10: Sample Solution
1
Distributed Network Partitioning
For this exercise, we dene the neighbo
Distributed
Computing
FS 2015
Prof. R. Wattenhofer / Michael Knig
o
Principles of Distributed Computing
Exercise 9
1
Scale Free Networks
Dierent studies of the structures of social networks have repor
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
Jara Uitto
Principles of Distributed Computing
Exercise 8: Sample Solution
1
Coloring Rings
a) Let n 4 be even, and r = n/2 2. Consider the r-neighbo
Distributed
Computing
FS 2015
Prof. R. Wattenhofer / Sebastian Brandt
Principles of Distributed Computing
Exercise 6: Sample Solution
1
Concurrent Ivy
a) The three nodes are served in the order v2 , v
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
Sebastian Brandt
Principles of Distributed Computing
Exercise 6
1
Concurrent Ivy
Consider the tree for the Ivy shared variable protocol in Figure 1.
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
David Stolz
Principles of Distributed Computing
Exercise 7: Sample Solution
1
Deterministic Maximal Independent Set
a) Consider the graph consisting
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
Jara Uitto
Principles of Distributed Computing
Exercise 8
1
Coloring Rings
In Chapter 1, we proved that a ring can be colored with 3 colors in log n
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
David Stolz
Principles of Distributed Computing
Exercise 7
1
Deterministic Maximal Independent Set
In the lecture, we discussed a slow but simple det
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
Jara Uitto
Principles of Distributed Computing
Exercise 5
1
Shared Sum
In the lecture, we discussed how shared registers can be employed eciently to
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
Laura Peer
Principles of Distributed Computing
Exercise 4
1
Sorting Networks
Figure 1: A Sorting Network?
For each of the following questions, prove
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
Jara Uitto
Principles of Distributed Computing
Exercise 5: Sample Solution
1
Shared Sum
In the following, let X (initialized to 0) always denote the
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
Pascal Bissig
Principles of Distributed Computing
Exercise 3
1
Leader Election in an Almost Anonymous Ring
a) Is deterministic leader election possib
Distributed Computing over
Communication Networks:
Topology
(with an excursion to P2P)
Stefan Schmid @ T-Labs, 2011
Some administrative comments.
There will be a Skript for this part
of the lecture. (
Distributed
Computing
FS 2015
Prof. R. Wattenhofer
Pascal Bissig
Principles of Distributed Computing
Sample Solution to Exercise 2
1
Leader Election in an Almost Anonymous Ring
a) Yes, it is possible: