Advertisement

Overview of Results

  • Art Sedighi
  • Milton Smith
Chapter

Abstract

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.

Keywords

Results 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 

References

  1. J. Rawls, Justice as fairness: A restatement (Harvard University Press, Cambridge, 2001)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Art Sedighi
    • 1
  • Milton Smith
    • 1
  1. 1.Industrial, Manufacturing & Systems EngineeringTexas Tech UniversityLubbockUSA

Personalised recommendations