I am trying to prove Theorem 6.2 on page 127 of the book Real-Time Systems by Jane W. S. Liu: http://www.cse.hcmut.edu.vn/~thai/books/2000%20_%20Liu-%20Real%20Time%20Systems.pdf It is based on Early Deadline First(EDF) scheduling. It says the proof is similar to the proof for Theorem 6.1 on page ...

I am looking for a family of pairwise independent hash functions $\mathcal{H} = \{h \mid h:[n]\rightarrow [m]\}$ that is easily computable. As an example that doesn't seem to work, choose a prime $p > n$ and $a,b \in \{0,\dots, p-1\}$ independently and uniformly at random. Now let $h_{a,b}(x) = ...