Abstract
For handling multiple aperiodic tasks with different temporal requirements, multiple aperiodic servers are used. Since capacity is partitioned statically among the multiple servers, they suffer from heavy capacity exhaustions. Bernat and Burns introduced Capacity sharing protocol, in which a server can use the unused capacity of other servers. Though capacity-sharing protocol minimized the capacity exhaustions in multiple servers, it did not deal with fairness in sharing of capacity among demanding servers, which leads to unfair treatment to low priority jobs. In our research, we propose fair capacity sharing protocol in multiple aperiodic servers, which shares the capacity fairly among the demanding servers based on their priorities. Our research includes implementation of our protocol and performance comparison with previous approaches.
Melapudi, Vinod Reddy (2002). Fair capacity sharing of multiple aperiodic servers. Master's thesis, Texas A&M University. Available electronically from
https : / /hdl .handle .net /1969 .1 /ETD -TAMU -2002 -THESIS -M442.