distributed algorithm is a type of algorithm that can be distributed across many modules.

There are a few core areas of research:

failure-proofing nodes is a distributed algorithm

• What if one processor fails?

communication in a distributed algorithm

• What if communication between processors fails?
• What if timing fails?

atomicity

atomicity is a property of distributed algorithm where, for a set of steps, a processor can only do one or all of the steps. i.e.: if you are asking a node to do something, it can either do all of the thing or be able to roll back as if the entire thing didn’t happen.

distributive harm is a harm where a system extends, withhold opportunities given a specific group of people

St. George’s hospital: overweighting

1. observing the weights
2. observing the input, consider whether or not input has sensitive features

Let integer \(a,b \in \mathbb{Z}\), where \(b \neq 0\). We say \(b\) divides \(a\) (i.e. \(b|a\)) if there’s some \(m \in \mathbb{Z}\) such that \(a = bm\).

additional information

division algorithm

Let \(a,b \in \mathbb{Z}\), \(b > 0\). Then, there exists, uniquely, some \(q,r \in \mathbb{Z}\) such that \(a = bq + r\) with \(0 \leq r <b\).

“division with remainder”

You will note that, if \(a < b\), we can just say \(q = 0\).