Overview of Results
Chapter 8 outlined 17 cases simulated using dSim. Both the traditional, fair-share scheduling algorithm and the Rawlsian Fair scheduling algorithm developed for our work were used in these simulations. Table 9.1 outlines the different classes of simulations and their purposes.
KeywordsResults Class A Class B Class C Class D Bucket Placement counter PC Bucket history BH Simulation 1 results BH = inf First-come first-serve FCFS Rawlsian fair Fairshare Scheduler Scheduling
- J. Rawls, Justice as fairness: A restatement (Harvard University Press, Cambridge, 2001)Google Scholar