Pfair scheduling for fault-tolerant broadcast disks in a real-time environment

With a growing number of mobile computers and cellular devices there is a growing disparity between upstream and downstream capabilities of clients and servers. To combat this situation a technique called broadcast disks was introduced. A growing need for secure and fault tolerant data resulted in many other technologies such as AIDA (Adaptive Information Dispersal Algorithm), which help in delivering the data accurately and at the earliest possible time using minimum possible bandwidth. Real-time system scheduling improves the timely delivery characteristic of a broadcast by scheduling the broadcast data in an appropriate manner.; This thesis studies the behavior of the fault tolerant broadcast disks when scheduled in a pfair manner using EPDF (Earliest Pseudo Deadline First). A detailed study of the resulting schedule is done and the effect of the schedule with respect to fault tolerance is analyzed. An alternative scheduling method is used to ameliorate the inconsistencies produced by the EPDF algorithm. Worst-case data recovery time is computed.