分布式系统：Naiad

Naiad: A Timely Dataflow System

问题

见参考

• Write down the timestamp changes that the records experience as they flow through the graph, e.g., (a, 2): at A, t = (1, []); at B, t = … You may omit vertices that do not modify the timestamp.

• Informally explain when E.OnNotify((1, [])) will be called. You do not need to step through the details of the pointstamp protocol.

回答

时间戳的排序方式：

• (1, [5, 7]) < (1, [5, 8]) < (1, [6, 2]) < (2, [1, 1])
  但是要注意，短的大于长的： (1, [5, 7]) < (1, [5]) – lexicographic ordering on loop counters
• 也就是说，(1, [x,y,z,…]) < (1, [ ] )。空集时间戳最大。

Pointstamp

• Pointstamp只关心 时间戳和位置（点/边）。不关心record（message）里面变量的值。
  • 做两种计数，1) occurrence count——此