Problem
1. Using the data of what is the longest UNIX pipeline that can be co-scheduled?
2. Can the model of triple modular redundancy described in the text handle Byzantine failures?
3. How many failed elements (devices plus voters) can handle? Given an example of the worst case that can be masked.
4. Does TMR generalize to five elements per group instead of three? If so, what properties does it have?